allyhub 0.1.0-alpha.8 → 0.2.0-next.1

package/LICENSE.md

@@ -0,0 +1,241 @@
+AllyHub Software License
+
+Copyright (c) 2026 AllyHub, Inc. ("AllyHub"). All rights reserved.
+
+This software (the AllyHub command-line tool, its SDK, runtime and the
+packages they depend on) is proprietary. It is not open source.
+
+1. Permitted use. You may install and run the software, unmodified, to make,
+   check, preview and render videos and decks, including for commercial
+   purposes. What you make with it is yours.
+
+2. Restrictions. Except as this license permits or applicable law requires,
+   you may not copy, modify, adapt, translate, sublicense, sell, rent, lease,
+   publish or otherwise distribute the software, create derivative works of
+   it, or reverse engineer, decompile or disassemble it.
+
+3. Cloud services. AllyHub's cloud tools (sign-in, research, images, voice,
+   video) are separate services governed by AllyHub's terms of service.
+
+4. Trademarks. This license grants no right to use the name "AllyHub" or its
+   logos.
+
+5. No warranty. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
+   KIND, EXPRESS OR IMPLIED, INCLUDING THE WARRANTIES OF MERCHANTABILITY,
+   FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL
+   ALLYHUB BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY ARISING FROM,
+   OUT OF OR IN CONNECTION WITH THE SOFTWARE OR ITS USE.
+
+6. Third-party code. Parts of the software are adapted from HyperFrames,
+   licensed under the Apache License, Version 2.0 (see NOTICE). Those parts
+   remain under that license, reproduced below, and nothing in this license
+   limits your rights under it.
+
+7. Starter components. The starter components in the "components" folder,
+   which "allyhub add" copies into your workspace, are licensed under the MIT
+   License (see components/LICENSE): once copied, you may change, use and
+   share them freely.
+
+--------------------------------------------------------------------------------
+
+                                 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/NOTICE

@@ -3,29 +3,26 @@ Copyright (c) 2026 AllyHub, Inc. All rights reserved.
 
 This product is proprietary; see LICENSE.
 
