@allyhub/sdk 0.1.0-alpha.8 → 0.2.0-next.1

package/node_modules/@allyhub-next/scenery/dist/screen-focus.d.ts

@@ -0,0 +1,55 @@
+import { type ResolvedCamera } from "./camera.js";
+import { type Px } from "./screen.js";
+import type { Vec3 } from "./vec.js";
+/** What screenFocus needs to know about a screen and its camera. */
+export interface ScreenFocusOptions {
+    /** The camera, resolved, with its aperture and focus (dof). */
+    camera: ResolvedCamera;
+    /** The content's corners in the scenery: top left, top right, bottom right, bottom left. */
+    corners: readonly [Vec3, Vec3, Vec3, Vec3];
+    /** The same corners on the frame, px. */
+    quad: readonly [Px, Px, Px, Px];
+    /** The content's size, px. */
+    size: readonly [number, number];
+    /** The frame's height, px (what blurDiameter counts in). */
+    frameHeight: number;
+    /** The most Gaussian levels mixed; 1 blurs the whole screen by its mean. */
+    levels: number;
+    /** The widest circle of confusion drawn, frame px (the scenery's own pass stops there too). */
+    most?: number;
+    /** How many places along the gradient the weights are given at. */
+    samples?: number;
+}
+/** A screen's blur as the filter draws it. */
+export interface ScreenFocus {
+    /** Each level's Gaussian, standard deviation in content px (0: sharp). */
+    sigmas: number[];
+    /**
+     * Where the depth gradient runs, content px: 0 at `from`, 1 at `to`,
+     * each point by its projection on the line between them.
+     */
+    from: Px;
+    to: Px;
+    /** Each level's weight at `samples` evenly spaced places from 0 to 1; they sum to 1 at each. */
+    weights: number[][];
+    /** The circle of confusion across the screen, frame px: the least and the most. */
+    diameter: {
+        least: number;
+        most: number;
+    };
+}
+/** screenFocus's defaults. */
+export declare const SCREEN_FOCUS_DEFAULTS: {
+    /** Gaussian levels a screen's content is mixed from. */
+    levels: number;
+    /** Places along the gradient the weights are given at. */
+    samples: number;
+    /** Below this standard deviation (content px) a screen is left sharp. */
+    sharp: number;
+};
+/**
+ * How a camera with an aperture blurs a screen, or undefined when it does
+ * not (no aperture, or sharp all over).
+ */
+export declare function screenFocus(o: ScreenFocusOptions): ScreenFocus | undefined;
+//# sourceMappingURL=screen-focus.d.ts.map

package/node_modules/@allyhub-next/scenery/dist/screen-focus.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{blurDiameter as tt}from"./camera.js";import{apply as g,homography as st}from"./screen.js";export const SCREEN_FOCUS_DEFAULTS={levels:8,samples:65,sharp:.05};const nt=(n,e)=>n[0]*e[0]+n[1]*e[1]+n[2]*e[2];export function screenFocus(n){const{camera:e}=n;if(!e.dof)return;const[c,r]=n.size,m=st(c,r,n.quad);if(!m||c<=0||r<=0)return;const M=t=>nt([t[0]-e.position[0],t[1]-e.position[1],t[2]-e.position[2]],e.forward),[T,j,,k]=n.corners,x=M(T),h=(M(j)-x)/c,p=(M(k)-x)/r,E=(t,s)=>x+h*t+p*s,B=n.most??1/0,F=(t,s)=>Math.min(tt(e,E(t,s),n.frameHeight),B),G=(t,s)=>{const[f,u]=g(m,t-.5,s),[Q,V]=g(m,t+.5,s),[W,X]=g(m,t,s-.5),[Y,Z]=g(m,t,s+.5),$=((Q-f)*(Z-X)-(V-u)*(Y-W))/(4*.5*.5);return Math.sqrt(Math.abs($))},J=(t,s)=>F(t,s)/4/Math.max(G(t,s),1e-6),O=[[0,0],[c,0],[c,r],[0,r]],y=O.map(([t,s])=>E(t,s)),A=Math.min(...y),S=Math.max(...y),d=O[y.indexOf(A)]??[0,0],U=h*h+p*p,q=Math.max(2,Math.round(n.samples??SCREEN_FOCUS_DEFAULTS.samples)),b=U>1e-18?(S-A)/U:0,o=[d[0],d[1]],l=[d[0]+h*b,d[1]+p*b],C=Array.from({length:q},(t,s)=>{const i=s/(q-1),f=o[0]+(l[0]-o[0])*i,u=o[1]+(l[1]-o[1])*i;return{sigma:J(f,u),diameter:F(f,u)}}),D=e.dof.focus,K=D>A&&D<S,I=C.map(t=>t.diameter),z={least:K?0:Math.min(...I),most:Math.max(...I)},a=C.map(t=>t.sigma),H=Math.min(...a),v=Math.max(...a);if(v<SCREEN_FOCUS_DEFAULTS.sharp)return;const w=Math.max(1,Math.round(n.levels));if(w===1||v-H<.25||b===0)return{sigmas:[a.reduce((s,i)=>s+i,0)/a.length],from:o,to:l,weights:[a.map(()=>1)],diameter:z};const _=t=>Math.log1p(t),L=_(H),N=(_(v)-L)/(w-1),R=Array.from({length:w},(t,s)=>L+N*s),P=R.map(t=>a.map(s=>Math.max(0,1-Math.abs(_(s)-t)/N)));return{sigmas:R.map(t=>Math.max(0,Math.expm1(t))),from:o,to:l,weights:P,diameter:z}}

