@proteus-vue/compiler-backend 0.1.0 → 0.1.1-beta.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/LICENSE ADDED
@@ -0,0 +1,218 @@
1
+ Proteus(普罗透斯)Vue 跨端编译框架
2
+ Copyright (c) 2026 Proteus Contributors
3
+
4
+ Licensed under the Apache License, Version 2.0 (the "License");
5
+ you may not use this file except in compliance with the License.
6
+ You may obtain a copy of the License at
7
+
8
+ http://www.apache.org/licenses/LICENSE-2.0
9
+
10
+ Unless required by applicable law or agreed to in writing, software
11
+ distributed under the License is distributed on an "AS IS" BASIS,
12
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13
+ See the License for the specific language governing permissions and
14
+ limitations under the License.
15
+
16
+ ═══════════════════════════════════════════════════════════════════════════════
17
+
18
+ Apache License
19
+ Version 2.0, January 2004
20
+ http://www.apache.org/licenses/
21
+
22
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
23
+
24
+ 1. Definitions.
25
+
26
+ "License" shall mean the terms and conditions for use, reproduction,
27
+ and distribution as defined by Sections 1 through 9 of this document.
28
+
29
+ "Licensor" shall mean the copyright owner or entity authorized by
30
+ the copyright owner that is granting the License.
31
+
32
+ "Legal Entity" shall mean the union of the acting entity and all
33
+ other entities that control, are controlled by, or are under common
34
+ control with that entity. For the purposes of this definition,
35
+ "control" means (i) the power, direct or indirect, to cause the
36
+ direction or management of such entity, whether by contract or
37
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
38
+ outstanding shares, or (iii) beneficial ownership of such entity.
39
+
40
+ "You" (or "Your") shall mean an individual or Legal Entity
41
+ exercising permissions granted by this License.
42
+
43
+ "Source" form shall mean the preferred form for making modifications,
44
+ including but not limited to software source code, documentation
45
+ source, and configuration files.
46
+
47
+ "Object" form shall mean any form resulting from mechanical
48
+ transformation or translation of a Source form, including but
49
+ not limited to compiled object code, generated documentation,
50
+ and conversions to other media types.
51
+
52
+ "Work" shall mean the work of authorship, whether in Source or
53
+ Object form, made available under the License, as indicated by a
54
+ copyright notice that is included in or attached to the work
55
+ (an example is provided in the Appendix below).
56
+
57
+ "Derivative Works" shall mean any work, whether in Source or Object
58
+ form, that is based on (or derived from) the Work and for which the
59
+ editorial revisions, annotations, elaborations, or other modifications
60
+ represent, as a whole, an original work of authorship. For the purposes
61
+ of this License, Derivative Works shall not include works that remain
62
+ separable from, or merely link (or bind by name) to the interfaces of,
63
+ the Work and Derivative Works thereof.
64
+
65
+ "Contribution" shall mean any work of authorship, including
66
+ the original version of the Work and any modifications or additions
67
+ to that Work or Derivative Works thereof, that is intentionally
68
+ submitted to Licensor for inclusion in the Work by the copyright owner
69
+ or by an individual or Legal Entity authorized to submit on behalf of
70
+ the copyright owner. For the purposes of this definition, "submitted"
71
+ means any form of electronic, verbal, or written communication sent
72
+ to the Licensor or its representatives, including but not limited to
73
+ communication on electronic mailing lists, source code control systems,
74
+ and issue tracking systems that are managed by, or on behalf of, the
75
+ Licensor for the purpose of discussing and improving the Work, but
76
+ excluding communication that is conspicuously marked or otherwise
77
+ designated in writing by the copyright owner as "Not a Contribution."
78
+
79
+ "Contributor" shall mean Licensor and any individual or Legal Entity
80
+ on behalf of whom a Contribution has been received by Licensor and
81
+ subsequently incorporated within the Work.
82
+
83
+ 2. Grant of Copyright License. Subject to the terms and conditions of
84
+ this License, each Contributor hereby grants to You a perpetual,
85
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
86
+ copyright license to reproduce, prepare Derivative Works of,
87
+ publicly display, publicly perform, sublicense, and distribute the
88
+ Work and such Derivative Works in Source or Object form.
89
+
90
+ 3. Grant of Patent License. Subject to the terms and conditions of
91
+ this License, each Contributor hereby grants to You a perpetual,
92
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
93
+ (except as stated in this section) patent license to make, have made,
94
+ use, offer to sell, sell, import, and otherwise transfer the Work,
95
+ where such license applies only to those patent claims licensable
96
+ by such Contributor that are necessarily infringed by their
97
+ Contribution(s) alone or by combination of their Contribution(s)
98
+ with the Work to which such Contribution(s) was submitted. If You
99
+ institute patent litigation against any entity (including a
100
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
101
+ or a Contribution incorporated within the Work constitutes direct
102
+ or contributory patent infringement, then any patent licenses
103
+ granted to You under this License for that Work shall terminate
104
+ as of the date such litigation is filed.
105
+
106
+ 4. Redistribution. You may reproduce and distribute copies of the
107
+ Work or Derivative Works thereof in any medium, with or without
108
+ modifications, and in Source or Object form, provided that You
109
+ meet the following conditions:
110
+
111
+ (a) You must give any other recipients of the Work or
112
+ Derivative Works a copy of this License; and
113
+
114
+ (b) You must cause any modified files to carry prominent notices
115
+ stating that You changed the files; and
116
+
117
+ (c) You must retain, in the Source form of any Derivative Works
118
+ that You distribute, all copyright, patent, trademark, and
119
+ attribution notices from the Source form of the Work,
120
+ excluding those notices that do not pertain to any part of
121
+ the Derivative Works; and
122
+
123
+ (d) If the Work includes a "NOTICE" text file as part of its
124
+ distribution, then any Derivative Works that You distribute must
125
+ include a readable copy of the attribution notices contained
126
+ within such NOTICE file, excluding those notices that do not
127
+ pertain to any part of the Derivative Works, in at least one
128
+ of the following places: within a NOTICE text file distributed
129
+ as part of the Derivative Works; within the Source form or
130
+ documentation, if provided along with the Derivative Works; or,
131
+ within a display generated by the Derivative Works, if and
132
+ wherever such third-party notices normally appear. The contents
133
+ of the NOTICE file are for informational purposes only and
134
+ do not modify the License. You may add Your own attribution
135
+ notices within Derivative Works that You distribute, alongside
136
+ or as an addendum to the NOTICE text from the Work, provided
137
+ that such additional attribution notices cannot be construed
138
+ as modifying the License.
139
+
140
+ You may add Your own copyright statement to Your modifications and
141
+ may provide additional or different license terms and conditions
142
+ for use, reproduction, or distribution of Your modifications, or
143
+ for any such Derivative Works as a whole, provided Your use,
144
+ reproduction, and distribution of the Work otherwise complies with
145
+ the conditions stated in this License.
146
+
147
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
148
+ any Contribution intentionally submitted for inclusion in the Work
149
+ by You to the Licensor shall be under the terms and conditions of
150
+ this License, without any additional terms or conditions.
151
+ Notwithstanding the above, nothing herein shall supersede or modify
152
+ the terms of any separate license agreement you may have executed
153
+ with Licensor regarding such Contributions.
154
+
155
+ 6. Trademarks. This License does not grant permission to use the trade
156
+ names, trademarks, service marks, or product names of the Licensor,
157
+ except as required for reasonable and customary use in describing the
158
+ origin of the Work and reproducing the content of the NOTICE file.
159
+
160
+ 7. Disclaimer of Warranty. Unless required by applicable law or
161
+ agreed to in writing, Licensor provides the Work (and each
162
+ Contributor provides its Contributions) on an "AS IS" BASIS,
163
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
164
+ implied, including, without limitation, any warranties or conditions
165
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
166
+ PARTICULAR PURPOSE. You are solely responsible for determining the
167
+ appropriateness of using or redistributing the Work and assume any
168
+ risks associated with Your exercise of permissions under this License.
169
+
170
+ 8. Limitation of Liability. In no event and under no legal theory,
171
+ whether in tort (including negligence), contract, or otherwise,
172
+ unless required by applicable law (such as deliberate and grossly
173
+ negligent acts) or agreed to in writing, shall any Contributor be
174
+ liable to You for damages, including any direct, indirect, special,
175
+ incidental, or consequential damages of any character arising as a
176
+ result of this License or out of the use or inability to use the
177
+ Work (including but not limited to damages for loss of goodwill,
178
+ work stoppage, computer failure or malfunction, or any and all
179
+ other commercial damages or losses), even if such Contributor
180
+ has been advised of the possibility of such damages.
181
+
182
+ 9. Accepting Warranty or Additional Liability. While redistributing
183
+ the Work or Derivative Works thereof, You may choose to offer,
184
+ and charge a fee for, acceptance of support, warranty, indemnity,
185
+ or other liability obligations and/or rights consistent with this
186
+ License. However, in accepting such obligations, You may act only
187
+ on Your own behalf and on Your sole responsibility, not on behalf
188
+ of any other Contributor, and only if You agree to indemnify,
189
+ defend, and hold each Contributor harmless for any liability
190
+ incurred by, or claims asserted against, such Contributor by reason
191
+ of your accepting any such warranty or additional liability.
192
+
193
+ END OF TERMS AND CONDITIONS
194
+
195
+ APPENDIX: How to apply the Apache License to your work.
196
+
197
+ To apply the Apache License to your work, attach the following
198
+ boilerplate notice, with the fields enclosed by brackets "[]"
199
+ replaced with your own identifying information. (Don't include
200
+ the brackets!) The text should be enclosed in the appropriate
201
+ comment syntax for the file format. We also recommend that a
202
+ file or class name and description of purpose be included on the
203
+ same "printed page" as the copyright notice for easier
204
+ identification within third-party archives.
205
+
206
+ Copyright [yyyy] [name of copyright owner]
207
+
208
+ Licensed under the Apache License, Version 2.0 (the "License");
209
+ you may not use this file except in compliance with the License.
210
+ You may obtain a copy of the License at
211
+
212
+ http://www.apache.org/licenses/LICENSE-2.0
213
+
214
+ Unless required by applicable law or agreed to in writing, software
215
+ distributed under the License is distributed on an "AS IS" BASIS,
216
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
217
+ See the License for the specific language governing permissions and
218
+ limitations under the License.
package/dist/index.js CHANGED
@@ -68,6 +68,9 @@ function runCompilerConformance(backend, fixture = DEFAULT_CONFORMANCE_SFC) {
68
68
  linkBroken.push(`${n.type}: \u975E p- \u5143\u7D20\u4E0D\u5E94\u643A\u5E26 semantic`);
69
69
  }
70
70
  } else if (n.type !== "#text" && n.type !== "#interpolation" && n.type !== "#comment") {
71
+ if (n.type.startsWith("p-")) {
72
+ linkBroken.push(`${n.type}\uFF08TAG_SEMANTIC_MAP \u672A\u767B\u8BB0\u2014\u2014p-* \u8BED\u4E49\u7A7A\u767D\uFF0C\u52FF\u9759\u9ED8\u5F53\u517C\u5BB9\u5C42\uFF09`);
73
+ }
71
74
  compatElements++;
72
75
  }