-Parts of the rendering code (frame capture with BeginFrame, worker sizing,
-frame extraction and the ffmpeg arguments) and of the speech recognition
-(the pinned Parakeet model and sherpa-onnx runtime installed on first use,
-decoding in windows cut at silences and merging tokens into words) and of
-the vision analyses (the onnxruntime-node runtime installed on first use,
-the models run in a child process) are adapted from HyperFrames (https://github.com/heygen-com/hyperframes),
+The sign-in's PKCE pair and its loopback server (src/pkce.ts,
+src/loopback.ts) are adapted from HyperFrames
+(https://github.com/heygen-com/hyperframes, packages/cli/src/auth/),
 Copyright 2026 HeyGen, Inc., licensed under the Apache License, Version 2.0.
 Each adapted file says so in its header.
 
-Two of the facts allyhub inspect reports follow methods of HyperFrames'
-skills, under the same licence: text-contrast measures text against the
-picture captured with the text hidden, as its contrast report does
-(skills/hyperframes-creative/scripts/contrast-report.mjs), and cut-seam
-measures element velocities either side of a cut, as its seam gate does
-(.claude/skills/motion-doctrine/scripts/seam-gate.mjs). The files that do
-(packages/engine/src/contrast.ts and seams.ts, packages/host-node/src/
-contrast.ts and seams.ts) say so in their headers.
-
-The doc editor (in the browser editor and AllyHub Studio) is built on
-BlockNote (https://github.com/TypeCellOS/BlockNote): the packages
-@blocknote/core, @blocknote/react and @blocknote/shadcn, used unmodified
-under the Mozilla Public License, Version 2.0. Their source is at that
-address. None of BlockNote's "XL" packages is used.
+---
+
+AllyHub
+Copyright (c) 2026 AllyHub, Inc. All rights reserved.
+
+This product is proprietary; see LICENSE.
+
+Parts of the speech recognition (the pinned Parakeet model and the
+sherpa-onnx runtime, decoding in windows cut at silences and merging tokens
+into words), of the vision analyses (the models run in a child process) and
+of the media probe (how ffprobe is run) are adapted from HyperFrames
+(https://github.com/heygen-com/hyperframes),
+Copyright 2026 HeyGen, Inc., licensed under the Apache License, Version 2.0.
+Each adapted file says so in its header.
 
 The vision analyses (face tracking and person mattes) adapt the decoding of
 the YuNet face detector's outputs and the non-maximum suppression from
@@ -57,20 +54,20 @@ from rembg (https://github.com/danielgatis/rembg), under the MIT License:
   USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 The models themselves are not shipped: they are downloaded on first use
-under their own licences (YuNet, Copyright (c) 2020 Shiqi Yu, MIT License;
-U²-Net, Copyright (c) 2020 Xuebin Qin, Apache License, Version 2.0), as is
-the onnxruntime-node runtime (Copyright (c) Microsoft Corporation, MIT
-License).
-
-The talking-head tools adapt logic from FilmCraft
-(https://github.com/storytold/filmcraft), dual-licensed under the MIT
-License or the Apache License, Version 2.0, and used here under the MIT
-License: reading a take by word index and tightening word bounds to the
-sound's level (crates/engine/src/transcript.rs, crates/speech/src/vad.rs),
-placing cuts in the silence beside the words, and measuring the offset
-between two recordings from their sound by generalised cross-correlation
-(GCC-PHAT, coarse then refined; crates/audio-dsp/src/sync.rs). Each adapted
-file says so in its header.
+under their own licences (Parakeet TDT, NVIDIA, CC-BY-4.0; YuNet,
+Copyright (c) 2020 Shiqi Yu, MIT License; U²-Net, Copyright (c) 2020
+Xuebin Qin, Apache License, Version 2.0; Tesseract's English model, Apache
+License, Version 2.0). The runtimes are dependencies under their own
+licences: onnxruntime-node (Copyright (c) Microsoft Corporation, MIT
+License), sherpa-onnx-node (Apache License, Version 2.0) and tesseract.js
+(Apache License, Version 2.0).
+
+Measuring the offset between two recordings from their sound by
+generalised cross-correlation (GCC-PHAT, coarse then refined) adapts logic
+from FilmCraft (https://github.com/storytold/filmcraft,
+crates/audio-dsp/src/sync.rs), dual-licensed under the MIT License or the
+Apache License, Version 2.0, and used here under the MIT License. The
+adapted file says so in its header.
 
   Copyright (c) 2026 ArtCraft Team and the FilmCraft contributors
 
@@ -93,21 +90,65 @@ file says so in its header.
   OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
   USE OR OTHER DEALINGS IN THE SOFTWARE.
 
-The SDK's motion and layout helpers are after three of Remotion's packages
-(https://github.com/remotion-dev/remotion), each published under the MIT
-License, written again in AllyHub's own code: fitting a text to n lines by
-a binary search on its font size (@remotion/layout-utils,
-fit-text-on-n-lines.ts and fill-text-box.ts; packages/sdk/src/fit.ts and
-fitLines in dom.ts), seeded simplex noise with a seed and coordinates
-(@remotion/noise; packages/sdk/src/noise.ts) and measuring, drawing on and
-interpolating SVG paths (@remotion/paths: getLength, getPointAtLength,
-getTangentAtLength, evolvePath, interpolatePath; packages/sdk/src/paths.ts).
-Each file says so in its header. @remotion/noise wraps simplex-noise
-(https://github.com/jwagner/simplex-noise.js, Copyright (c) 2022 Jonas
-Wagner, MIT License); the noise here, like it, follows Stefan Gustavson's
-public-domain simplex noise reference ("Simplex noise demystified", 2005).
-
-  Copyright (c) 2023 JonnyBurger
+The Apache License, Version 2.0 is reproduced at the end of LICENSE; those
+parts remain under it.
+
+---
+
+AllyHub
+Copyright (c) 2026 AllyHub, Inc. All rights reserved.
+
+This product is proprietary; see the repository LICENSE.
+
+Geometry Boolean operations use manifold-3d 3.5.4 (Manifold),
+https://github.com/elalish/manifold, under the Apache License 2.0.
+Its published package retains its own LICENSE. No Manifold source is copied
+into this package.
+
+Three.js (MIT) supplies math and polygon triangulation; glTF Transform (MIT)
+supplies GLB encoding. Their published packages retain their license notices.
+
+Blender 4.5 is an API and development-test reference. No Blender implementation
+is copied or linked into this package. The test/reference Python harness runs
+an independently installed Blender executable only when explicitly invoked.
+
+Subdivision uses OpenSubdiv 3.6.0, Copyright Pixar,
+https://github.com/PixarAnimationStudios/OpenSubdiv, commit
+7d0ab5530feef693ac0a920585b5c663b80773b3, under its Modified Apache 2.0
+license. The small native integration is informed by its Far tutorial 5.1.
+The compiled WASM is distributed in @allyhub-next/model's generated runtime.
+The upstream LICENSE.opensubdiv and NOTICE.opensubdiv are retained beside it,
+along with the Emscripten, LLVM libc++/libc++abi/compiler-rt and musl runtime
+license texts. The generated runtime and these notices are copied into
+@allyhub-next/model/dist/generated when building the package.
+
+---
+
+AllyHub
+Copyright (c) 2026 AllyHub, Inc. All rights reserved.
+
+This product is proprietary; see LICENSE.
+
+Parts of the rendering code (the x264 settings and BT.709 conversion of
+an mp4, the closed-GOP segments joined by copying, the sizing of the
+pages that draw, and how a VP8 or VP9 file's alpha is decoded) are
+adapted from HyperFrames (https://github.com/heygen-com/hyperframes),
+Copyright 2026 HeyGen, Inc., licensed under the Apache License, Version
+2.0 (http://www.apache.org/licenses/LICENSE-2.0). Each adapted file says
+so in its header: src/encode.ts, src/render.ts, src/footage.ts and
+src/ffmpeg.ts.
+
+---
+
+AllyHub
+Copyright (c) 2026 AllyHub, Inc. All rights reserved.
+
+This product is proprietary; see LICENSE.
+
+The centripetal Catmull-Rom tangents in src/curve.ts follow three.js's
+CatmullRomCurve3 (src/extras/curves/CatmullRomCurve3.js)
+(https://github.com/mrdoob/three.js),
+Copyright 2010-2026 three.js authors, 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
@@ -128,5 +169,46 @@ public-domain simplex noise reference ("Simplex noise demystified", 2005).
   OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
   USE OR OTHER DEALINGS IN THE SOFTWARE.
 
-The Apache License, Version 2.0 is reproduced at the end of LICENSE; those
-parts remain under it.
+The arc-length parametrisation (Gauss-Legendre quadrature per segment,
+inverted by Newton steps with a bisection fallback) and the timing of
+keyframes by a monotone cubic follow the approach of the splines library
+(https://github.com/AudioSceneDescriptionFormat/splines), Copyright (c)
+2018-2026 Matthias Geier, under the MIT License (the same terms as above).
+No code of it is copied.
+
+The moiré a sensor makes of a screen (src/moire.ts) follows
+the screen-capture simulation of UniDemoiré
+(https://github.com/4DVLab/UniDemoire, unidemoire/models/shooting), Copyright
+(c) 2024 4DVLab, under the MIT License: a screen's RGB subpixels, the
+projective transform, the sensor's Bayer filter. It is worked out in closed
+form per pixel; no code of it is copied.
+
+---
+
+AllyHub
+Copyright (c) 2026 AllyHub, Inc. All rights reserved.
+
+This product is proprietary; see LICENSE.
+
+A screen's glass in src/glass.ts mirrors the scenery as three.js's Reflector
+does (examples/jsm/objects/Reflector.js) (https://github.com/mrdoob/three.js),
+Copyright 2010-2026 three.js authors, 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.

package/bin/allyhub.js

@@ -1,40 +1,35 @@
 #!/usr/bin/env node
+import { realpathSync } from "node:fs";
+import { createRequire } from "node:module";
+import { dirname, join } from "node:path";
+import { fileURLToPath, pathToFileURL } from "node:url";
 
-// A published allyhub always has its built files. One run from a source
-// checkout does not while `pnpm build` rebuilds it (the build clears each
-// package's dist first): Node then fails on the first import with a stack
-// trace that reads like a broken install. Say what it is, and that the
-// command can be run again.
+// The project's own allyhub runs a command when the project installed one
+// (as webpack-cli and jest prefer a local install): a global allyhub, or
+// AllyHub Studio's, hands the run to the version the project's package.json
+// pins. It is found from the current folder as Node finds a package.
+// ALLYHUB_NO_LOCAL=1 runs this one.
 
-/** The error is a built file of AllyHub's own that is not there. */
-function missingBuild(e) {
-  if (typeof e !== "object" || e === null) return undefined;
-  if (e.code !== "ERR_MODULE_NOT_FOUND") return undefined;
-  const url = typeof e.url === "string" ? e.url : "";
-  const own =
-    url.startsWith(new URL("../dist/", import.meta.url).href) ||
-    /\/(node_modules\/@allyhub|packages)\/[^/]+\/dist\//.test(url);
-  return own ? url : undefined;
-}
+const own = dirname(dirname(fileURLToPath(import.meta.url)));
 
-let main;
-try {
-  ({ main } = await import("../dist/main.js"));
-} catch (e) {
-  const file = missingBuild(e);
-  if (file === undefined) throw e;
-  const error = {
-    code: "not_built",
-    message: `allyhub's built files are not there (${file}).`,
-    hint: "This allyhub runs from a source checkout that is being rebuilt, or was never built. Run the command again in a few seconds; if it still fails, run pnpm build in the checkout.",
-  };
-  if (process.argv.includes("--json")) {
-    process.stdout.write(`${JSON.stringify({ error }, null, 2)}\n`);
-  } else {
-    process.stderr.write(`Error: ${error.message}\n${error.hint}\n`);
+/** The project's installed copy of this package, when it is another one. */
+function local() {
+  if (process.env.ALLYHUB_NO_LOCAL === "1") return undefined;
+  const require = createRequire(import.meta.url);
+  const { name } = require(join(own, "package.json"));
+  try {
+    const entry = createRequire(join(process.cwd(), "noop.js")).resolve(name);
+    const dir = dirname(dirname(entry));
+    return realpathSync(dir) === realpathSync(own) ? undefined : dir;
+  } catch {
+    return undefined;
   }
-  // EXIT.platform: nothing is wrong with the command or the workspace.
-  process.exit(5);
 }
 
-process.exitCode = await main(process.argv.slice(2));
+const theirs = local();
+if (theirs !== undefined)
+  await import(pathToFileURL(join(theirs, "bin", "allyhub.js")).href);
+else {
+  const { main } = await import("../dist/main.js");
+  process.exitCode = await main(process.argv.slice(2));
+}

package/dist/args.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{parseArgs as T}from"node:util";import{z as x}from"zod";import{EXIT as z}from"@allyhub-next/protocol";import{CommandError as E}from"./command.js";const k=s=>s._zod.def;export function shapeOf(s){let r=s,a;for(;;){const n=k(r);if((n.type==="default"||n.type==="prefault")&&(a=typeof n.defaultValue=="function"?n.defaultValue():n.defaultValue),(n.type==="optional"||n.type==="default"||n.type==="prefault"||n.type==="nullable")&&n.innerType){r=n.innerType;continue}const l=f=>{const o=k(f).type;if(o==="boolean")return"boolean";if(o==="number"||o==="int")return"number";if(o==="union"){const m=new Set((k(f).options??[]).map(l));return m.size===1?[...m][0]??"string":"string"}return"string"};return n.type==="array"&&n.element?{kind:l(n.element),list:!0,...a===void 0?{}:{fallback:a}}:{kind:l(r),list:!1,...a===void 0?{}:{fallback:a}}}}export function paramsOf(s){let r=s;for(;r;){const a=k(r);if(a.type==="object")return r.shape;r=a.innerType}}export const optionName=s=>s.replaceAll(/[A-Z]/gu,r=>`-${r.toLowerCase()}`);export function splitList(s){const r=[];let a=0,n=!1,l=0;for(let f=0;f<s.length;f++){const o=s[f];n?o==="\\"?f++:o==='"'&&(n=!1):o==='"'&&a>0?n=!0:o==="["||o==="{"?a++:(o==="]"||o==="}")&&a>0?a--:o===","&&a===0&&(r.push(s.slice(l,f)),l=f+1)}return r.push(s.slice(l)),r}const g=(s,r)=>new E("usage",s,{exit:z.usage,...r===void 0?{}:{hint:r}});function M(s,r){const a=[];for(let n=0;n<s.length;n++){const l=s[n]??"",f=s[n+1],o=l.startsWith("--")&&!l.includes("=")?l.slice(2):"";o!==""&&r(o)&&f!==void 0&&/^-\.?\d/u.test(f)?(a.push(`${l}=${f}`),n++):a.push(l)}return a}export function readArgs(s,r){const a=s.input.shape,n=Object.entries(a),l=[...s.positional??[]],f=new Map(n.map(([t,e])=>[t,shapeOf(e)])),o={},m=new Map,h=paramsOf(a.params);h&&(o.param={type:"string",multiple:!0});for(const[t]of n){if(l.includes(t)||h&&t==="params")continue;const e=f.get(t);if(!e)continue;const i=optionName(t);m.set(i,t),o[i]={type:e.kind==="boolean"&&!e.list?"boolean":"string",...e.list?{multiple:!0}:{}},e.kind==="boolean"&&!e.list&&(o[`no-${i}`]={type:"boolean"})}let $;try{$=T({args:M(r,t=>o[t]?.type==="string"),options:o,allowPositionals:!0,strict:!0})}catch(t){const e=[...m.keys()].map(i=>`--${i}`).join(", ");throw g(t.message,e?`${s.name} takes ${e}.`:`${s.name} takes no options.`)}const d={},y=(t,e)=>{if(f.get(t)?.kind!=="number")return e;const p=Number(e);if(e.trim()===""||!Number.isFinite(p))throw g(`--${optionName(t)} is a number, not "${e}".`);return p};if(h){const t={};for(const e of $.values.param??[]){const i=e.indexOf("="),p=i<0?e:e.slice(0,i),u=Object.keys(h).find(c=>optionName(c)===p||c===p);if(u===void 0||i<0)throw g(i<0?`--param ${e}: write it as name=value.`:`--param: ${s.name} has no parameter "${p}".`,`Its parameters: ${Object.keys(h).map(optionName).join(", ")}.`);const w=e.slice(i+1),{kind:O,list:A}=shapeOf(h[u]??x.string()),v=c=>{if(O==="number"){const N=Number(c);if(c.trim()===""||!Number.isFinite(N))throw g(`--param ${p} is a number, not "${c}".`);return N}return O==="boolean"?c==="true"||c==="1"||c==="yes":c};t[u]=A?splitList(w).filter(c=>c!=="").map(v):v(w)}d.params=t}for(const[t,e]of Object.entries($.values)){if(t==="param"&&h)continue;if(t.startsWith("no-")&&m.has(t.slice(3))){const u=m.get(t.slice(3))??"";e===!0&&(d[u]=!1);continue}const i=m.get(t);if(i===void 0)continue;const p=f.get(i);Array.isArray(e)?d[i]=e.flatMap(u=>splitList(String(u))).filter(u=>u!=="").map(u=>y(i,u)):typeof e=="boolean"?d[i]=e:typeof e=="string"&&(d[i]=p?.list?splitList(e).map(u=>y(i,u)):y(i,e))}const b=[...$.positionals];if(l.forEach((t,e)=>{const i=f.get(t),p=e===l.length-1;if(i?.list&&p){b.length>0&&(d[t]=b.splice(0).map(w=>y(t,w)));return}const u=b.shift();u!==void 0&&(d[t]=y(t,u))}),b.length>0)throw g(`${s.name} does not take "${b.join(" ")}".`);const j=s.input.safeParse(d);if(!j.success){const t=j.error.issues[0],e=String(t?.path[0]??""),i=l.includes(e)?`<${e}>`:e?`--${optionName(e)}`:s.name;throw g(`${i}: ${t?.message??"not valid"}.`)}return j.data}

package/dist/astro.d.ts

@@ -0,0 +1,2 @@
+export { default, allyhub, type AllyHubSiteOptions, } from "@allyhub-next/site/astro";
+//# sourceMappingURL=astro.d.ts.map

package/dist/astro.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+export{default,allyhub}from"@allyhub-next/site/astro";

package/dist/audio-text.js

@@ -0,0 +1,6 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{isAbsolute as U,relative as T}from"node:path";import{VOICE_FIT_DEFAULTS as E}from"@allyhub-next/audio";import{comboKey as S}from"@allyhub-next/video-core";const c=(e,t=1)=>e==null?"–":e.toFixed(t),p=(e,t=1)=>`${e>=0?"+":"−"}${Math.abs(e).toFixed(t)}`,b=(e,t)=>`${String(e)} ${t}${e===1?"":"s"}`;function x(e,t){const o=T(t,e);return o&&!o.startsWith("..")&&!U(o)?o:e}const P=e=>[...e].sort((t,o)=>o.strength-t.strength).slice(0,12).sort((t,o)=>t.t-o.t),g=e=>`${e.p10.toFixed(1)} / ${e.median.toFixed(1)} / ${e.p90.toFixed(1)}`,w=e=>e?`${e.bpm.toFixed(1)} BPM (confidence ${e.confidence.toFixed(2)})`:"no steady tempo";function v(e){const t=e.loudness,o=P(e.onsets);return[`Loudness  ${c(t.integrated)} LUFS integrated · range ${c(t.range)} LU · true peak ${c(t.truePeak)} dBTP · sample peak ${c(t.samplePeak)} dBFS${e.clipped>0?` · ${b(e.clipped,"sample")} at full scale`:""}`,`Silence   under ${String(e.options.silence.noise)} dBFS for ${String(e.options.silence.min)} s or longer: ${e.silences.length===0?"none":e.silences.map(i=>`${i.start.toFixed(2)}–${i.end.toFixed(2)} s (${i.duration.toFixed(2)} s${i.part?`, ${i.part}`:""})`).join(" · ")}`,`Onsets    ${String(e.onsets.length)}${o.length>0?`; strongest at ${o.map(i=>i.t.toFixed(2)).join(" ")} s (all in --json)`:""}`]}export function fileAudioText(e,t){return[`${x(e.source.file,t)} · ${e.duration.toFixed(2)} s · measured alone, on its own clock`,...v(e),`Pace      ${w(e.pace.tempo)} · ${e.pace.onsetsPerMinute.toFixed(1)} onsets a minute`,`Levels    dBFS every 10 ms, 10th / median / 90th: whole ${g(e.sound.whole)} · floor ${e.sound.floor.toFixed(1)}`].join(`
+`)}function O(e){return e===null?"":"█".repeat(Math.round(Math.min(-6,Math.max(-36,e))+36))}const y=e=>e?[e.pitch===void 0?void 0:`${p(e.pitch)} st`,e.pace===void 0?void 0:`${p(e.pace*100,0)} %`,e.bright===void 0?void 0:`${p(e.bright)} dB`].filter(t=>t!==void 0).join("  "):"",k=e=>e.pitch?`${e.pitch.median.toFixed(0).padStart(4)} Hz (${e.pitch.low.toFixed(0)}–${e.pitch.high.toFixed(0)})`:"   – Hz";export function versionAudioText(e,t,o){const i=t.master,s=[`${[e.piece,S(e.combo),e.format].join(" · ")} · ${t.duration.toFixed(2)} s · ${t.source.kind==="file"?`measured ${x(t.source.file,o)}`:"mixed now from its sources (no render)"}`,...v(t)];i&&s.splice(2,0,`Master    ${i.target.lufs===!1?"the mix's own level":`${String(i.target.lufs)} LUFS`}, ceiling ${String(i.target.truePeak)} dBTP: ${i.gainDb===void 0?"silent":`gain ${p(i.gainDb,2)} dB`}${i.before?` on ${i.before.integrated.toFixed(1)} LUFS, range ${c(i.before.range)} LU, true peak ${c(i.before.truePeak)} dBTP`:""}${i.limited===void 0?"":` · the limiter took ${i.limited.toFixed(1)} dB off the loudest peak`}`);const a=t.pace;s.push(`Pace      ${w(a.tempo)} · ${a.onsetsPerMinute.toFixed(1)} onsets a minute · ${a.wordsPerMinute.toFixed(1)} words a minute (${a.speakingRate.toFixed(1)} from the first word to the last) · speech ${(a.speechShare*100).toFixed(0)} % of the film${a.timeToFirstWord===null?"":` · first word at ${a.timeToFirstWord.toFixed(2)} s`}`);const r=t.sound;s.push(`Levels    dBFS every 10 ms, 10th / median / 90th: whole ${g(r.whole)}${r.words?` · under words ${g(r.words)}`:""}${r.between?` · between them ${g(r.between)} (${r.between.seconds.toFixed(1)} s, ${(r.between.voicedShare*100).toFixed(0)} % voiced, ${r.between.onsetsPerMinute.toFixed(1)} onsets a minute)`:""} · floor ${r.floor.toFixed(1)}${t.bedUnderVoice===null?"":` · words over between ${t.bedUnderVoice.toFixed(1)} dB`}`),t.stems.length>0&&s.push(`Stems     ${t.stems.map(n=>`${n.as} ${n.file} ${c(n.lufs)} LUFS${n.by==="level"?" (level over its length)":""}`).join(" · ")}`);const $=t.summary,f=n=>n.onset===void 0||n.offsetMs===void 0?"no onset":`onset ${n.onset.toFixed(2)} (${n.offsetMs>=0?"+":""}${String(n.offsetMs)} ms)${n.near?"  ✓":""}`,l=Math.max(4,...t.cuts.map(n=>n.part.length),...t.cues.map(n=>n.sound.length));s.push(`Cuts      ${String($.cutsOnOnset)} of ${String($.cuts)} within ±${String($.toleranceMs)} ms of an onset`);for(const n of t.cuts)s.push(`  ${n.t.toFixed(2).padStart(6)} ${n.part.padEnd(l)}  ${f(n)}`);if($.cues>0){s.push(`Cues      ${String($.cuesOnOnset)} of ${String($.cues)} within ±${String($.toleranceMs)} ms of an onset`);for(const n of t.cues)s.push(`  ${n.t.toFixed(2).padStart(6)} ${n.sound.padEnd(l)}  ${f(n)}  (${n.part})`)}const m=Math.max(4,...t.parts.map(n=>n.key.length));s.push("Parts     momentary loudness, mean / max LUFS");for(const n of t.parts)s.push(`  ${n.key.padEnd(m)} ${n.start.toFixed(2).padStart(6)}–${n.end.toFixed(2).padEnd(6)} ${c(n.loudness).padStart(5)} / ${c(n.peak).padStart(5)}  ${O(n.loudness)}`);if(t.speech.length>0){const n=Math.max(4,...t.speech.map(d=>d.part.length));s.push(`Speech    where each part speaks, mean LUFS; integrated LUFS before the recording and ${t.source.kind==="file"?"in the file":"in the mix"}; silences inside`);for(const d of t.speech){const u=d.levels.gainDb===void 0?"":` (speechGainDb ${p(d.levels.gainDb)})`;s.push(`  ${d.part.padEnd(n)} ${d.start.toFixed(2).padStart(6)}–${d.end.toFixed(2).padEnd(6)} ${c(d.loudness).padStart(5)}  ${c(d.levels.before).padStart(5)} → ${c(d.levels.after).padStart(5)}${u}  ${d.gaps.length===0?"continuous":b(d.gaps.length,"gap")}  ${d.file} @ ${d.from.toFixed(2)} s`)}t.speechSpread.before!==null&&t.speechSpread.after!==null&&s.push(`  the parts' spread: ${t.speechSpread.before.toFixed(1)} LU before the recording, ${t.speechSpread.after.toFixed(1)} LU ${t.source.kind==="file"?"in the file":"in the mix"}`),s.push(`Voice     each part's from its own file: median pitch (10–90 %), words a second, energy above ${String(t.options.voice.bright)} Hz; the step from the part before`);for(const d of t.speech){const u=d.voice;if(!u){s.push(`  ${d.part.padEnd(n)} –  (its file could not be read)`);continue}const h=y(d.step);s.push(`  ${d.part.padEnd(n)} ${k(u).padEnd(22)} ${c(u.pace,2).padStart(5)} /s  ${c(u.bright).padStart(6)} dB${h?`    ${h}`:""}`)}if(t.speech.some(d=>d.fileVoice!==void 0)){s.push(`File      the file's sound where each part speaks (what is under the voice counts too): median pitch (10–90 %), energy above ${String(t.options.voice.bright)} Hz; the file's less the video's`);for(const d of t.speech){const u=d.fileVoice;if(!u){s.push(`  ${d.part.padEnd(n)} –`);continue}const h=y(d.fileStep);s.push(`  ${d.part.padEnd(n)} ${k(u).padEnd(22)} ${c(u.bright).padStart(6)} dB${h?`    ${h}`:""}`)}}}for(const n of t.notes)s.push(`! ${n}`);return s.join(`
+`)}const L=[63,125,250,500,1e3,2e3,4e3,8e3,16e3],j=e=>e>=1e3?`${String(e/1e3)}k`:String(e);function B(e){const t=e.decay,o=e.tone;return[`speech ${e.speech.toFixed(1)} s, pauses ${e.pauses.toFixed(1)} s`,"t60"in t?`decay ${t.t60.toFixed(2)} s (${t.low.toFixed(2)}–${t.high.toFixed(2)}, ${String(t.ends)} ends)`:`decay – (${t.missing})`,"below"in o?`room tone ${o.below.toFixed(1)} LU under, tilt ${p(o.tilt)} dB/oct`:`room tone – (${o.missing})`,`spread ${e.dynamics.spread.toFixed(1)} LU, crest ${e.dynamics.crest.toFixed(1)} dB`].join(" · ")}const F=e=>L.map(t=>{const o=e.find(i=>i.hz===t);return(o?p(o.db):"–").padStart(6)}).join("");export function versionRecordingText(e,t){return[[e.piece,S(e.combo),e.format].join(" · "),...M(t)].join(`
+`)}export function fileRecordingText(e,t,o){return[`${x(e,o)} · measured alone, whole`,...M({file:t})].join(`
+`)}function M(e){const t=[],o="piece"in e?e:void 0;if(o){const a=o.groups.map(r=>`${r.setup} (${r.parts.join(", ")})`).join(" · ");t.push(o.measured==="mix"?`Recording the video's whole mix, as mastered; video({ mic }): ${JSON.stringify(o.setting)}`:`Recording the voice as recorded: ${a||"played as it is"}; video({ mic }): ${JSON.stringify(o.setting)}`,`  video   ${B(o.piece)}`)}else t.push("Recording");e.file&&t.push(`  file    ${B(e.file)}`),t.push(`  spectrum, dB against 1 kHz  ${L.map(a=>j(a).padStart(6)).join("")}   (third octaves in --json)`),o&&t.push(`  video                       ${F(o.piece.spectrum)}`),e.file&&t.push(`  file                        ${F(e.file.spectrum)}`);const i=o?.difference;i&&t.push(`  file − video                ${F(i.spectrum)}`,`  file − video: ${[i.decay===void 0?"decay –":`decay ${p(i.decay,2)} s`,i.tone===void 0?"room tone –":`room tone ${p(i.tone)} LU under, tilt ${p(i.tilt??0)}`,`spread ${p(i.spread)} LU`,`crest ${p(i.crest)} dB`].join(" · ")}`);const s=o?.fit;if(s){const a=s.distance.before,r=s.distance.after,$=(f,l,m,n="")=>l===void 0||m===void 0?void 0:`${f} ${p(l)} → ${p(m)}${n}`;t.push(`Fit       the video's voice moved (${s.moved.join(", ")||"nothing"}) until it measures as the file's; video − file: ${[`spectrum ${a.spectrum.toFixed(1)} → ${r.spectrum.toFixed(1)} dB RMS`,$("decay",a.decay,r.decay," s"),$("room tone",a.tone,r.tone," LU"),$("tilt",a.tilt,r.tilt)].filter(f=>f!==void 0).join(" · ")}`,`  mic: ${JSON.stringify(s.setting)}`),s.limited.length>0&&t.push(`  The response reached its limit at ${s.limited.map(j).join(", ")} Hz (it moves at most ${String(E.most)} dB at a band).`);for(const f of s.notes)t.push(`! ${f}`)}if(o)for(const a of o.notes)t.push(`! ${a}`);return t}

package/dist/command.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{EXIT as d,command as i}from"@allyhub-next/protocol";export function defineCommand(n,r){return{spec:i(n),run:r}}export class CommandError extends Error{code;hint;exit;constructor(r,t,e={}){super(t,e.cause===void 0?void 0:{cause:e.cause}),this.name="CommandError",this.code=r,this.hint=e.hint,this.exit=e.exit??d.failed}}

package/dist/commands/add.js

@@ -0,0 +1,6 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{readFile as j}from"node:fs/promises";import{join as w,posix as L,relative as O}from"node:path";import{fileURLToPath as T}from"node:url";import{z as l}from"zod";import{modelInfo as k}from"@allyhub-next/build";import{COMPONENTS_DIR as S}from"@allyhub-next/formats";import{EXIT as u}from"@allyhub-next/protocol";import{ASSET_DEFAULTS as C,ASSET_TYPES as _,PolyHaven as N,PolyHavenError as z,RegistryError as F,applyAdd as D,folderRegistry as x,planAdd as U,searchIndex as M}from"@allyhub-next/registry";import{cacheHome as Y}from"@allyhub-next/runtimes";import{CommandError as A,defineCommand as H}from"../command.js";import{projectRoot as V}from"../project.js";import{dir as B}from"../fields.js";const W=JSON.parse(await j(new URL("../../package.json",import.meta.url),"utf8")).version,P=T(new URL(".",import.meta.resolve("@allyhub-next/components/registry.json"))),b=Object.keys(_),E=20,q=e=>e.replace(/\.(?:ts|js)$/u,"").replaceAll(/[A-Z]/gu,t=>`-${t.toLowerCase()}`).replace(/^-/u,"");function I(e){return e instanceof F?new A(e.code,e.message,{exit:e.code==="conflict"?u.conflict:e.code==="no-item"?u.notFound:u.failed,...e.hint===void 0?{}:{hint:e.hint}}):e instanceof z?new A(e.code,e.message,{exit:e.code==="network"?u.platform:e.code==="not-found"?u.notFound:e.code==="bad-choice"?u.usage:u.failed,...e.hint===void 0?{}:{hint:e.hint}}):e}const R=e=>new N({userAgent:`AllyHub/${W} (+https://allyhub.com)`,cacheDir:w(Y(e.env),"polyhaven"),...e.env.ALLYHUB_POLYHAVEN_API?{api:e.env.ALLYHUB_POLYHAVEN_API}:{}}),g=e=>`${e.toFixed(3)} m`;function J(e){const t=[e.type,e.category,e.size?`${g(e.size.width)} wide, ${g(e.size.depth)} deep, ${g(e.size.height)} tall`:void 0,e.covers?`one tile covers ${e.covers.map(g).join(" × ")}`:void 0,e.polycount!==void 0?`${e.polycount.toLocaleString("en")} polygons`:void 0,e.maxResolution?`up to ${String(e.maxResolution[0])} px`:void 0,e.authors.length>0?`by ${e.authors.join(", ")}`:void 0].filter(n=>n!==void 0);return`  ${e.id}: ${e.name} (${t.join("; ")})
+    found in ${e.matchedIn.join(", ")||"everything"}; tags ${e.tags.join(", ")}`}async function K(e,t){const n=[`${t.name} from Poly Haven (CC0, by ${t.source.authors.join(", ")||"its authors"}): ${String(t.files.length)} files in ${t.dir}/, ${t.fetched>0?`${String(t.fetched)} fetched`:"all already there"}. Records: ${t.records.join(", ")}.`];if(t.type==="model"){const a=t.main[0]??"",d=await k(e,a,await j(w(e,a))),i=d.bounds;return n.push(i?`Measured: ${i.size.map(c=>c.toFixed(3)).join(" × ")} m along x, y (up), z; from ${i.min.map(c=>c.toFixed(3)).join(", ")} to ${i.max.map(c=>c.toFixed(3)).join(", ")}.`:`Not measured: ${d.contentsMissing??"no contents"}.`,...d.missing.length>0?[`Missing: ${d.missing.join(", ")}.`]:[],`In a scenery: const m = await w.load("${a}");`),{lines:n,model:d}}if(t.type==="hdri")return n.push(`In a scenery: await w.environment("${t.main[0]??""}", { background: true });`),{lines:n};const o=t.covers;return n.push(o&&o.length>=2?`One tile covers ${g(o[0]??0)} × ${g(o[1]??0)} (Poly Haven's dimensions): a surface's repeat is its size over that.`:"Poly Haven gives no size for one tile.",...t.main.map((a,d)=>{const i=t.maps?.[d]??"";return`  ${i}: await w.texture("${a}"${i==="diffuse"?"":', { colorSpace: "linear" }'})`})),{lines:n}}export const add=H({name:"add",summary:"Adds what the registry has to the project: a starter component, or a CC0 model, HDRI or texture from Poly Haven; alone it lists the components",input:l.strictObject({name:l.array(l.string()).optional().describe("What to add: a starter component (caption-line, or captionLine), or a Poly Haven asset's id (as allyhub add search prints it)"),to:l.string().optional().describe(`The folder the files go in, from the project (default ${S} for a component; for an asset, its kind's folder under assets/media/ and its id)`),force:l.boolean().default(!1).describe("Replace a component's copy the project changed (its changes are lost)"),res:l.string().optional().describe(`An asset's resolution, of its textures or of the HDRI (default ${C.resolution})`),dir:B}),positional:["name"],output:l.looseObject({}),examples:["allyhub add","allyhub add caption-line","allyhub add metal_office_desk --res 2k"]},async(e,t)=>{const n=x(P);try{const o=await n.index();if(!e.name||e.name.length===0){const h=Math.max(...o.items.map(s=>s.name.length));return{value:{components:o.items},text:["Starter components (allyhub add <name> copies one into components/; allyhub add search <words> finds Poly Haven's models, HDRIs and textures too):",...o.items.map(s=>`  ${s.name.padEnd(h)}  ${s.description}`)].join(`
+`)}}const a=await V(t.cwd,e.dir),d=new Set(o.items.map(h=>h.name)),i=e.name.map(q),c=i.filter(h=>d.has(h)),p=e.name.filter((h,s)=>!d.has(i[s]??"")),m=[],$={};if(c.length>0){const h=e.to??S,s=await U(n,c,{root:a,dir:h,force:e.force});await D(a,s);const v=r=>r==="up to date"?"Up to date":r==="added"?"Added":"Replaced";m.push(...s.files.map(r=>`${v(r.status)} ${r.path}`));const f=s.items.find(r=>r.name===c[0]),y=f?.files[0]?.target.replaceAll("{dir}",h);if(f&&y){const r=O(w(a,"name"),w(a,y)).split("\\").join("/").replace(/\.ts$/u,".js");m.push(`Import it from an item's entry file (<name>/video.ts): import { ${f.title} } from "${r.startsWith(".")?r:`./${r}`}"; one "../" more for each folder the item is deeper.`,"The file is the project's: change it as you like. allyhub add <name> --force puts the registry's back.")}s.missing.length>0&&m.push(`It needs packages the project does not declare: ${s.missing.join(", ")}.`),$.components=s.files.map(r=>({item:r.item,path:r.path,status:r.status})),$.missing=s.missing}if(p.length>0){const h=R(t),s=[];for(const v of p){const f=await h.add(v,{root:a,...e.to===void 0||c.length>0?{}:{to:L.normalize(e.to)},...e.res===void 0?{}:{resolution:e.res}}),y=await K(a,f);m.length>0&&m.push(""),m.push(...y.lines),s.push({...f,...y.model===void 0?{}:{model:y.model}})}$.assets=s}return{value:$,text:m.join(`
+`)}}catch(o){throw I(o)}}),addSearch=H({name:"add search",summary:"Finds the starter components and Poly Haven's CC0 models, HDRIs and textures whose names, tags, categories or descriptions hold every word, each with where its words were found",input:l.strictObject({words:l.array(l.string()).min(1).describe("The words to find (a word may start one of theirs)"),type:l.array(l.enum(["component",...b])).optional().describe("Only these kinds (default all)"),all:l.boolean().default(!1).describe(`Every match, not only the first ${String(E)} Poly Haven assets`)}),positional:["words"],output:l.looseObject({}),examples:['allyhub add search "office desk" --type model',"allyhub add search caption"]},async(e,t)=>{const n=e.words.join(" ").trim();try{const o=e.type??["component",...b],a=o.includes("component")?M(await x(P).index(),n):[],d=b.filter(m=>o.includes(m)),{found:i,total:c}=d.length>0?await R(t).search(n,d):{found:[],total:0},p=e.all?i:i.slice(0,E);return{value:{query:n,components:a,assets:{total:c,matches:i.length,found:p}},text:[...o.includes("component")?[`Starter components: ${String(a.length)} hold "${n}".`,...a.map(m=>`  ${m.name} (${m.title}): ${m.description}`)]:[],...d.length>0?[`From Poly Haven (CC0): ${String(i.length)} of ${String(c)} assets hold "${n}"${p.length<i.length?`; the first ${String(p.length)} (--all for every one)`:""}.`,...p.map(J)]:[],"","Add one: allyhub add <name or id>"].join(`
+`)}}catch(o){throw I(o)}});

package/dist/commands/align.js

@@ -0,0 +1,3 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{relative as h}from"node:path";import{z as s}from"zod";import{parameters as p}from"../parameters.js";import{SECOND_PEAK_GUARD as u,syncOffset as $}from"@allyhub-next/media";import{defineCommand as g}from"../command.js";import{existingFile as c,media as w,progressLines as b}from"../media.js";import{projectOfFile as x}from"../project.js";const d=(e,t)=>`${e<0?"−":"+"}${Math.abs(e).toFixed(t)}`,l=e=>e<0?`−${(-e).toFixed(1)}`:e.toFixed(1);function F(e){const t=Object.fromEntries(Object.entries(e).filter(([r])=>r!=="reference"&&r!=="rate"&&r!=="other")),o=e.other;return{...o,...t,offset:e.offset,pictureOffset:e.offset===null||o.soundStart===null?null:Math.round((e.offset+o.soundStart)*1e6)/1e6}}function S(e,t){const o=t(e.reference.file),r=t(e.other.file),f=`  Sound: ${o} ${l(e.level.reference.rms)} dBFS RMS, ${e.reference.duration.toFixed(2)} s; ${r} ${l(e.level.other.rms)} dBFS RMS, ${e.other.duration.toFixed(2)} s${e.other.soundStart?`; its sound starts ${String(e.other.soundStart)} s into its own clock`:""}.`;if(e.offset===null)return[`${r} against ${o}: not measured: ${e.why??"no offset found"}.`,f];const n=[`${r} against ${o}: offset ${d(e.offset,6)} s: a moment at t s of ${o} is at t ${e.offset<0?"−":"+"} ${Math.abs(e.offset).toFixed(6)} s of ${r}.`];return e.peak&&n.push(`  Peak ${e.peak.confidence.toFixed(1)} × the correlation's RMS; ${e.second?`the next peak more than ${String(u)} s away ${e.second.ratio.toFixed(2)} × lower, at ${d(e.second.offset,3)} s`:"no other peak"}; polarity ${e.peak.inverted?"inverted":"the same"}; ${String(e.common??0)} s of common sound.`),e.windows.length&&n.push(`  Windows (${String(e.windows[0]?.dur??0)} s each): where, offset, peak, width, correlation:`,...e.windows.map(a=>a.offset===null?`    at ${a.at.toFixed(2).padStart(8)} s  not measured: no sound on a side`:`    at ${a.at.toFixed(2).padStart(8)} s  ${d(a.offset,6)} s  ${(a.confidence??0).toFixed(1)} ×  ${((a.width??0)*1e3).toFixed(3)} ms  ${(a.correlation??0).toFixed(3)}`)),n.push(e.drift?`  Drift ${d(e.drift.ppm,2)} ppm over ${String(e.drift.span)} s: offset(t) = ${e.drift.at0.toFixed(6)} ${e.drift.slope<0?"−":"+"} ${Math.abs(e.drift.slope).toExponential(4)} × t; speed ${(1+e.drift.slope).toFixed(8)} keeps step.`:`  Drift not measured: ${e.driftWhy??"no line"}.`,f),n}const y={max:s.number().positive().optional().describe("The largest offset looked for either way, seconds (default any that leaves common sound)")};export const align=g({name:"align",summary:"The offset between recordings of the same moment, from their sound, with how sharply they match and how it drifts",input:s.strictObject({reference:s.string().describe("The recording the others are measured against"),others:s.array(s.string()).min(1).describe("The recordings to measure: other = reference + offset"),dir:s.string().optional().describe("The project whose media index keeps the result (default the nearest above the reference)"),params:p(y)}),positional:["reference","others"],output:s.looseObject({reference:s.unknown(),files:s.array(s.looseObject({offset:s.number().nullable()}))}),examples:["allyhub align assets/media/mic.wav assets/media/cam.mp4","allyhub align mic.wav cam.mp4 --param max=10"]},async(e,t)=>{const o=await c(t.cwd,e.reference),r=await Promise.all(e.others.map(i=>c(t.cwd,i))),f=await x(e.reference,t.cwd,e.dir);f.warning!==void 0&&t.progress(f.warning);const n=[];for(const i of r)n.push(await w(()=>$(o,i,{root:f.root,...e.params.max===void 0?{}:{max:e.params.max},onProgress:b(t),signal:t.signal})));const a=i=>{const m=h(t.cwd,i);return m===""||m.startsWith("..")?i:m};return{value:{project:f.root,reference:n[0]?.reference??{file:o},rate:n[0]?.rate??null,files:n.map(F)},text:n.flatMap(i=>S(i,a)).join(`
+`)}});