package/node_modules/@allyhub-next/scenery/dist/screen.d.ts

@@ -0,0 +1,71 @@
+/** A point on the frame, px from the top left. */
+export type Px = readonly [number, number];
+/**
+ * The 3 × 3 homography (row-major, h22 = 1) that maps the rectangle's
+ * corners (0, 0), (w, 0), (w, h), (0, h) to q[0], q[1], q[2], q[3].
+ * Undefined when the quad is degenerate (three corners in a line).
+ */
+export declare function homography(w: number, h: number, q: readonly [Px, Px, Px, Px]): number[] | undefined;
+/** Where the homography sends a point. */
+export declare function apply(m: readonly number[], x: number, y: number): Px;
+/** The homography as a CSS transform, for an element w × h with transform-origin 0 0. */
+export declare function matrix3d(m: readonly number[]): string;
+/** What a screen measures on a frame: its share of it, how much its content is enlarged, how far it is turned. */
+export interface ScreenOnFrame {
+    /** Its corners on the frame, px: top left, top right, bottom right, bottom left of its content. */
+    corners: readonly [Px, Px, Px, Px];
+    /** The share of the frame it covers: the quad clipped to the frame (what shows), 0–1. */
+    share: number;
+    /** Frame pixels per content pixel, the least and the most across the screen (below 1: shrunk). */
+    scale: {
+        least: number;
+        most: number;
+    };
+    /**
+     * Degrees between the screen's face and the line to the camera, at the
+     * centre of what the frame shows of it (0: square on there).
+     */
+    angle: number;
+}
+/** A polygon clipped to the rectangle [0, w] × [0, h] (Sutherland–Hodgman). */
+export declare function clipToFrame(poly: readonly Px[], w: number, h: number): Px[];
+/**
+ * Where on a screen's face the centre of what a frame shows of it is, as
+ * shares of its width and height from its top left (0.5, 0.5: its own
+ * centre, as it is whenever the whole face is on the frame). Undefined
+ * when none of it is on the frame.
+ */
+export declare function shownCentre(corners: readonly [Px, Px, Px, Px], frame: readonly [number, number]): [number, number] | undefined;
+/**
+ * How a w × h screen sits on a frame of fw × fh px, from its corners and
+ * the angle of its face to the view.
+ */
+export declare function screenOnFrame(w: number, h: number, corners: readonly [Px, Px, Px, Px], frame: readonly [number, number], angle: number): ScreenOnFrame;
+/**
+ * The steady light a scenery already has from a screen drawn in it
+ * (screen({ inScenery: { light: { base } } })): a bake's, an area light's on
+ * its face, a probe's pane of it. Its radiance is `color` (a hex colour,
+ * sRGB as a light's colour is, or linear RGB) times `brightness`
+ * (scene-linear, the units of inScenery's own brightness; default that
+ * brightness, so `{}` is the screen's white).
+ */
+export interface ScreenLightBase {
+    brightness?: number;
+    color?: string | readonly [number, number, number];
+}
+/**
+ * A screen drawn in the scenery lights what is near it: its picture cut into
+ * this many cells across and down, each a uniformly bright polygon, for its
+ * diffuse light (screen({ inScenery: { light: { cells } } })), reflected by
+ * the materials it lights (`specular`; false: its diffuse light alone),
+ * and all of it added (`base`: null), or only what it differs by from the
+ * steady light the scenery already has from it (`base`, ScreenLightBase).
+ */
+export declare const SCREEN_LIGHT_DEFAULTS: {
+    cells: readonly [number, number];
+    specular: boolean;
+    base: ScreenLightBase | null;
+};
+/** What is wrong with a screen light's base, or undefined. */
+export declare function screenLightBaseProblem(base: unknown): string | undefined;
+//# sourceMappingURL=screen.d.ts.map