73
76
  });
@@ -81,9 +84,13 @@ function runCompilerConformance(backend, fixture = DEFAULT_CONFORMANCE_SFC) {
81
84
  } else {
82
85
  check("ir.semantic.tree", sem.tree === null || typeof sem.tree.tag === "string" && typeof sem.tree.semantic === "string", sem.tree ? `root=${sem.tree.tag}\u2192${sem.tree.semantic}` : "tree=null");
83
86
  const irCount = sem.tree ? countCIR(sem.tree) : 0;
84
- check("ir.semantic.countMatch", irCount === sem.semanticCount, `C-IR \u6811 ${irCount} \u8282\u70B9 vs semanticCount=${sem.semanticCount}`);
87
+ check("ir.semantic.countMatch", sem.tree === null || irCount === sem.semanticCount, sem.tree ? `C-IR \u6811 ${irCount} \u8282\u70B9 vs semanticCount=${sem.semanticCount}` : "tree=null\uFF08compat \u6839\u9875\u9762\u2014\u2014\u8BED\u4E49\u4EE5\u6E32\u67D3\u6811+\u8BA1\u6570\u4E3A\u51C6\uFF09");
85
88
  check("ir.semantic.renderMatch", sem.semanticCount === semanticNodes, `semanticCount=${sem.semanticCount} vs \u6E32\u67D3\u6811\u8BED\u4E49\u8282\u70B9 ${semanticNodes}`);
86
89
  check("ir.semantic.compatCount", sem.compatCount === compatElements, `compatCount=${sem.compatCount} vs \u6E32\u67D3\u6811\u517C\u5BB9\u5143\u7D20 ${compatElements}`);
90
+ const forest = sem.forest ?? [];
91
+ check("ir.semantic.forestRooted", sem.tree !== null ? forest.length === 1 && sem.tree.semantic === forest[0]?.semantic : forest.every((f) => typeof f.semantic === "string"), sem.tree !== null ? `tree \u6839=${sem.tree.semantic} vs forest=${forest.map((f) => f.semantic).join(",")}` : forest.length ? `compat \u6839\u9875\u9876\u5C42\u8BED\u4E49\u6839\uFF1A${forest.map((f) => f.semantic).join(", ")}` : "\u7EAF compat\uFF08\u65E0\u8BED\u4E49\u5185\u5BB9\uFF09");
92
+ check("ir.semantic.forestNonEmpty", sem.tree !== null || sem.semanticCount === 0 || forest.length > 0, sem.tree === null && sem.semanticCount > 0 && forest.length === 0 ? `\u8BED\u4E49\u5185\u5BB9 ${sem.semanticCount} \u4E2A\u4F46 forest \u7A7A\u2014\u2014compat \u6839\u9875\u8BED\u4E49\u672A\u5E73\u94FA` : void 0);
93
+ check("ir.semantic.unrooted", true, sem.tree === null && sem.semanticCount > 0 ? `tree=null \u4F46 semanticCount=${sem.semanticCount}\uFF08compat \u6839\u9875\u9762\uFF1A\u8BED\u4E49\u9876\u5C42\u6839\u89C1 forest=${forest.map((f) => f.semantic).join(",") || "(\u7A7A)"}\uFF09` : void 0);
87
94
  }
