sjabloon 0.5.1 → 0.7.0

package/LICENSE

@@ -1,21 +1,201 @@
-MIT License
-
-Copyright (c) Robin van der Vleuten <robin@webstronauts.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.
+                                 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.

package/README.md

@@ -1,11 +1,11 @@
 # sjabloon
 
-A tiny, CSP-safe template engine for JavaScript. **~1.8KB min+gzip (~3.6KB with [xprsn](https://www.npmjs.com/package/xprsn)), one dependency.**
+A tiny, CSP-safe, target-neutral template engine for JavaScript. **~1.9KB min+brotli (~3.7KB with [xprsn](https://www.npmjs.com/package/xprsn)), one dependency.**
 
 [![NPM version](https://img.shields.io/npm/v/sjabloon.svg)](https://www.npmjs.com/package/sjabloon)
-[![Build Status](https://github.com/robinvdvleuten/sjabloon/actions/workflows/test.yml/badge.svg)](https://github.com/robinvdvleuten/sjabloon/actions/workflows/test.yml)
+[![Build Status](https://github.com/getquario/sjabloon/actions/workflows/test.yml/badge.svg)](https://github.com/getquario/sjabloon/actions/workflows/test.yml)
 [![NPM downloads](https://img.shields.io/npm/dm/sjabloon.svg)](https://www.npmjs.com/package/sjabloon)
-[![MIT license](https://img.shields.io/github/license/robinvdvleuten/sjabloon.svg)](https://github.com/robinvdvleuten/sjabloon/blob/main/LICENSE)
+[![Apache-2.0 license](https://img.shields.io/github/license/getquario/sjabloon.svg)](https://github.com/getquario/sjabloon/blob/main/LICENSE)
 
 <a href="https://webstronauts.com?utm_source=github&utm_medium=readme&utm_campaign=sjabloon">
 	<picture>
@@ -13,16 +13,24 @@ A tiny, CSP-safe template engine for JavaScript. **~1.8KB min+gzip (~3.6KB with
 	</picture>
 </a>
 
-*Sjabloon* is Dutch for "template". It renders text templates with full [xprsn](https://github.com/robinvdvleuten/xprsn) expressions inside every tag, without turning template text into JavaScript. There is no `eval` and no `new Function`, so it runs under a strict Content Security Policy where engines that compile templates to code cannot.
+*Sjabloon* is Dutch for "template". It renders templates with full [xprsn](https://github.com/getquario/xprsn) expressions inside every tag, without turning template text into JavaScript. There is no `eval` and no `new Function`, so it runs under a strict Content Security Policy where engines that compile templates to code cannot.
+
+The engine emits **tokens**, not text. A render gives you the literal runs and the interpolated values, interleaved in render order — because different targets need different things from the same template. HTML wants escaped text; a spreadsheet wants the number `1000` and a cell format; a PDF wants styled runs. Escaping belongs at the output edge, not in the engine, so a string is just one way to consume the stream.
 
 ```js
-import { template, render } from 'sjabloon';
+import { template, text } from 'sjabloon';
+
+const cell = template('{{ total * 1.21 }}');
+
+cell({ total: 1000 });        // => [{ value: 1210 }]      — still a number
+text(cell({ total: 1000 }));  // => '1210'                 — when you want the string
+```
 
-// Compile once, render many times:
-const greet = template('Hello {{ user.name.toUpperCase() }}!');
-greet({ user: { name: 'Robin' } }); // => 'Hello ROBIN!'
+If you only want a string, import the edition that produces one directly:
+
+```js
+import { render } from 'sjabloon/html';   // {{ }} HTML-escapes, {{{ }}} is raw
 
-// Blocks, expressions, and custom functions:
 render(
   `<ul>{{#each items as it, i}}
     <li>{{ i + 1 }}. {{ it.name }}: {{ fmt(it.price * it.qty) }}</li>
@@ -33,11 +41,25 @@ render(
 );
 ```
 
+## Editions
+
+Three entry points, one engine. They share a parser, a syntax, and a diagnostics contract, and differ only in what a render produces.
+
+| Import | `template(str, funcs?)` returns | `{{ expr }}` | `{{{ expr }}}` |
+| --- | --- | --- | --- |
+| `sjabloon` | `(values?, scope?) => Token[]` | value token | `SyntaxError` |
+| `sjabloon/text` | `(values?, scope?) => string` | unescaped | `SyntaxError` |
+| `sjabloon/html` | `(values?, scope?) => string` | HTML-escaped | raw |
+
+`{{{ }}}` exists only in the HTML edition, where "raw" means something. Everywhere else `{{ }}` is already raw, so the triple form is a compile-time `SJABLOON_RAW_TAG` error rather than a silent synonym.
+
+Every edition exports `template`, `render`, and `isDiagnostic`. They all resolve to one shared core, so a diagnostic thrown through any of them authenticates through all of them.
+
 ## API
 
 ### `template(str, functions?)`
 
-Compiles the template and returns a renderer `(values?, scope?) => string`. Malformed tags, unclosed blocks, and invalid expressions throw a `SyntaxError` at compile time.
+Compiles the template and returns a renderer. What it renders to depends on the edition you imported from (see [Editions](#editions)); everything else on this page is identical across all three. Malformed tags, unclosed blocks, and invalid expressions throw a `SyntaxError` at compile time.
 
 The anchors `$` (root) and `@` (current `{{#each}}` item) work as [described below](#syntax) with no extra arguments — at the root, before any loop, both point at `values`. If you're embedding sjabloon under an engine with its own scope model, pass `{ root, item }` as the second argument to seed the two root anchors from distinct objects: `$` becomes `root` and `@` becomes `item`. Omit `item` and `@` stays unbound at the root, so reading `@.x` throws where there is no current item. Either way, `{{#each}}` still re-points `@` to the current item inside its body.
 
@@ -47,7 +69,7 @@ tpl(base, { root: reportRoot, item: currentRow }); // $ = reportRoot, @ = curren
 tpl(base, { root: reportRoot });                   // no item → @.x throws
 ```
 
-The renderer also carries `names` (every variable the template reads from your values, loop variables excluded) and `functions` (the registry functions it calls, methods excluded), both deduplicated. Check a stored template against your data model and its allowed functions before you render it, or fetch only the fields it needs.
+The renderer carries `names` (every variable the template reads from your values, loop variables excluded) and `functions` (the registry functions it calls, methods excluded), both deduplicated. Check a stored template against your data model and its allowed functions before you render it, or fetch only the fields it needs.
 
 ```js
 const tpl = template('{{ fmt(title) }}{{#each items as it}}{{ it.name }}{{/each}}', { fmt: s => s });
@@ -57,7 +79,28 @@ tpl.functions; // => ['fmt']
 
 ### `render(str, values?, functions?)`
 
-Shorthand for `template(str, functions)(values)`.
+Shorthand for `template(str, functions)(values)`, returning whatever its edition renders.
+
+### `text(tokens)` — root entry only
+
+Joins a token stream the way `sjabloon/text` would have rendered it: literals verbatim, values as `String(value ?? '')`. `text(template(str)(values))` and `sjabloon/text`'s `template(str)(values)` are equal for every template and every set of values — a property the test suite and the fuzzer both check.
+
+```js
+import { template, text } from 'sjabloon';
+
+const tokens = template('{{ qty }} × {{ name }}')({ qty: 2, name: 'Koffie' });
+// => [{ value: 2 }, { literal: ' × ' }, { value: 'Koffie' }]
+
+text(tokens); // => '2 × Koffie'
+```
+
+A `Token` is either `{ literal: string }` or `{ value: unknown }`:
+
+- **Values are pre-stringify.** `{{ total }}` holding `1000` yields the number `1000`, not `"1000"`, and nullish stays nullish. Stringification is deferred to `text()` — so a value with no primitive conversion reaches the stream intact and only fails when something asks for text.
+- **Order is render order.** Loop bodies append once per iteration, untaken branches append nothing, and block expressions (`#if` conditions, `#each` collections) never appear — they steer the render rather than being part of it.
+- **Literals are the template's static runs**, one token each, never merged and never empty. So the interleaving tells you the shape: a bare `{{ amount }}` is exactly one value token, while `Total: {{ amount }}` is a literal followed by a value. That distinction is why the engine emits tokens instead of a string plus a list of values — a spreadsheet cell that is *only* a number is a different thing from one that happens to contain one.
+
+Literal tokens are frozen and shared across loop iterations; value tokens are fresh per emit.
 
 ### Error diagnostics
 
@@ -68,18 +111,18 @@ Sjabloon errors keep their native `SyntaxError` or `TypeError` class and expose:
 - `end`: the exclusive template offset;
 - `blocks`: a frozen, outermost-first array of `{ type, start, end }` opener spans.
 
-Parser codes are `SJABLOON_EACH_SYNTAX`, `SJABLOON_BLOCKED_BINDING`, `SJABLOON_UNEXPECTED_TAG`, `SJABLOON_UNKNOWN_BLOCK`, `SJABLOON_UNCLOSED_BLOCK`, and `SJABLOON_TOO_DEEP` (block nesting past 256 levels, located at the opener that crossed the cap). A missing closer uses an empty span at the end of the template. Expression offsets refer to the original template, so surrounding braces, whitespace, and trim markers contribute to their absolute position.
+Parser codes are `SJABLOON_EACH_SYNTAX`, `SJABLOON_BLOCKED_BINDING`, `SJABLOON_UNEXPECTED_TAG`, `SJABLOON_UNKNOWN_BLOCK`, `SJABLOON_UNCLOSED_BLOCK`, `SJABLOON_RAW_TAG` (a `{{{ }}}` tag outside the HTML edition, located at the whole tag), and `SJABLOON_TOO_DEEP` (block nesting past 256 levels, located at the opener that crossed the cap). A missing closer uses an empty span at the end of the template. Expression offsets refer to the original template, so surrounding braces, whitespace, and trim markers contribute to their absolute position.
 
 Unauthenticated errors thrown by registered functions, getters, methods, or value coercion hooks are host errors. Sjabloon passes them through unchanged and does not attach template diagnostic fields.
 
-Use `isDiagnostic(error)` when a host needs to distinguish those errors. It returns `true` only for errors produced or translated by the same sjabloon module instance. Copying a documented `code`, `start`, `end`, and `blocks` onto another error does not authenticate it. A diagnostic from another installed copy or module instance also returns `false`.
+Use `isDiagnostic(error)` when a host needs to distinguish those errors. It returns `true` only for errors produced or translated by the same sjabloon module instance. Copying a documented `code`, `start`, `end`, and `blocks` onto another error does not authenticate it. A diagnostic from another installed copy or module instance returns `false`. All three editions share one core, so mixing them in a single process is safe: an error thrown through `sjabloon/html` authenticates through `sjabloon`.
 
 ## Syntax
 
 | Tag | Meaning |
 | --- | --- |
-| `{{ expr }}` | Interpolate an expression, HTML-escaped |
-| `{{{ expr }}}` | Interpolate without escaping |
+| `{{ expr }}` | Interpolate an expression — a value token, or text escaped per edition |
+| `{{{ expr }}}` | Interpolate raw. **`sjabloon/html` only**; a `SyntaxError` elsewhere |
 | `{{#if expr}} … {{#elif expr}} … {{#else}} … {{/if}}` | Conditional block, with as many `{{#elif}}` links as you need |
 | `{{#each expr as item}} … {{/each}}` | Loop over an array or an object's values |
 | `{{#each expr as item, key}} … {{/each}}` | Second name binds the index (arrays) or the key (objects) |
@@ -88,7 +131,7 @@ Use `isDiagnostic(error)` when a host needs to distinguish those errors. It retu
 | `{{! anything }}` | Comment, removed from output |
 | `{{- expr -}}` | A dash hugging either brace trims the whitespace on that side, newlines included; works on every tag form |
 
-Every `expr` is an [xprsn expression](https://github.com/robinvdvleuten/xprsn#syntax): literals, arithmetic, string concatenation with `~` (`{{ first ~ " " ~ last }}`), comparisons, `and`/`or`/`not`/`in`, ternaries, property and method access, and functions from the registry you pass in. `null` and `undefined` render as empty strings.
+Every `expr` is an [xprsn expression](https://github.com/getquario/xprsn#syntax): literals, arithmetic, string concatenation with `~` (`{{ first ~ " " ~ last }}`), comparisons, `and`/`or`/`not`/`in`, ternaries, property and method access, and functions from the registry you pass in. `null` and `undefined` render as empty strings.
 
 A loop body sees its loop variable plus the outer scope; reusing an outer name shadows it only inside that body. The engine keeps loop variables on a child scope, so the values you pass are never mutated.
 
@@ -119,15 +162,29 @@ That runtime CSP support costs some render speed. Handlebars and tempura generat
 
 ## Safety
 
-- `{{ expr }}` escapes `& < > " '` by default; unescaped output requires the explicit `{{{ }}}` form.
+- `sjabloon/html` escapes `& < > " '` in `{{ }}`; unescaped output requires the explicit `{{{ }}}` form. **If you are rendering HTML, import that edition.** The other two are output-neutral by design and escape nothing, on the assumption that you escape at your own output edge.
 - Expressions inherit all of xprsn's guards: no `__proto__`/`constructor`/`prototype` access, null-prototype hash literals, and functions resolved only from your registry.
 - Templates read your values; they cannot assign to them.
 - Registered functions are host-provided capabilities, not a sandbox boundary. Only register helpers that template authors are allowed to invoke; likewise, treat explicit raw output as trusted HTML.
 
 ## Environments
 
-Node.js 22 and newer are supported through the ESM and CommonJS builds. Browser use is supported through a standards-based ESM bundler in environments supporting ES2024. Direct `<script>` globals and UMD builds are not provided.
+Node.js 22.12 and newer, ESM only. Browser use is supported through a standards-based ESM bundler in environments supporting ES2024. Direct `<script>` globals, UMD, and CommonJS builds are not provided.
+
+Shipping CommonJS alongside ESM would put two copies of the core in any process that mixed `require` and `import`, and therefore two diagnostic identities — `isDiagnostic` would silently return `false` across the seam. One format removes that failure mode instead of documenting it.
 
 ## License
 
-MIT © [Robin van der Vleuten](https://robinvdvleuten.nl)
+Copyright 2026 Robin van der Vleuten
+
+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/dist/core.js

@@ -0,0 +1 @@
+import{compile as e,isDiagnostic as t}from"xprsn";const n=/^(?:__proto__|constructor|prototype)$/,r=new WeakSet,i=r.add.bind(r),a=r.has.bind(r),o=e=>a(e);let s=e=>{let t=[];for(let n=0,r=1;n<e.length;){let i=e.indexOf(`{{`,n);if(i<0){t.push([0,e.slice(n)]);break}i>n&&t.push([0,e.slice(n,i)]);let a=+(e[i+2]===`{`),o=i+2+a,s=e[o]===`-`,c=-1;if(s&&o++,a&&r&&(c=e.indexOf(`}}}`,o),c<0&&(r=0)),c<0&&(a&&(a=0,o=i+2,s=e[o]===`-`,s&&o++),c=e.indexOf(`}}`,o)),c<0){t.push([0,e.slice(i)]);break}let l=c>o&&e[c-1]===`-`,u=l?c-1:c,d=e.slice(o,u),f=d.trim(),p=o+d.length-d.trimStart().length,m=c+2+a,h=[a?1:2,f,i,m,p],g=t.at(-1);if(s&&g?.[0]===0&&g[1]&&(g[1]=g[1].trimEnd()),t.push(h),n=m,l)for(;/\s/.test(e[n]);)n++}return t},c,l,u,d,f,p,m,h,g,_,v,y,b=()=>Object.freeze(g.slice()),x=(e,t)=>(g.length<256||C(`Template too deeply nested`,`SJABLOON_TOO_DEEP`,t),Object.freeze({type:e,start:t[2],end:t[3]})),S=(e,t)=>(Object.defineProperty(e,"blocks",{value:t,enumerable:!0}),i(e),e);const C=(e,t,n,r=n?.[2]??h.length,i=n?.[3]??h.length)=>{let a=SyntaxError(e);throw a.code=t,a.start=r,a.end=i,S(a,b())};let w=(e,n,r,i=t)=>{throw i(e)?(e.start+=n,e.end+=n,S(e,r)):e},T=e=>C(`Unexpected {{`+e[1]+`}}`,`SJABLOON_UNEXPECTED_TAG`,e),E=(e,t,n)=>{for(let r of e)r(t,n)},D=(e,t)=>t(O(e[1],e[4],b())),O=(t,n,r)=>{let i;try{i=e(t,u)}catch(e){w(e,n,r)}for(let e of i.names)f.includes(e)||p.add(e);for(let e of i.functions)m.add(e);return e=>{try{return i(e)}catch(e){w(e,n,r,i.isDiagnostic)}}},k=e=>{let t=A([`#elif`,`#else`,`/if`]),n=d[1],r=[];return n.startsWith(`#elif `)?r=[k(O(n.slice(6),d[4]+6,b()))]:n===`#else`?(r=A([`/if`]),d[1]===`/if`||T(d)):n!==`/if`&&T(d),(n,i)=>E(e(n)?t:r,n,i)},A=e=>{let t=[];for(let r;r=c[l++];){let i=r[1];if(!r[0])i&&t.push(_(i));else if(r[0]===1)y||C(`Raw {{{`+i+`}}} is not available here; {{ `+i+` }} is already raw`,`SJABLOON_RAW_TAG`,r),t.push(D(r,y));else if(e.includes(i.split(` `)[0]))return d=r,t;else if(i[0]!==`!`)if(i.startsWith(`#if `))g.push(x(`if`,r)),t.push(k(O(i.slice(4),r[4]+4,b()))),g.pop();else if(/^#each(?:\s|$)/.test(i)){g.push(x(`each`,r));let e=/^#each ([\s\S]+) as ((\w+)(?:\s*,\s*(\w+))?)$/.exec(i)||C(`Bad {{`+i+`}}`,`SJABLOON_EACH_SYNTAX`,r),a=e[3],o=e[4],s=r[4]+i.length-e[2].length;if(n.test(a)&&C(`Bad {{`+i+`}}`,`SJABLOON_BLOCKED_BINDING`,r,s,s+a.length),o&&n.test(o)){let e=r[4]+i.length-o.length;C(`Bad {{`+i+`}}`,`SJABLOON_BLOCKED_BINDING`,r,e,e+o.length)}let c=O(e[1],r[4]+6,b()),l=f.length;f.push(a),o&&f.push(o),f.push(`loop`);let u=A([`#else`,`/each`]);f.length=l;let p=[];d[1]===`#else`?(p=A([`/each`]),d[1]===`/each`||T(d)):d[1]!==`/each`&&T(d),g.pop(),t.push((e,t)=>{let n=c(e),r=Array.isArray(n),i=r?n.slice():n&&typeof n==`object`?Object.keys(n).map(e=>[n[e],e]):[];if(!i.length)return E(p,e,t);i.forEach((n,s)=>{let c=r?n:n[0],l=r?s:n[1],d=Object.create(e);d[a]=c,o&&(d[o]=l),d[`@`]=c,d.loop={index:s+1,index0:s,first:!s,last:s===i.length-1,length:i.length},E(u,d,t)})})}else/^#(?:if|elif|else)(?:\s|$)/.test(i)||i[0]===`/`?T(r):i[0]===`#`?C(`Unknown {{`+i+`}}`,`SJABLOON_UNKNOWN_BLOCK`,r):t.push(D(r,v))}return e.length&&C(`Missing {{`+e[e.length-1]+`}}`,`SJABLOON_UNCLOSED_BLOCK`),t},j=([e,t,n,r,i])=>{function a(a,o){_=e,v=t,y=n,u=o,f=[`$`,`@`],p=new Set,m=new Set,h=String(a),g=[],c=s(h),l=0;let d;try{d=A([])}catch(e){throw e instanceof RangeError&&C(`Template too deeply nested`,`SJABLOON_TOO_DEEP`),e}let b=(e,t)=>{e||={};let n=Object.create(e);n.$=t?t.root:e,t?`item`in t&&(n[`@`]=t.item):n[`@`]=e;let a=r();return E(d,n,a),i(a)};return b.names=Array.from(p),b.functions=Array.from(m),b}return{template:a,render:(e,t,n)=>a(e,n)(t)}};export{j as n,o as t};

package/dist/html.d.ts

@@ -0,0 +1,17 @@
+export * from './types.js';
+import type { SjabloonFunctions, SjabloonRenderer, SjabloonValues } from './types.js';
+
+/**
+ * Compile a template once, render it many times to an HTML string.
+ *
+ * `{{ expr }}` HTML-escapes (`& < > " '`) and `{{{ expr }}}` interpolates raw.
+ * This is the only edition that knows what HTML is; the rest of sjabloon leaves
+ * escaping to the output edge.
+ *
+ * @see SjabloonRenderer for `names`/`functions`, SjabloonScope for `$` and `@`.
+ * @throws {SyntaxError} On malformed tags, unclosed blocks, or bad expressions.
+ */
+export function template(str: string, funcs?: SjabloonFunctions): SjabloonRenderer<string>;
+
+/** Compile and render in one go. Shorthand for `template(str, funcs)(values)`. */
+export function render(str: string, values?: SjabloonValues, funcs?: SjabloonFunctions): string;

package/dist/html.js

@@ -0,0 +1 @@
+import{n as e,t}from"./core.js";const n={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,'"':`&quot;`,"'":`&#39;`},r=e=>String(e).replace(/[&<>"']/g,e=>n[e]),{template:i,render:a}=e([e=>(t,n)=>{n.s+=e},e=>(t,n,i)=>(i=e(t),n.s+=r(i??``)),e=>(t,n,r)=>(r=e(t),n.s+=String(r??``)),()=>({s:``}),e=>e.s]);export{t as isDiagnostic,a as render,i as template};

package/dist/index.d.ts

@@ -0,0 +1,23 @@
+export * from './types.js';
+import type { SjabloonFunctions, SjabloonRenderer, SjabloonValues, Token } from './types.js';
+
+/**
+ * Compile a template once, render it many times to a token stream.
+ *
+ * `{{ expr }}` emits a value token; escaping belongs to whoever consumes the
+ * stream, so `{{{ expr }}}` has no meaning here and is a compile-time
+ * `SJABLOON_RAW_TAG` error.
+ *
+ * @see SjabloonRenderer for `names`/`functions`, SjabloonScope for `$` and `@`.
+ * @throws {SyntaxError} On malformed tags, unclosed blocks, or bad expressions.
+ */
+export function template(str: string, funcs?: SjabloonFunctions): SjabloonRenderer<Token[]>;
+
+/** Compile and render in one go. Shorthand for `template(str, funcs)(values)`. */
+export function render(str: string, values?: SjabloonValues, funcs?: SjabloonFunctions): Token[];
+
+/**
+ * Join a token stream into the string `sjabloon/text` would have produced:
+ * literals verbatim, values as `String(value ?? '')`.
+ */
+export function text(tokens: readonly Token[]): string;

package/dist/index.js

@@ -1 +1 @@
-import{compile as e,isDiagnostic as t}from"xprsn";const n={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,'"':`&quot;`,"'":`&#39;`},r=e=>String(e).replace(/[&<>"']/g,e=>n[e]),i=/^(?:__proto__|constructor|prototype)$/,a=new WeakSet,o=a.add.bind(a),s=a.has.bind(a),c=e=>s(e);let l=e=>{let t=[];for(let n=0,r=1;n<e.length;){let i=e.indexOf(`{{`,n);if(i<0){t.push([0,e.slice(n)]);break}i>n&&t.push([0,e.slice(n,i)]);let a=e[i+2]===`{`,o=i+2+a,s=e[o]===`-`,c=-1;if(s&&o++,a&&r&&(c=e.indexOf(`}}}`,o),c<0&&(r=0)),c<0&&(a&&(a=!1,o=i+2,s=e[o]===`-`,s&&o++),c=e.indexOf(`}}`,o)),c<0){t.push([0,e.slice(i)]);break}let l=c>o&&e[c-1]===`-`,u=l?c-1:c,d=e.slice(o,u),f=d.trim(),p=o+d.length-d.trimStart().length,m=c+2+a,h=[a?1:2,f,i,m,p],g=t.at(-1);if(s&&g?.[0]===0&&g[1]&&(g[1]=g[1].trimEnd()),t.push(h),n=m,l)for(;/\s/.test(e[n]);)n++}return t},u,d,f,p,m,h,g,_,v,y=()=>Object.freeze(v.slice()),b=(e,t)=>(v.length<256||S(`Template too deeply nested`,`SJABLOON_TOO_DEEP`,t),Object.freeze({type:e,start:t[2],end:t[3]})),x=(e,t)=>(Object.defineProperty(e,"blocks",{value:t,enumerable:!0}),o(e),e),S=(e,t,n,r=n?.[2]??_.length,i=n?.[3]??_.length)=>{let a=SyntaxError(e);throw a.code=t,a.start=r,a.end=i,x(a,y())},C=(e,n,r,i=t)=>{throw i(e)?(e.start+=n,e.end+=n,x(e,r)):e},w=e=>S(`Unexpected {{`+e[1]+`}}`,`SJABLOON_UNEXPECTED_TAG`,e),T=(e,t)=>e.map(e=>e(t)).join(``),E=(e,t)=>(e=>n=>t(e(n)??``))(D(e[1],e[4],y())),D=(t,n,r)=>{let i;try{i=e(t,f)}catch(e){C(e,n,r)}for(let e of i.names)m.includes(e)||h.add(e);for(let e of i.functions)g.add(e);return e=>{try{return i(e)}catch(e){C(e,n,r,i.isDiagnostic)}}},O=e=>{let t=k([`#elif`,`#else`,`/if`]),n=p[1],r=[];return n.startsWith(`#elif `)?r=[O(D(n.slice(6),p[4]+6,y()))]:n===`#else`?(r=k([`/if`]),p[1]===`/if`||w(p)):n!==`/if`&&w(p),n=>T(e(n)?t:r,n)},k=e=>{let t=[];for(let n;n=u[d++];){let a=n[1];if(!n[0])t.push((e=>()=>e)(a));else if(n[0]===1)t.push(E(n,String));else if(e.includes(a.split(` `)[0]))return p=n,t;else if(a[0]!==`!`)if(a.startsWith(`#if `))v.push(b(`if`,n)),t.push(O(D(a.slice(4),n[4]+4,y()))),v.pop();else if(/^#each(?:\s|$)/.test(a)){v.push(b(`each`,n));let e=/^#each ([\s\S]+) as ((\w+)(?:\s*,\s*(\w+))?)$/.exec(a);e||S(`Bad {{`+a+`}}`,`SJABLOON_EACH_SYNTAX`,n);let r=e[3],o=e[4],s=n[4]+a.length-e[2].length;if(i.test(r)&&S(`Bad {{`+a+`}}`,`SJABLOON_BLOCKED_BINDING`,n,s,s+r.length),o&&i.test(o)){let e=n[4]+a.length-o.length;S(`Bad {{`+a+`}}`,`SJABLOON_BLOCKED_BINDING`,n,e,e+o.length)}let c=D(e[1],n[4]+6,y()),l=m.length;m.push(r),o&&m.push(o),m.push(`loop`);let u=k([`#else`,`/each`]);m.length=l;let d=[];p[1]===`#else`?(d=k([`/each`]),p[1]===`/each`||w(p)):p[1]!==`/each`&&w(p),v.pop(),t.push(e=>{let t=c(e),n=Array.isArray(t),i=n?t.slice():t&&typeof t==`object`?Object.keys(t).map(e=>[t[e],e]):[];return i.length?i.map((t,a)=>{let s=n?t:t[0],c=n?a:t[1],l=Object.create(e);return l[r]=s,o&&(l[o]=c),l[`@`]=s,l.loop={index:a+1,index0:a,first:!a,last:a===i.length-1,length:i.length},T(u,l)}).join(``):T(d,e)})}else/^#(?:if|elif|else)(?:\s|$)/.test(a)||a[0]===`/`?w(n):a[0]===`#`?S(`Unknown {{`+a+`}}`,`SJABLOON_UNKNOWN_BLOCK`,n):t.push(E(n,r))}return e.length&&S(`Missing {{`+e[e.length-1]+`}}`,`SJABLOON_UNCLOSED_BLOCK`),t};function A(e,t){f=t,m=[`$`,`@`],h=new Set,g=new Set,_=String(e),v=[],u=l(_),d=0;let n;try{n=k([])}catch(e){throw e instanceof RangeError&&S(`Template too deeply nested`,`SJABLOON_TOO_DEEP`),e}let r=(e,t)=>{e||={};let r=Object.create(e);return r.$=t?t.root:e,t?`item`in t&&(r[`@`]=t.item):r[`@`]=e,T(n,r)};return r.names=Array.from(h),r.functions=Array.from(g),r}function j(e,t,n){return A(e,n)(t)}export{c as isDiagnostic,j as render,A as template};
+import{n as e,t}from"./core.js";const{template:n,render:r}=e([e=>(e=>(t,n)=>{n.push(e)})(Object.freeze({literal:e})),e=>(t,n)=>{n.push({value:e(t)})},0,()=>[],e=>e]),i=e=>{let t=``;for(let n of e)t+=n.literal??String(n.value??``);return t};export{t as isDiagnostic,r as render,n as template,i as text};

package/dist/text.d.ts

@@ -0,0 +1,17 @@
+export * from './types.js';
+import type { SjabloonFunctions, SjabloonRenderer, SjabloonValues } from './types.js';
+
+/**
+ * Compile a template once, render it many times to a plain string.
+ *
+ * `{{ expr }}` interpolates unescaped — escaping belongs at the output edge —
+ * so `{{{ expr }}}` has no meaning here and is a compile-time
+ * `SJABLOON_RAW_TAG` error.
+ *
+ * @see SjabloonRenderer for `names`/`functions`, SjabloonScope for `$` and `@`.
+ * @throws {SyntaxError} On malformed tags, unclosed blocks, or bad expressions.
+ */
+export function template(str: string, funcs?: SjabloonFunctions): SjabloonRenderer<string>;
+
+/** Compile and render in one go. Shorthand for `template(str, funcs)(values)`. */
+export function render(str: string, values?: SjabloonValues, funcs?: SjabloonFunctions): string;

package/dist/text.js

@@ -0,0 +1 @@
+import{n as e,t}from"./core.js";const{template:n,render:r}=e([e=>(t,n)=>{n.s+=e},e=>(t,n,r)=>(r=e(t),n.s+=String(r??``)),0,()=>({s:``}),e=>e.s]);export{t as isDiagnostic,r as render,n as template};

package/dist/types.d.ts

@@ -0,0 +1,83 @@
+import type { XprsnErrorCode } from 'xprsn';
+
+export type SjabloonErrorCode =
+    | XprsnErrorCode
+    | 'SJABLOON_EACH_SYNTAX'
+    | 'SJABLOON_BLOCKED_BINDING'
+    | 'SJABLOON_UNEXPECTED_TAG'
+    | 'SJABLOON_UNKNOWN_BLOCK'
+    | 'SJABLOON_UNCLOSED_BLOCK'
+    | 'SJABLOON_TOO_DEEP'
+    | 'SJABLOON_RAW_TAG';
+
+export interface SjabloonBlock {
+    readonly type: 'if' | 'each';
+    readonly start: number;
+    readonly end: number;
+}
+
+export interface SjabloonDiagnostic extends Error {
+    readonly code: SjabloonErrorCode;
+    readonly start: number;
+    readonly end: number;
+    readonly blocks: readonly SjabloonBlock[];
+}
+
+export type SjabloonValues = Record<string, any>;
+export type SjabloonFunctions = Record<string, Function>;
+
+/**
+ * Per-render override of the scope anchors, for embedders with their own scope
+ * model.
+ *
+ * Two anchors are always in scope: `$` is the root values, and `@` is the
+ * current `#each` item (the root outside any loop). They let a nested loop
+ * reach the root (`$.company`) or the current item (`@.total`) explicitly,
+ * past any shadowing. Neither counts as a `name`.
+ *
+ * Passing this object as the renderer's second argument makes `$` become
+ * `root` and `@` become `item` (two distinct objects). Omit `item` to leave
+ * `@` unbound, so reading `@.x` throws through xprsn's guard — a group-header
+ * band that has no current row wants exactly that.
+ */
+export interface SjabloonScope {
+    root?: any;
+    item?: any;
+}
+
+/**
+ * A compiled template: render it many times.
+ *
+ * `names` are the variables the template reads from your values, deduplicated;
+ * loop variables the template introduces are not included. `functions` are the
+ * registry functions the template calls, deduplicated.
+ */
+export interface SjabloonRenderer<T> {
+    (values?: SjabloonValues, scope?: SjabloonScope): T;
+    names: string[];
+    functions: string[];
+}
+
+/** One static text run of the template, verbatim. */
+export interface LiteralToken {
+    literal: string;
+}
+
+/** One `{{ }}` interpolation, pre-stringify. Nullish values are preserved. */
+export interface ValueToken {
+    value: unknown;
+}
+
+/**
+ * A render's output in the token edition, in render order: loop bodies append
+ * once per iteration, untaken branches append nothing, and block expressions
+ * (`#if` conditions, `#each` collections) never appear.
+ */
+export type Token = LiteralToken | ValueToken;
+
+/**
+ * Check whether an error was produced or translated by sjabloon. Every entry
+ * shares one core, so a diagnostic thrown through any of them authenticates
+ * through all of them.
+ */
+export function isDiagnostic(error: unknown): error is SjabloonDiagnostic;

package/package.json

@@ -1,42 +1,67 @@
 {
 	"name": "sjabloon",
-	"version": "0.5.1",
+	"version": "0.7.0",
 	"description": "Tiny, CSP-safe template engine for JavaScript, powered by xprsn expressions. No eval, no new Function.",
 	"repository": "getquario/sjabloon",
-	"license": "MIT",
+	"license": "Apache-2.0",
 	"author": {
 		"name": "Robin van der Vleuten",
 		"email": "robin@webstronauts.com",
 		"url": "https://robinvdvleuten.nl"
 	},
 	"type": "module",
-	"source": "src/index.js",
-	"main": "dist/index.cjs",
 	"module": "dist/index.js",
-	"types": "index.d.ts",
+	"types": "dist/index.d.ts",
 	"exports": {
 		".": {
-			"types": "./index.d.ts",
-			"import": "./dist/index.js",
-			"require": "./dist/index.cjs"
-		}
+			"types": "./dist/index.d.ts",
+			"default": "./dist/index.js"
+		},
+		"./text": {
+			"types": "./dist/text.d.ts",
+			"default": "./dist/text.js"
+		},
+		"./html": {
+			"types": "./dist/html.d.ts",
+			"default": "./dist/html.js"
+		},
+		"./package.json": "./package.json"
 	},
 	"engines": {
-		"node": ">=22.0.0"
+		"node": ">=22.12.0"
 	},
 	"files": [
-		"dist",
-		"src",
-		"index.d.ts"
+		"dist"
 	],
 	"size-limit": [
 		{
-			"path": "dist/index.js",
-			"limit": "1.7 kB"
+			"name": "sjabloon",
+			"path": [
+				"dist/index.js",
+				"dist/core.js"
+			],
+			"limit": "1.95 kB"
+		},
+		{
+			"name": "sjabloon/text",
+			"path": [
+				"dist/text.js",
+				"dist/core.js"
+			],
+			"limit": "1.9 kB"
+		},
+		{
+			"name": "sjabloon/html",
+			"path": [
+				"dist/html.js",
+				"dist/core.js"
+			],
+			"limit": "1.97 kB"
 		},
 		{
-			"path": "dist/index.cjs",
-			"limit": "1.72 kB"
+			"name": "core chunk (informational)",
+			"path": "dist/core.js",
+			"limit": "1.75 kB"
 		}
 	],
 	"scripts": {

package/dist/index.cjs

@@ -1 +0,0 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});let e=require("xprsn");const t={"&":`&amp;`,"<":`&lt;`,">":`&gt;`,'"':`&quot;`,"'":`&#39;`},n=e=>String(e).replace(/[&<>"']/g,e=>t[e]),r=/^(?:__proto__|constructor|prototype)$/,i=new WeakSet,a=i.add.bind(i),o=i.has.bind(i),s=e=>o(e);let c=e=>{let t=[];for(let n=0,r=1;n<e.length;){let i=e.indexOf(`{{`,n);if(i<0){t.push([0,e.slice(n)]);break}i>n&&t.push([0,e.slice(n,i)]);let a=e[i+2]===`{`,o=i+2+a,s=e[o]===`-`,c=-1;if(s&&o++,a&&r&&(c=e.indexOf(`}}}`,o),c<0&&(r=0)),c<0&&(a&&(a=!1,o=i+2,s=e[o]===`-`,s&&o++),c=e.indexOf(`}}`,o)),c<0){t.push([0,e.slice(i)]);break}let l=c>o&&e[c-1]===`-`,u=l?c-1:c,d=e.slice(o,u),f=d.trim(),p=o+d.length-d.trimStart().length,m=c+2+a,h=[a?1:2,f,i,m,p],g=t.at(-1);if(s&&g?.[0]===0&&g[1]&&(g[1]=g[1].trimEnd()),t.push(h),n=m,l)for(;/\s/.test(e[n]);)n++}return t},l,u,d,f,p,m,h,g,_,v=()=>Object.freeze(_.slice()),y=(e,t)=>(_.length<256||x(`Template too deeply nested`,`SJABLOON_TOO_DEEP`,t),Object.freeze({type:e,start:t[2],end:t[3]})),b=(e,t)=>(Object.defineProperty(e,"blocks",{value:t,enumerable:!0}),a(e),e),x=(e,t,n,r=n?.[2]??g.length,i=n?.[3]??g.length)=>{let a=SyntaxError(e);throw a.code=t,a.start=r,a.end=i,b(a,v())},S=(t,n,r,i=e.isDiagnostic)=>{throw i(t)?(t.start+=n,t.end+=n,b(t,r)):t},C=e=>x(`Unexpected {{`+e[1]+`}}`,`SJABLOON_UNEXPECTED_TAG`,e),w=(e,t)=>e.map(e=>e(t)).join(``),T=(e,t)=>(e=>n=>t(e(n)??``))(E(e[1],e[4],v())),E=(t,n,r)=>{let i;try{i=(0,e.compile)(t,d)}catch(e){S(e,n,r)}for(let e of i.names)p.includes(e)||m.add(e);for(let e of i.functions)h.add(e);return e=>{try{return i(e)}catch(e){S(e,n,r,i.isDiagnostic)}}},D=e=>{let t=O([`#elif`,`#else`,`/if`]),n=f[1],r=[];return n.startsWith(`#elif `)?r=[D(E(n.slice(6),f[4]+6,v()))]:n===`#else`?(r=O([`/if`]),f[1]===`/if`||C(f)):n!==`/if`&&C(f),n=>w(e(n)?t:r,n)},O=e=>{let t=[];for(let i;i=l[u++];){let a=i[1];if(!i[0])t.push((e=>()=>e)(a));else if(i[0]===1)t.push(T(i,String));else if(e.includes(a.split(` `)[0]))return f=i,t;else if(a[0]!==`!`)if(a.startsWith(`#if `))_.push(y(`if`,i)),t.push(D(E(a.slice(4),i[4]+4,v()))),_.pop();else if(/^#each(?:\s|$)/.test(a)){_.push(y(`each`,i));let e=/^#each ([\s\S]+) as ((\w+)(?:\s*,\s*(\w+))?)$/.exec(a);e||x(`Bad {{`+a+`}}`,`SJABLOON_EACH_SYNTAX`,i);let n=e[3],o=e[4],s=i[4]+a.length-e[2].length;if(r.test(n)&&x(`Bad {{`+a+`}}`,`SJABLOON_BLOCKED_BINDING`,i,s,s+n.length),o&&r.test(o)){let e=i[4]+a.length-o.length;x(`Bad {{`+a+`}}`,`SJABLOON_BLOCKED_BINDING`,i,e,e+o.length)}let c=E(e[1],i[4]+6,v()),l=p.length;p.push(n),o&&p.push(o),p.push(`loop`);let u=O([`#else`,`/each`]);p.length=l;let d=[];f[1]===`#else`?(d=O([`/each`]),f[1]===`/each`||C(f)):f[1]!==`/each`&&C(f),_.pop(),t.push(e=>{let t=c(e),r=Array.isArray(t),i=r?t.slice():t&&typeof t==`object`?Object.keys(t).map(e=>[t[e],e]):[];return i.length?i.map((t,a)=>{let s=r?t:t[0],c=r?a:t[1],l=Object.create(e);return l[n]=s,o&&(l[o]=c),l[`@`]=s,l.loop={index:a+1,index0:a,first:!a,last:a===i.length-1,length:i.length},w(u,l)}).join(``):w(d,e)})}else/^#(?:if|elif|else)(?:\s|$)/.test(a)||a[0]===`/`?C(i):a[0]===`#`?x(`Unknown {{`+a+`}}`,`SJABLOON_UNKNOWN_BLOCK`,i):t.push(T(i,n))}return e.length&&x(`Missing {{`+e[e.length-1]+`}}`,`SJABLOON_UNCLOSED_BLOCK`),t};function k(e,t){d=t,p=[`$`,`@`],m=new Set,h=new Set,g=String(e),_=[],l=c(g),u=0;let n;try{n=O([])}catch(e){throw e instanceof RangeError&&x(`Template too deeply nested`,`SJABLOON_TOO_DEEP`),e}let r=(e,t)=>{e||={};let r=Object.create(e);return r.$=t?t.root:e,t?`item`in t&&(r[`@`]=t.item):r[`@`]=e,w(n,r)};return r.names=Array.from(m),r.functions=Array.from(h),r}function A(e,t,n){return k(e,n)(t)}exports.isDiagnostic=s,exports.render=A,exports.template=k;

package/index.d.ts

@@ -1,68 +0,0 @@
-import type { XprsnErrorCode } from 'xprsn';
-
-export type SjabloonErrorCode =
-    | XprsnErrorCode
-    | 'SJABLOON_EACH_SYNTAX'
-    | 'SJABLOON_BLOCKED_BINDING'
-    | 'SJABLOON_UNEXPECTED_TAG'
-    | 'SJABLOON_UNKNOWN_BLOCK'
-    | 'SJABLOON_UNCLOSED_BLOCK';
-
-export interface SjabloonBlock {
-    readonly type: 'if' | 'each';
-    readonly start: number;
-    readonly end: number;
-}
-
-export interface SjabloonDiagnostic extends Error {
-    readonly code: SjabloonErrorCode;
-    readonly start: number;
-    readonly end: number;
-    readonly blocks: readonly SjabloonBlock[];
-}
-
-/**
- * Check whether an error was produced or translated by this sjabloon module instance.
- */
-export function isDiagnostic(error: unknown): error is SjabloonDiagnostic;
-
-/**
- * Compile a template once, render it many times.
- *
- * The returned renderer exposes `names`: the variables the template reads
- * from your values, deduplicated. Loop variables the template introduces are
- * not included. It also exposes `functions`: the registry functions the
- * template calls, deduplicated.
- *
- * Two anchors are always in scope: `$` is the root values, and `@` is the
- * current `#each` item (the root outside any loop). They let a nested loop
- * reach the root (`$.company`) or the current item (`@.total`) explicitly,
- * past any shadowing. Neither counts as a `name`.
- *
- * An embedder with its own scope model can override the anchors per render by
- * passing `{ root, item }` as the renderer's second argument: `$` becomes
- * `root` and `@` becomes `item` (two distinct objects). Omit `item` to leave
- * `@` unbound, so reading `@.x` throws through xprsn's guard.
- *
- * @param {string} str The template, e.g. `'Hello {{ user.name }}!'`.
- * @param {Record<string, Function>} [funcs] Functions callable inside expressions.
- * @returns {{(values?: Record<string, any>, scope?: { root?: any, item?: any }): string, names: string[], functions: string[]}} Renderer for the compiled template.
- * @throws {SyntaxError} On malformed tags, unclosed blocks, or bad expressions.
- */
-export function template(str: string, funcs?: Record<string, Function>): {
-    (values?: Record<string, any>, scope?: {
-        root?: any;
-        item?: any;
-    }): string;
-    names: string[];
-    functions: string[];
-};
-/**
- * Compile and render a template in one go.
- *
- * @param {string} str The template to render.
- * @param {Record<string, any>} [values] Variables available to the template.
- * @param {Record<string, Function>} [funcs] Functions callable inside expressions.
- * @returns {string} The rendered output.
- */
-export function render(str: string, values?: Record<string, any>, funcs?: Record<string, Function>): string;

package/src/index.js

@@ -1,274 +0,0 @@
-/**
- * Tiny, CSP-safe template engine powered by xprsn expressions.
- * Templates compile to a composition of closures; template text is never
- * turned into JavaScript, so strict CSP is satisfied.
- */
-import { compile, isDiagnostic as isXprsnDiagnostic } from 'xprsn';
-
-const ESC = { '&': '&amp;', '<': '&lt;', '>': '&gt;', '"': '&quot;', "'": '&#39;' };
-const esc = s => String(s).replace(/[&<>"']/g, c => ESC[c]);
-const BLOCKED = /^(?:__proto__|constructor|prototype)$/;
-const DIAGNOSTICS = new WeakSet();
-const mark = DIAGNOSTICS.add.bind(DIAGNOSTICS);
-const owns = DIAGNOSTICS.has.bind(DIAGNOSTICS);
-
-/**
- * Check whether an error was produced or translated by sjabloon.
- *
- * @param {unknown} error Any thrown value.
- * @returns {boolean} Whether `error` is an authentic sjabloon diagnostic.
- */
-export const isDiagnostic = error => owns(error);
-
-// Linear scan into text/tag/raw tokens. Dashes hug braces (`{{- x -}}` trims;
-// `{{ -x }}` stays unary minus). Prefer {{{ }}} over {{ }}. `triple` latches
-// off once }}} is gone so {{{...}}×N does not rescan to EOF (stays O(n)).
-let lex = s => {
-	const out = [];
-	for (let i = 0, triple = 1; i < s.length; ) {
-		const a = s.indexOf('{{', i);
-		if (a < 0) { out.push([0, s.slice(i)]); break; }
-		if (a > i) out.push([0, s.slice(i, a)]);
-		let raw = s[a + 2] === '{', p = a + 2 + raw, l = s[p] === '-', b = -1;
-		if (l) p++;
-		if (raw && triple) { b = s.indexOf('}}}', p); if (b < 0) triple = 0; }
-		if (b < 0) {
-			if (raw) { raw = !1; p = a + 2; l = s[p] === '-'; if (l) p++; }
-			b = s.indexOf('}}', p);
-		}
-		if (b < 0) { out.push([0, s.slice(a)]); break; }
-		const r = b > p && s[b - 1] === '-';
-		const q = r ? b - 1 : b, whole = s.slice(p, q), body = whole.trim();
-		const start = p + whole.length - whole.trimStart().length, end = b + 2 + raw;
-		const t = [raw ? 1 : 2, body, a, end, start];
-		const prev = out.at(-1);
-		if (l && prev?.[0] === 0 && prev[1]) prev[1] = prev[1].trimEnd();
-		out.push(t);
-		i = end;
-		if (r) while (/\s/.test(s[i])) i++;
-	}
-	return out;
-};
-
-// Shared parser state; parsing is synchronous so this is safe.
-// `nms` collects free variables, `fnms` the registry functions called.
-let toks, i, fns, last, bound, nms, fnms, src, blocks;
-
-let snap = () => Object.freeze(blocks.slice());
-// Block nesting is capped so a pathological template fails as a deterministic
-// SyntaxError at the offending opener, far below the native stack limit.
-const DEPTH = 256;
-let opener = (type, t) => {
-	blocks.length < DEPTH || fault('Template too deeply nested', 'SJABLOON_TOO_DEEP', t);
-	return Object.freeze({ type, start: t[2], end: t[3] });
-};
-let attach = (e, context) => {
-	Object.defineProperty(e, 'blocks', { value: context, enumerable: true });
-	mark(e);
-	return e;
-};
-let fault = (msg, code, t, start = t?.[2] ?? src.length, end = t?.[3] ?? src.length) => {
-	const e = SyntaxError(msg);
-	e.code = code;
-	e.start = start;
-	e.end = end;
-	throw attach(e, snap());
-};
-let translated = (e, start, context, owns = isXprsnDiagnostic) => {
-	if (!owns(e)) throw e;
-	e.start += start;
-	e.end += start;
-	throw attach(e, context);
-};
-let unexpected = t => fault('Unexpected {{' + t[1] + '}}', 'SJABLOON_UNEXPECTED_TAG', t);
-
-// Render a list of nodes against a scope.
-let run = (nodes, v) => nodes.map(n => n(v)).join('');
-
-// A leaf interpolation node: compile `src`, render nullish as '', apply `wrap`
-// (`esc` for `{{ }}`, `String` for the raw `{{{ }}}` form).
-let interp = (t, wrap) => (e => v => wrap(e(v) ?? ''))(cp(t[1], t[4], snap()));
-
-// Compile one expression and collect its free variables (minus the loop
-// variables currently in scope, which belong to the template) and the registry
-// functions it calls.
-let cp = (s, start, context) => {
-	let e;
-	try {
-		e = compile(s, fns);
-	} catch (x) {
-		translated(x, start, context);
-	}
-	for (const n of e.names) bound.includes(n) || nms.add(n);
-	for (const fn of e.functions) fnms.add(fn);
-	return v => {
-		try {
-			return e(v);
-		} catch (x) {
-			translated(x, start, context, e.isDiagnostic);
-		}
-	};
-};
-
-// One `#if`/`#elif` link: parse its branch, then recurse on the chain tail.
-let branch = cond => {
-	const then = parse(['#elif', '#else', '/if']);
-	const tag = last[1];
-	let els = [];
-	if (tag.startsWith('#elif ')) els = [branch(cp(tag.slice(6), last[4] + 6, snap()))];
-	else if (tag === '#else') {
-		els = parse(['/if']);
-		last[1] === '/if' || unexpected(last);
-	} else if (tag !== '/if') unexpected(last);
-	return v => run(cond(v) ? then : els, v);
-};
-
-let parse = stops => {
-	const nodes = [];
-	for (let t; (t = toks[i++]); ) {
-		const tag = t[1];
-		if (!t[0]) {
-			nodes.push((s => () => s)(tag));
-		} else if (t[0] === 1) {
-			nodes.push(interp(t, String));
-		} else if (stops.includes(tag.split(' ')[0])) {
-			last = t;
-			return nodes;
-		} else if (tag[0] === '!') {
-			// comment
-		} else if (tag.startsWith('#if ')) {
-			blocks.push(opener('if', t));
-			nodes.push(branch(cp(tag.slice(4), t[4] + 4, snap())));
-			blocks.pop();
-		} else if (/^#each(?:\s|$)/.test(tag)) {
-			blocks.push(opener('each', t));
-			const m = /^#each ([\s\S]+) as ((\w+)(?:\s*,\s*(\w+))?)$/.exec(tag);
-			m || fault('Bad {{' + tag + '}}', 'SJABLOON_EACH_SYNTAX', t);
-			const name = m[3], idx = m[4], at = t[4] + tag.length - m[2].length;
-			if (BLOCKED.test(name)) fault('Bad {{' + tag + '}}', 'SJABLOON_BLOCKED_BINDING', t, at, at + name.length);
-			if (idx && BLOCKED.test(idx)) {
-				const p = t[4] + tag.length - idx.length;
-				fault('Bad {{' + tag + '}}', 'SJABLOON_BLOCKED_BINDING', t, p, p + idx.length);
-			}
-			const list = cp(m[1], t[4] + 6, snap());
-			// `name`, `idx`, and `loop` are engine-bound inside the body, so
-			// exclude them from names there and restore outer bindings after.
-			const mark = bound.length;
-			bound.push(name);
-			if (idx) bound.push(idx);
-			bound.push('loop');
-			const body = parse(['#else', '/each']);
-			bound.length = mark;
-			let empty = [];
-			if (last[1] === '#else') {
-				empty = parse(['/each']);
-				last[1] === '/each' || unexpected(last);
-			} else if (last[1] !== '/each') unexpected(last);
-			blocks.pop();
-			// Child scopes inherit the parent via the prototype chain, so outer
-			// variables stay visible inside the loop body. `@` re-points to the
-			// current item at each level, `$` (root) rides the chain, and `loop`
-			// carries the iteration metadata (index/first/last/length).
-			nodes.push(v => {
-				const lv = list(v), arr = Array.isArray(lv);
-				const ps = arr ? lv.slice() : lv && typeof lv === 'object' ? Object.keys(lv).map(k => [lv[k], k]) : [];
-				if (!ps.length) return run(empty, v);
-				return ps.map((x, j) => {
-					const item = arr ? x : x[0], key = arr ? j : x[1];
-					const s = Object.create(v);
-					s[name] = item;
-					if (idx) s[idx] = key;
-					s['@'] = item;
-					s.loop = { index: j + 1, index0: j, first: !j, last: j === ps.length - 1, length: ps.length };
-					return run(body, s);
-				}).join('');
-			});
-		} else if (/^#(?:if|elif|else)(?:\s|$)/.test(tag) || tag[0] === '/') {
-			unexpected(t);
-		} else if (tag[0] === '#') {
-			fault('Unknown {{' + tag + '}}', 'SJABLOON_UNKNOWN_BLOCK', t);
-		} else {
-			nodes.push(interp(t, esc));
-		}
-	}
-	stops.length && fault('Missing {{' + stops[stops.length - 1] + '}}', 'SJABLOON_UNCLOSED_BLOCK');
-	return nodes;
-};
-
-/**
- * Compile a template once, render it many times.
- *
- * The returned renderer exposes `names`: the variables the template reads
- * from your values, deduplicated. Loop variables the template introduces are
- * not included. It also exposes `functions`: the registry functions the
- * template calls, deduplicated.
- *
- * Two anchors are always in scope: `$` is the root values, and `@` is the
- * current `#each` item (the root outside any loop). They let a nested loop
- * reach the root (`$.company`) or the current item (`@.total`) explicitly,
- * past any shadowing. Neither counts as a `name`.
- *
- * An embedder with its own scope model can override the anchors per render by
- * passing `{ root, item }` as the renderer's second argument: `$` becomes
- * `root` and `@` becomes `item` (two distinct objects). Omit `item` to leave
- * `@` unbound, so reading `@.x` throws through xprsn's guard.
- *
- * @param {string} str The template, e.g. `'Hello {{ user.name }}!'`.
- * @param {Record<string, Function>} [funcs] Functions callable inside expressions.
- * @returns {{(values?: Record<string, any>, scope?: { root?: any, item?: any }): string, names: string[], functions: string[]}} Renderer for the compiled template.
- * @throws {SyntaxError} On malformed tags, unclosed blocks, or bad expressions.
- */
-export function template(str, funcs) {
-	fns = funcs;
-	// `$` (root) and `@` (current item) are engine-bound anchors, always in
-	// scope, so they never count as caller-supplied `names`.
-	bound = ['$', '@'];
-	nms = new Set();
-	fnms = new Set();
-	src = String(str);
-	blocks = [];
-	toks = lex(src);
-	i = 0;
-	// Deeply nested blocks overflow the recursive-descent parser; surface that
-	// as a SyntaxError so malformed input keeps its documented compile-time
-	// contract (mirroring xprsn's XPRSN_TOO_DEEP for expressions).
-	let nodes;
-	try {
-		nodes = parse([]);
-	} catch (x) {
-		// An empty span at the end, like an unclosed block.
-		if (x instanceof RangeError) fault('Template too deeply nested', 'SJABLOON_TOO_DEEP');
-		throw x;
-	}
-	// Wrap the values in a root scope carrying the anchors, without mutating
-	// what the caller passed: by default `$` and `@` both point at the root.
-	// An embedder can override the anchors with a `{ root, item }` second arg:
-	// `$` = root, `@` = item (distinct objects). Omitting `item` leaves `@`
-	// unbound, so `@.x` throws through xprsn's guard — a group-header band that
-	// has no current row wants exactly that.
-	const f = (v, o) => {
-		v = v || {};
-		const r = Object.create(v);
-		r['$'] = o ? o.root : v;
-		if (!o) r['@'] = v;
-		else if ('item' in o) r['@'] = o.item;
-		return run(nodes, r);
-	};
-	// Array.from, not a spread: the bundler's transpile turns `[...set]` into
-	// `[].concat(set)`, which wraps the Set instead of unpacking it.
-	f.names = Array.from(nms);
-	f.functions = Array.from(fnms);
-	return f;
-}
-
-/**
- * Compile and render a template in one go.
- *
- * @param {string} str The template to render.
- * @param {Record<string, any>} [values] Variables available to the template.
- * @param {Record<string, Function>} [funcs] Functions callable inside expressions.
- * @returns {string} The rendered output.
- */
-export function render(str, values, funcs) {
-	return template(str, funcs)(values);
-}