package/node_modules/@allyhub-next/scenery/dist/screen.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+export function homography(n,o,e){const[[i,s],[t,r],[c,f],[u,h]]=e,d=t-c,l=u-c,a=r-f,p=h-f,g=i-t+c-u,y=s-r+f-h,M=d*p-l*a;if(Math.abs(M)<1e-12)return;const b=(g*p-l*y)/M,m=(d*y-g*a)/M,N=t-i+b*t,O=u-i+m*u,S=i,$=r-s+b*r,A=h-s+m*h,j=s;return[N/n,O/o,S,$/n,A/o,j,b/n,m/o,1]}export function apply(n,o,e){const i=(n[6]??0)*o+(n[7]??0)*e+(n[8]??1);return[((n[0]??0)*o+(n[1]??0)*e+(n[2]??0))/i,((n[3]??0)*o+(n[4]??0)*e+(n[5]??0))/i]}export function matrix3d(n){const[o,e,i,s,t,r,c,f,u]=n.map(h=>Object.is(h,-0)?0:h);return`matrix3d(${[o,s,0,c,e,t,0,f,0,0,1,0,i,r,0,u].map(h=>String(h??0)).join(",")})`}const E=n=>{let o=0;return n.forEach((e,i)=>{const s=n[(i+1)%n.length]??e;o+=e[0]*s[1]-s[0]*e[1]}),Math.abs(o)/2};export function clipToFrame(n,o,e){const i=[[t=>t[0]>=0,(t,r)=>x(t,r,(t[0]-0)/(t[0]-r[0]))],[t=>t[0]<=o,(t,r)=>x(t,r,(t[0]-o)/(t[0]-r[0]))],[t=>t[1]>=0,(t,r)=>x(t,r,(t[1]-0)/(t[1]-r[1]))],[t=>t[1]<=e,(t,r)=>x(t,r,(t[1]-e)/(t[1]-r[1]))]];let s=[...n];for(const[t,r]of i){const c=s;if(s=[],c.forEach((f,u)=>{const h=c[(u+c.length-1)%c.length]??f;t(f)?(t(h)||s.push(r(h,f)),s.push(f)):t(h)&&s.push(r(h,f))}),s.length===0)break}return s}function v(n){const[o=0,e=0,i=0,s=0,t=0,r=0,c=0,f=0,u=0]=n,h=t*u-r*f,d=-(s*u-r*c),l=s*f-t*c,a=o*h+e*d+i*l;if(!(Math.abs(a)<1e-12))return[h/a,-(e*u-i*f)/a,(e*r-i*t)/a,d/a,(o*u-i*c)/a,-(o*r-i*s)/a,l/a,-(o*f-e*c)/a,(o*t-e*s)/a]}export function shownCentre(n,o){const e=clipToFrame(n,o[0],o[1]),i=E(n),s=E(e);if(!(s>0))return;if(s>=i*(1-1e-6))return[.5,.5];let t=0,r=0,c=0;e.forEach((a,p)=>{const g=e[(p+1)%e.length]??a,y=a[0]*g[1]-g[0]*a[1];c+=y,t+=(a[0]+g[0])*y,r+=(a[1]+g[1])*y});const f=homography(1,1,n),u=f?v(f):void 0;if(!u||c===0)return[.5,.5];const[h,d]=apply(u,t/(3*c),r/(3*c)),l=a=>Math.min(Math.max(a,0),1);return[l(h),l(d)]}const x=(n,o,e)=>[n[0]+(o[0]-n[0])*e,n[1]+(o[1]-n[1])*e];export function screenOnFrame(n,o,e,i,s){const[t,r,c,f]=e,u=(l,a)=>Math.hypot(a[0]-l[0],a[1]-l[1]),h=[Math.sqrt(u(t,r)/n*(u(t,f)/o)),Math.sqrt(u(r,t)/n*(u(r,c)/o)),Math.sqrt(u(c,f)/n*(u(c,r)/o)),Math.sqrt(u(f,c)/n*(u(f,t)/o))],d=l=>Math.round(l*1e4)/1e4;return{corners:e,share:d(E(clipToFrame(e,i[0],i[1]))/(i[0]*i[1])),scale:{least:d(Math.min(...h)),most:d(Math.max(...h))},angle:Math.round(s*100)/100}}export const SCREEN_LIGHT_DEFAULTS={cells:[8,5],specular:!0,base:null};const F=/^#(?:[0-9a-f]{3}|[0-9a-f]{6})$/i;export function screenLightBaseProblem(n){if(typeof n!="object"||n===null||Array.isArray(n))return`${JSON.stringify(n)} is not { brightness?, color? }`;const{brightness:o,color:e,...i}=n,s=Object.keys(i);if(s.length>0)return`it takes brightness and color, not ${s.join(", ")}`;if(o!==void 0&&!(typeof o=="number"&&Number.isFinite(o)&&o>=0))return`its brightness ${JSON.stringify(o)} is not a number of 0 or more`;if(e!==void 0){if(typeof e=="string")return F.test(e)?void 0:`its color ${JSON.stringify(e)} is not a hex colour ("#808080")`;if(!(Array.isArray(e)&&e.length===3&&e.every(t=>typeof t=="number"&&Number.isFinite(t)&&t>=0)))return`its color ${JSON.stringify(e)} is not a hex colour ("#808080") or three linear numbers of 0 or more`}}