88
95
  const b = ir.bindings;
89
96
  check("bindings.capabilities", Array.isArray(b?.capabilities), void 0);
@@ -193,28 +200,46 @@ function renderToComponentIR(node) {
193
200
  const children = node.children.map(renderToComponentIR).filter(Boolean);
194
201
  return toComponentIR(node.type, pickConstraintProps(node.props), children);
195
202
  }
203
+ function collectSemanticForest(node) {
204
+ const out = [];
205
+ const walk = (n) => {
206
+ if (n.semantic) {
207
+ const ir = renderToComponentIR(n);
208
+ if (ir) out.push(ir);
209
+ return;
210
+ }
211
+ for (const c of n.children) walk(c);
212
+ };
213
+ walk(node);
214
+ return out;
215
+ }
196
216
  function buildIR(template) {
197
217
  const root = domParse(template, { onError: () => void 0 });
198
218
  const rootEl = flattenChildNodes(root.children).find((c) => c.type === NodeTypes.ELEMENT);
199
219
  if (!rootEl) {
200
220
  return {
201
221
  render: { type: "template", props: {}, children: [], loc: { line: 1, column: 1 } },
202
- semantic: { tree: null, semanticCount: 0, compatCount: 0 },
222
+ semantic: { tree: null, semanticCount: 0, compatCount: 0, forest: [] },
203
223
  bindings: { capabilities: [], models: [], handlers: [] }
204
224
  };
205
225
  }
206
226
  const acc = { capabilities: [], models: [], handlers: [] };
207
227
  const render = elementToRenderNode(rootEl, acc);
208
228
  const tree = renderToComponentIR(render);
209
- const semanticCount = tree ? countCIR2(tree) : 0;
229
+ const semanticCount = countSemantic(render);
210
230
  const compatCount = countCompat(render);
231
+ const forest = collectSemanticForest(render);
211
232
  if (tree) {
212
233
  collectCapabilities(tree, acc);
234
+ } else {
235
+ for (const f of forest) collectCapabilities(f, acc);
213
236
  }
214
- return { render, semantic: { tree, semanticCount, compatCount }, bindings: acc };
237
+ return { render, semantic: { tree, semanticCount, compatCount, forest }, bindings: acc };
215
238
  }