package/node_modules/@allyhub-next/scenery/dist/solve.d.ts

@@ -0,0 +1,82 @@
+import { type CameraState } from "./camera.js";
+import type { LensFrame } from "./lens.js";
+import { type Vec3 } from "./vec.js";
+/** A point of the scenery and the pixel it lands on, from the picture's top left. */
+export interface SolvePoint {
+    scenery: Vec3;
+    px: readonly [number, number];
+    /** What it is, for the residuals: "laptop top left". */
+    name?: string;
+    /** Default 1. */
+    weight?: number;
+}
+/** A line of the scenery, through two of its points, that passes through a pixel. */
+export interface SolveLine {
+    scenery: readonly [Vec3, Vec3];
+    px: readonly [number, number];
+    name?: string;
+    weight?: number;
+}
+export declare const SOLVE_PARAMS: readonly ["x", "y", "z", "yaw", "pitch", "roll", "lens"];
+export type SolveParam = (typeof SOLVE_PARAMS)[number];
+export declare const SOLVE_DEFAULTS: {
+    /** The 35 mm-equivalent lens when it is fixed and nothing else gives one: a phone's main camera. */
+    lens: number;
+    lensFrame: "phone";
+    /** What is solved for: everything but the lens. */
+    free: readonly SolveParam[];
+    /** Iterations of each start. */
+    iterations: number;
+    /** An eigenvalue of the scaled normal matrix under this share of the largest: a direction the correspondences do not fix. */
+    degenerate: number;
+};
+export interface SolveOptions {
+    /** The picture's size, px. */
+    frame: readonly [number, number];
+    points?: readonly SolvePoint[];
+    lines?: readonly SolveLine[];
+    /** The lens, 35 mm-equivalent (its start when free); default SOLVE_DEFAULTS.lens. */
+    lens?: number;
+    /** What the lens is measured on; default "phone". */
+    lensFrame?: LensFrame;
+    /** The parameters solved for; the others keep their start. Default all but the lens. */
+    free?: readonly SolveParam[];
+    /** A camera to start from (its lens too, unless `lens` is given); without it, a grid of starts round the points. */
+    from?: CameraState;
+    iterations?: number;
+}
+export interface SolveResidual {
+    kind: "point" | "line";
+    name?: string;
+    /** The pixel measured. */
+    px: readonly [number, number];
+    /** A point: where the camera puts it; a line: the nearest point of the line on the picture. */
+    drawn: readonly [number, number];
+    /** How far apart, px. */
+    distance: number;
+}
+export interface SolveResult {
+    /** The camera, ready to write: position, yaw, pitch, roll, lens and its frame. Absent when nothing could be solved. */
+    camera?: CameraState;
+    residuals: SolveResidual[];
+    /** Root mean square of the residuals' distances, px. */
+    rms?: number;
+    /** What the correspondences do not fix, a sentence each: the camera holds there only by its start. */
+    undetermined: string[];
+    /**
+     * How far each free parameter moves for 1 px of error in each measured
+     * value, one standard deviation (from the Jacobian at the solution):
+     * metres for x, y and z, degrees for the angles, mm for the lens. A
+     * parameter the correspondences barely fix moves far: a lens of 5 m
+     * that fits as well as one of 26 mm. Absent where nothing is fixed.
+     */
+    spread?: Partial<Record<SolveParam, number>>;
+    /** Why there is no camera at all. */
+    missing?: string;
+    /** The starts tried, and the iterations of the best. */
+    starts: number;
+    iterations: number;
+}
+/** The camera that puts the points and lines where they were measured. */
+export declare function solveCamera(o: SolveOptions): SolveResult;
+//# sourceMappingURL=solve.d.ts.map

package/node_modules/@allyhub-next/scenery/dist/solve.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+import{project as K,resolveCamera as V,yawPitchOf as D}from"./camera.js";import{cross as L,DEG as j,dot as Y,length as Q,normalize as W,sub as C}from"./vec.js";export const SOLVE_PARAMS=["x","y","z","yaw","pitch","roll","lens"],SOLVE_DEFAULTS={lens:26,lensFrame:"phone",free:["x","y","z","yaw","pitch","roll"],iterations:200,degenerate:1e-9};const O=1e4;function R(r,i){return{position:[r[0]??0,r[1]??0,r[2]??0],yaw:r[3]??0,pitch:r[4]??0,roll:r[5]??0,lens:Math.exp(r[6]??Math.log(SOLVE_DEFAULTS.lens)),lensFrame:i}}function T(r,i,a){const o=K(r,a);if(o.depth>r.near)return[(o.x+1)/2*i[0],(1-o.y)/2*i[1]]}function X(r){const i=o=>O*Math.sqrt(o??1),a=(o,l)=>({kind:o,...l.name===void 0?{}:{name:l.name},px:l.px,drawn:[Number.NaN,Number.NaN],distance:Number.POSITIVE_INFINITY});return{residuals:[...r.points.flatMap(o=>[i(o.weight),i(o.weight)]),...r.lines.map(o=>i(o.weight))],list:[...r.points.map(o=>a("point",o)),...r.lines.map(o=>a("line",o))]}}function B(r,i){const a=R(r,i.lensFrame);if(Math.abs(a.pitch??0)>=89.9||!((a.lens??0)>.5))return X(i);const o=V(a,i.frame[0]/i.frame[1]),l=[],e=[];for(const t of i.points){const s=Math.sqrt(t.weight??1),n=T(o,i.frame,t.scenery);if(!n){l.push(O*s,O*s),e.push({kind:"point",...t.name===void 0?{}:{name:t.name},px:t.px,drawn:[Number.NaN,Number.NaN],distance:Number.POSITIVE_INFINITY});continue}l.push((n[0]-t.px[0])*s,(n[1]-t.px[1])*s),e.push({kind:"point",...t.name===void 0?{}:{name:t.name},px:t.px,drawn:n,distance:Math.hypot(n[0]-t.px[0],n[1]-t.px[1])})}for(const t of i.lines){const s=Math.sqrt(t.weight??1),n=T(o,i.frame,t.scenery[0]),c=T(o,i.frame,t.scenery[1]),u=n&&c?Math.hypot(c[0]-n[0],c[1]-n[1]):0;if(!n||!c||u<1e-9){l.push(O*s),e.push({kind:"line",...t.name===void 0?{}:{name:t.name},px:t.px,drawn:[Number.NaN,Number.NaN],distance:Number.POSITIVE_INFINITY});continue}const d=(c[0]-n[0])/u,f=(c[1]-n[1])/u,g=t.px[0]-n[0],M=t.px[1]-n[1],m=g*f-M*d,p=g*d+M*f;l.push(m*s),e.push({kind:"line",...t.name===void 0?{}:{name:t.name},px:t.px,drawn:[n[0]+d*p,n[1]+f*p],distance:Math.abs(m)})}return{residuals:l,list:e}}const G=r=>r.reduce((i,a)=>i+a*a,0),Z=[1e-5,1e-5,1e-5,1e-4,1e-4,1e-4,1e-5];function H(r,i,a){const o=i.map(e=>{const t=Z[e]??1e-5,s=[...r],n=[...r];s[e]=(s[e]??0)+t,n[e]=(n[e]??0)-t;const c=a(s),u=a(n);return c.map((d,f)=>(d-(u[f]??0))/(2*t))}),l=o[0]?.length??0;return Array.from({length:l},(e,t)=>o.map(s=>s[t]??0))}function U(r,i){const a=i.length,o=r.map((e,t)=>[...e,i[t]??0]);for(let e=0;e<a;e++){let t=e;for(let c=e+1;c<a;c++)Math.abs(o[c]?.[e]??0)>Math.abs(o[t]?.[e]??0)&&(t=c);const s=o[t],n=o[e];if(!s||!n||Math.abs(s[e]??0)<1e-300)return;o[t]=n,o[e]=s;for(let c=e+1;c<a;c++){const u=o[c];if(!u)continue;const d=(u[e]??0)/(s[e]??1);for(let f=e;f<=a;f++)u[f]=(u[f]??0)-d*(s[f]??0)}}const l=new Array(a).fill(0);for(let e=a-1;e>=0;e--){const t=o[e];if(!t)return;let s=t[a]??0;for(let n=e+1;n<a;n++)s-=(t[n]??0)*(l[n]??0);l[e]=s/(t[e]??1)}return l}function P(r,i){const a=r[0]?.length??0,o=Array.from({length:a},()=>new Array(a).fill(0)),l=new Array(a).fill(0);return r.forEach((e,t)=>{for(let s=0;s<a;s++){l[s]=(l[s]??0)+(e[s]??0)*(i[t]??0);const n=o[s];if(n)for(let c=0;c<a;c++)n[c]=(n[c]??0)+(e[s]??0)*(e[c]??0)}}),{a:o,g:l}}function tt(r,i,a,o){let l=[...r],e=a(l),t=G(e),s=.001,n=0;for(;n<o;n++){const c=H(l,i,a),{a:u,g:d}=P(c,e);let f=!1;for(let g=0;g<12;g++){const M=u.map((x,b)=>x.map((S,h)=>b===h?S+s*Math.max(S,1e-12):S)),m=U(M,d.map(x=>-x));if(!m){s*=10;continue}const p=[...l];i.forEach((x,b)=>{p[x]=(p[x]??0)+(m[b]??0)});const y=a(p),I=G(y);if(I<t){const x=t-I;if(l=p,e=y,t=I,s=Math.max(s/3,1e-12),f=!0,x<1e-12*Math.max(1,t))return{p:l,cost:t,iterations:n+1};break}s*=4}if(!f)break}return{p:l,cost:t,iterations:n}}function nt(r){const i=r.length,a=r.map(t=>[...t]),o=Array.from({length:i},(t,s)=>Array.from({length:i},(n,c)=>s===c?1:0)),l=(t,s,n)=>t[s]?.[n]??0,e=(t,s,n,c)=>{const u=t[s];u&&(u[n]=c)};for(let t=0;t<100;t++){let s=0;for(let n=0;n<i;n++)for(let c=n+1;c<i;c++)s+=l(a,n,c)**2;if(s<1e-30)break;for(let n=0;n<i;n++)for(let c=n+1;c<i;c++){const u=l(a,n,c);if(Math.abs(u)<1e-300)continue;const d=(l(a,c,c)-l(a,n,n))/(2*u),f=Math.sign(d||1)/(Math.abs(d)+Math.sqrt(d*d+1)),g=1/Math.sqrt(f*f+1),M=f*g;for(let m=0;m<i;m++){const p=l(a,m,n),y=l(a,m,c);e(a,m,n,g*p-M*y),e(a,m,c,M*p+g*y)}for(let m=0;m<i;m++){const p=l(a,n,m),y=l(a,c,m);e(a,n,m,g*p-M*y),e(a,c,m,M*p+g*y)}for(let m=0;m<i;m++){const p=l(o,m,n),y=l(o,m,c);e(o,m,n,g*p-M*y),e(o,m,c,M*p+g*y)}}}return{values:Array.from({length:i},(t,s)=>l(a,s,s)),vectors:Array.from({length:i},(t,s)=>Array.from({length:i},(n,c)=>l(o,c,s)))}}function et(r,i,a){const o=V(r,i),{yaw:l,pitch:e}=D(o.forward),t=W(L(o.forward,[0,1,0])),s=L(t,o.forward),n=Math.atan2(-Y(o.up,t),Y(o.up,s))/j;return[...r.position,l,e,n,Math.log(a)]}function st(r,i){const a=Math.max(r.length,1),o=[r.reduce((t,s)=>t+s[0],0)/a,r.reduce((t,s)=>t+s[1],0)/a,r.reduce((t,s)=>t+s[2],0)/a],l=Math.max(.05,...r.map(t=>Q(C(t,o)))),e=[];for(const t of[1.5,3,6])for(const s of[-35,0,35,70])for(let n=0;n<360;n+=30){const c=s*j,u=n*j,d=l*t,f=[o[0]+d*Math.cos(c)*Math.sin(u),o[1]+d*Math.sin(c),o[2]+d*Math.cos(c)*Math.cos(u)],{yaw:g,pitch:M}=D(C(o,f));e.push([...f,g,M,0,Math.log(i)])}return e}const $=r=>Math.round(r*1e4)/1e4,N=r=>Math.round(r*100)/100;export function solveCamera(r){const i=r.points??[],a=r.lines??[],o=r.lensFrame??SOLVE_DEFAULTS.lensFrame,l=r.free??SOLVE_DEFAULTS.free,e=SOLVE_PARAMS.flatMap((h,w)=>l.includes(h)?[w]:[]),t=r.iterations??SOLVE_DEFAULTS.iterations,s=i.length*2+a.length;if(e.length===0)return{residuals:[],undetermined:[],missing:"Nothing is free to solve for.",starts:0,iterations:0};if(s<e.length)return{residuals:[],undetermined:[],missing:`${String(s)} measured value${s===1?"":"s"} (a point gives 2, a line 1) for ${String(e.length)} free parameters (${e.map(h=>SOLVE_PARAMS[h]).join(", ")}): give more points or lines, or fix some (the lens is fixed unless freed).`,starts:0,iterations:0};const n=r.frame[0]/r.frame[1],c=r.lens??r.from?.lens??SOLVE_DEFAULTS.lens,u=h=>B(h,{frame:r.frame,points:i,lines:a,lensFrame:o}).residuals,d=r.from?[et(r.from,n,c)]:st([...i.map(h=>h.scenery),...a.flatMap(h=>[...h.scenery])],c);let f;for(const h of d){const w=tt(h,e,u,t);(!f||w.cost<f.cost-1e-9)&&(f=w)}if(!f)return{residuals:[],undetermined:[],missing:"No start could be drawn.",starts:d.length,iterations:0};const g=B(f.p,{frame:r.frame,points:i,lines:a,lensFrame:o}),M=H(f.p,e,u),m=e.map((h,w)=>Math.sqrt(M.reduce((k,v)=>k+(v[w]??0)**2,0))),p=[];if(m.forEach((h,w)=>{h<1e-9&&p.push(`${SOLVE_PARAMS[e[w]??0]??""} changes nothing measured`)}),p.length===0){const h=M.map(_=>_.map((F,q)=>F/(m[q]??1))),{a:w}=P(h,new Array(h.length).fill(0)),k=nt(w),v=Math.max(...k.values.map(Math.abs));k.values.forEach((_,F)=>{if(Math.abs(_)>v*SOLVE_DEFAULTS.degenerate)return;const q=(k.vectors[F]??[]).map((A,E)=>[Math.abs(A),SOLVE_PARAMS[e[E]??0]??""]).filter(([A])=>A>.3).map(([,A])=>A);p.push(`${q.join(" with ")} ${q.length>1?"trade against each other":"is not fixed"}: the correspondences change too little along it`)})}let y;if(p.length===0){const{a:h}=P(M,new Array(M.length).fill(0)),w=e.length,k={};for(let v=0;v<w;v++){const _=Array.from({length:w},(z,J)=>J===v?1:0),q=U(h.map(z=>[...z]),_)?.[v];if(q===void 0||!(q>=0))continue;const A=Math.sqrt(q),E=SOLVE_PARAMS[e[v]??0];E!==void 0&&(k[E]=E==="lens"?N(Math.exp(f.p[6]??0)*A):E==="x"||E==="y"||E==="z"?$(A):N(A))}Object.keys(k).length>0&&(y=k)}const I=g.list.filter(h=>Number.isFinite(h.distance)),x=g.list.length-I.length;x>0&&p.push(`${String(x)} correspondence${x===1?" is":"s are"} behind the camera it found`);const b=R(f.p,o);return{camera:{position:[$(b.position[0]),$(b.position[1]),$(b.position[2])],yaw:N(b.yaw??0),pitch:N(b.pitch??0),roll:N(b.roll??0),lens:N(b.lens??c),lensFrame:o},residuals:g.list.map(h=>({...h,drawn:[N(h.drawn[0]),N(h.drawn[1])],distance:N(h.distance)})),...I.length===0?{}:{rms:N(Math.sqrt(I.reduce((h,w)=>h+w.distance**2,0)/I.length))},undetermined:p,...y?{spread:y}:{},starts:d.length,iterations:f.iterations}}