216
- function countCIR2(node) {
217
- return 1 + node.children.reduce((acc, c) => acc + countCIR2(c), 0);
239
+ function countSemantic(node) {
240
+ let n = node.semantic ? 1 : 0;
241
+ for (const c of node.children) n += countSemantic(c);
242
+ return n;
218
243
  }
219
244
  function countCompat(node) {
220
245
  let n = 0;
package/dist/node.js CHANGED
@@ -82,28 +82,46 @@ function renderToComponentIR(node) {
82
82
  const children = node.children.map(renderToComponentIR).filter(Boolean);
83
83
  return toComponentIR(node.type, pickConstraintProps(node.props), children);
84
84
  }
85
+ function collectSemanticForest(node) {
86
+ const out = [];
87
+ const walk = (n) => {
88
+ if (n.semantic) {
89
+ const ir = renderToComponentIR(n);
90
+ if (ir) out.push(ir);
91
+ return;
92
+ }
93
+ for (const c of n.children) walk(c);
94
+ };
95
+ walk(node);
96
+ return out;
97
+ }
85
98
  function buildIR(template) {
86
99
  const root = domParse(template, { onError: () => void 0 });
87
100
  const rootEl = flattenChildNodes(root.children).find((c) => c.type === NodeTypes.ELEMENT);
88
101
  if (!rootEl) {
89
102
  return {
90
103
  render: { type: "template", props: {}, children: [], loc: { line: 1, column: 1 } },
91
- semantic: { tree: null, semanticCount: 0, compatCount: 0 },
104
+ semantic: { tree: null, semanticCount: 0, compatCount: 0, forest: [] },
92
105
  bindings: { capabilities: [], models: [], handlers: [] }
93
106
  };
94
107
  }
95
108
  const acc = { capabilities: [], models: [], handlers: [] };
96
109
  const render = elementToRenderNode(rootEl, acc);
97
110
  const tree = renderToComponentIR(render);
98
- const semanticCount = tree ? countCIR(tree) : 0;
111
+ const semanticCount = countSemantic(render);
99
112
  const compatCount = countCompat(render);
113
+ const forest = collectSemanticForest(render);
100
114
  if (tree) {
101
115
  collectCapabilities(tree, acc);
116
+ } else {
117
+ for (const f of forest) collectCapabilities(f, acc);
102
118
  }
103
- return { render, semantic: { tree, semanticCount, compatCount }, bindings: acc };
119
+ return { render, semantic: { tree, semanticCount, compatCount, forest }, bindings: acc };
104
120
  }
105
- function countCIR(node) {
106
- return 1 + node.children.reduce((acc, c) => acc + countCIR(c), 0);
121
+ function countSemantic(node) {
122
+ let n = node.semantic ? 1 : 0;
123
+ for (const c of node.children) n += countSemantic(c);
124
+ return n;
107
125
  }
108
126
  function countCompat(node) {
109
127
  let n = 0;
package/dist/spi.d.ts CHANGED
@@ -31,13 +31,20 @@ export interface RenderNode {
31
31
  export interface RenderIR {
32
32
  root: RenderNode;
33
33
  }
34
- /** 语义 IR(G-31 C-IR 树——真实模板编译 → toComponentIR;非 p- 标签不产生 Layer 0 C-IR) */
34
+ /** 语义 IR(G-31 C-IR 树——真实模板编译 → toComponentIR;非 p- 标签不产生 Layer 0 C-IR)
35
+ * ★#505 M3:semanticCount 定义 = 渲染树**全树**带 semantic 的元素数(不再取“根为 p-* 的 C-IR 树”计数)
36
+ * —— compat 根页面(view 壳 + 嵌套 p-*)的真实产物语义内容从此如实计入;
37
+ * tree 仅当模板根为 p-*(组件级语义树)时存在;compat 根的页面 tree=null,语义内容以渲染树 + 计数为准。
38
+ * ★#505 M3 D6(语义森林):forest = 语义内容**顶层根**(父链无 semantic 的语义节点)的 C-IR 子树集合——
39
+ * root 为 p-* 时恒为 [tree](同构);compat 根页面逐顶层语义根平铺(供六端矩阵按根 readback);无语义 → []。 */
35
40
  export interface SemanticIR {
36
41
  tree: ComponentIR | null;
37
- /** C-IR 树节点数(= 渲染树中带 semantic 的元素数——conformance 交叉核对) */
42
+ /** 渲染树中带 semantic 的元素总数(全树——conformance 交叉核对 renderMatch) */
38
43
  semanticCount: number;
39
44
  /** 兼容层元素数(渲染树中无 semantic 的元素——view/text/scroll-view 等) */
40
45
  compatCount: number;
46
+ /** 语义内容顶层根集合(D6 旁路——tree 单根契约不动,compat 根页面语义内容不丢失) */
47
+ forest?: ComponentIR[];
41
48
  }
42
49
  /** 布局约束(G-22——B1 占位,v1 可选) */
43
50
  export interface LayoutConstraintIR {
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@proteus-vue/compiler-backend",
3
- "version": "0.1.0",
3
+ "version": "0.1.1-beta.0",
4
4
  "description": "G-29 编译器可插拔后端:CompilerIR 契约 + conformance(CMP002/CMP004 + G-31.1 语义链接)+ NodeBackend 参考实现(真实模板编译 → C-IR 语义树)——编译、逻辑、UI、能力四维可插拔(原则 #10 终极形态)",
5
5
  "type": "module",
6
6
  "license": "Apache-2.0",
@@ -23,11 +23,8 @@
23
23
  "dist",
24
24
  "README.md"
25
25
  ],
26
- "scripts": {
27
- "build": "tsc -p tsconfig.build.json --emitDeclarationOnly && esbuild src/index.ts --bundle --format=esm --platform=node --outfile=dist/index.js --external:@vue/compiler-sfc --external:@vue/compiler-dom --external:@proteus-vue/component-ir && esbuild src/node.ts --bundle --format=esm --platform=neutral --outfile=dist/node.js --external:@vue/compiler-sfc --external:@vue/compiler-dom --external:@proteus-vue/component-ir"
28
- },
29
26
  "dependencies": {
30
- "@proteus-vue/component-ir": "0.1.0"
27
+ "@proteus-vue/component-ir": "0.1.1-beta.0"
31
28
  },
32
29
  "peerDependencies": {
33
30
  "@vue/compiler-dom": "^3.4",
@@ -36,6 +33,9 @@
36
33
  "devDependencies": {
37
34
  "@vue/compiler-dom": "^3.5.42",
38
35
  "@vue/compiler-sfc": "^3.5.42",
39
- "@proteus-vue/types": "workspace:*"
36
+ "@proteus-vue/types": "0.2.0-beta.1"
37
+ },
38
+ "scripts": {
39
+ "build": "tsc -p tsconfig.build.json --emitDeclarationOnly && esbuild src/index.ts --bundle --format=esm --platform=node --outfile=dist/index.js --external:@vue/compiler-sfc --external:@vue/compiler-dom --external:@proteus-vue/component-ir && esbuild src/node.ts --bundle --format=esm --platform=neutral --outfile=dist/node.js --external:@vue/compiler-sfc --external:@vue/compiler-dom --external:@proteus-vue/component-ir"
40
40
  }
41
- }
41
+ }