package/node_modules/@allyhub-next/scenery/dist/timing.d.ts

@@ -0,0 +1,26 @@
+/**
+ * How a stretch runs: one of the SDK's eases by name, `smooth`, or a
+ * function on 0–1.
+ */
+export type Ease = "linear" | "in" | "out" | "in-out" | "smooth" | ((x: number) => number);
+/**
+ * Eased progress on [0, 1]. `in`, `out` and `in-out` are the SDK's cubic
+ * eases (`in-out` runs at three times its mean speed half way); `smooth`
+ * is smoothstep, still at both ends and at one and a half times its mean
+ * speed half way, a camera's move.
+ */
+export declare function easeValue(ease: Ease | undefined, x: number): number;
+/** A key of a number: its time, its value, and how the stretch arriving at it runs. */
+export interface NumberKey {
+    t: number;
+    v: number;
+    ease?: Ease;
+}
+/**
+ * A number over time through keys in time order (times strictly
+ * increasing). Before the first key it is the first value, after the last
+ * the last. Stretches whose arriving key has an ease run by it; the rest
+ * run by a monotone cubic through each unbroken run of them.
+ */
+export declare function timedNumber(keys: readonly NumberKey[]): (t: number) => number;
+//# sourceMappingURL=timing.d.ts.map

package/node_modules/@allyhub-next/scenery/dist/timing.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+export function easeValue(e,u){const n=Math.min(Math.max(u,0),1);if(typeof e=="function")return e(n);switch(e??"linear"){case"linear":return n;case"in":return n*n*n;case"out":return 1-(1-n)**3;case"in-out":return n<.5?4*n*n*n:1-(-2*n+2)**3/2;case"smooth":return n*n*(3-2*n)}}const m=e=>e>0?1:e<0?-1:0;function x(e,u){const n=e.length,l=[],s=[];for(let t=0;t+1<n;t++){const o=(e[t+1]??0)-(e[t]??0);l.push(o),s.push(((u[t+1]??0)-(u[t]??0))/o)}if(n===2)return[s[0]??0,s[0]??0];const a=new Array(n).fill(0);for(let t=1;t+1<n;t++){const[o,i,f,c]=[s[t-1]??0,s[t]??0,l[t-1]??0,l[t]??0];if(m(o)*m(i)<=0)continue;const h=2*c+f,p=c+2*f;a[t]=(h+p)/(h/o+p/i)}const r=(t,o,i,f)=>{let c=((2*t+o)*i-t*f)/(t+o);return m(c)!==m(i)?c=0:m(i)!==m(f)&&Math.abs(c)>3*Math.abs(i)&&(c=3*i),c};return a[0]=r(l[0]??0,l[1]??0,s[0]??0,s[1]??0),a[n-1]=r(l[n-2]??0,l[n-3]??0,s[n-2]??0,s[n-3]??0),a}export function timedNumber(e){const u=e[0];if(!u)throw new Error("A value over time needs at least one key.");for(let r=1;r<e.length;r++){const[t,o]=[e[r-1],e[r]];if(!t||!o||!(o.t>t.t))throw new Error(`Keys must be in time order with different times: ${String(t?.t)} s is followed by ${String(o?.t)} s.`)}const n=[],l=[];let s=0;for(;s+1<e.length;){if(e[s+1]?.ease!==void 0){n.push(-1),s++;continue}let r=s;for(;r+1<e.length&&e[r+1]?.ease===void 0;)r++;const t=e.slice(s,r+1);l.push({from:s,slopes:x(t.map(o=>o.t),t.map(o=>o.v))});for(let o=s;o<r;o++)n.push(l.length-1);s=r}const a=e.at(-1)??u;return r=>{if(!(r>u.t))return u.v;if(r>=a.t)return a.v;let t=0,o=e.length-2;for(;t<o;){const d=t+o+1>>1;(e[d]?.t??0)<=r?t=d:o=d-1}const i=e[t]??u,f=e[t+1]??a,c=f.t-i.t,h=(r-i.t)/c,p=n[t]??-1,w=l[p];if(p<0||!w)return i.v+(f.v-i.v)*easeValue(f.ease,h);const g=(w.slopes[t-w.from]??0)*c,M=(w.slopes[t+1-w.from]??0)*c,v=h*h,b=v*h;return(2*b-3*v+1)*i.v+(b-2*v+h)*g+(-2*b+3*v)*f.v+(b-v)*M}}

package/node_modules/@allyhub-next/scenery/dist/vec.d.ts

@@ -0,0 +1,19 @@
+/** A point or a direction in world space: metres, Y up. */
+export type Vec3 = readonly [number, number, number];
+export declare const add: (a: Vec3, b: Vec3) => Vec3;
+export declare const sub: (a: Vec3, b: Vec3) => Vec3;
+export declare const scale: (a: Vec3, k: number) => Vec3;
+/** a + b·k. */
+export declare const addScaled: (a: Vec3, b: Vec3, k: number) => Vec3;
+export declare const dot: (a: Vec3, b: Vec3) => number;
+export declare const cross: (a: Vec3, b: Vec3) => Vec3;
+export declare const length: (a: Vec3) => number;
+export declare const distance: (a: Vec3, b: Vec3) => number;
+/** The unit vector along a; a zero vector stays zero. */
+export declare function normalize(a: Vec3): Vec3;
+export declare const lerp3: (a: Vec3, b: Vec3, x: number) => Vec3;
+export declare const isFinite3: (a: Vec3) => boolean;
+/** v turned about the unit axis k by `angle` radians (Rodrigues). */
+export declare function rotate(v: Vec3, k: Vec3, angle: number): Vec3;
+export declare const DEG: number;
+//# sourceMappingURL=vec.d.ts.map

package/node_modules/@allyhub-next/scenery/dist/vec.js

@@ -0,0 +1,2 @@
+/*! AllyHub. Copyright (c) 2026 AllyHub, Inc. All rights reserved. Use is subject to LICENSE.md. */
+export const add=(t,o)=>[t[0]+o[0],t[1]+o[1],t[2]+o[2]],sub=(t,o)=>[t[0]-o[0],t[1]-o[1],t[2]-o[2]],scale=(t,o)=>[t[0]*o,t[1]*o,t[2]*o],addScaled=(t,o,n)=>[t[0]+o[0]*n,t[1]+o[1]*n,t[2]+o[2]*n],dot=(t,o)=>t[0]*o[0]+t[1]*o[1]+t[2]*o[2],cross=(t,o)=>[t[1]*o[2]-t[2]*o[1],t[2]*o[0]-t[0]*o[2],t[0]*o[1]-t[1]*o[0]],length=t=>Math.hypot(t[0],t[1],t[2]),distance=(t,o)=>length(sub(t,o));export function normalize(t){const o=length(t);return o===0?[0,0,0]:scale(t,1/o)}export const lerp3=(t,o,n)=>[t[0]+(o[0]-t[0])*n,t[1]+(o[1]-t[1])*n,t[2]+(o[2]-t[2])*n],isFinite3=t=>Number.isFinite(t[0])&&Number.isFinite(t[1])&&Number.isFinite(t[2]);export function rotate(t,o,n){const e=Math.cos(n),s=Math.sin(n),c=cross(o,t),r=dot(o,t)*(1-e);return[t[0]*e+c[0]*s+o[0]*r,t[1]*e+c[1]*s+o[1]*r,t[2]*e+c[2]*s+o[2]*r]}export const DEG=Math.PI/180;

package/node_modules/@allyhub-next/scenery/package.json

@@ -0,0 +1,13 @@
+{
+  "name": "@allyhub-next/scenery",
+  "version": "0.2.0-next.1",
+  "type": "module",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "private": true,
+  "license": "SEE LICENSE IN LICENSE.md"
+}

package/node_modules/@allyhub-next/video-core/LICENSE

@@ -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.