@selvajs/compute 4.0.0-beta.0 → 4.0.0-beta.1

package/dist/chunk-BVMGO7IG.cjs

@@ -0,0 +1,2 @@
+"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } } function _optionalChain(ops) { let lastAccessLHS = undefined; let value = ops[0]; let i = 1; while (i < ops.length) { const op = ops[i]; const fn = ops[i + 1]; i += 2; if ((op === 'optionalAccess' || op === 'optionalCall') && value == null) { return undefined; } if (op === 'access' || op === 'optionalAccess') { lastAccessLHS = value; value = fn(value); } else if (op === 'call' || op === 'optionalCall') { value = fn((...args) => value.call(lastAccessLHS, ...args)); lastAccessLHS = undefined; } } return value; }var _chunkLLUNR66Gcjs = require('./chunk-LLUNR66G.cjs');var ie=new Set;function Ve(){if(typeof window>"u"||_optionalChain([globalThis, 'access', _2 => _2.process, 'optionalAccess', _3 => _3.versions, 'optionalAccess', _4 => _4.node])!=null)return!1;let e=globalThis.navigator,r=typeof _optionalChain([e, 'optionalAccess', _5 => _5.userAgent])=="string"?e.userAgent:"";return!/jsdom/i.test(r)}function I(t,e){e||Ve()&&!ie.has(t)&&(ie.add(t),_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Warning: ${t} is running on the client side. For better performance and security, consider running this on the server side.`))}function T(t){return typeof t=="object"&&!(t instanceof Uint8Array)&&typeof t.key=="string"&&typeof t.load=="function"}var Ge="Unable to load grasshopper definition";function We(t){return t instanceof _chunkLLUNR66Gcjs.c?t.code===_chunkLLUNR66Gcjs.b.DEFINITION_NOT_CACHED||t.message.includes(Ge):!1}function je(t,e){if(!e)return;let r=_chunkLLUNR66Gcjs.r.call(void 0, t,"values");if(!Array.isArray(r)||r.length===0)return;let n=[];for(let o of r){let i=_chunkLLUNR66Gcjs.r.call(void 0, o,"innerTree");(!i||Object.keys(i).length===0)&&n.push(_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, o,"paramName"), () => ("<unnamed>")))}if(n.length===0)return;let s=n.length===r.length?"all":`${n.length}/${r.length}`;_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Solve returned empty output(s) (${s}): ${n.join(", ")}. These parameters produced no data \u2014 check the definition's inputs and the branch feeding each.`)}async function k(t,e,r){I("solveGrasshopperDefinition",_nullishCoalesce(r.suppressBrowserWarning, () => (r.suppressClientSideWarning)));let n=await j(e),{response:s}=await P(w(n,t),r);return s}async function ae(t,e,r){I("solveGrasshopperDefinitionWithCacheKey",_nullishCoalesce(r.suppressBrowserWarning, () => (r.suppressClientSideWarning)));let n=await j(e);return P(w(n,t),r)}async function ue(t,e,r,n){I("solveByCacheKey",_nullishCoalesce(n.suppressBrowserWarning, () => (n.suppressClientSideWarning)));let s={algo:null,pointer:e,values:t};try{return{...await P(s,n),missed:!1}}catch(o){if(!We(o))throw o;let i=await j(r);return{...await P(w(i,t),n),missed:!0}}}async function j(t){if(!T(t))return t;try{return await t.load()}catch(e){throw new (0, _chunkLLUNR66Gcjs.c)(`Failed to load definition bytes for ref '${t.key}'`,_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{definitionKey:t.key},originalError:e instanceof Error?e:new Error(String(e))})}}async function P(t,e){Be(t,e);let r=await _chunkLLUNR66Gcjs.m.call(void 0, "grasshopper",t,e),{pointer:n,algo:s,...o}=r,i=o,a=_chunkLLUNR66Gcjs.l.call(void 0, r);if(a!==void 0){let u=typeof s=="string"?s.length:0;_chunkLLUNR66Gcjs.k.call(void 0, i,Math.max(0,a-u))}return je(i,e.debug),{response:i,cacheKey:typeof n=="string"?n:null}}function w(t,e){let r={algo:null,pointer:null,values:e};return t instanceof Uint8Array?r.algo=_chunkLLUNR66Gcjs.g.call(void 0, t):/^https?:\/\//i.test(t)?r.pointer=t:r.algo=_nullishCoalesce(_chunkLLUNR66Gcjs.e.call(void 0, t), () => (_chunkLLUNR66Gcjs.d.call(void 0, t))),r}function Be(t,e){e.cachesolve!=null&&(t.cachesolve=e.cachesolve),e.cacheerroredsolves!=null&&(t.cacheerroredsolves=e.cacheerroredsolves),e.modelunits!=null&&(t.modelunits=e.modelunits),e.angletolerance!=null&&(t.angletolerance=e.angletolerance),e.absolutetolerance!=null&&(t.absolutetolerance=e.absolutetolerance),e.dataversion!=null&&(t.dataversion=e.dataversion)}function le(t){let e=new WeakSet,r=n=>{if(n===void 0)return"undefined";if(n===null)return"null";if(typeof n=="number")return Number.isFinite(n)?String(n):"null";if(typeof n=="string"||typeof n=="boolean")return JSON.stringify(n);if(typeof n=="bigint")return`${n}n`;if(n instanceof Uint8Array)return`{"__u8":${n.length},"hash":"${fe(n)}"}`;if(Array.isArray(n)){if(e.has(n))return'"[Circular]"';e.add(n);let s=[];for(let o=0;o<n.length;o++)s.push(r(n[o]));return e.delete(n),`[${s.join(",")}]`}if(typeof n=="object"){if(e.has(n))return'"[Circular]"';e.add(n);let s;return typeof n.toJSON=="function"?s=r(n.toJSON()):n instanceof Map?s=`{"__map":[${[...n.entries()].map(([i,a])=>`[${r(i)},${r(a)}]`).sort().join(",")}]}`:n instanceof Set?s=`{"__set":[${[...n.values()].map(r).sort().join(",")}]}`:s=`{${Object.keys(n).sort().map(a=>`${JSON.stringify(a)}:${r(n[a])}`).join(",")}}`,e.delete(n),s}return"null"};return r(t)}function pe(t,e){let r=2166136261;for(let n=0;n<t;n++)r^=e(n),r=r+((r<<1)+(r<<4)+(r<<7)+(r<<8)+(r<<24))>>>0;return r.toString(16).padStart(8,"0")}function ce(t){return pe(t.length,e=>t.charCodeAt(e))}function fe(t){return pe(t.length,e=>t[e])}function $e(t,e){return B(N(t),e)}function B(t,e){let r=le(e);return`${t}|t:${r.length}:${ce(r)}`}function N(t){return T(t)?`r:${t.key}`:typeof t=="string"?`s:${t.length}:${ce(t)}`:`u8:${t.length}:${fe(t)}`}var ze=100;function Ue(t){return typeof t!="string"?!0:!/^https?:\/\//i.test(t)}function _e(t){try{return _nullishCoalesce(_optionalChain([JSON, 'access', _6 => _6.stringify, 'call', _7 => _7(t), 'optionalAccess', _8 => _8.length]), () => (0))}catch (e2){return 0}}var E=class{constructor(e,r,n={},s){_chunkLLUNR66Gcjs.a.call(void 0, this,"executor");_chunkLLUNR66Gcjs.a.call(void 0, this,"baseConfig");_chunkLLUNR66Gcjs.a.call(void 0, this,"mode");_chunkLLUNR66Gcjs.a.call(void 0, this,"maxConcurrent");_chunkLLUNR66Gcjs.a.call(void 0, this,"maxQueueDepth");_chunkLLUNR66Gcjs.a.call(void 0, this,"queueWaitMs");_chunkLLUNR66Gcjs.a.call(void 0, this,"timeoutMs");_chunkLLUNR66Gcjs.a.call(void 0, this,"retry");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheEnabled");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheMaxBytes");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheTtl");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheErroredSolves");_chunkLLUNR66Gcjs.a.call(void 0, this,"cache",new Map);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheBytes",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheHits",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheMisses",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheEvictions",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheKeyExecutor");_chunkLLUNR66Gcjs.a.call(void 0, this,"reuseServerDefinitionCache");_chunkLLUNR66Gcjs.a.call(void 0, this,"serverCacheKeys",new Map);_chunkLLUNR66Gcjs.a.call(void 0, this,"onStart");_chunkLLUNR66Gcjs.a.call(void 0, this,"onSettle");_chunkLLUNR66Gcjs.a.call(void 0, this,"onSuperseded");_chunkLLUNR66Gcjs.a.call(void 0, this,"subscribers",new Set);_chunkLLUNR66Gcjs.a.call(void 0, this,"inFlight",new Set);_chunkLLUNR66Gcjs.a.call(void 0, this,"pendingForLatestWins",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"fifoQueue",[]);_chunkLLUNR66Gcjs.a.call(void 0, this,"_lastResult",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"_lastError",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"_lastDurationMs",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"solveSeq",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"lastStateSeq",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"disposed",!1);this.executor=e,this.cacheKeyExecutor=s,this.baseConfig=r,this.mode=_nullishCoalesce(n.mode, () => ("latest-wins")),this.maxConcurrent=Math.max(1,_nullishCoalesce(n.maxConcurrent, () => ((this.mode==="parallel"?4:1)))),this.maxQueueDepth=n.maxQueueDepth!==void 0&&n.maxQueueDepth>0?Math.floor(n.maxQueueDepth):void 0,this.queueWaitMs=n.queueWaitMs!==void 0&&n.queueWaitMs>0?n.queueWaitMs:void 0,this.timeoutMs=n.timeoutMs,this.retry=n.retry;let o=n.cache,i=typeof o=="object"?o:null;this.cacheMaxBytes=Math.max(0,_nullishCoalesce(_optionalChain([i, 'optionalAccess', _9 => _9.maxBytes]), () => (0))),this.cacheEnabled=this.cacheMaxBytes>0,this.cacheTtl=_nullishCoalesce(_optionalChain([i, 'optionalAccess', _10 => _10.ttlMs]), () => (0)),this.cacheErroredSolves=_nullishCoalesce(_optionalChain([i, 'optionalAccess', _11 => _11.cacheErroredSolves]), () => (!0)),this.reuseServerDefinitionCache=!!s&&(_nullishCoalesce(n.reuseServerDefinitionCache, () => (!0))),this.onStart=n.onStart,this.onSettle=n.onSettle,this.onSuperseded=n.onSuperseded}get isSolving(){return this.inFlight.size>0}get hasPending(){return this.pendingForLatestWins!==null||this.fifoQueue.length>0}get inFlightCount(){return this.inFlight.size}get queueDepth(){return this.fifoQueue.length+(this.pendingForLatestWins?1:0)}get lastResult(){return this._lastResult}get lastError(){return this._lastError}get lastDurationMs(){return this._lastDurationMs}subscribe(e){return this.subscribers.add(e),()=>this.subscribers.delete(e)}notify(){for(let e of this.subscribers)try{e()}catch(r){_chunkLLUNR66Gcjs.h.call(void 0, ).error("[SolveScheduler] subscriber threw:",r)}}solve(e,r,n){if(this.disposed)return Promise.reject(new (0, _chunkLLUNR66Gcjs.c)("SolveScheduler has been disposed and cannot be used",_chunkLLUNR66Gcjs.b.INVALID_STATE));let s=N(e),o=B(s,r),i=++this.solveSeq,a={key:o,enqueuedAt:Date.now(),startedAt:null};if(_optionalChain([n, 'optionalAccess', _12 => _12.signal, 'optionalAccess', _13 => _13.aborted]))return Promise.reject(this.makeAbortError(a));if(this.cacheEnabled){let u=this.readCache(o);if(u){this.mode==="latest-wins"&&this.supersedeCurrent();let f={status:"success",response:u,durationMs:0,fromCache:!0};return this.writeLastState(i,{result:u,durationMs:0}),this.runHook(this.onStart,a),this.runHook(this.onSettle,a,f),this.notify(),Promise.resolve(u)}}return new Promise((u,f)=>{let c={definition:e,dataTree:r,definitionHash:s,ctx:a,seq:i,resolve:u,reject:f,externalSignal:_optionalChain([n, 'optionalAccess', _14 => _14.signal])};c.externalSignal&&(c.queuedAbortHandler=()=>this.abortQueuedItem(c),c.externalSignal.addEventListener("abort",c.queuedAbortHandler,{once:!0})),this.enqueue(c)})}writeLastState(e,r){return e<this.lastStateSeq?!1:(this.lastStateSeq=e,"result"in r?(this._lastResult=r.result,this._lastError=null):this._lastError=r.error,this._lastDurationMs=r.durationMs,!0)}supersedeCurrent(){this.pendingForLatestWins&&(this.supersede(this.pendingForLatestWins),this.pendingForLatestWins=null);for(let e of this.inFlight)this.supersede(e),e.controller.abort()}abortQueuedItem(e){this.pendingForLatestWins===e&&(this.pendingForLatestWins=null);let r=this.fifoQueue.indexOf(e);r>=0&&this.fifoQueue.splice(r,1),this.rejectAsAborted(e),this.notify()}shedAsQueueFull(e){let r=new (0, _chunkLLUNR66Gcjs.c)("Solve queue is full; request shed (backpressure)",_chunkLLUNR66Gcjs.b.QUEUE_FULL,{statusCode:503,context:{key:e.ctx.key,queueDepth:this.fifoQueue.length,maxQueueDepth:this.maxQueueDepth}});this.settleError(e,r)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:r,durationMs:0}),this.notify()}armQueueWaitTimer(e){if(this.queueWaitMs===void 0)return;let r=this.queueWaitMs;e.queueWaitTimer=setTimeout(()=>{if(e.settled)return;let n=this.fifoQueue.indexOf(e);n>=0&&this.fifoQueue.splice(n,1);let s=new (0, _chunkLLUNR66Gcjs.c)(`Solve waited longer than ${r}ms in queue; shed (backpressure)`,_chunkLLUNR66Gcjs.b.QUEUE_TIMEOUT,{statusCode:503,context:{key:e.ctx.key,waitedMs:Date.now()-e.ctx.enqueuedAt,queueWaitMs:r}});this.settleError(e,s)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:s,durationMs:0}),this.notify()},r)}clearQueueWaitTimer(e){e.queueWaitTimer!==void 0&&(clearTimeout(e.queueWaitTimer),e.queueWaitTimer=void 0)}enqueue(e){switch(this.mode){case"latest-wins":{this.supersedeCurrent(),this.inFlight.size===0?this.execute(e):this.pendingForLatestWins=e;break}case"queue":case"parallel":{this.inFlight.size<this.maxConcurrent?this.execute(e):this.maxQueueDepth!==void 0&&this.fifoQueue.length>=this.maxQueueDepth?this.shedAsQueueFull(e):(this.armQueueWaitTimer(e),this.fifoQueue.push(e));break}}this.notify()}async execute(e){let r=new AbortController,n=e;n.controller=r,this.inFlight.add(n),e.ctx.startedAt=Date.now(),this.clearQueueWaitTimer(e),this.removeQueuedAbortHandler(e);let s=()=>r.abort();_optionalChain([e, 'access', _15 => _15.externalSignal, 'optionalAccess', _16 => _16.addEventListener, 'call', _17 => _17("abort",s,{once:!0})]),this.runHook(this.onStart,e.ctx),this.notify();let o=performance.now();try{let i={...this.baseConfig,signal:r.signal,...this.timeoutMs!==void 0&&{timeoutMs:this.timeoutMs},...this.retry!==void 0&&{retry:this.retry}},{response:a,definitionReuploaded:u}=await this.runExecutor(e.definition,e.dataTree,e.definitionHash,i),f=performance.now()-o;if(this.cacheEnabled&&this.writeCache(e.ctx.key,a),!this.settleSuccess(e,a))return;this.writeLastState(e.seq,{result:a,durationMs:f}),this.runHook(this.onSettle,e.ctx,{status:"success",response:a,durationMs:f,fromCache:!1,definitionReuploaded:u})}catch(i){let a=performance.now()-o,u=this.normalizeExecutionError(i,n);this.writeLastState(e.seq,{error:u,durationMs:a}),this.settleError(e,u)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:u,durationMs:a})}finally{_optionalChain([e, 'access', _18 => _18.externalSignal, 'optionalAccess', _19 => _19.removeEventListener, 'call', _20 => _20("abort",s)]),this.inFlight.delete(n),this.drainNext(),this.notify()}}async runExecutor(e,r,n,s){if(!this.cacheKeyExecutor||!this.reuseServerDefinitionCache||!Ue(e))return{response:await this.executor(e,r,s)};let o=n,i=_nullishCoalesce(this.serverCacheKeys.get(o), () => (null)),a=await this.cacheKeyExecutor(e,r,i,s);if(a.cacheKey)for(this.serverCacheKeys.delete(o),this.serverCacheKeys.set(o,a.cacheKey);this.serverCacheKeys.size>ze;){let u=this.serverCacheKeys.keys().next().value;if(u===void 0)break;this.serverCacheKeys.delete(u)}else this.serverCacheKeys.delete(o);return{response:a.response,definitionReuploaded:a.missed}}drainNext(){if(!this.disposed){if(this.mode==="latest-wins"){if(this.pendingForLatestWins&&this.inFlight.size===0){let e=this.pendingForLatestWins;this.pendingForLatestWins=null,this.execute(e)}return}for(;this.fifoQueue.length>0&&this.inFlight.size<this.maxConcurrent;){let e=this.fifoQueue.shift();this.execute(e)}}}supersede(e){let r=new (0, _chunkLLUNR66Gcjs.c)("Superseded by newer solve",_chunkLLUNR66Gcjs.b.SUPERSEDED,{context:{key:e.ctx.key,enqueuedAt:e.ctx.enqueuedAt}});this.settleError(e,r)&&this.runHook(this.onSuperseded,e.ctx)}makeAbortError(e){return new (0, _chunkLLUNR66Gcjs.c)("Request aborted by caller",_chunkLLUNR66Gcjs.b.ABORTED,{context:{key:e.key,enqueuedAt:e.enqueuedAt}})}settleError(e,r){return e.settled?!1:(e.settled={error:r},this.clearQueueWaitTimer(e),this.removeQueuedAbortHandler(e),e.reject(r),!0)}settleSuccess(e,r){return e.settled?!1:(e.settled={ok:!0},this.clearQueueWaitTimer(e),this.removeQueuedAbortHandler(e),e.resolve(r),!0)}removeQueuedAbortHandler(e){e.queuedAbortHandler&&e.externalSignal&&e.externalSignal.removeEventListener("abort",e.queuedAbortHandler),e.queuedAbortHandler=void 0}isAbortLikeError(e){if(e instanceof Error){if(e.name==="AbortError")return!0;if(typeof DOMException<"u"&&e instanceof DOMException)return e.name==="AbortError"}return!1}normalizeExecutionError(e,r){return r.settled&&"error"in r.settled?r.settled.error:e instanceof _chunkLLUNR66Gcjs.c?e:this.isAbortLikeError(e)?this.makeAbortError(r.ctx):new (0, _chunkLLUNR66Gcjs.c)(e instanceof Error?e.message:String(e),_chunkLLUNR66Gcjs.b.UNKNOWN_ERROR,{originalError:e instanceof Error?e:new Error(String(e))})}cancelAll(){for(this.pendingForLatestWins&&(this.rejectAsAborted(this.pendingForLatestWins),this.pendingForLatestWins=null);this.fifoQueue.length>0;){let e=this.fifoQueue.shift();this.rejectAsAborted(e)}for(let e of this.inFlight){let r=this.makeAbortError(e.ctx);this.settleError(e,r)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:r,durationMs:e.ctx.startedAt?Date.now()-e.ctx.startedAt:0}),e.controller.abort()}this.notify()}rejectAsAborted(e){let r=this.makeAbortError(e.ctx);this.settleError(e,r)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:r,durationMs:0})}readCache(e){if(!this.cacheEnabled)return null;let r=this.cache.get(e);return r?this.cacheTtl>0&&Date.now()-r.insertedAt>this.cacheTtl?(this.dropCacheEntry(e),this.cacheMisses+=1,null):(this.cache.delete(e),this.cache.set(e,r),this.cacheHits+=1,r.response):(this.cacheMisses+=1,null)}writeCache(e,r){if(!this.cacheEnabled||!this.cacheErroredSolves&&r.errors&&r.errors.length>0)return;let n=_nullishCoalesce(_chunkLLUNR66Gcjs.l.call(void 0, r), () => (_e(r)));if(!(n>this.cacheMaxBytes))for(this.dropCacheEntry(e),this.cache.set(e,{response:r,insertedAt:Date.now(),sizeBytes:n}),this.cacheBytes+=n;this.cacheBytes>this.cacheMaxBytes&&this.cache.size>0;){let s=this.cache.keys().next().value;if(s===void 0)break;this.dropCacheEntry(s),this.cacheEvictions+=1}}dropCacheEntry(e){let r=this.cache.get(e);r&&(this.cache.delete(e),this.cacheBytes-=r.sizeBytes)}clearCache(){this.cache.clear(),this.cacheBytes=0}cacheStats(){return{entries:this.cache.size,bytes:this.cacheBytes,hits:this.cacheHits,misses:this.cacheMisses,evictions:this.cacheEvictions}}dispose(){this.disposed||(this.disposed=!0,this.cancelAll(),this.subscribers.clear(),this.clearCache())}runHook(e,...r){if(e)try{e(...r)}catch(n){_chunkLLUNR66Gcjs.h.call(void 0, ).error("[SolveScheduler] hook threw:",n)}}};function de(t){return T(t)?`ref:${t.key}`:typeof t=="string"&&t.length<200?t:"...content..."}function me(t){return Array.isArray(t)?t.map(e=>{let r=0,n=0,s=_chunkLLUNR66Gcjs.r.call(void 0, e,"innerTree");if(s&&typeof s=="object"){for(let o of Object.values(s))if(Array.isArray(o)){r+=o.length;for(let i of o){let a=_optionalChain([i, 'optionalAccess', _21 => _21.data]);typeof a=="string"&&(n+=a.length)}}}return{param:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, e,"paramName"), () => ("<unnamed>")),items:r,bytes:n}}):[]}var O=class t{constructor(e){_chunkLLUNR66Gcjs.a.call(void 0, this,"config");_chunkLLUNR66Gcjs.a.call(void 0, this,"serverStats");_chunkLLUNR66Gcjs.a.call(void 0, this,"disposed",!1);this.config=this.normalizeComputeConfig(e),this.serverStats=new (0, _chunkLLUNR66Gcjs.o)(this.config.serverUrl,this.config.apiKey)}static async create(e){let r=new t(e),n=Math.max(1,(_nullishCoalesce(_optionalChain([e, 'access', _22 => _22.retry, 'optionalAccess', _23 => _23.attempts]), () => (2)))+1),s=_nullishCoalesce(_optionalChain([e, 'access', _24 => _24.retry, 'optionalAccess', _25 => _25.baseDelayMs]), () => (250)),o=_nullishCoalesce(_optionalChain([e, 'access', _26 => _26.retry, 'optionalAccess', _27 => _27.maxDelayMs]), () => (1e3));for(let i=0;i<n;i++){if(await r.serverStats.isServerOnline())return r;if(i<n-1){let a=Math.min(s*2**i,o);await new Promise(u=>setTimeout(u,a))}}throw await r.dispose(),new (0, _chunkLLUNR66Gcjs.c)("Rhino Compute server is not online",_chunkLLUNR66Gcjs.b.NETWORK_ERROR,{context:{serverUrl:r.config.serverUrl,attempts:n}})}getConfig(){return this.ensureNotDisposed(),{...this.config}}async getIO(e){return this.ensureNotDisposed(),$(e,this.config)}async getRawIO(e){return this.ensureNotDisposed(),F(e,this.config)}async solve(e,r,n){this.ensureNotDisposed();try{if(typeof e=="string"&&!_optionalChain([e, 'optionalAccess', _28 => _28.trim, 'call', _29 => _29()]))throw new (0, _chunkLLUNR66Gcjs.c)("Definition URL/content is required",_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{receivedUrl:e}});if(e instanceof Uint8Array&&e.length===0)throw new (0, _chunkLLUNR66Gcjs.c)("Definition content is empty",_chunkLLUNR66Gcjs.b.INVALID_INPUT);if(T(e)&&!e.key.trim())throw new (0, _chunkLLUNR66Gcjs.c)("DefinitionRef key is empty",_chunkLLUNR66Gcjs.b.INVALID_INPUT);let s={...this.config,..._optionalChain([n, 'optionalAccess', _30 => _30.signal])!==void 0&&{signal:n.signal},..._optionalChain([n, 'optionalAccess', _31 => _31.timeoutMs])!==void 0&&{timeoutMs:n.timeoutMs},..._optionalChain([n, 'optionalAccess', _32 => _32.retry])!==void 0&&{retry:n.retry}},o=await k(r,e,s);if(_optionalChain([o, 'optionalAccess', _33 => _33.errors])&&o.errors.length>0)throw new (0, _chunkLLUNR66Gcjs.c)(o.errors.join("; ")||"Computation failed",_chunkLLUNR66Gcjs.b.COMPUTATION_ERROR,{context:{definition:de(e),inputSummary:me(r),errors:o.errors,warnings:o.warnings,values:o.values}});return o}catch(s){throw this.config.debug&&_chunkLLUNR66Gcjs.h.call(void 0, ).error("Compute failed:",s),s instanceof _chunkLLUNR66Gcjs.c?s:new (0, _chunkLLUNR66Gcjs.c)(s instanceof Error?s.message:String(s),_chunkLLUNR66Gcjs.b.COMPUTATION_ERROR,{context:{definition:de(e),inputSummary:me(r)},originalError:s instanceof Error?s:new Error(String(s))})}}createScheduler(e){this.ensureNotDisposed();let r=(s,o,i)=>k(o,s,i),n=(s,o,i,a)=>i===null?ae(o,s,a).then(u=>({...u,missed:!1})):ue(o,i,s,a);return new E(r,this.config,e,n)}async dispose(){this.disposed||(this.disposed=!0,await this.serverStats.dispose())}ensureNotDisposed(){if(this.disposed)throw new (0, _chunkLLUNR66Gcjs.c)("GrasshopperClient has been disposed and cannot be used",_chunkLLUNR66Gcjs.b.INVALID_STATE)}normalizeComputeConfig(e){return{...e,serverUrl:_chunkLLUNR66Gcjs.n.call(void 0, e.serverUrl),apiKey:e.apiKey,authToken:e.authToken,debug:_nullishCoalesce(e.debug, () => (!1)),suppressBrowserWarning:_nullishCoalesce(e.suppressBrowserWarning, () => (e.suppressClientSideWarning))}}};var M=new Map;function ye(t,e){M.set(t,e)}ye("Rhino.Geometry.Point3d",(t,e)=>{let r=e;return!r||typeof r.X!="number"?null:new t.Point([r.X,r.Y,r.Z])});ye("Rhino.Geometry.Line",(t,e)=>{let r=e;return!r||!r.From||!r.To?null:new t.Line([r.From.X,r.From.Y,r.From.Z],[r.To.X,r.To.Y,r.To.Z])});function qe(t){if(M.has(t))return M.get(t);for(let[e,r]of M)if(t.startsWith(e))return r}function Ke(t){return!!(t&&typeof t=="object"&&typeof t.data=="string")}function he(t,e){return{__decodeError:!0,type:t,raw:e}}function ge(t,e,r){let n=qe(e),s=!1;if(n)try{let o=n(r,t);if(o!=null)return o}catch(o){_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Failed to decode Rhino type ${e}:`,o),s=!0}try{if(Ke(t))return r.CommonObject.decode(t)}catch(o){return _chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Failed to decode ${e} with CommonObject:`,o),he(e,t)}return s?he(e,t):t}function be(t){let e=new WeakSet,r=n=>{if(!n||typeof n!="object"||e.has(n))return;e.add(n);let s=n.delete;if(typeof s=="function"){let i=n.isDeleted;(typeof i!="function"||!i.call(n))&&s.call(n);return}if(Array.isArray(n)){for(let i of n)r(i);return}let o=Object.getPrototypeOf(n);if(o===Object.prototype||o===null)for(let i of Object.values(n))r(i)};r(t)}var x={STRING:"System.String",INT:"System.Int32",DOUBLE:"System.Double",BOOL:"System.Boolean"},Qe="Rhino.Geometry.",He=["WebDisplay"],Je="FileData";function Te(t){return He.some(e=>t.includes(e))}function Ye(t){if(typeof t!="string")return t;let e=t.trim();if(!(e.startsWith("{")||e.startsWith("[")||e.startsWith('"')))return t;try{let n=JSON.parse(e);if(typeof n=="string")try{return JSON.parse(n)}catch (e3){return n}return n}catch (e4){return t}}function Xe(t,e,r){switch(e){case x.STRING:return typeof t!="string"?t:t.replace(/^"(.*)"$/,"$1");case x.INT:return Number.parseInt(t,10);case x.DOUBLE:return Number.parseFloat(t);case x.BOOL:return String(t).toLowerCase()==="true";default:return r&&e.startsWith(Qe)?ge(t,e,r):t}}var z=new WeakMap;function Se(t){if(z.has(t))return z.get(t);let e=Ye(t.data);return z.set(t,e),e}function De(t,e,r,n){if(typeof t.data!="string")return t.data;let s=r?Se(t):t.data;return Xe(s,e,n)}function Ze(t){if(!t||typeof t!="object")return!1;let e=t;return typeof e.fileName=="string"&&typeof e.fileType=="string"&&"data"in e&&typeof e.isBase64Encoded=="boolean"&&typeof e.subFolder=="string"}function U(t){let e=_chunkLLUNR66Gcjs.r.call(void 0, t,"values");return Array.isArray(e)?e:[]}function _(t){return typeof t.type=="string"?t.type:""}function q(t,e){if(!(!t||typeof t!="object")){for(let r of Object.values(t))if(Array.isArray(r))for(let n of r)n&&typeof n=="object"&&e(n)}}function Ie(t,e=!1,r={}){let{parseValues:n=!0,rhino:s,stringOnly:o=!1}=r,i={},a=new Set;for(let u of U(t)){let f=_chunkLLUNR66Gcjs.r.call(void 0, u,"paramName");q(_chunkLLUNR66Gcjs.r.call(void 0, u,"innerTree"),c=>{let d=_(c);if(Te(d)||o&&d!==x.STRING)return;let g=e?c.id:f;if(!g)return;let b=De(c,d,n,s);g in i?a.has(g)?i[g].push(b):(i[g]=[i[g],b],a.add(g)):i[g]=b})}return{values:i,dispose:()=>be(i)}}function xe(t){let e=[];for(let r of U(t))q(_chunkLLUNR66Gcjs.r.call(void 0, r,"innerTree"),n=>{if(!_(n).includes(Je))return;let s=Se(n);Ze(s)&&e.push(s)});return e}function Ce(t,e,r={}){let{parseValues:n=!0,rhino:s,stringOnly:o=!1}=r;for(let i of U(t)){let a=_chunkLLUNR66Gcjs.r.call(void 0, i,"innerTree"),u=!1;if("byName"in e){if(_chunkLLUNR66Gcjs.r.call(void 0, i,"paramName")!==e.byName)continue;u=!0}let f=[];if(q(a,c=>{if("byId"in e){if(c.id!==e.byId)return;u=!0}let d=_(c);Te(d)||o&&d!==x.STRING||f.push(De(c,d,n,s))}),u)return f.length===0?void 0:f.length===1?f[0]:f}}var L=class{constructor(e,r=!1){_chunkLLUNR66Gcjs.a.call(void 0, this,"response",e);_chunkLLUNR66Gcjs.a.call(void 0, this,"debug",r)}getValues(e=!1,r={}){return Ie(this.response,e,r)}getValue(e,r){return Ce(this.response,e,r)}getFileData(){return xe(this.response)}async getAndDownloadFiles(e,r){let n=this.getFileData();await _chunkLLUNR66Gcjs.u.call(void 0, n,e,r)}};var K=/^\{(-?\d+(?:;-?\d+)*)?\}$/;function C(t){if(typeof t!="object"||t===null||Array.isArray(t))return!1;let e=Object.entries(t);return e.length>0&&e.every(([r,n])=>K.test(r)&&Array.isArray(n))}function Q(t,e,r){let n=Number(t.toFixed(e));return Math.abs(t-n)<r?n:t}function we(t,e){if(!Number.isFinite(t)||t===0)return .1;let r=Math.abs(t);if(r>=1){let g=String(t).split(".")[1];if(g&&g.length>0){let b=Math.min(g.length,12),D=Math.pow(10,-b),Z=Number(D.toFixed(b));return Math.abs(Z-D)<e?Z:D}return 1}let n=String(t),s=n.toLowerCase().match(/e(-?\d+)/);if(s){let d=Number(s[1]);if(d<0||n.toLowerCase().includes("e-")){let g=Math.abs(d),b=Math.pow(10,-g),D=Number(b.toFixed(g));return Math.abs(D-b)<e?D:b}return .1}let o=12,a=r.toFixed(o).replace(/0+$/,""),u=Math.min((a.split(".")[1]||"").length,o);if(u===0)return .1;let f=Math.pow(10,-u),c=Number(f.toFixed(u));return Math.abs(c-f)<e?c:f}function H(t){return typeof t.stepSize=="number"&&Number.isFinite(t.stepSize)&&t.stepSize>0?t.stepSize:void 0}function S(t,e,r){if(t==null)return t;if(Array.isArray(t)){let s=t.map(e).filter(o=>o!==null);return s.length>0?s:void 0}let n=e(t);return n!==null?n:r?void 0:t}var v=t=>{if(typeof t=="number")return Number.isFinite(t)?t:null;if(typeof t=="string"){let e=t.trim();if(e===""||/^[+-]?0[xbo]/i.test(e))return null;let r=Number(e);return Number.isFinite(r)?r:null}return null},V=t=>{if(typeof t=="boolean")return t;if(typeof t=="string"){let e=t.trim().toLowerCase();if(e==="true")return!0;if(e==="false")return!1}return null},Ee=t=>typeof t=="string"?t.length>=2&&t.startsWith('"')&&t.endsWith('"')?t.slice(1,-1):t.startsWith('"')?t.slice(1):t:null,ve=t=>{if(typeof t=="string"){let e=t.trim();return e.startsWith('"')&&e.endsWith('"')&&(e=e.slice(1,-1).trim()),e}return null};function J(t){return e=>{if(typeof e=="object"&&e!==null)return e;if(typeof e=="string"&&e.trim()!=="")try{let r=JSON.parse(e);return typeof r=="object"&&r!==null?r:(_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Parsed value for input ${t} is not an object`),null)}catch(r){return _chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Failed to parse object value "${e}" for input ${t}`,r),null}return null}}function et(t,e=1e-8){let r=t.paramType==="Integer",n=H(t);if(C(t.default))return{default:t.default,stepSize:_nullishCoalesce(n, () => ((r?1:.1)))};if(typeof t.default=="string"&&t.default.trim()!==""&&v(t.default)===null)throw new (0, _chunkLLUNR66Gcjs.c)(`Invalid numeric default "${t.default}" for input "${t.name||"unknown"}"`,_chunkLLUNR66Gcjs.b.VALIDATION_ERROR,{context:{inputName:t.name,default:t.default}});let s=S(t.default,v,!0);if(r)return Array.isArray(s)?s=s.map(d=>typeof d=="number"?Math.round(d):d):typeof s=="number"&&(s=Math.round(s)),{default:s,stepSize:_nullishCoalesce(n, () => (1))};let o=Array.isArray(s)?s[0]:s,i;typeof o=="number"&&Number.isFinite(o)&&o!==0?i=o:typeof t.minimum=="number"&&Number.isFinite(t.minimum)&&t.minimum!==0?i=t.minimum:typeof t.maximum=="number"&&Number.isFinite(t.maximum)&&t.maximum!==0&&(i=t.maximum);let a=_nullishCoalesce(n, () => ((i!==void 0?we(i,e):.1))),u=0,f=String(a),c=f.toLowerCase().match(/e(-?\d+)/);if(c?u=Math.abs(Number(c[1])):u=_nullishCoalesce(_optionalChain([f, 'access', _34 => _34.split, 'call', _35 => _35("."), 'access', _36 => _36[1], 'optionalAccess', _37 => _37.length]), () => (0)),u===0&&typeof o=="number"&&o!==0&&Math.abs(o)<1){let d=Math.ceil(-Math.log10(Math.abs(o)));Number.isFinite(d)&&d>0&&(u=d)}return u=Math.min(Math.max(u,0),12),Array.isArray(s)?s=s.map(d=>typeof d=="number"?Q(d,u,e):d):typeof s=="number"&&(s=Q(s,u,e)),{default:s,stepSize:a}}var tt={types:["Number","Integer"],parse(t,e){let{default:r,stepSize:n}=et(t);return{...e,paramType:t.paramType,minimum:t.minimum,maximum:t.maximum,atLeast:t.atLeast,atMost:t.atMost,stepSize:n,default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1,n=typeof t.minimum=="number"&&Number.isFinite(t.minimum)&&t.minimum>0?t.minimum:0;return{...e,paramType:t.paramType,minimum:t.minimum,maximum:t.maximum,atLeast:t.atLeast,atMost:t.atMost,stepSize:_nullishCoalesce(H(t), () => ((t.paramType==="Integer"?1:.1))),default:r?[n]:n}}},rt={types:["Boolean"],parse(t,e){if(C(t.default))return{...e,paramType:"Boolean",default:t.default};let r=S(t.default,V,!1);if(r!=null&&typeof r!="boolean"&&!Array.isArray(r))throw new (0, _chunkLLUNR66Gcjs.c)(`Invalid boolean default "${String(r)}" for input "${t.name||"unknown"}"`,_chunkLLUNR66Gcjs.b.VALIDATION_ERROR,{context:{inputName:t.name,default:t.default}});return{...e,paramType:"Boolean",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Boolean",default:r?[!1]:!1}}},nt={types:["Text"],parse(t,e){let r=S(t.default,Ee,!1);return{...e,paramType:"Text",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Text",default:r?[""]:""}}},st={types:["ValueList"],parse(t,e){if(!t.values||typeof t.values!="object"||Object.keys(t.values).length===0)throw _chunkLLUNR66Gcjs.c.missingValues(t.nickname||"unnamed","ValueList");let r=t.default;if(t.default!==void 0&&t.default!==null){if(typeof t.default=="object")throw new (0, _chunkLLUNR66Gcjs.c)(`ValueList input "${t.nickname||"unnamed"}" default is not a string-able value`,_chunkLLUNR66Gcjs.b.VALIDATION_ERROR,{context:{inputName:t.name,default:t.default}});let n=String(t.default).toLowerCase(),s=Object.keys(t.values).find(o=>o.toLowerCase()===n);s!==void 0?r=s:_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`ValueList input "${t.nickname||"unnamed"}" default value "${t.default}" is not in available values`)}return{...e,paramType:"ValueList",values:t.values,default:r}},fallback(t,e){return{...e,paramType:"ValueList",values:t.values&&typeof t.values=="object"?t.values:{},default:void 0}}},Ae={types:["Geometry"],parse(t,e){let r=S(t.default,J(t.nickname||"unnamed"),!0);return{...e,paramType:"Geometry",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Geometry",default:r?[null]:null}}},ot={types:["File"],parse(t,e){let r=S(t.default,J(t.nickname||"unnamed"),!0);return{...e,paramType:"File",acceptedFormats:t.acceptedFormats,default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"File",default:r?[null]:null}}},it={types:["Color"],parse(t,e){let r=S(t.default,ve,!1);return{...e,paramType:"Color",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Color",default:r?["0, 0, 0"]:"0, 0, 0"}}},at=[tt,rt,nt,st,Ae,ot,it],Y=new Map(at.flatMap(t=>t.types.map(e=>[e,t]))),Re=Ae;function Pe(t){return _chunkLLUNR66Gcjs.r.call(void 0, t,"data")}function ut(t){return _chunkLLUNR66Gcjs.r.call(void 0, t,"type")}var lt=new Set(["System.Double","System.Single","System.Decimal","System.Int32","System.Int64"]),pt=new Set(["System.Int32","System.Int64"]);function ke(t){if(typeof t.default!="object"||t.default===null)return{schema:t};if(Array.isArray(t.default))return{schema:t};if(!_chunkLLUNR66Gcjs.s.call(void 0, t.default,"innerTree")){let n=`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default had an unrecognized shape (no innerTree key); the default was dropped.`;return _chunkLLUNR66Gcjs.h.call(void 0, ).warn("Unexpected structure in input.default:",t.default),{schema:{...t,default:null},warning:{code:"MALFORMED_DEFAULT",message:n}}}let e=_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t.default,"innerTree"), () => ({}));if(Object.keys(e).length===0)return{schema:{...t,default:void 0}};if(t.treeAccess||t.atMost&&t.atMost>1){let n={},s=[];for(let[i,a]of Object.entries(e)){if(!Array.isArray(a)){let f=`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default had a non-array innerTree branch ("${i}"); the default was dropped.`;return _chunkLLUNR66Gcjs.h.call(void 0, ).warn("Unexpected structure in input.default innerTree:",t.default),{schema:{...t,default:null},warning:{code:"MALFORMED_DEFAULT",message:f}}}let u=[];for(let f of a){let c=Pe(f),d=ut(f);if(d&&lt.has(d)){if(typeof c=="string"&&c.trim()==="")continue;let g=v(c);if(g===null){s.push(`"${String(c)}" (${d})`);continue}u.push(pt.has(d)?Math.round(g):g);continue}if(d==="System.Boolean"){let g=V(c);if(g===null){s.push(`"${String(c)}" (${d})`);continue}u.push(g);continue}if(typeof c=="string"&&_optionalChain([d, 'optionalAccess', _38 => _38.startsWith, 'call', _39 => _39("Rhino.Geometry")])){try{u.push(JSON.parse(c))}catch (e5){u.push(c)}continue}u.push(c)}n[i]=u}let o;if(s.length>0){let i=`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default contained ${s.length} tree value(s) that could not be parsed and were dropped: ${s.join(", ")}.`;_chunkLLUNR66Gcjs.h.call(void 0, ).warn(i),o={code:"MALFORMED_DEFAULT",message:i}}return{schema:{...t,default:n},...o&&{warning:o}}}let r=[];for(let n of Object.values(e))Array.isArray(n)&&n.forEach(s=>{s&&typeof s=="object"&&_chunkLLUNR66Gcjs.s.call(void 0, s,"data")&&r.push(Pe(s))});return r.length===0?{schema:{...t,default:void 0}}:r.length===1?{schema:{...t,default:r[0]}}:{schema:{...t,default:r}}}var ct=new Map([...Y.keys()].map(t=>[t.toLowerCase(),t]));function ft(t){return _nullishCoalesce(ct.get(_optionalChain([t, 'optionalAccess', _40 => _40.toLowerCase, 'call', _41 => _41()])), () => (t))}function dt(t){return Ne(t).input}function Ne(t){let e={description:t.description,name:t.name,nickname:t.nickname,treeAccess:t.treeAccess,groupName:_nullishCoalesce(t.groupName, () => (void 0)),id:t.id},r=ft(t.paramType),n={...t,paramType:r},s;try{let{schema:i,warning:a}=ke(n);n=i,s=a&&{inputName:t.name||"unknown",paramType:t.paramType,message:a.message,code:a.code}}catch(i){n={...n,default:null},s={inputName:t.name||"unknown",paramType:t.paramType,message:`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default could not be normalized and was dropped: ${i instanceof Error?i.message:String(i)}`,code:"MALFORMED_DEFAULT"}}let o=Y.get(r);try{if(!o)throw _chunkLLUNR66Gcjs.c.unknownParamType(r,t.name);return{input:o.parse(n,e),error:s,...s&&{errors:[s]}}}catch(i){if(i instanceof _chunkLLUNR66Gcjs.c){_chunkLLUNR66Gcjs.h.call(void 0, ).error(`Validation error for input ${t.name||"unknown"}:`,i.message);let a={inputName:t.name||"unknown",paramType:t.paramType,message:i.message,code:i.code};return{input:(_nullishCoalesce(o, () => (Re))).fallback(n,e),error:a,errors:s?[s,a]:[a]}}throw new (0, _chunkLLUNR66Gcjs.c)(i instanceof Error?i.message:String(i),"VALIDATION_ERROR",{context:{paramName:t.name,paramType:r},originalError:i instanceof Error?i:new Error(String(i))})}}function Oe(t){let e=[],r=[];for(let n of t){let{input:s,errors:o}=Ne(n);e.push(s),o&&r.push(...o)}return{inputs:e,parseErrors:r}}function Fe(t){let e=_chunkLLUNR66Gcjs.r.call(void 0, t,"stepSize");return{id:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"id"), () => ("")),name:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"name"), () => ("")),nickname:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"nickname"), () => (null)),description:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"description"), () => ("")),paramType:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"paramType"), () => ("")),treeAccess:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"treeAccess"), () => (!1)),minimum:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"minimum"), () => (null)),maximum:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"maximum"), () => (null)),atLeast:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"atLeast"), () => (1)),atMost:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"atMost"), () => (1)),stepSize:typeof e=="number"&&Number.isFinite(e)?e:void 0,default:_chunkLLUNR66Gcjs.r.call(void 0, t,"default"),values:_chunkLLUNR66Gcjs.r.call(void 0, t,"values"),acceptedFormats:_chunkLLUNR66Gcjs.r.call(void 0, t,"acceptedFormats"),groupName:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"groupName"), () => (null))}}function Me(t){return{name:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"name"), () => ("")),nickname:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"nickname"), () => (null)),paramType:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"paramType"), () => ("")),id:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"id"), () => (""))}}async function F(t,e){let r=w(t,[]),n={};if(r.algo&&(n.algo=r.algo),r.pointer&&(n.pointer=r.pointer),!n.algo&&!n.pointer)throw new (0, _chunkLLUNR66Gcjs.c)("Definition must resolve to either a URL pointer or base64 algo",_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{definition:t}});let s=await _chunkLLUNR66Gcjs.m.call(void 0, "io",n,e);if(!s||typeof s!="object")throw new (0, _chunkLLUNR66Gcjs.c)("Invalid IO response structure",_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{response:s,definition:t}});let o=Le(_chunkLLUNR66Gcjs.r.call(void 0, s,"warnings")),i=Le(_chunkLLUNR66Gcjs.r.call(void 0, s,"errors")),a=_chunkLLUNR66Gcjs.r.call(void 0, s,"inputs"),u=_chunkLLUNR66Gcjs.r.call(void 0, s,"outputs");return{inputs:Array.isArray(a)?a.map(Fe):[],outputs:Array.isArray(u)?u.map(Me):[],...o&&{loadWarnings:o},...i&&{loadErrors:i}}}function Le(t){if(!Array.isArray(t))return;let e=t.map(mt).filter(r=>r!==void 0);return e.length>0?e:void 0}function mt(t){if(t==null)return;let e;if(typeof t=="string")e=t;else if(typeof t=="object"){let r=_chunkLLUNR66Gcjs.r.call(void 0, t,"message");if(typeof r=="string"&&r.trim().length>0)e=r;else try{e=_nullishCoalesce(JSON.stringify(t), () => (String(t)))}catch (e6){e=String(t)}}else e=String(t);return e.trim().length>0?e:void 0}async function $(t,e){I("fetchParsedDefinitionIO",_nullishCoalesce(e.suppressBrowserWarning, () => (e.suppressClientSideWarning)));let{inputs:r,outputs:n,loadWarnings:s,loadErrors:o}=await F(t,e),{inputs:i,parseErrors:a}=Oe(r);return{inputs:i,outputs:n,...a.length>0&&{parseErrors:a},...s&&{loadWarnings:s},...o&&{loadErrors:o}}}var X=class t{constructor(e){_chunkLLUNR66Gcjs.a.call(void 0, this,"innerTree");_chunkLLUNR66Gcjs.a.call(void 0, this,"paramName");this.paramName=e,this.innerTree={}}append(e,r){let n=t.formatPathString(e);this.innerTree[n]||(this.innerTree[n]=[]);let s=r.map(o=>({data:t.serializeValue(o)}));return this.innerTree[n].push(...s),this}appendSingle(e,r){return this.append(e,[r])}fromDataTreeDefault(e){this.innerTree={};for(let[r,n]of Object.entries(e)){if(!Array.isArray(n))continue;let s=t.parsePathString(r);this.append(s,n)}return this}appendFlat(e){let r=Array.isArray(e)?e:[e];return this.append([0],r)}flatten(){let e=[];for(let r of Object.values(this.innerTree))if(Array.isArray(r))for(let n of r)e.push(t.deserializeValue(n.data));return e}getPaths(){return Object.keys(this.innerTree)}getPath(e){let r=t.formatPathString(e),n=this.innerTree[r];if(n)return n.map(s=>t.deserializeValue(s.data))}toComputeFormat(){return{ParamName:this.paramName,InnerTree:this.innerTree}}getInnerTree(){return this.innerTree}getParamName(){return this.paramName}static fromInputParams(e){return e.filter(r=>t.hasValidValue(r.default)).map(r=>{let n=new t(r.nickname||"unnamed"),s=r.default;if(r.treeAccess&&C(s))n.fromDataTreeDefault(s),t.isNumericInput(r)&&n.applyNumericConstraints(r.minimum,r.maximum,r.nickname||"unnamed");else{let o=Array.isArray(s)?s:[s],i=t.processValues(o,r);n.appendFlat(i)}return n.toComputeFormat()})}static fromInputParam(e){return t.hasValidValue(e.default)?t.fromInputParams([e])[0]:void 0}static replaceTreeValue(e,r,n){let s=e.length>0&&e[0]instanceof t,o=t.buildFromValue(r,n);if(s){let f=e.slice(),c=f.findIndex(d=>d.getParamName()===r);return c!==-1?f[c]=o:f.push(o),f}let i=e.slice(),a=o.toComputeFormat(),u=i.findIndex(f=>f.ParamName===r);return u!==-1?i[u]=a:i.push(a),i}static buildFromValue(e,r){let n=new t(e);return C(r)?n.fromDataTreeDefault(r):n.appendFlat(r),n}static getTreeValue(e,r){let s=e.length>0&&e[0]instanceof t?t.readFromBuilders(e,r):t.readFromDataTrees(e,r);return s===null||s.length===0?null:s.length===1?s[0]:s}static readFromBuilders(e,r){let n=e.find(s=>s.getParamName()===r);return n?n.flatten():null}static readFromDataTrees(e,r){let n=e.find(i=>i.ParamName===r);if(!_optionalChain([n, 'optionalAccess', _42 => _42.InnerTree]))return null;let s=Object.keys(n.InnerTree)[0];if(!s)return null;let o=n.InnerTree[s];return Array.isArray(o)?o.map(i=>_optionalChain([i, 'optionalAccess', _43 => _43.data])!==void 0?t.deserializeValue(i.data):null):_optionalChain([o, 'optionalAccess', _44 => _44.data])!==void 0?[t.deserializeValue(o.data)]:o!==void 0?[o]:null}static parsePathString(e){let r=e.match(K);if(!r)throw new Error(`Invalid Grasshopper tree path: "${e}". Expected "{}", "{0}", or "{0;1;2}" (negative indices allowed, no empty segments).`);return r[1]?r[1].split(";").map(Number):[]}static formatPathString(e){return`{${e.join(";")}}`}applyNumericConstraints(e,r,n){for(let s of Object.values(this.innerTree))if(Array.isArray(s))for(let o of s){let i=t.deserializeValue(o.data);if(typeof i=="number"){let a=t.clampValue(i,e,r,n);o.data=t.serializeValue(a)}}}static serializeValue(e){return typeof e=="boolean"||typeof e=="number"||typeof e=="string"?e:typeof e=="object"&&e!==null?JSON.stringify(e):String(e)}static deserializeValue(e){if(typeof e=="boolean"||typeof e=="number"||typeof e!="string")return e;if(e.startsWith("{")||e.startsWith("["))try{return JSON.parse(e)}catch (e7){return e}let r=Number(e);return Number.isFinite(r)&&String(r)===e?r:e==="true"?!0:e==="false"?!1:e}static hasValidValue(e){return e==null?!1:typeof e=="string"?!0:!(Array.isArray(e)&&e.length===0||typeof e=="object"&&!Array.isArray(e)&&Object.keys(e).length===0)}static isNumericInput(e){return e.paramType==="Number"||e.paramType==="Integer"}static processValues(e,r){return e.map(n=>t.isNumericInput(r)&&typeof n=="number"?t.clampValue(n,r.minimum,r.maximum,r.nickname||"unnamed"):n).filter(n=>n!=null)}static clampValue(e,r,n,s){let o=e;return r!=null&&o<r&&(_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`${s}: ${e} below min ${r}, clamping`),o=r),n!=null&&o>n&&(_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`${s}: ${e} above max ${n}, clamping`),o=n),o}};exports.a = T; exports.b = k; exports.c = le; exports.d = $e; exports.e = N; exports.f = E; exports.g = O; exports.h = L; exports.i = dt; exports.j = F; exports.k = $; exports.l = X;
+//# sourceMappingURL=chunk-BVMGO7IG.cjs.map

package/dist/{chunk-G7NVQAK5.cjs.map → chunk-BVMGO7IG.cjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["/home/runner/work/selva/selva/packages/compute/dist/chunk-G7NVQAK5.cjs","../src/core/utils/warnings.ts","../src/grasshopper/definition-ref.ts","../src/grasshopper/solve.ts"],"names":["warnedFunctions","isRealBrowser","nav","userAgent","warnIfClientSide","functionName","suppress","getLogger","isDefinitionRef","definition","DEFINITION_LOAD_FAILED","isDefinitionLoadMiss","error","RhinoComputeError","ErrorCodes","warnOnEmptyInnerTrees","response","debug","values","readField","empty","param","innerTree","scope"],"mappings":"AAAA,yuBAA2I,ICGrIA,EAAAA,CAAkB,IAAI,GAAA,CAa5B,SAASC,EAAAA,CAAAA,CAAyB,CAIjC,EAAA,CAHI,OAAO,MAAA,CAAW,GAAA,kBAER,UAAA,qBAA+D,OAAA,6BACnE,QAAA,6BAAU,MAAA,EAAQ,IAAA,CAAM,MAAO,CAAA,CAAA,CAEzC,IAAMC,CAAAA,CAAO,UAAA,CAAuD,SAAA,CAC9DC,CAAAA,CAAY,uBAAOD,CAAAA,6BAAK,WAAA,EAAc,QAAA,CAAWA,CAAAA,CAAI,SAAA,CAAY,EAAA,CACvE,MAAI,CAAA,QAAA,CAAS,IAAA,CAAKC,CAAS,CAG5B,CAEO,SAASC,CAAAA,CAAiBC,CAAAA,CAAsBC,CAAAA,CAA0B,CAC5EA,CAAAA,EAIAL,EAAAA,CAAc,CAAA,EAAK,CAACD,EAAAA,CAAgB,GAAA,CAAIK,CAAY,CAAA,EAAA,CACvDL,EAAAA,CAAgB,GAAA,CAAIK,CAAY,CAAA,CAChCE,iCAAAA,CAAU,CAAE,IAAA,CACX,CAAA,SAAA,EAAYF,CAAY,CAAA,8GAAA,CACzB,CAAA,CAEF,CCKO,SAASG,CAAAA,CAAgBC,CAAAA,CAA0D,CACzF,OACC,OAAOA,CAAAA,EAAe,QAAA,EACtB,CAAA,CAAEA,EAAAA,WAAsB,UAAA,CAAA,EACxB,OAAOA,CAAAA,CAAW,GAAA,EAAQ,QAAA,EAC1B,OAAOA,CAAAA,CAAW,IAAA,EAAS,UAE7B,CCvBA,IAAMC,EAAAA,CAAyB,uCAAA,CAG/B,SAASC,EAAAA,CAAqBC,CAAAA,CAAyB,CACtD,OAAMA,EAAAA,WAAiBC,mBAAAA,CAEtBD,CAAAA,CAAM,IAAA,GAASE,mBAAAA,CAAW,qBAAA,EAC1BF,CAAAA,CAAM,OAAA,CAAQ,QAAA,CAASF,EAAsB,CAAA,CAHI,CAAA,CAKnD,CAeO,SAASK,EAAAA,CAAsBC,CAAAA,CAAsCC,CAAAA,CAAuB,CAClG,EAAA,CAAI,CAACA,CAAAA,CAAO,MAAA,CAEZ,IAAMC,CAAAA,CAASC,iCAAAA,CAAqBH,CAAU,QAAQ,CAAA,CACtD,EAAA,CAAI,CAAC,KAAA,CAAM,OAAA,CAAQE,CAAM,CAAA,EAAKA,CAAAA,CAAO,MAAA,GAAW,CAAA,CAAG,MAAA,CAEnD,IAAME,CAAAA,CAAkB,CAAC,CAAA,CACzB,GAAA,CAAA,IAAWC,EAAAA,GAASH,CAAAA,CAAQ,CAC3B,IAAMI,CAAAA,CAAYH,iCAAAA,CAAmCE,CAAO,WAAW,CAAA,CAAA,CAEnE,CAACC,CAAAA,EAAa,MAAA,CAAO,IAAA,CAAKA,CAAS,CAAA,CAAE,MAAA,GAAW,CAAA,CAAA,EACnDF,CAAAA,CAAM,IAAA,kBAAKD,iCAAAA,CAAkBE,CAAO,WAAW,CAAA,SAAK,aAAW,CAEjE,CAEA,EAAA,CAAID,CAAAA,CAAM,MAAA,GAAW,CAAA,CAAG,MAAA,CAExB,IAAMG,CAAAA,CAAQH,CAAAA,CAAM,MAAA,GAAWF,CAAAA,CAAO,MAAA,CAAS,KAAA,CAAQ,CAAA,EAAA","file":"/home/runner/work/selva/selva/packages/compute/dist/chunk-G7NVQAK5.cjs","sourcesContent":[null,"import { getLogger } from './logger';\n\n/** Functions that already warned — the exposure risk doesn't change per call, so once is enough. */\nconst warnedFunctions = new Set<string>();\n\n/**\n * True only in a GENUINE browser/worker context — the case where an API key in\n * the config is actually exposed to end users. `typeof window !== 'undefined'`\n * alone is not enough: jsdom test environments define `window` too, and every\n * unsuppressed vitest/jest run would warn noisily (issue 110).\n *\n * Detection: `window` must exist, AND we must not be in Node (jsdom runs in\n * Node, so `process.versions.node` is defined there but never in a real\n * browser), AND the user agent must not carry jsdom's marker (belt-and-braces\n * for exotic setups that hide `process`). Genuine browsers pass all three.\n */\nfunction isRealBrowser(): boolean {\n\tif (typeof window === 'undefined') return false;\n\n\tconst proc = (globalThis as { process?: { versions?: { node?: unknown } } }).process;\n\tif (proc?.versions?.node != null) return false;\n\n\tconst nav = (globalThis as { navigator?: { userAgent?: unknown } }).navigator;\n\tconst userAgent = typeof nav?.userAgent === 'string' ? nav.userAgent : '';\n\tif (/jsdom/i.test(userAgent)) return false;\n\n\treturn true;\n}\n\nexport function warnIfClientSide(functionName: string, suppress?: boolean): void {\n\tif (suppress) {\n\t\treturn;\n\t}\n\n\tif (isRealBrowser() && !warnedFunctions.has(functionName)) {\n\t\twarnedFunctions.add(functionName);\n\t\tgetLogger().warn(\n\t\t\t`Warning: ${functionName} is running on the client side. For better performance and security, consider running this on the server side.`\n\t\t);\n\t}\n}\n\n/** @internal Reset the once-per-function dedupe — for tests only. */\nexport function resetClientSideWarnings(): void {\n\twarnedFunctions.clear();\n}\n","/**\n * By-reference definition form for solves.\n *\n * Lets a caller that already knows a definition's identity (e.g. a stored\n * version's UUID) schedule solves without materializing the multi-MB bytes:\n * cache keys and the server-pointer map are derived from `key` alone, and\n * `load()` is only called when an upload is genuinely unavoidable (first solve\n * of a definition, or a server-side pointer miss).\n */\n\n/**\n * A definition identified by a stable key, with bytes materialized on demand.\n *\n * **Immutability contract — read this before constructing one.** `key` must\n * identify IMMUTABLE bytes: every `load()` for a given `key` must return the\n * same content, forever. All caching (the scheduler's result cache, the\n * server-pointer map, and any durable cache built on these keys) trusts the\n * key as the definition's identity WITHOUT looking at the bytes. If two\n * different byte contents ever share a key, cached solves from one are served\n * for the other — silent cache poisoning with no diagnostic. Use an identity\n * that can never be reused for different content (e.g. a version UUID), never\n * a mutable name or path.\n */\nexport interface DefinitionRef {\n\t/**\n\t * Identity of immutable bytes (e.g. a version UUID). Two different byte\n\t * contents must never share a key — cache poisoning otherwise.\n\t */\n\tkey: string;\n\t/**\n\t * Materialize the bytes. Called ONLY when an upload is unavoidable — inside\n\t * the solve execution, so it counts toward the solve's abort semantics.\n\t */\n\tload: () => Promise<Uint8Array>;\n}\n\n/**\n * Every definition form accepted by the solve entry points:\n * - a URL, base64 string, or plain string (content-hashed for caching)\n * - raw `.gh` bytes (content-hashed)\n * - a {@link DefinitionRef} (identity-keyed; bytes loaded lazily)\n */\nexport type SolveDefinition = string | Uint8Array | DefinitionRef;\n\n/** Narrow a {@link SolveDefinition} to the by-reference form. */\nexport function isDefinitionRef(definition: SolveDefinition): definition is DefinitionRef {\n\treturn (\n\t\ttypeof definition === 'object' &&\n\t\t!(definition instanceof Uint8Array) &&\n\t\ttypeof definition.key === 'string' &&\n\t\ttypeof definition.load === 'function'\n\t);\n}\n","import { fetchRhinoCompute, RhinoComputeError, ErrorCodes } from '@/core';\nimport { getResponseWireSize, setResponseWireSize } from '@/core/compute-fetch/wire-size';\nimport { base64ByteArray, detectBase64Payload, encodeStringToBase64 } from '@/core/utils/encoding';\nimport { getLogger } from '@/core/utils/logger';\nimport { readField } from '@/core/utils/read-field';\nimport { warnIfClientSide } from '@/core/utils/warnings';\n\nimport {\n\tGrasshopperRequestSchema,\n\tGrasshopperComputeConfig,\n\tGrasshopperComputeResponse,\n\tDataTree\n} from './types';\nimport { isDefinitionRef, type SolveDefinition } from './definition-ref';\n\n/**\n * The exact message the server throws when it can neither resolve a `pointer`\n * nor a base64 `algo` to a definition (ResthopperEndpoints.cs). This is the\n * signal that a cache-key pointer missed the server's definition cache (GC'd, or\n * a different child in the pool), so the caller should retry with the full\n * definition. Matched as a substring because the server wraps it with a category\n * prefix in its exception handler.\n *\n * NOTE: the server only includes this message when running in debug mode; its\n * production exception handler scrubs the message to a generic string. The\n * reliable signal is therefore {@link ErrorCodes.DEFINITION_NOT_CACHED}, derived\n * from the server's machine `code` (which isn't scrubbed). The string match is\n * kept as a fallback for debug-mode servers and forks that don't yet emit a code.\n */\nconst DEFINITION_LOAD_FAILED = 'Unable to load grasshopper definition';\n\n/** Does this error look like a server-side definition-load miss? */\nfunction isDefinitionLoadMiss(error: unknown): boolean {\n\tif (!(error instanceof RhinoComputeError)) return false;\n\treturn (\n\t\terror.code === ErrorCodes.DEFINITION_NOT_CACHED ||\n\t\terror.message.includes(DEFINITION_LOAD_FAILED)\n\t);\n}\n\n/**\n * Debug aid: a solve can return successfully yet hand back outputs whose\n * `InnerTree` is empty (`{}`), meaning that parameter produced nothing — often a\n * sign the definition didn't actually compute (wrong/missing inputs, a guarded\n * branch). The names tell you exactly which output was empty so you can trace it\n * back to the responsible branch.\n *\n * Only logs when `debug` is set: an empty output can be legitimate, so this is a\n * diagnostic, never a hard failure. Reads `ParamName` / `InnerTree`\n * case-insensitively to stay robust across server-branch casing.\n *\n * @internal Exported for testing.\n */\nexport function warnOnEmptyInnerTrees(response: GrasshopperComputeResponse, debug?: boolean): void {\n\tif (!debug) return;\n\n\tconst values = readField<unknown[]>(response, 'values');\n\tif (!Array.isArray(values) || values.length === 0) return;\n\n\tconst empty: string[] = [];\n\tfor (const param of values) {\n\t\tconst innerTree = readField<Record<string, unknown>>(param, 'innerTree');\n\t\t// Treat a missing or empty innerTree as \"produced nothing\".\n\t\tif (!innerTree || Object.keys(innerTree).length === 0) {\n\t\t\tempty.push(readField<string>(param, 'paramName') ?? '<unnamed>');\n\t\t}\n\t}\n\n\tif (empty.length === 0) return;\n\n\tconst scope = empty.length === values.length ? 'all' : `${empty.length}/${values.length}`;\n\tgetLogger().warn(\n\t\t`Solve returned empty output(s) (${scope}): ${empty.join(', ')}. ` +\n\t\t\t`These parameters produced no data — check the definition's inputs and the branch feeding each.`\n\t);\n}\n\n/**\n * Result of a solve that also reports the definition's server-side cache key.\n *\n * `cacheKey` is the `md5_…` identifier the server assigned to the (base64)\n * definition — stable for identical content. A caller that holds it can solve\n * the same definition again by reference (`pointer: cacheKey`) instead of\n * re-uploading the full base64, which matters a lot for large (multi-MB)\n * definitions on a live UI. For a URL-pointer solve the server echoes the\n * request schema back, so `cacheKey` is the definition URL itself (already a\n * reference — nothing gained by re-pointing at it). `null` only when the\n * server's response carried no `pointer` at all — do NOT use `null` to detect\n * URL-pointer solves.\n */\nexport interface SolveWithCacheKey {\n\tresponse: GrasshopperComputeResponse;\n\tcacheKey: string | null;\n}\n\n/**\n * Runs a Rhino Compute job using the provided tree prototypes and Grasshopper definition.\n *\n * @public Use this for direct compute control. For high-level API, use `GrasshopperClient.solve()`.\n *\n * @param dataTree - An array of `DataTree` objects representing the input data for the compute job.\n * @param definition - The Grasshopper definition, which can be:\n *   - A URL string (e.g., 'https://example.com/definition.gh')\n *   - A base64-encoded string of the .gh file\n *   - A plain string (will be base64-encoded)\n *   - A Uint8Array of the .gh file (will be base64-encoded)\n *   - A `DefinitionRef` (bytes are loaded via `ref.load()` for the upload)\n * @param config - Compute configuration (server URL, API key, etc. along with optional timeout, units, etc.)\n * @returns An object containing the compute result and extracted file data.\n *\n * @example\n * // Using a URL\n * await solveGrasshopperDefinition(trees, 'https://example.com/definition.gh', config);\n *\n * // Using a base64 string\n * await solveGrasshopperDefinition(trees, 'UEsDBBQAAAAIAL...', config);\n *\n * // Using binary data\n * const fileData = new Uint8Array([...]);\n * await solveGrasshopperDefinition(trees, fileData, config);\n */\nexport async function solveGrasshopperDefinition(\n\tdataTree: DataTree[],\n\tdefinition: SolveDefinition,\n\tconfig: GrasshopperComputeConfig\n): Promise<GrasshopperComputeResponse> {\n\t// Not gated on `debug`: exposing an API key in the browser is a security\n\t// concern in every configuration. `suppressBrowserWarning` is the opt-out.\n\twarnIfClientSide(\n\t\t'solveGrasshopperDefinition',\n\t\tconfig.suppressBrowserWarning ?? config.suppressClientSideWarning\n\t);\n\n\tconst bytes = await materializeDefinition(definition);\n\tconst { response } = await runSolve(prepareGrasshopperArgs(bytes, dataTree), config);\n\treturn response;\n}\n\n/**\n * Solve while reporting the server's definition cache key.\n *\n * Behaves like {@link solveGrasshopperDefinition} but returns the `cacheKey` the\n * server assigned, so a caller (e.g. the scheduler) can later solve the same\n * definition by reference instead of re-uploading it. The cache key is only\n * meaningful for base64/binary definitions; a URL-pointer solve returns the URL.\n *\n * @internal\n */\nexport async function solveGrasshopperDefinitionWithCacheKey(\n\tdataTree: DataTree[],\n\tdefinition: SolveDefinition,\n\tconfig: GrasshopperComputeConfig\n): Promise<SolveWithCacheKey> {\n\twarnIfClientSide(\n\t\t'solveGrasshopperDefinitionWithCacheKey',\n\t\tconfig.suppressBrowserWarning ?? config.suppressClientSideWarning\n\t);\n\n\tconst bytes = await materializeDefinition(definition);\n\treturn runSolve(prepareGrasshopperArgs(bytes, dataTree), config);\n}\n\n/**\n * Solve a definition by its server-side cache key (`pointer: cacheKey`),\n * skipping the (potentially multi-MB) base64 upload. If the key has been evicted\n * from the server's definition cache — `DEFINITION_LOAD_FAILED` — transparently\n * retry once with the full `definition` and report the fresh cache key so the\n * caller can update its mapping. A `DefinitionRef` definition is only\n * materialized (`ref.load()`) inside that miss branch — a pointer hit never\n * touches the bytes.\n *\n * @returns The solve result plus the (possibly refreshed) cache key, and whether\n *   the fast path missed (so callers can record the new key / track hit rate).\n * @internal\n */\nexport async function solveByCacheKey(\n\tdataTree: DataTree[],\n\tcacheKey: string,\n\tdefinition: SolveDefinition,\n\tconfig: GrasshopperComputeConfig\n): Promise<SolveWithCacheKey & { missed: boolean }> {\n\twarnIfClientSide(\n\t\t'solveByCacheKey',\n\t\tconfig.suppressBrowserWarning ?? config.suppressClientSideWarning\n\t);\n\n\tconst pointerArgs: GrasshopperRequestSchema = { algo: null, pointer: cacheKey, values: dataTree };\n\n\ttry {\n\t\tconst fast = await runSolve(pointerArgs, config);\n\t\treturn { ...fast, missed: false };\n\t} catch (error) {\n\t\tif (!isDefinitionLoadMiss(error)) throw error;\n\t\t// Cache miss — fall back to the full upload and capture the fresh key.\n\t\tconst bytes = await materializeDefinition(definition);\n\t\tconst full = await runSolve(prepareGrasshopperArgs(bytes, dataTree), config);\n\t\treturn { ...full, missed: true };\n\t}\n}\n\n/**\n * Resolve a definition to uploadable form: a `DefinitionRef` is materialized\n * via `load()` (failures are wrapped so callers get a `RhinoComputeError`\n * naming the ref, not an opaque loader exception); other forms pass through.\n */\nasync function materializeDefinition(definition: SolveDefinition): Promise<string | Uint8Array> {\n\tif (!isDefinitionRef(definition)) return definition;\n\ttry {\n\t\treturn await definition.load();\n\t} catch (error) {\n\t\tthrow new RhinoComputeError(\n\t\t\t`Failed to load definition bytes for ref '${definition.key}'`,\n\t\t\tErrorCodes.INVALID_INPUT,\n\t\t\t{\n\t\t\t\tcontext: { definitionKey: definition.key },\n\t\t\t\toriginalError: error instanceof Error ? error : new Error(String(error))\n\t\t\t}\n\t\t);\n\t}\n}\n\n/**\n * Shared solve body: apply optional settings, POST, and split the server's\n * `pointer` (its cache key) off the response. `algo` — the request's full\n * base64 definition echoed back on every solve — is stripped too: keeping it\n * pins a multi-MB copy per response, multiplied by every cache holding\n * responses (the scheduler's LRU alone up to `maxEntries` times). Stripping via\n * shallow copy rather than `delete` keeps any already-observed response object\n * unmutated.\n */\nasync function runSolve(\n\targs: GrasshopperRequestSchema,\n\tconfig: GrasshopperComputeConfig\n): Promise<SolveWithCacheKey> {\n\tapplyOptionalComputeSettings(args, config);\n\n\tconst result = await fetchRhinoCompute<GrasshopperComputeResponse>('grasshopper', args, config);\n\n\tconst {\n\t\tpointer,\n\t\talgo: _algo,\n\t\t...rest\n\t} = result as GrasshopperComputeResponse & { pointer?: unknown; algo?: unknown };\n\tconst response = rest as GrasshopperComputeResponse;\n\t// The wire-size hint follows object identity, so the stripped copy must\n\t// re-register it — minus the echoed `algo`, which is no longer retained (it\n\t// can dwarf the actual outputs for a large definition).\n\tconst wireSize = getResponseWireSize(result);\n\tif (wireSize !== undefined) {\n\t\tconst algoLength = typeof _algo === 'string' ? _algo.length : 0;\n\t\tsetResponseWireSize(response, Math.max(0, wireSize - algoLength));\n\t}\n\twarnOnEmptyInnerTrees(response, config.debug);\n\treturn {\n\t\tresponse,\n\t\tcacheKey: typeof pointer === 'string' ? pointer : null\n\t};\n}\n\n// ============================================================================\n// Grasshopper Arguments\n// ============================================================================\n\n/**\n * Prepares Grasshopper arguments from a definition and data tree.\n * Automatically detects the definition format and converts it appropriately.\n *\n * @param definition - Can be a URL, base64 string, plain string, or Uint8Array\n * @param dataTree - Array of DataTree objects for compute inputs\n * @internal\n */\nexport function prepareGrasshopperArgs(\n\tdefinition: string | Uint8Array,\n\tdataTree: DataTree[]\n): GrasshopperRequestSchema {\n\tconst args: GrasshopperRequestSchema = {\n\t\talgo: null,\n\t\tpointer: null,\n\t\tvalues: dataTree\n\t};\n\n\tif (definition instanceof Uint8Array) {\n\t\t// Binary data → convert to base64\n\t\targs.algo = base64ByteArray(definition);\n\t} else if (/^https?:\\/\\//i.test(definition)) {\n\t\t// URL → use as pointer reference\n\t\targs.pointer = definition;\n\t} else {\n\t\t// Base64 detection is a heuristic (see detectBase64Payload): only long\n\t\t// (≥64 data chars), canonical base64 is passed through — normalized, so\n\t\t// newline-wrapped/unpadded definitions reach the server decodable instead\n\t\t// of double-encoded. Everything else (incl. short base64-shaped strings\n\t\t// like \"test\") is treated as a plain string and encoded. Pass a\n\t\t// Uint8Array to bypass sniffing entirely.\n\t\targs.algo = detectBase64Payload(definition) ?? encodeStringToBase64(definition);\n\t}\n\n\treturn args;\n}\n\n/**\n * @internal\n */\nexport function applyOptionalComputeSettings(\n\targlist: GrasshopperRequestSchema,\n\toptions: GrasshopperComputeConfig\n): void {\n\tif (options.cachesolve != null) arglist.cachesolve = options.cachesolve;\n\tif (options.cacheerroredsolves != null) arglist.cacheerroredsolves = options.cacheerroredsolves;\n\tif (options.modelunits != null) arglist.modelunits = options.modelunits;\n\tif (options.angletolerance != null) arglist.angletolerance = options.angletolerance;\n\tif (options.absolutetolerance != null) arglist.absolutetolerance = options.absolutetolerance;\n\tif (options.dataversion != null) arglist.dataversion = options.dataversion;\n}\n"]}
+{"version":3,"sources":["/home/runner/work/selva/selva/packages/compute/dist/chunk-BVMGO7IG.cjs","../src/core/utils/warnings.ts","../src/grasshopper/definition-ref.ts","../src/grasshopper/solve.ts"],"names":["warnedFunctions","isRealBrowser","nav","userAgent","warnIfClientSide","functionName","suppress","getLogger","isDefinitionRef","definition","DEFINITION_LOAD_FAILED","isDefinitionLoadMiss","error","RhinoComputeError","ErrorCodes","warnOnEmptyInnerTrees","response","debug","values","readField","empty","param","innerTree","scope"],"mappings":"AAAA,yuBAA2I,ICGrIA,EAAAA,CAAkB,IAAI,GAAA,CAa5B,SAASC,EAAAA,CAAAA,CAAyB,CAIjC,EAAA,CAHI,OAAO,MAAA,CAAW,GAAA,kBAER,UAAA,qBAA+D,OAAA,6BACnE,QAAA,6BAAU,MAAA,EAAQ,IAAA,CAAM,MAAO,CAAA,CAAA,CAEzC,IAAMC,CAAAA,CAAO,UAAA,CAAuD,SAAA,CAC9DC,CAAAA,CAAY,uBAAOD,CAAAA,6BAAK,WAAA,EAAc,QAAA,CAAWA,CAAAA,CAAI,SAAA,CAAY,EAAA,CACvE,MAAI,CAAA,QAAA,CAAS,IAAA,CAAKC,CAAS,CAG5B,CAEO,SAASC,CAAAA,CAAiBC,CAAAA,CAAsBC,CAAAA,CAA0B,CAC5EA,CAAAA,EAIAL,EAAAA,CAAc,CAAA,EAAK,CAACD,EAAAA,CAAgB,GAAA,CAAIK,CAAY,CAAA,EAAA,CACvDL,EAAAA,CAAgB,GAAA,CAAIK,CAAY,CAAA,CAChCE,iCAAAA,CAAU,CAAE,IAAA,CACX,CAAA,SAAA,EAAYF,CAAY,CAAA,8GAAA,CACzB,CAAA,CAEF,CCKO,SAASG,CAAAA,CAAgBC,CAAAA,CAA0D,CACzF,OACC,OAAOA,CAAAA,EAAe,QAAA,EACtB,CAAA,CAAEA,EAAAA,WAAsB,UAAA,CAAA,EACxB,OAAOA,CAAAA,CAAW,GAAA,EAAQ,QAAA,EAC1B,OAAOA,CAAAA,CAAW,IAAA,EAAS,UAE7B,CCvBA,IAAMC,EAAAA,CAAyB,uCAAA,CAG/B,SAASC,EAAAA,CAAqBC,CAAAA,CAAyB,CACtD,OAAMA,EAAAA,WAAiBC,mBAAAA,CAEtBD,CAAAA,CAAM,IAAA,GAASE,mBAAAA,CAAW,qBAAA,EAC1BF,CAAAA,CAAM,OAAA,CAAQ,QAAA,CAASF,EAAsB,CAAA,CAHI,CAAA,CAKnD,CAeO,SAASK,EAAAA,CAAsBC,CAAAA,CAAsCC,CAAAA,CAAuB,CAClG,EAAA,CAAI,CAACA,CAAAA,CAAO,MAAA,CAEZ,IAAMC,CAAAA,CAASC,iCAAAA,CAAqBH,CAAU,QAAQ,CAAA,CACtD,EAAA,CAAI,CAAC,KAAA,CAAM,OAAA,CAAQE,CAAM,CAAA,EAAKA,CAAAA,CAAO,MAAA,GAAW,CAAA,CAAG,MAAA,CAEnD,IAAME,CAAAA,CAAkB,CAAC,CAAA,CACzB,GAAA,CAAA,IAAWC,EAAAA,GAASH,CAAAA,CAAQ,CAC3B,IAAMI,CAAAA,CAAYH,iCAAAA,CAAmCE,CAAO,WAAW,CAAA,CAAA,CAEnE,CAACC,CAAAA,EAAa,MAAA,CAAO,IAAA,CAAKA,CAAS,CAAA,CAAE,MAAA,GAAW,CAAA,CAAA,EACnDF,CAAAA,CAAM,IAAA,kBAAKD,iCAAAA,CAAkBE,CAAO,WAAW,CAAA,SAAK,aAAW,CAEjE,CAEA,EAAA,CAAID,CAAAA,CAAM,MAAA,GAAW,CAAA,CAAG,MAAA,CAExB,IAAMG,CAAAA,CAAQH,CAAAA,CAAM,MAAA,GAAWF,CAAAA,CAAO,MAAA,CAAS,KAAA,CAAQ,CAAA,EAAA","file":"/home/runner/work/selva/selva/packages/compute/dist/chunk-BVMGO7IG.cjs","sourcesContent":[null,"import { getLogger } from './logger';\n\n/** Functions that already warned — the exposure risk doesn't change per call, so once is enough. */\nconst warnedFunctions = new Set<string>();\n\n/**\n * True only in a GENUINE browser/worker context — the case where an API key in\n * the config is actually exposed to end users. `typeof window !== 'undefined'`\n * alone is not enough: jsdom test environments define `window` too, and every\n * unsuppressed vitest/jest run would warn noisily (issue 110).\n *\n * Detection: `window` must exist, AND we must not be in Node (jsdom runs in\n * Node, so `process.versions.node` is defined there but never in a real\n * browser), AND the user agent must not carry jsdom's marker (belt-and-braces\n * for exotic setups that hide `process`). Genuine browsers pass all three.\n */\nfunction isRealBrowser(): boolean {\n\tif (typeof window === 'undefined') return false;\n\n\tconst proc = (globalThis as { process?: { versions?: { node?: unknown } } }).process;\n\tif (proc?.versions?.node != null) return false;\n\n\tconst nav = (globalThis as { navigator?: { userAgent?: unknown } }).navigator;\n\tconst userAgent = typeof nav?.userAgent === 'string' ? nav.userAgent : '';\n\tif (/jsdom/i.test(userAgent)) return false;\n\n\treturn true;\n}\n\nexport function warnIfClientSide(functionName: string, suppress?: boolean): void {\n\tif (suppress) {\n\t\treturn;\n\t}\n\n\tif (isRealBrowser() && !warnedFunctions.has(functionName)) {\n\t\twarnedFunctions.add(functionName);\n\t\tgetLogger().warn(\n\t\t\t`Warning: ${functionName} is running on the client side. For better performance and security, consider running this on the server side.`\n\t\t);\n\t}\n}\n\n/** @internal Reset the once-per-function dedupe — for tests only. */\nexport function resetClientSideWarnings(): void {\n\twarnedFunctions.clear();\n}\n","/**\n * By-reference definition form for solves.\n *\n * Lets a caller that already knows a definition's identity (e.g. a stored\n * version's UUID) schedule solves without materializing the multi-MB bytes:\n * cache keys and the server-pointer map are derived from `key` alone, and\n * `load()` is only called when an upload is genuinely unavoidable (first solve\n * of a definition, or a server-side pointer miss).\n */\n\n/**\n * A definition identified by a stable key, with bytes materialized on demand.\n *\n * **Immutability contract — read this before constructing one.** `key` must\n * identify IMMUTABLE bytes: every `load()` for a given `key` must return the\n * same content, forever. All caching (the scheduler's result cache, the\n * server-pointer map, and any durable cache built on these keys) trusts the\n * key as the definition's identity WITHOUT looking at the bytes. If two\n * different byte contents ever share a key, cached solves from one are served\n * for the other — silent cache poisoning with no diagnostic. Use an identity\n * that can never be reused for different content (e.g. a version UUID), never\n * a mutable name or path.\n */\nexport interface DefinitionRef {\n\t/**\n\t * Identity of immutable bytes (e.g. a version UUID). Two different byte\n\t * contents must never share a key — cache poisoning otherwise.\n\t */\n\tkey: string;\n\t/**\n\t * Materialize the bytes. Called ONLY when an upload is unavoidable — inside\n\t * the solve execution, so it counts toward the solve's abort semantics.\n\t */\n\tload: () => Promise<Uint8Array>;\n}\n\n/**\n * Every definition form accepted by the solve entry points:\n * - a URL, base64 string, or plain string (content-hashed for caching)\n * - raw `.gh` bytes (content-hashed)\n * - a {@link DefinitionRef} (identity-keyed; bytes loaded lazily)\n */\nexport type SolveDefinition = string | Uint8Array | DefinitionRef;\n\n/** Narrow a {@link SolveDefinition} to the by-reference form. */\nexport function isDefinitionRef(definition: SolveDefinition): definition is DefinitionRef {\n\treturn (\n\t\ttypeof definition === 'object' &&\n\t\t!(definition instanceof Uint8Array) &&\n\t\ttypeof definition.key === 'string' &&\n\t\ttypeof definition.load === 'function'\n\t);\n}\n","import { fetchRhinoCompute, RhinoComputeError, ErrorCodes } from '@/core';\nimport { getResponseWireSize, setResponseWireSize } from '@/core/compute-fetch/wire-size';\nimport { base64ByteArray, detectBase64Payload, encodeStringToBase64 } from '@/core/utils/encoding';\nimport { getLogger } from '@/core/utils/logger';\nimport { readField } from '@/core/utils/read-field';\nimport { warnIfClientSide } from '@/core/utils/warnings';\n\nimport {\n\tGrasshopperRequestSchema,\n\tGrasshopperComputeConfig,\n\tGrasshopperComputeResponse,\n\tDataTree\n} from './types';\nimport { isDefinitionRef, type SolveDefinition } from './definition-ref';\n\n/**\n * The exact message the server throws when it can neither resolve a `pointer`\n * nor a base64 `algo` to a definition (ResthopperEndpoints.cs). This is the\n * signal that a cache-key pointer missed the server's definition cache (GC'd, or\n * a different child in the pool), so the caller should retry with the full\n * definition. Matched as a substring because the server wraps it with a category\n * prefix in its exception handler.\n *\n * NOTE: the server only includes this message when running in debug mode; its\n * production exception handler scrubs the message to a generic string. The\n * reliable signal is therefore {@link ErrorCodes.DEFINITION_NOT_CACHED}, derived\n * from the server's machine `code` (which isn't scrubbed). The string match is\n * kept as a fallback for debug-mode servers and forks that don't yet emit a code.\n */\nconst DEFINITION_LOAD_FAILED = 'Unable to load grasshopper definition';\n\n/** Does this error look like a server-side definition-load miss? */\nfunction isDefinitionLoadMiss(error: unknown): boolean {\n\tif (!(error instanceof RhinoComputeError)) return false;\n\treturn (\n\t\terror.code === ErrorCodes.DEFINITION_NOT_CACHED ||\n\t\terror.message.includes(DEFINITION_LOAD_FAILED)\n\t);\n}\n\n/**\n * Debug aid: a solve can return successfully yet hand back outputs whose\n * `InnerTree` is empty (`{}`), meaning that parameter produced nothing — often a\n * sign the definition didn't actually compute (wrong/missing inputs, a guarded\n * branch). The names tell you exactly which output was empty so you can trace it\n * back to the responsible branch.\n *\n * Only logs when `debug` is set: an empty output can be legitimate, so this is a\n * diagnostic, never a hard failure. Reads `ParamName` / `InnerTree`\n * case-insensitively to stay robust across server-branch casing.\n *\n * @internal Exported for testing.\n */\nexport function warnOnEmptyInnerTrees(response: GrasshopperComputeResponse, debug?: boolean): void {\n\tif (!debug) return;\n\n\tconst values = readField<unknown[]>(response, 'values');\n\tif (!Array.isArray(values) || values.length === 0) return;\n\n\tconst empty: string[] = [];\n\tfor (const param of values) {\n\t\tconst innerTree = readField<Record<string, unknown>>(param, 'innerTree');\n\t\t// Treat a missing or empty innerTree as \"produced nothing\".\n\t\tif (!innerTree || Object.keys(innerTree).length === 0) {\n\t\t\tempty.push(readField<string>(param, 'paramName') ?? '<unnamed>');\n\t\t}\n\t}\n\n\tif (empty.length === 0) return;\n\n\tconst scope = empty.length === values.length ? 'all' : `${empty.length}/${values.length}`;\n\tgetLogger().warn(\n\t\t`Solve returned empty output(s) (${scope}): ${empty.join(', ')}. ` +\n\t\t\t`These parameters produced no data — check the definition's inputs and the branch feeding each.`\n\t);\n}\n\n/**\n * Result of a solve that also reports the definition's server-side cache key.\n *\n * `cacheKey` is the `md5_…` identifier the server assigned to the (base64)\n * definition — stable for identical content. A caller that holds it can solve\n * the same definition again by reference (`pointer: cacheKey`) instead of\n * re-uploading the full base64, which matters a lot for large (multi-MB)\n * definitions on a live UI. For a URL-pointer solve the server echoes the\n * request schema back, so `cacheKey` is the definition URL itself (already a\n * reference — nothing gained by re-pointing at it). `null` only when the\n * server's response carried no `pointer` at all — do NOT use `null` to detect\n * URL-pointer solves.\n */\nexport interface SolveWithCacheKey {\n\tresponse: GrasshopperComputeResponse;\n\tcacheKey: string | null;\n}\n\n/**\n * Runs a Rhino Compute job using the provided tree prototypes and Grasshopper definition.\n *\n * @public Use this for direct compute control. For high-level API, use `GrasshopperClient.solve()`.\n *\n * @param dataTree - An array of `DataTree` objects representing the input data for the compute job.\n * @param definition - The Grasshopper definition, which can be:\n *   - A URL string (e.g., 'https://example.com/definition.gh')\n *   - A base64-encoded string of the .gh file\n *   - A plain string (will be base64-encoded)\n *   - A Uint8Array of the .gh file (will be base64-encoded)\n *   - A `DefinitionRef` (bytes are loaded via `ref.load()` for the upload)\n * @param config - Compute configuration (server URL, API key, etc. along with optional timeout, units, etc.)\n * @returns An object containing the compute result and extracted file data.\n *\n * @example\n * // Using a URL\n * await solveGrasshopperDefinition(trees, 'https://example.com/definition.gh', config);\n *\n * // Using a base64 string\n * await solveGrasshopperDefinition(trees, 'UEsDBBQAAAAIAL...', config);\n *\n * // Using binary data\n * const fileData = new Uint8Array([...]);\n * await solveGrasshopperDefinition(trees, fileData, config);\n */\nexport async function solveGrasshopperDefinition(\n\tdataTree: DataTree[],\n\tdefinition: SolveDefinition,\n\tconfig: GrasshopperComputeConfig\n): Promise<GrasshopperComputeResponse> {\n\t// Not gated on `debug`: exposing an API key in the browser is a security\n\t// concern in every configuration. `suppressBrowserWarning` is the opt-out.\n\twarnIfClientSide(\n\t\t'solveGrasshopperDefinition',\n\t\tconfig.suppressBrowserWarning ?? config.suppressClientSideWarning\n\t);\n\n\tconst bytes = await materializeDefinition(definition);\n\tconst { response } = await runSolve(prepareGrasshopperArgs(bytes, dataTree), config);\n\treturn response;\n}\n\n/**\n * Solve while reporting the server's definition cache key.\n *\n * Behaves like {@link solveGrasshopperDefinition} but returns the `cacheKey` the\n * server assigned, so a caller (e.g. the scheduler) can later solve the same\n * definition by reference instead of re-uploading it. The cache key is only\n * meaningful for base64/binary definitions; a URL-pointer solve returns the URL.\n *\n * @internal\n */\nexport async function solveGrasshopperDefinitionWithCacheKey(\n\tdataTree: DataTree[],\n\tdefinition: SolveDefinition,\n\tconfig: GrasshopperComputeConfig\n): Promise<SolveWithCacheKey> {\n\twarnIfClientSide(\n\t\t'solveGrasshopperDefinitionWithCacheKey',\n\t\tconfig.suppressBrowserWarning ?? config.suppressClientSideWarning\n\t);\n\n\tconst bytes = await materializeDefinition(definition);\n\treturn runSolve(prepareGrasshopperArgs(bytes, dataTree), config);\n}\n\n/**\n * Solve a definition by its server-side cache key (`pointer: cacheKey`),\n * skipping the (potentially multi-MB) base64 upload. If the key has been evicted\n * from the server's definition cache — `DEFINITION_LOAD_FAILED` — transparently\n * retry once with the full `definition` and report the fresh cache key so the\n * caller can update its mapping. A `DefinitionRef` definition is only\n * materialized (`ref.load()`) inside that miss branch — a pointer hit never\n * touches the bytes.\n *\n * @returns The solve result plus the (possibly refreshed) cache key, and whether\n *   the fast path missed (so callers can record the new key / track hit rate).\n * @internal\n */\nexport async function solveByCacheKey(\n\tdataTree: DataTree[],\n\tcacheKey: string,\n\tdefinition: SolveDefinition,\n\tconfig: GrasshopperComputeConfig\n): Promise<SolveWithCacheKey & { missed: boolean }> {\n\twarnIfClientSide(\n\t\t'solveByCacheKey',\n\t\tconfig.suppressBrowserWarning ?? config.suppressClientSideWarning\n\t);\n\n\tconst pointerArgs: GrasshopperRequestSchema = { algo: null, pointer: cacheKey, values: dataTree };\n\n\ttry {\n\t\tconst fast = await runSolve(pointerArgs, config);\n\t\treturn { ...fast, missed: false };\n\t} catch (error) {\n\t\tif (!isDefinitionLoadMiss(error)) throw error;\n\t\t// Cache miss — fall back to the full upload and capture the fresh key.\n\t\tconst bytes = await materializeDefinition(definition);\n\t\tconst full = await runSolve(prepareGrasshopperArgs(bytes, dataTree), config);\n\t\treturn { ...full, missed: true };\n\t}\n}\n\n/**\n * Resolve a definition to uploadable form: a `DefinitionRef` is materialized\n * via `load()` (failures are wrapped so callers get a `RhinoComputeError`\n * naming the ref, not an opaque loader exception); other forms pass through.\n */\nasync function materializeDefinition(definition: SolveDefinition): Promise<string | Uint8Array> {\n\tif (!isDefinitionRef(definition)) return definition;\n\ttry {\n\t\treturn await definition.load();\n\t} catch (error) {\n\t\tthrow new RhinoComputeError(\n\t\t\t`Failed to load definition bytes for ref '${definition.key}'`,\n\t\t\tErrorCodes.INVALID_INPUT,\n\t\t\t{\n\t\t\t\tcontext: { definitionKey: definition.key },\n\t\t\t\toriginalError: error instanceof Error ? error : new Error(String(error))\n\t\t\t}\n\t\t);\n\t}\n}\n\n/**\n * Shared solve body: apply optional settings, POST, and split the server's\n * `pointer` (its cache key) off the response. `algo` — the request's full\n * base64 definition echoed back on every solve — is stripped too: keeping it\n * pins a multi-MB copy per response, which would consume the scheduler cache's\n * byte budget many times over. Stripping via shallow copy rather than `delete`\n * keeps any already-observed response object unmutated.\n */\nasync function runSolve(\n\targs: GrasshopperRequestSchema,\n\tconfig: GrasshopperComputeConfig\n): Promise<SolveWithCacheKey> {\n\tapplyOptionalComputeSettings(args, config);\n\n\tconst result = await fetchRhinoCompute<GrasshopperComputeResponse>('grasshopper', args, config);\n\n\tconst {\n\t\tpointer,\n\t\talgo: _algo,\n\t\t...rest\n\t} = result as GrasshopperComputeResponse & { pointer?: unknown; algo?: unknown };\n\tconst response = rest as GrasshopperComputeResponse;\n\t// The wire-size hint follows object identity, so the stripped copy must\n\t// re-register it — minus the echoed `algo`, which is no longer retained (it\n\t// can dwarf the actual outputs for a large definition).\n\tconst wireSize = getResponseWireSize(result);\n\tif (wireSize !== undefined) {\n\t\tconst algoLength = typeof _algo === 'string' ? _algo.length : 0;\n\t\tsetResponseWireSize(response, Math.max(0, wireSize - algoLength));\n\t}\n\twarnOnEmptyInnerTrees(response, config.debug);\n\treturn {\n\t\tresponse,\n\t\tcacheKey: typeof pointer === 'string' ? pointer : null\n\t};\n}\n\n// ============================================================================\n// Grasshopper Arguments\n// ============================================================================\n\n/**\n * Prepares Grasshopper arguments from a definition and data tree.\n * Automatically detects the definition format and converts it appropriately.\n *\n * @param definition - Can be a URL, base64 string, plain string, or Uint8Array\n * @param dataTree - Array of DataTree objects for compute inputs\n * @internal\n */\nexport function prepareGrasshopperArgs(\n\tdefinition: string | Uint8Array,\n\tdataTree: DataTree[]\n): GrasshopperRequestSchema {\n\tconst args: GrasshopperRequestSchema = {\n\t\talgo: null,\n\t\tpointer: null,\n\t\tvalues: dataTree\n\t};\n\n\tif (definition instanceof Uint8Array) {\n\t\t// Binary data → convert to base64\n\t\targs.algo = base64ByteArray(definition);\n\t} else if (/^https?:\\/\\//i.test(definition)) {\n\t\t// URL → use as pointer reference\n\t\targs.pointer = definition;\n\t} else {\n\t\t// Base64 detection is a heuristic (see detectBase64Payload): only long\n\t\t// (≥64 data chars), canonical base64 is passed through — normalized, so\n\t\t// newline-wrapped/unpadded definitions reach the server decodable instead\n\t\t// of double-encoded. Everything else (incl. short base64-shaped strings\n\t\t// like \"test\") is treated as a plain string and encoded. Pass a\n\t\t// Uint8Array to bypass sniffing entirely.\n\t\targs.algo = detectBase64Payload(definition) ?? encodeStringToBase64(definition);\n\t}\n\n\treturn args;\n}\n\n/**\n * @internal\n */\nexport function applyOptionalComputeSettings(\n\targlist: GrasshopperRequestSchema,\n\toptions: GrasshopperComputeConfig\n): void {\n\tif (options.cachesolve != null) arglist.cachesolve = options.cachesolve;\n\tif (options.cacheerroredsolves != null) arglist.cacheerroredsolves = options.cacheerroredsolves;\n\tif (options.modelunits != null) arglist.modelunits = options.modelunits;\n\tif (options.angletolerance != null) arglist.angletolerance = options.angletolerance;\n\tif (options.absolutetolerance != null) arglist.absolutetolerance = options.absolutetolerance;\n\tif (options.dataversion != null) arglist.dataversion = options.dataversion;\n}\n"]}

package/dist/grasshopper.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkG7NVQAK5cjs = require('./chunk-G7NVQAK5.cjs');var _chunkLLUNR66Gcjs = require('./chunk-LLUNR66G.cjs');exports.GrasshopperClient = _chunkG7NVQAK5cjs.g; exports.GrasshopperResponseProcessor = _chunkG7NVQAK5cjs.h; exports.SolveScheduler = _chunkG7NVQAK5cjs.f; exports.TreeBuilder = _chunkG7NVQAK5cjs.l; exports.downloadFileData = _chunkLLUNR66Gcjs.u; exports.extractFilesFromComputeResponse = _chunkLLUNR66Gcjs.t; exports.fetchDefinitionIO = _chunkG7NVQAK5cjs.j; exports.fetchParsedDefinitionIO = _chunkG7NVQAK5cjs.k; exports.hashDefinition = _chunkG7NVQAK5cjs.e; exports.hashSolveInput = _chunkG7NVQAK5cjs.d; exports.isDefinitionRef = _chunkG7NVQAK5cjs.a; exports.processInput = _chunkG7NVQAK5cjs.i; exports.solveGrasshopperDefinition = _chunkG7NVQAK5cjs.b; exports.stableStringify = _chunkG7NVQAK5cjs.c;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBVMGO7IGcjs = require('./chunk-BVMGO7IG.cjs');var _chunkLLUNR66Gcjs = require('./chunk-LLUNR66G.cjs');exports.GrasshopperClient = _chunkBVMGO7IGcjs.g; exports.GrasshopperResponseProcessor = _chunkBVMGO7IGcjs.h; exports.SolveScheduler = _chunkBVMGO7IGcjs.f; exports.TreeBuilder = _chunkBVMGO7IGcjs.l; exports.downloadFileData = _chunkLLUNR66Gcjs.u; exports.extractFilesFromComputeResponse = _chunkLLUNR66Gcjs.t; exports.fetchDefinitionIO = _chunkBVMGO7IGcjs.j; exports.fetchParsedDefinitionIO = _chunkBVMGO7IGcjs.k; exports.hashDefinition = _chunkBVMGO7IGcjs.e; exports.hashSolveInput = _chunkBVMGO7IGcjs.d; exports.isDefinitionRef = _chunkBVMGO7IGcjs.a; exports.processInput = _chunkBVMGO7IGcjs.i; exports.solveGrasshopperDefinition = _chunkBVMGO7IGcjs.b; exports.stableStringify = _chunkBVMGO7IGcjs.c;
 //# sourceMappingURL=grasshopper.cjs.map

package/dist/grasshopper.d.cts

@@ -387,19 +387,29 @@ declare function isDefinitionRef(definition: SolveDefinition): definition is Def
  */
 type SchedulerMode = 'latest-wins' | 'queue' | 'parallel';
 interface CacheOptions {
-    /** Maximum entries kept in the LRU. Default: 50. */
-    maxEntries?: number;
-    /**
-     * Total byte budget for retained responses, evicted LRU alongside
-     * `maxEntries` (both bounds apply). Responses range KB→100s of MB, so an
-     * entry count alone can't bound heap. Sizing uses the response's wire size
-     * (JSON text length, recorded at the fetch boundary — no re-serialization);
-     * a response without that hint (custom executor) is sized by a one-off
-     * `JSON.stringify`. A single response larger than the whole budget is
-     * served but never retained. `0` = no byte bound (count-only, default).
-     */
-    maxBytes?: number;
-    /** Time-to-live in ms. Set to `0` for no expiry (default). */
+    /**
+     * Total byte budget for retained responses, evicted LRU. The only size bound
+     * there is: responses range KB→100s of MB, so memory is the constraint that
+     * matters and an entry count would only obscure it.
+     *
+     * Sizing uses the response's wire size (JSON text length, recorded at the
+     * fetch boundary — no re-serialization); a response without that hint
+     * (custom executor) is sized by a one-off `JSON.stringify`. A single
+     * response larger than the whole budget is served but never retained.
+     *
+     * Required and must be > 0 — to disable caching, pass `cache: false`.
+     */
+    maxBytes: number;
+    /**
+     * Time-to-live in ms. Set to `0` for no expiry (default, and the right
+     * choice for a solve keyed by immutable definition+inputs — expiry there
+     * only buys a paid re-solve of an identical answer). Meaningful only when a
+     * definition reaches outside its inputs (external data source, clock), where
+     * a stale result is genuinely wrong rather than merely old.
+     *
+     * Expiry is evaluated lazily on read: an expired entry keeps its bytes
+     * counted against `maxBytes` until that exact key is next consulted.
+     */
     ttlMs?: number;
     /**
      * Cache responses that carry Grasshopper `errors`. Default `true`: an
@@ -433,8 +443,12 @@ interface SolveSchedulerOptions {
     queueWaitMs?: number;
     timeoutMs?: number;
     retry?: RetryPolicy;
-    /** Enable response caching keyed by hash of (definition, dataTree). */
-    cache?: boolean | CacheOptions;
+    /**
+     * Response caching keyed by hash of (definition, dataTree). Omit or pass
+     * `false` to disable; otherwise a byte budget is required, so an unbounded
+     * cache can't be enabled by accident.
+     */
+    cache?: false | CacheOptions;
     /**
      * Reuse the server's definition cache key so a large (base64/binary)
      * definition is uploaded once and subsequent solves reference it by
@@ -541,7 +555,6 @@ declare class SolveScheduler {
     private readonly timeoutMs;
     private readonly retry;
     private readonly cacheEnabled;
-    private readonly cacheMax;
     private readonly cacheMaxBytes;
     private readonly cacheTtl;
     private readonly cacheErroredSolves;

package/dist/grasshopper.d.ts

@@ -387,19 +387,29 @@ declare function isDefinitionRef(definition: SolveDefinition): definition is Def
  */
 type SchedulerMode = 'latest-wins' | 'queue' | 'parallel';
 interface CacheOptions {
-    /** Maximum entries kept in the LRU. Default: 50. */
-    maxEntries?: number;
-    /**
-     * Total byte budget for retained responses, evicted LRU alongside
-     * `maxEntries` (both bounds apply). Responses range KB→100s of MB, so an
-     * entry count alone can't bound heap. Sizing uses the response's wire size
-     * (JSON text length, recorded at the fetch boundary — no re-serialization);
-     * a response without that hint (custom executor) is sized by a one-off
-     * `JSON.stringify`. A single response larger than the whole budget is
-     * served but never retained. `0` = no byte bound (count-only, default).
-     */
-    maxBytes?: number;
-    /** Time-to-live in ms. Set to `0` for no expiry (default). */
+    /**
+     * Total byte budget for retained responses, evicted LRU. The only size bound
+     * there is: responses range KB→100s of MB, so memory is the constraint that
+     * matters and an entry count would only obscure it.
+     *
+     * Sizing uses the response's wire size (JSON text length, recorded at the
+     * fetch boundary — no re-serialization); a response without that hint
+     * (custom executor) is sized by a one-off `JSON.stringify`. A single
+     * response larger than the whole budget is served but never retained.
+     *
+     * Required and must be > 0 — to disable caching, pass `cache: false`.
+     */
+    maxBytes: number;
+    /**
+     * Time-to-live in ms. Set to `0` for no expiry (default, and the right
+     * choice for a solve keyed by immutable definition+inputs — expiry there
+     * only buys a paid re-solve of an identical answer). Meaningful only when a
+     * definition reaches outside its inputs (external data source, clock), where
+     * a stale result is genuinely wrong rather than merely old.
+     *
+     * Expiry is evaluated lazily on read: an expired entry keeps its bytes
+     * counted against `maxBytes` until that exact key is next consulted.
+     */
     ttlMs?: number;
     /**
      * Cache responses that carry Grasshopper `errors`. Default `true`: an
@@ -433,8 +443,12 @@ interface SolveSchedulerOptions {
     queueWaitMs?: number;
     timeoutMs?: number;
     retry?: RetryPolicy;
-    /** Enable response caching keyed by hash of (definition, dataTree). */
-    cache?: boolean | CacheOptions;
+    /**
+     * Response caching keyed by hash of (definition, dataTree). Omit or pass
+     * `false` to disable; otherwise a byte budget is required, so an unbounded
+     * cache can't be enabled by accident.
+     */
+    cache?: false | CacheOptions;
     /**
      * Reuse the server's definition cache key so a large (base64/binary)
      * definition is uploaded once and subsequent solves reference it by
@@ -541,7 +555,6 @@ declare class SolveScheduler {
     private readonly timeoutMs;
     private readonly retry;
     private readonly cacheEnabled;
-    private readonly cacheMax;
     private readonly cacheMaxBytes;
     private readonly cacheTtl;
     private readonly cacheErroredSolves;

package/dist/grasshopper.js

@@ -1,2 +1,2 @@
-import{a as c,b as d,c as e,d as f,e as g,f as h,g as i,h as j,i as k,j as l,k as m,l as n}from"./chunk-RFFCVRKM.js";import{t as a,u as b}from"./chunk-XT3XWDDV.js";export{i as GrasshopperClient,j as GrasshopperResponseProcessor,h as SolveScheduler,n as TreeBuilder,b as downloadFileData,a as extractFilesFromComputeResponse,l as fetchDefinitionIO,m as fetchParsedDefinitionIO,g as hashDefinition,f as hashSolveInput,c as isDefinitionRef,k as processInput,d as solveGrasshopperDefinition,e as stableStringify};
+import{a as c,b as d,c as e,d as f,e as g,f as h,g as i,h as j,i as k,j as l,k as m,l as n}from"./chunk-BCVDB6AE.js";import{t as a,u as b}from"./chunk-XT3XWDDV.js";export{i as GrasshopperClient,j as GrasshopperResponseProcessor,h as SolveScheduler,n as TreeBuilder,b as downloadFileData,a as extractFilesFromComputeResponse,l as fetchDefinitionIO,m as fetchParsedDefinitionIO,g as hashDefinition,f as hashSolveInput,c as isDefinitionRef,k as processInput,d as solveGrasshopperDefinition,e as stableStringify};
 //# sourceMappingURL=grasshopper.js.map

package/dist/index.cjs

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkG7NVQAK5cjs = require('./chunk-G7NVQAK5.cjs');var _chunkLLUNR66Gcjs = require('./chunk-LLUNR66G.cjs');exports.ComputeServerStats = _chunkLLUNR66Gcjs.o; exports.ErrorCodes = _chunkLLUNR66Gcjs.b; exports.GrasshopperClient = _chunkG7NVQAK5cjs.g; exports.GrasshopperResponseProcessor = _chunkG7NVQAK5cjs.h; exports.RhinoComputeError = _chunkLLUNR66Gcjs.c; exports.SolveScheduler = _chunkG7NVQAK5cjs.f; exports.TreeBuilder = _chunkG7NVQAK5cjs.l; exports.camelcaseKeys = _chunkLLUNR66Gcjs.q; exports.decodeBase64ToBinary = _chunkLLUNR66Gcjs.f; exports.downloadFileData = _chunkLLUNR66Gcjs.u; exports.enableDebugLogging = _chunkLLUNR66Gcjs.j; exports.extractFilesFromComputeResponse = _chunkLLUNR66Gcjs.t; exports.fetchDefinitionIO = _chunkG7NVQAK5cjs.j; exports.fetchParsedDefinitionIO = _chunkG7NVQAK5cjs.k; exports.fetchRhinoCompute = _chunkLLUNR66Gcjs.m; exports.getLogger = _chunkLLUNR66Gcjs.h; exports.getResponseWireSize = _chunkLLUNR66Gcjs.l; exports.hashDefinition = _chunkG7NVQAK5cjs.e; exports.hashSolveInput = _chunkG7NVQAK5cjs.d; exports.isDefinitionRef = _chunkG7NVQAK5cjs.a; exports.processInput = _chunkG7NVQAK5cjs.i; exports.setLogger = _chunkLLUNR66Gcjs.i; exports.setResponseWireSize = _chunkLLUNR66Gcjs.k; exports.solveGrasshopperDefinition = _chunkG7NVQAK5cjs.b; exports.stableStringify = _chunkG7NVQAK5cjs.c; exports.toCamelCase = _chunkLLUNR66Gcjs.p;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkBVMGO7IGcjs = require('./chunk-BVMGO7IG.cjs');var _chunkLLUNR66Gcjs = require('./chunk-LLUNR66G.cjs');exports.ComputeServerStats = _chunkLLUNR66Gcjs.o; exports.ErrorCodes = _chunkLLUNR66Gcjs.b; exports.GrasshopperClient = _chunkBVMGO7IGcjs.g; exports.GrasshopperResponseProcessor = _chunkBVMGO7IGcjs.h; exports.RhinoComputeError = _chunkLLUNR66Gcjs.c; exports.SolveScheduler = _chunkBVMGO7IGcjs.f; exports.TreeBuilder = _chunkBVMGO7IGcjs.l; exports.camelcaseKeys = _chunkLLUNR66Gcjs.q; exports.decodeBase64ToBinary = _chunkLLUNR66Gcjs.f; exports.downloadFileData = _chunkLLUNR66Gcjs.u; exports.enableDebugLogging = _chunkLLUNR66Gcjs.j; exports.extractFilesFromComputeResponse = _chunkLLUNR66Gcjs.t; exports.fetchDefinitionIO = _chunkBVMGO7IGcjs.j; exports.fetchParsedDefinitionIO = _chunkBVMGO7IGcjs.k; exports.fetchRhinoCompute = _chunkLLUNR66Gcjs.m; exports.getLogger = _chunkLLUNR66Gcjs.h; exports.getResponseWireSize = _chunkLLUNR66Gcjs.l; exports.hashDefinition = _chunkBVMGO7IGcjs.e; exports.hashSolveInput = _chunkBVMGO7IGcjs.d; exports.isDefinitionRef = _chunkBVMGO7IGcjs.a; exports.processInput = _chunkBVMGO7IGcjs.i; exports.setLogger = _chunkLLUNR66Gcjs.i; exports.setResponseWireSize = _chunkLLUNR66Gcjs.k; exports.solveGrasshopperDefinition = _chunkBVMGO7IGcjs.b; exports.stableStringify = _chunkBVMGO7IGcjs.c; exports.toCamelCase = _chunkLLUNR66Gcjs.p;
 //# sourceMappingURL=index.cjs.map

package/dist/index.js

@@ -1,2 +1,2 @@
-import{a as i,b as j,c as k,d as l,e as n,f as q,g as s,h as u,i as v,j as w,k as y,l as z}from"./chunk-RFFCVRKM.js";import{b as o,c as r,f as e,h as f,i as m,j as p,k as t,l as x,m as a,o as b,p as c,q as d,t as g,u as h}from"./chunk-XT3XWDDV.js";export{b as ComputeServerStats,o as ErrorCodes,s as GrasshopperClient,u as GrasshopperResponseProcessor,r as RhinoComputeError,q as SolveScheduler,z as TreeBuilder,d as camelcaseKeys,e as decodeBase64ToBinary,h as downloadFileData,p as enableDebugLogging,g as extractFilesFromComputeResponse,w as fetchDefinitionIO,y as fetchParsedDefinitionIO,a as fetchRhinoCompute,f as getLogger,x as getResponseWireSize,n as hashDefinition,l as hashSolveInput,i as isDefinitionRef,v as processInput,m as setLogger,t as setResponseWireSize,j as solveGrasshopperDefinition,k as stableStringify,c as toCamelCase};
+import{a as i,b as j,c as k,d as l,e as n,f as q,g as s,h as u,i as v,j as w,k as y,l as z}from"./chunk-BCVDB6AE.js";import{b as o,c as r,f as e,h as f,i as m,j as p,k as t,l as x,m as a,o as b,p as c,q as d,t as g,u as h}from"./chunk-XT3XWDDV.js";export{b as ComputeServerStats,o as ErrorCodes,s as GrasshopperClient,u as GrasshopperResponseProcessor,r as RhinoComputeError,q as SolveScheduler,z as TreeBuilder,d as camelcaseKeys,e as decodeBase64ToBinary,h as downloadFileData,p as enableDebugLogging,g as extractFilesFromComputeResponse,w as fetchDefinitionIO,y as fetchParsedDefinitionIO,a as fetchRhinoCompute,f as getLogger,x as getResponseWireSize,n as hashDefinition,l as hashSolveInput,i as isDefinitionRef,v as processInput,m as setLogger,t as setResponseWireSize,j as solveGrasshopperDefinition,k as stableStringify,c as toCamelCase};
 //# sourceMappingURL=index.js.map

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@selvajs/compute",
-  "version": "4.0.0-beta.0",
+  "version": "4.0.0-beta.1",
   "description": "TypeScript library for Rhino Compute Server - Grasshopper and RhinoCommon",
   "author": "VektorNode",
   "license": "MIT",

package/dist/chunk-G7NVQAK5.cjs

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true}); function _nullishCoalesce(lhs, rhsFn) { if (lhs != null) { return lhs; } else { return rhsFn(); } } function _optionalChain(ops) { let lastAccessLHS = undefined; let value = ops[0]; let i = 1; while (i < ops.length) { const op = ops[i]; const fn = ops[i + 1]; i += 2; if ((op === 'optionalAccess' || op === 'optionalCall') && value == null) { return undefined; } if (op === 'access' || op === 'optionalAccess') { lastAccessLHS = value; value = fn(value); } else if (op === 'call' || op === 'optionalCall') { value = fn((...args) => value.call(lastAccessLHS, ...args)); lastAccessLHS = undefined; } } return value; }var _chunkLLUNR66Gcjs = require('./chunk-LLUNR66G.cjs');var ie=new Set;function Ve(){if(typeof window>"u"||_optionalChain([globalThis, 'access', _2 => _2.process, 'optionalAccess', _3 => _3.versions, 'optionalAccess', _4 => _4.node])!=null)return!1;let e=globalThis.navigator,r=typeof _optionalChain([e, 'optionalAccess', _5 => _5.userAgent])=="string"?e.userAgent:"";return!/jsdom/i.test(r)}function x(t,e){e||Ve()&&!ie.has(t)&&(ie.add(t),_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Warning: ${t} is running on the client side. For better performance and security, consider running this on the server side.`))}function T(t){return typeof t=="object"&&!(t instanceof Uint8Array)&&typeof t.key=="string"&&typeof t.load=="function"}var Ge="Unable to load grasshopper definition";function We(t){return t instanceof _chunkLLUNR66Gcjs.c?t.code===_chunkLLUNR66Gcjs.b.DEFINITION_NOT_CACHED||t.message.includes(Ge):!1}function je(t,e){if(!e)return;let r=_chunkLLUNR66Gcjs.r.call(void 0, t,"values");if(!Array.isArray(r)||r.length===0)return;let n=[];for(let o of r){let i=_chunkLLUNR66Gcjs.r.call(void 0, o,"innerTree");(!i||Object.keys(i).length===0)&&n.push(_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, o,"paramName"), () => ("<unnamed>")))}if(n.length===0)return;let s=n.length===r.length?"all":`${n.length}/${r.length}`;_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Solve returned empty output(s) (${s}): ${n.join(", ")}. These parameters produced no data \u2014 check the definition's inputs and the branch feeding each.`)}async function k(t,e,r){x("solveGrasshopperDefinition",_nullishCoalesce(r.suppressBrowserWarning, () => (r.suppressClientSideWarning)));let n=await j(e),{response:s}=await P(w(n,t),r);return s}async function ae(t,e,r){x("solveGrasshopperDefinitionWithCacheKey",_nullishCoalesce(r.suppressBrowserWarning, () => (r.suppressClientSideWarning)));let n=await j(e);return P(w(n,t),r)}async function ue(t,e,r,n){x("solveByCacheKey",_nullishCoalesce(n.suppressBrowserWarning, () => (n.suppressClientSideWarning)));let s={algo:null,pointer:e,values:t};try{return{...await P(s,n),missed:!1}}catch(o){if(!We(o))throw o;let i=await j(r);return{...await P(w(i,t),n),missed:!0}}}async function j(t){if(!T(t))return t;try{return await t.load()}catch(e){throw new (0, _chunkLLUNR66Gcjs.c)(`Failed to load definition bytes for ref '${t.key}'`,_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{definitionKey:t.key},originalError:e instanceof Error?e:new Error(String(e))})}}async function P(t,e){Be(t,e);let r=await _chunkLLUNR66Gcjs.m.call(void 0, "grasshopper",t,e),{pointer:n,algo:s,...o}=r,i=o,a=_chunkLLUNR66Gcjs.l.call(void 0, r);if(a!==void 0){let u=typeof s=="string"?s.length:0;_chunkLLUNR66Gcjs.k.call(void 0, i,Math.max(0,a-u))}return je(i,e.debug),{response:i,cacheKey:typeof n=="string"?n:null}}function w(t,e){let r={algo:null,pointer:null,values:e};return t instanceof Uint8Array?r.algo=_chunkLLUNR66Gcjs.g.call(void 0, t):/^https?:\/\//i.test(t)?r.pointer=t:r.algo=_nullishCoalesce(_chunkLLUNR66Gcjs.e.call(void 0, t), () => (_chunkLLUNR66Gcjs.d.call(void 0, t))),r}function Be(t,e){e.cachesolve!=null&&(t.cachesolve=e.cachesolve),e.cacheerroredsolves!=null&&(t.cacheerroredsolves=e.cacheerroredsolves),e.modelunits!=null&&(t.modelunits=e.modelunits),e.angletolerance!=null&&(t.angletolerance=e.angletolerance),e.absolutetolerance!=null&&(t.absolutetolerance=e.absolutetolerance),e.dataversion!=null&&(t.dataversion=e.dataversion)}function le(t){let e=new WeakSet,r=n=>{if(n===void 0)return"undefined";if(n===null)return"null";if(typeof n=="number")return Number.isFinite(n)?String(n):"null";if(typeof n=="string"||typeof n=="boolean")return JSON.stringify(n);if(typeof n=="bigint")return`${n}n`;if(n instanceof Uint8Array)return`{"__u8":${n.length},"hash":"${fe(n)}"}`;if(Array.isArray(n)){if(e.has(n))return'"[Circular]"';e.add(n);let s=[];for(let o=0;o<n.length;o++)s.push(r(n[o]));return e.delete(n),`[${s.join(",")}]`}if(typeof n=="object"){if(e.has(n))return'"[Circular]"';e.add(n);let s;return typeof n.toJSON=="function"?s=r(n.toJSON()):n instanceof Map?s=`{"__map":[${[...n.entries()].map(([i,a])=>`[${r(i)},${r(a)}]`).sort().join(",")}]}`:n instanceof Set?s=`{"__set":[${[...n.values()].map(r).sort().join(",")}]}`:s=`{${Object.keys(n).sort().map(a=>`${JSON.stringify(a)}:${r(n[a])}`).join(",")}}`,e.delete(n),s}return"null"};return r(t)}function pe(t,e){let r=2166136261;for(let n=0;n<t;n++)r^=e(n),r=r+((r<<1)+(r<<4)+(r<<7)+(r<<8)+(r<<24))>>>0;return r.toString(16).padStart(8,"0")}function ce(t){return pe(t.length,e=>t.charCodeAt(e))}function fe(t){return pe(t.length,e=>t[e])}function $e(t,e){return B(N(t),e)}function B(t,e){let r=le(e);return`${t}|t:${r.length}:${ce(r)}`}function N(t){return T(t)?`r:${t.key}`:typeof t=="string"?`s:${t.length}:${ce(t)}`:`u8:${t.length}:${fe(t)}`}var ze=100;function Ue(t){return typeof t!="string"?!0:!/^https?:\/\//i.test(t)}function _e(t){try{return _nullishCoalesce(_optionalChain([JSON, 'access', _6 => _6.stringify, 'call', _7 => _7(t), 'optionalAccess', _8 => _8.length]), () => (0))}catch (e2){return 0}}var E=class{constructor(e,r,n={},s){_chunkLLUNR66Gcjs.a.call(void 0, this,"executor");_chunkLLUNR66Gcjs.a.call(void 0, this,"baseConfig");_chunkLLUNR66Gcjs.a.call(void 0, this,"mode");_chunkLLUNR66Gcjs.a.call(void 0, this,"maxConcurrent");_chunkLLUNR66Gcjs.a.call(void 0, this,"maxQueueDepth");_chunkLLUNR66Gcjs.a.call(void 0, this,"queueWaitMs");_chunkLLUNR66Gcjs.a.call(void 0, this,"timeoutMs");_chunkLLUNR66Gcjs.a.call(void 0, this,"retry");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheEnabled");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheMax");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheMaxBytes");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheTtl");_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheErroredSolves");_chunkLLUNR66Gcjs.a.call(void 0, this,"cache",new Map);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheBytes",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheHits",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheMisses",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheEvictions",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"cacheKeyExecutor");_chunkLLUNR66Gcjs.a.call(void 0, this,"reuseServerDefinitionCache");_chunkLLUNR66Gcjs.a.call(void 0, this,"serverCacheKeys",new Map);_chunkLLUNR66Gcjs.a.call(void 0, this,"onStart");_chunkLLUNR66Gcjs.a.call(void 0, this,"onSettle");_chunkLLUNR66Gcjs.a.call(void 0, this,"onSuperseded");_chunkLLUNR66Gcjs.a.call(void 0, this,"subscribers",new Set);_chunkLLUNR66Gcjs.a.call(void 0, this,"inFlight",new Set);_chunkLLUNR66Gcjs.a.call(void 0, this,"pendingForLatestWins",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"fifoQueue",[]);_chunkLLUNR66Gcjs.a.call(void 0, this,"_lastResult",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"_lastError",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"_lastDurationMs",null);_chunkLLUNR66Gcjs.a.call(void 0, this,"solveSeq",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"lastStateSeq",0);_chunkLLUNR66Gcjs.a.call(void 0, this,"disposed",!1);this.executor=e,this.cacheKeyExecutor=s,this.baseConfig=r,this.mode=_nullishCoalesce(n.mode, () => ("latest-wins")),this.maxConcurrent=Math.max(1,_nullishCoalesce(n.maxConcurrent, () => ((this.mode==="parallel"?4:1)))),this.maxQueueDepth=n.maxQueueDepth!==void 0&&n.maxQueueDepth>0?Math.floor(n.maxQueueDepth):void 0,this.queueWaitMs=n.queueWaitMs!==void 0&&n.queueWaitMs>0?n.queueWaitMs:void 0,this.timeoutMs=n.timeoutMs,this.retry=n.retry;let o=n.cache;this.cacheEnabled=o!==void 0&&o!==!1;let i=typeof o=="object"?o:{};this.cacheMax=_nullishCoalesce(i.maxEntries, () => (50)),this.cacheMaxBytes=Math.max(0,_nullishCoalesce(i.maxBytes, () => (0))),this.cacheTtl=_nullishCoalesce(i.ttlMs, () => (0)),this.cacheErroredSolves=_nullishCoalesce(i.cacheErroredSolves, () => (!0)),this.reuseServerDefinitionCache=!!s&&(_nullishCoalesce(n.reuseServerDefinitionCache, () => (!0))),this.onStart=n.onStart,this.onSettle=n.onSettle,this.onSuperseded=n.onSuperseded}get isSolving(){return this.inFlight.size>0}get hasPending(){return this.pendingForLatestWins!==null||this.fifoQueue.length>0}get inFlightCount(){return this.inFlight.size}get queueDepth(){return this.fifoQueue.length+(this.pendingForLatestWins?1:0)}get lastResult(){return this._lastResult}get lastError(){return this._lastError}get lastDurationMs(){return this._lastDurationMs}subscribe(e){return this.subscribers.add(e),()=>this.subscribers.delete(e)}notify(){for(let e of this.subscribers)try{e()}catch(r){_chunkLLUNR66Gcjs.h.call(void 0, ).error("[SolveScheduler] subscriber threw:",r)}}solve(e,r,n){if(this.disposed)return Promise.reject(new (0, _chunkLLUNR66Gcjs.c)("SolveScheduler has been disposed and cannot be used",_chunkLLUNR66Gcjs.b.INVALID_STATE));let s=N(e),o=B(s,r),i=++this.solveSeq,a={key:o,enqueuedAt:Date.now(),startedAt:null};if(_optionalChain([n, 'optionalAccess', _9 => _9.signal, 'optionalAccess', _10 => _10.aborted]))return Promise.reject(this.makeAbortError(a));if(this.cacheEnabled){let u=this.readCache(o);if(u){this.mode==="latest-wins"&&this.supersedeCurrent();let f={status:"success",response:u,durationMs:0,fromCache:!0};return this.writeLastState(i,{result:u,durationMs:0}),this.runHook(this.onStart,a),this.runHook(this.onSettle,a,f),this.notify(),Promise.resolve(u)}}return new Promise((u,f)=>{let c={definition:e,dataTree:r,definitionHash:s,ctx:a,seq:i,resolve:u,reject:f,externalSignal:_optionalChain([n, 'optionalAccess', _11 => _11.signal])};c.externalSignal&&(c.queuedAbortHandler=()=>this.abortQueuedItem(c),c.externalSignal.addEventListener("abort",c.queuedAbortHandler,{once:!0})),this.enqueue(c)})}writeLastState(e,r){return e<this.lastStateSeq?!1:(this.lastStateSeq=e,"result"in r?(this._lastResult=r.result,this._lastError=null):this._lastError=r.error,this._lastDurationMs=r.durationMs,!0)}supersedeCurrent(){this.pendingForLatestWins&&(this.supersede(this.pendingForLatestWins),this.pendingForLatestWins=null);for(let e of this.inFlight)this.supersede(e),e.controller.abort()}abortQueuedItem(e){this.pendingForLatestWins===e&&(this.pendingForLatestWins=null);let r=this.fifoQueue.indexOf(e);r>=0&&this.fifoQueue.splice(r,1),this.rejectAsAborted(e),this.notify()}shedAsQueueFull(e){let r=new (0, _chunkLLUNR66Gcjs.c)("Solve queue is full; request shed (backpressure)",_chunkLLUNR66Gcjs.b.QUEUE_FULL,{statusCode:503,context:{key:e.ctx.key,queueDepth:this.fifoQueue.length,maxQueueDepth:this.maxQueueDepth}});this.settleError(e,r)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:r,durationMs:0}),this.notify()}armQueueWaitTimer(e){if(this.queueWaitMs===void 0)return;let r=this.queueWaitMs;e.queueWaitTimer=setTimeout(()=>{if(e.settled)return;let n=this.fifoQueue.indexOf(e);n>=0&&this.fifoQueue.splice(n,1);let s=new (0, _chunkLLUNR66Gcjs.c)(`Solve waited longer than ${r}ms in queue; shed (backpressure)`,_chunkLLUNR66Gcjs.b.QUEUE_TIMEOUT,{statusCode:503,context:{key:e.ctx.key,waitedMs:Date.now()-e.ctx.enqueuedAt,queueWaitMs:r}});this.settleError(e,s)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:s,durationMs:0}),this.notify()},r)}clearQueueWaitTimer(e){e.queueWaitTimer!==void 0&&(clearTimeout(e.queueWaitTimer),e.queueWaitTimer=void 0)}enqueue(e){switch(this.mode){case"latest-wins":{this.supersedeCurrent(),this.inFlight.size===0?this.execute(e):this.pendingForLatestWins=e;break}case"queue":case"parallel":{this.inFlight.size<this.maxConcurrent?this.execute(e):this.maxQueueDepth!==void 0&&this.fifoQueue.length>=this.maxQueueDepth?this.shedAsQueueFull(e):(this.armQueueWaitTimer(e),this.fifoQueue.push(e));break}}this.notify()}async execute(e){let r=new AbortController,n=e;n.controller=r,this.inFlight.add(n),e.ctx.startedAt=Date.now(),this.clearQueueWaitTimer(e),this.removeQueuedAbortHandler(e);let s=()=>r.abort();_optionalChain([e, 'access', _12 => _12.externalSignal, 'optionalAccess', _13 => _13.addEventListener, 'call', _14 => _14("abort",s,{once:!0})]),this.runHook(this.onStart,e.ctx),this.notify();let o=performance.now();try{let i={...this.baseConfig,signal:r.signal,...this.timeoutMs!==void 0&&{timeoutMs:this.timeoutMs},...this.retry!==void 0&&{retry:this.retry}},{response:a,definitionReuploaded:u}=await this.runExecutor(e.definition,e.dataTree,e.definitionHash,i),f=performance.now()-o;if(this.cacheEnabled&&this.writeCache(e.ctx.key,a),!this.settleSuccess(e,a))return;this.writeLastState(e.seq,{result:a,durationMs:f}),this.runHook(this.onSettle,e.ctx,{status:"success",response:a,durationMs:f,fromCache:!1,definitionReuploaded:u})}catch(i){let a=performance.now()-o,u=this.normalizeExecutionError(i,n);this.writeLastState(e.seq,{error:u,durationMs:a}),this.settleError(e,u)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:u,durationMs:a})}finally{_optionalChain([e, 'access', _15 => _15.externalSignal, 'optionalAccess', _16 => _16.removeEventListener, 'call', _17 => _17("abort",s)]),this.inFlight.delete(n),this.drainNext(),this.notify()}}async runExecutor(e,r,n,s){if(!this.cacheKeyExecutor||!this.reuseServerDefinitionCache||!Ue(e))return{response:await this.executor(e,r,s)};let o=n,i=_nullishCoalesce(this.serverCacheKeys.get(o), () => (null)),a=await this.cacheKeyExecutor(e,r,i,s);if(a.cacheKey)for(this.serverCacheKeys.delete(o),this.serverCacheKeys.set(o,a.cacheKey);this.serverCacheKeys.size>ze;){let u=this.serverCacheKeys.keys().next().value;if(u===void 0)break;this.serverCacheKeys.delete(u)}else this.serverCacheKeys.delete(o);return{response:a.response,definitionReuploaded:a.missed}}drainNext(){if(!this.disposed){if(this.mode==="latest-wins"){if(this.pendingForLatestWins&&this.inFlight.size===0){let e=this.pendingForLatestWins;this.pendingForLatestWins=null,this.execute(e)}return}for(;this.fifoQueue.length>0&&this.inFlight.size<this.maxConcurrent;){let e=this.fifoQueue.shift();this.execute(e)}}}supersede(e){let r=new (0, _chunkLLUNR66Gcjs.c)("Superseded by newer solve",_chunkLLUNR66Gcjs.b.SUPERSEDED,{context:{key:e.ctx.key,enqueuedAt:e.ctx.enqueuedAt}});this.settleError(e,r)&&this.runHook(this.onSuperseded,e.ctx)}makeAbortError(e){return new (0, _chunkLLUNR66Gcjs.c)("Request aborted by caller",_chunkLLUNR66Gcjs.b.ABORTED,{context:{key:e.key,enqueuedAt:e.enqueuedAt}})}settleError(e,r){return e.settled?!1:(e.settled={error:r},this.clearQueueWaitTimer(e),this.removeQueuedAbortHandler(e),e.reject(r),!0)}settleSuccess(e,r){return e.settled?!1:(e.settled={ok:!0},this.clearQueueWaitTimer(e),this.removeQueuedAbortHandler(e),e.resolve(r),!0)}removeQueuedAbortHandler(e){e.queuedAbortHandler&&e.externalSignal&&e.externalSignal.removeEventListener("abort",e.queuedAbortHandler),e.queuedAbortHandler=void 0}isAbortLikeError(e){if(e instanceof Error){if(e.name==="AbortError")return!0;if(typeof DOMException<"u"&&e instanceof DOMException)return e.name==="AbortError"}return!1}normalizeExecutionError(e,r){return r.settled&&"error"in r.settled?r.settled.error:e instanceof _chunkLLUNR66Gcjs.c?e:this.isAbortLikeError(e)?this.makeAbortError(r.ctx):new (0, _chunkLLUNR66Gcjs.c)(e instanceof Error?e.message:String(e),_chunkLLUNR66Gcjs.b.UNKNOWN_ERROR,{originalError:e instanceof Error?e:new Error(String(e))})}cancelAll(){for(this.pendingForLatestWins&&(this.rejectAsAborted(this.pendingForLatestWins),this.pendingForLatestWins=null);this.fifoQueue.length>0;){let e=this.fifoQueue.shift();this.rejectAsAborted(e)}for(let e of this.inFlight){let r=this.makeAbortError(e.ctx);this.settleError(e,r)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:r,durationMs:e.ctx.startedAt?Date.now()-e.ctx.startedAt:0}),e.controller.abort()}this.notify()}rejectAsAborted(e){let r=this.makeAbortError(e.ctx);this.settleError(e,r)&&this.runHook(this.onSettle,e.ctx,{status:"error",error:r,durationMs:0})}readCache(e){if(!this.cacheEnabled)return null;let r=this.cache.get(e);return r?this.cacheTtl>0&&Date.now()-r.insertedAt>this.cacheTtl?(this.dropCacheEntry(e),this.cacheMisses+=1,null):(this.cache.delete(e),this.cache.set(e,r),this.cacheHits+=1,r.response):(this.cacheMisses+=1,null)}writeCache(e,r){if(!this.cacheEnabled||!this.cacheErroredSolves&&r.errors&&r.errors.length>0)return;let n=_nullishCoalesce(_chunkLLUNR66Gcjs.l.call(void 0, r), () => (_e(r)));if(!(this.cacheMaxBytes>0&&n>this.cacheMaxBytes))for(this.dropCacheEntry(e),this.cache.set(e,{response:r,insertedAt:Date.now(),sizeBytes:n}),this.cacheBytes+=n;(this.cache.size>this.cacheMax||this.cacheMaxBytes>0&&this.cacheBytes>this.cacheMaxBytes)&&this.cache.size>0;){let s=this.cache.keys().next().value;if(s===void 0)break;this.dropCacheEntry(s),this.cacheEvictions+=1}}dropCacheEntry(e){let r=this.cache.get(e);r&&(this.cache.delete(e),this.cacheBytes-=r.sizeBytes)}clearCache(){this.cache.clear(),this.cacheBytes=0}cacheStats(){return{entries:this.cache.size,bytes:this.cacheBytes,hits:this.cacheHits,misses:this.cacheMisses,evictions:this.cacheEvictions}}dispose(){this.disposed||(this.disposed=!0,this.cancelAll(),this.subscribers.clear(),this.clearCache())}runHook(e,...r){if(e)try{e(...r)}catch(n){_chunkLLUNR66Gcjs.h.call(void 0, ).error("[SolveScheduler] hook threw:",n)}}};function de(t){return T(t)?`ref:${t.key}`:typeof t=="string"&&t.length<200?t:"...content..."}function me(t){return Array.isArray(t)?t.map(e=>{let r=0,n=0,s=_chunkLLUNR66Gcjs.r.call(void 0, e,"innerTree");if(s&&typeof s=="object"){for(let o of Object.values(s))if(Array.isArray(o)){r+=o.length;for(let i of o){let a=_optionalChain([i, 'optionalAccess', _18 => _18.data]);typeof a=="string"&&(n+=a.length)}}}return{param:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, e,"paramName"), () => ("<unnamed>")),items:r,bytes:n}}):[]}var O=class t{constructor(e){_chunkLLUNR66Gcjs.a.call(void 0, this,"config");_chunkLLUNR66Gcjs.a.call(void 0, this,"serverStats");_chunkLLUNR66Gcjs.a.call(void 0, this,"disposed",!1);this.config=this.normalizeComputeConfig(e),this.serverStats=new (0, _chunkLLUNR66Gcjs.o)(this.config.serverUrl,this.config.apiKey)}static async create(e){let r=new t(e),n=Math.max(1,(_nullishCoalesce(_optionalChain([e, 'access', _19 => _19.retry, 'optionalAccess', _20 => _20.attempts]), () => (2)))+1),s=_nullishCoalesce(_optionalChain([e, 'access', _21 => _21.retry, 'optionalAccess', _22 => _22.baseDelayMs]), () => (250)),o=_nullishCoalesce(_optionalChain([e, 'access', _23 => _23.retry, 'optionalAccess', _24 => _24.maxDelayMs]), () => (1e3));for(let i=0;i<n;i++){if(await r.serverStats.isServerOnline())return r;if(i<n-1){let a=Math.min(s*2**i,o);await new Promise(u=>setTimeout(u,a))}}throw await r.dispose(),new (0, _chunkLLUNR66Gcjs.c)("Rhino Compute server is not online",_chunkLLUNR66Gcjs.b.NETWORK_ERROR,{context:{serverUrl:r.config.serverUrl,attempts:n}})}getConfig(){return this.ensureNotDisposed(),{...this.config}}async getIO(e){return this.ensureNotDisposed(),$(e,this.config)}async getRawIO(e){return this.ensureNotDisposed(),M(e,this.config)}async solve(e,r,n){this.ensureNotDisposed();try{if(typeof e=="string"&&!_optionalChain([e, 'optionalAccess', _25 => _25.trim, 'call', _26 => _26()]))throw new (0, _chunkLLUNR66Gcjs.c)("Definition URL/content is required",_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{receivedUrl:e}});if(e instanceof Uint8Array&&e.length===0)throw new (0, _chunkLLUNR66Gcjs.c)("Definition content is empty",_chunkLLUNR66Gcjs.b.INVALID_INPUT);if(T(e)&&!e.key.trim())throw new (0, _chunkLLUNR66Gcjs.c)("DefinitionRef key is empty",_chunkLLUNR66Gcjs.b.INVALID_INPUT);let s={...this.config,..._optionalChain([n, 'optionalAccess', _27 => _27.signal])!==void 0&&{signal:n.signal},..._optionalChain([n, 'optionalAccess', _28 => _28.timeoutMs])!==void 0&&{timeoutMs:n.timeoutMs},..._optionalChain([n, 'optionalAccess', _29 => _29.retry])!==void 0&&{retry:n.retry}},o=await k(r,e,s);if(_optionalChain([o, 'optionalAccess', _30 => _30.errors])&&o.errors.length>0)throw new (0, _chunkLLUNR66Gcjs.c)(o.errors.join("; ")||"Computation failed",_chunkLLUNR66Gcjs.b.COMPUTATION_ERROR,{context:{definition:de(e),inputSummary:me(r),errors:o.errors,warnings:o.warnings,values:o.values}});return o}catch(s){throw this.config.debug&&_chunkLLUNR66Gcjs.h.call(void 0, ).error("Compute failed:",s),s instanceof _chunkLLUNR66Gcjs.c?s:new (0, _chunkLLUNR66Gcjs.c)(s instanceof Error?s.message:String(s),_chunkLLUNR66Gcjs.b.COMPUTATION_ERROR,{context:{definition:de(e),inputSummary:me(r)},originalError:s instanceof Error?s:new Error(String(s))})}}createScheduler(e){this.ensureNotDisposed();let r=(s,o,i)=>k(o,s,i),n=(s,o,i,a)=>i===null?ae(o,s,a).then(u=>({...u,missed:!1})):ue(o,i,s,a);return new E(r,this.config,e,n)}async dispose(){this.disposed||(this.disposed=!0,await this.serverStats.dispose())}ensureNotDisposed(){if(this.disposed)throw new (0, _chunkLLUNR66Gcjs.c)("GrasshopperClient has been disposed and cannot be used",_chunkLLUNR66Gcjs.b.INVALID_STATE)}normalizeComputeConfig(e){return{...e,serverUrl:_chunkLLUNR66Gcjs.n.call(void 0, e.serverUrl),apiKey:e.apiKey,authToken:e.authToken,debug:_nullishCoalesce(e.debug, () => (!1)),suppressBrowserWarning:_nullishCoalesce(e.suppressBrowserWarning, () => (e.suppressClientSideWarning))}}};var F=new Map;function ye(t,e){F.set(t,e)}ye("Rhino.Geometry.Point3d",(t,e)=>{let r=e;return!r||typeof r.X!="number"?null:new t.Point([r.X,r.Y,r.Z])});ye("Rhino.Geometry.Line",(t,e)=>{let r=e;return!r||!r.From||!r.To?null:new t.Line([r.From.X,r.From.Y,r.From.Z],[r.To.X,r.To.Y,r.To.Z])});function qe(t){if(F.has(t))return F.get(t);for(let[e,r]of F)if(t.startsWith(e))return r}function Ke(t){return!!(t&&typeof t=="object"&&typeof t.data=="string")}function he(t,e){return{__decodeError:!0,type:t,raw:e}}function ge(t,e,r){let n=qe(e),s=!1;if(n)try{let o=n(r,t);if(o!=null)return o}catch(o){_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Failed to decode Rhino type ${e}:`,o),s=!0}try{if(Ke(t))return r.CommonObject.decode(t)}catch(o){return _chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Failed to decode ${e} with CommonObject:`,o),he(e,t)}return s?he(e,t):t}function be(t){let e=new WeakSet,r=n=>{if(!n||typeof n!="object"||e.has(n))return;e.add(n);let s=n.delete;if(typeof s=="function"){let i=n.isDeleted;(typeof i!="function"||!i.call(n))&&s.call(n);return}if(Array.isArray(n)){for(let i of n)r(i);return}let o=Object.getPrototypeOf(n);if(o===Object.prototype||o===null)for(let i of Object.values(n))r(i)};r(t)}var I={STRING:"System.String",INT:"System.Int32",DOUBLE:"System.Double",BOOL:"System.Boolean"},Qe="Rhino.Geometry.",He=["WebDisplay"],Je="FileData";function Te(t){return He.some(e=>t.includes(e))}function Ye(t){if(typeof t!="string")return t;let e=t.trim();if(!(e.startsWith("{")||e.startsWith("[")||e.startsWith('"')))return t;try{let n=JSON.parse(e);if(typeof n=="string")try{return JSON.parse(n)}catch (e3){return n}return n}catch (e4){return t}}function Xe(t,e,r){switch(e){case I.STRING:return typeof t!="string"?t:t.replace(/^"(.*)"$/,"$1");case I.INT:return Number.parseInt(t,10);case I.DOUBLE:return Number.parseFloat(t);case I.BOOL:return String(t).toLowerCase()==="true";default:return r&&e.startsWith(Qe)?ge(t,e,r):t}}var z=new WeakMap;function Se(t){if(z.has(t))return z.get(t);let e=Ye(t.data);return z.set(t,e),e}function De(t,e,r,n){if(typeof t.data!="string")return t.data;let s=r?Se(t):t.data;return Xe(s,e,n)}function Ze(t){if(!t||typeof t!="object")return!1;let e=t;return typeof e.fileName=="string"&&typeof e.fileType=="string"&&"data"in e&&typeof e.isBase64Encoded=="boolean"&&typeof e.subFolder=="string"}function U(t){let e=_chunkLLUNR66Gcjs.r.call(void 0, t,"values");return Array.isArray(e)?e:[]}function _(t){return typeof t.type=="string"?t.type:""}function q(t,e){if(!(!t||typeof t!="object")){for(let r of Object.values(t))if(Array.isArray(r))for(let n of r)n&&typeof n=="object"&&e(n)}}function xe(t,e=!1,r={}){let{parseValues:n=!0,rhino:s,stringOnly:o=!1}=r,i={},a=new Set;for(let u of U(t)){let f=_chunkLLUNR66Gcjs.r.call(void 0, u,"paramName");q(_chunkLLUNR66Gcjs.r.call(void 0, u,"innerTree"),c=>{let d=_(c);if(Te(d)||o&&d!==I.STRING)return;let g=e?c.id:f;if(!g)return;let b=De(c,d,n,s);g in i?a.has(g)?i[g].push(b):(i[g]=[i[g],b],a.add(g)):i[g]=b})}return{values:i,dispose:()=>be(i)}}function Ie(t){let e=[];for(let r of U(t))q(_chunkLLUNR66Gcjs.r.call(void 0, r,"innerTree"),n=>{if(!_(n).includes(Je))return;let s=Se(n);Ze(s)&&e.push(s)});return e}function Ce(t,e,r={}){let{parseValues:n=!0,rhino:s,stringOnly:o=!1}=r;for(let i of U(t)){let a=_chunkLLUNR66Gcjs.r.call(void 0, i,"innerTree"),u=!1;if("byName"in e){if(_chunkLLUNR66Gcjs.r.call(void 0, i,"paramName")!==e.byName)continue;u=!0}let f=[];if(q(a,c=>{if("byId"in e){if(c.id!==e.byId)return;u=!0}let d=_(c);Te(d)||o&&d!==I.STRING||f.push(De(c,d,n,s))}),u)return f.length===0?void 0:f.length===1?f[0]:f}}var L=class{constructor(e,r=!1){_chunkLLUNR66Gcjs.a.call(void 0, this,"response",e);_chunkLLUNR66Gcjs.a.call(void 0, this,"debug",r)}getValues(e=!1,r={}){return xe(this.response,e,r)}getValue(e,r){return Ce(this.response,e,r)}getFileData(){return Ie(this.response)}async getAndDownloadFiles(e,r){let n=this.getFileData();await _chunkLLUNR66Gcjs.u.call(void 0, n,e,r)}};var K=/^\{(-?\d+(?:;-?\d+)*)?\}$/;function C(t){if(typeof t!="object"||t===null||Array.isArray(t))return!1;let e=Object.entries(t);return e.length>0&&e.every(([r,n])=>K.test(r)&&Array.isArray(n))}function Q(t,e,r){let n=Number(t.toFixed(e));return Math.abs(t-n)<r?n:t}function we(t,e){if(!Number.isFinite(t)||t===0)return .1;let r=Math.abs(t);if(r>=1){let g=String(t).split(".")[1];if(g&&g.length>0){let b=Math.min(g.length,12),D=Math.pow(10,-b),Z=Number(D.toFixed(b));return Math.abs(Z-D)<e?Z:D}return 1}let n=String(t),s=n.toLowerCase().match(/e(-?\d+)/);if(s){let d=Number(s[1]);if(d<0||n.toLowerCase().includes("e-")){let g=Math.abs(d),b=Math.pow(10,-g),D=Number(b.toFixed(g));return Math.abs(D-b)<e?D:b}return .1}let o=12,a=r.toFixed(o).replace(/0+$/,""),u=Math.min((a.split(".")[1]||"").length,o);if(u===0)return .1;let f=Math.pow(10,-u),c=Number(f.toFixed(u));return Math.abs(c-f)<e?c:f}function H(t){return typeof t.stepSize=="number"&&Number.isFinite(t.stepSize)&&t.stepSize>0?t.stepSize:void 0}function S(t,e,r){if(t==null)return t;if(Array.isArray(t)){let s=t.map(e).filter(o=>o!==null);return s.length>0?s:void 0}let n=e(t);return n!==null?n:r?void 0:t}var v=t=>{if(typeof t=="number")return Number.isFinite(t)?t:null;if(typeof t=="string"){let e=t.trim();if(e===""||/^[+-]?0[xbo]/i.test(e))return null;let r=Number(e);return Number.isFinite(r)?r:null}return null},V=t=>{if(typeof t=="boolean")return t;if(typeof t=="string"){let e=t.trim().toLowerCase();if(e==="true")return!0;if(e==="false")return!1}return null},Ee=t=>typeof t=="string"?t.length>=2&&t.startsWith('"')&&t.endsWith('"')?t.slice(1,-1):t.startsWith('"')?t.slice(1):t:null,ve=t=>{if(typeof t=="string"){let e=t.trim();return e.startsWith('"')&&e.endsWith('"')&&(e=e.slice(1,-1).trim()),e}return null};function J(t){return e=>{if(typeof e=="object"&&e!==null)return e;if(typeof e=="string"&&e.trim()!=="")try{let r=JSON.parse(e);return typeof r=="object"&&r!==null?r:(_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Parsed value for input ${t} is not an object`),null)}catch(r){return _chunkLLUNR66Gcjs.h.call(void 0, ).warn(`Failed to parse object value "${e}" for input ${t}`,r),null}return null}}function et(t,e=1e-8){let r=t.paramType==="Integer",n=H(t);if(C(t.default))return{default:t.default,stepSize:_nullishCoalesce(n, () => ((r?1:.1)))};if(typeof t.default=="string"&&t.default.trim()!==""&&v(t.default)===null)throw new (0, _chunkLLUNR66Gcjs.c)(`Invalid numeric default "${t.default}" for input "${t.name||"unknown"}"`,_chunkLLUNR66Gcjs.b.VALIDATION_ERROR,{context:{inputName:t.name,default:t.default}});let s=S(t.default,v,!0);if(r)return Array.isArray(s)?s=s.map(d=>typeof d=="number"?Math.round(d):d):typeof s=="number"&&(s=Math.round(s)),{default:s,stepSize:_nullishCoalesce(n, () => (1))};let o=Array.isArray(s)?s[0]:s,i;typeof o=="number"&&Number.isFinite(o)&&o!==0?i=o:typeof t.minimum=="number"&&Number.isFinite(t.minimum)&&t.minimum!==0?i=t.minimum:typeof t.maximum=="number"&&Number.isFinite(t.maximum)&&t.maximum!==0&&(i=t.maximum);let a=_nullishCoalesce(n, () => ((i!==void 0?we(i,e):.1))),u=0,f=String(a),c=f.toLowerCase().match(/e(-?\d+)/);if(c?u=Math.abs(Number(c[1])):u=_nullishCoalesce(_optionalChain([f, 'access', _31 => _31.split, 'call', _32 => _32("."), 'access', _33 => _33[1], 'optionalAccess', _34 => _34.length]), () => (0)),u===0&&typeof o=="number"&&o!==0&&Math.abs(o)<1){let d=Math.ceil(-Math.log10(Math.abs(o)));Number.isFinite(d)&&d>0&&(u=d)}return u=Math.min(Math.max(u,0),12),Array.isArray(s)?s=s.map(d=>typeof d=="number"?Q(d,u,e):d):typeof s=="number"&&(s=Q(s,u,e)),{default:s,stepSize:a}}var tt={types:["Number","Integer"],parse(t,e){let{default:r,stepSize:n}=et(t);return{...e,paramType:t.paramType,minimum:t.minimum,maximum:t.maximum,atLeast:t.atLeast,atMost:t.atMost,stepSize:n,default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1,n=typeof t.minimum=="number"&&Number.isFinite(t.minimum)&&t.minimum>0?t.minimum:0;return{...e,paramType:t.paramType,minimum:t.minimum,maximum:t.maximum,atLeast:t.atLeast,atMost:t.atMost,stepSize:_nullishCoalesce(H(t), () => ((t.paramType==="Integer"?1:.1))),default:r?[n]:n}}},rt={types:["Boolean"],parse(t,e){if(C(t.default))return{...e,paramType:"Boolean",default:t.default};let r=S(t.default,V,!1);if(r!=null&&typeof r!="boolean"&&!Array.isArray(r))throw new (0, _chunkLLUNR66Gcjs.c)(`Invalid boolean default "${String(r)}" for input "${t.name||"unknown"}"`,_chunkLLUNR66Gcjs.b.VALIDATION_ERROR,{context:{inputName:t.name,default:t.default}});return{...e,paramType:"Boolean",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Boolean",default:r?[!1]:!1}}},nt={types:["Text"],parse(t,e){let r=S(t.default,Ee,!1);return{...e,paramType:"Text",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Text",default:r?[""]:""}}},st={types:["ValueList"],parse(t,e){if(!t.values||typeof t.values!="object"||Object.keys(t.values).length===0)throw _chunkLLUNR66Gcjs.c.missingValues(t.nickname||"unnamed","ValueList");let r=t.default;if(t.default!==void 0&&t.default!==null){if(typeof t.default=="object")throw new (0, _chunkLLUNR66Gcjs.c)(`ValueList input "${t.nickname||"unnamed"}" default is not a string-able value`,_chunkLLUNR66Gcjs.b.VALIDATION_ERROR,{context:{inputName:t.name,default:t.default}});let n=String(t.default).toLowerCase(),s=Object.keys(t.values).find(o=>o.toLowerCase()===n);s!==void 0?r=s:_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`ValueList input "${t.nickname||"unnamed"}" default value "${t.default}" is not in available values`)}return{...e,paramType:"ValueList",values:t.values,default:r}},fallback(t,e){return{...e,paramType:"ValueList",values:t.values&&typeof t.values=="object"?t.values:{},default:void 0}}},Ae={types:["Geometry"],parse(t,e){let r=S(t.default,J(t.nickname||"unnamed"),!0);return{...e,paramType:"Geometry",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Geometry",default:r?[null]:null}}},ot={types:["File"],parse(t,e){let r=S(t.default,J(t.nickname||"unnamed"),!0);return{...e,paramType:"File",acceptedFormats:t.acceptedFormats,default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"File",default:r?[null]:null}}},it={types:["Color"],parse(t,e){let r=S(t.default,ve,!1);return{...e,paramType:"Color",default:r}},fallback(t,e){let r=(_nullishCoalesce(t.atMost, () => (1)))>1;return{...e,paramType:"Color",default:r?["0, 0, 0"]:"0, 0, 0"}}},at=[tt,rt,nt,st,Ae,ot,it],Y=new Map(at.flatMap(t=>t.types.map(e=>[e,t]))),Re=Ae;function Pe(t){return _chunkLLUNR66Gcjs.r.call(void 0, t,"data")}function ut(t){return _chunkLLUNR66Gcjs.r.call(void 0, t,"type")}var lt=new Set(["System.Double","System.Single","System.Decimal","System.Int32","System.Int64"]),pt=new Set(["System.Int32","System.Int64"]);function ke(t){if(typeof t.default!="object"||t.default===null)return{schema:t};if(Array.isArray(t.default))return{schema:t};if(!_chunkLLUNR66Gcjs.s.call(void 0, t.default,"innerTree")){let n=`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default had an unrecognized shape (no innerTree key); the default was dropped.`;return _chunkLLUNR66Gcjs.h.call(void 0, ).warn("Unexpected structure in input.default:",t.default),{schema:{...t,default:null},warning:{code:"MALFORMED_DEFAULT",message:n}}}let e=_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t.default,"innerTree"), () => ({}));if(Object.keys(e).length===0)return{schema:{...t,default:void 0}};if(t.treeAccess||t.atMost&&t.atMost>1){let n={},s=[];for(let[i,a]of Object.entries(e)){if(!Array.isArray(a)){let f=`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default had a non-array innerTree branch ("${i}"); the default was dropped.`;return _chunkLLUNR66Gcjs.h.call(void 0, ).warn("Unexpected structure in input.default innerTree:",t.default),{schema:{...t,default:null},warning:{code:"MALFORMED_DEFAULT",message:f}}}let u=[];for(let f of a){let c=Pe(f),d=ut(f);if(d&&lt.has(d)){if(typeof c=="string"&&c.trim()==="")continue;let g=v(c);if(g===null){s.push(`"${String(c)}" (${d})`);continue}u.push(pt.has(d)?Math.round(g):g);continue}if(d==="System.Boolean"){let g=V(c);if(g===null){s.push(`"${String(c)}" (${d})`);continue}u.push(g);continue}if(typeof c=="string"&&_optionalChain([d, 'optionalAccess', _35 => _35.startsWith, 'call', _36 => _36("Rhino.Geometry")])){try{u.push(JSON.parse(c))}catch (e5){u.push(c)}continue}u.push(c)}n[i]=u}let o;if(s.length>0){let i=`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default contained ${s.length} tree value(s) that could not be parsed and were dropped: ${s.join(", ")}.`;_chunkLLUNR66Gcjs.h.call(void 0, ).warn(i),o={code:"MALFORMED_DEFAULT",message:i}}return{schema:{...t,default:n},...o&&{warning:o}}}let r=[];for(let n of Object.values(e))Array.isArray(n)&&n.forEach(s=>{s&&typeof s=="object"&&_chunkLLUNR66Gcjs.s.call(void 0, s,"data")&&r.push(Pe(s))});return r.length===0?{schema:{...t,default:void 0}}:r.length===1?{schema:{...t,default:r[0]}}:{schema:{...t,default:r}}}var ct=new Map([...Y.keys()].map(t=>[t.toLowerCase(),t]));function ft(t){return _nullishCoalesce(ct.get(_optionalChain([t, 'optionalAccess', _37 => _37.toLowerCase, 'call', _38 => _38()])), () => (t))}function dt(t){return Ne(t).input}function Ne(t){let e={description:t.description,name:t.name,nickname:t.nickname,treeAccess:t.treeAccess,groupName:_nullishCoalesce(t.groupName, () => (void 0)),id:t.id},r=ft(t.paramType),n={...t,paramType:r},s;try{let{schema:i,warning:a}=ke(n);n=i,s=a&&{inputName:t.name||"unknown",paramType:t.paramType,message:a.message,code:a.code}}catch(i){n={...n,default:null},s={inputName:t.name||"unknown",paramType:t.paramType,message:`Input "${_nullishCoalesce(t.name, () => ("unknown"))}" default could not be normalized and was dropped: ${i instanceof Error?i.message:String(i)}`,code:"MALFORMED_DEFAULT"}}let o=Y.get(r);try{if(!o)throw _chunkLLUNR66Gcjs.c.unknownParamType(r,t.name);return{input:o.parse(n,e),error:s,...s&&{errors:[s]}}}catch(i){if(i instanceof _chunkLLUNR66Gcjs.c){_chunkLLUNR66Gcjs.h.call(void 0, ).error(`Validation error for input ${t.name||"unknown"}:`,i.message);let a={inputName:t.name||"unknown",paramType:t.paramType,message:i.message,code:i.code};return{input:(_nullishCoalesce(o, () => (Re))).fallback(n,e),error:a,errors:s?[s,a]:[a]}}throw new (0, _chunkLLUNR66Gcjs.c)(i instanceof Error?i.message:String(i),"VALIDATION_ERROR",{context:{paramName:t.name,paramType:r},originalError:i instanceof Error?i:new Error(String(i))})}}function Oe(t){let e=[],r=[];for(let n of t){let{input:s,errors:o}=Ne(n);e.push(s),o&&r.push(...o)}return{inputs:e,parseErrors:r}}function Me(t){let e=_chunkLLUNR66Gcjs.r.call(void 0, t,"stepSize");return{id:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"id"), () => ("")),name:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"name"), () => ("")),nickname:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"nickname"), () => (null)),description:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"description"), () => ("")),paramType:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"paramType"), () => ("")),treeAccess:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"treeAccess"), () => (!1)),minimum:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"minimum"), () => (null)),maximum:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"maximum"), () => (null)),atLeast:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"atLeast"), () => (1)),atMost:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"atMost"), () => (1)),stepSize:typeof e=="number"&&Number.isFinite(e)?e:void 0,default:_chunkLLUNR66Gcjs.r.call(void 0, t,"default"),values:_chunkLLUNR66Gcjs.r.call(void 0, t,"values"),acceptedFormats:_chunkLLUNR66Gcjs.r.call(void 0, t,"acceptedFormats"),groupName:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"groupName"), () => (null))}}function Fe(t){return{name:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"name"), () => ("")),nickname:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"nickname"), () => (null)),paramType:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"paramType"), () => ("")),id:_nullishCoalesce(_chunkLLUNR66Gcjs.r.call(void 0, t,"id"), () => (""))}}async function M(t,e){let r=w(t,[]),n={};if(r.algo&&(n.algo=r.algo),r.pointer&&(n.pointer=r.pointer),!n.algo&&!n.pointer)throw new (0, _chunkLLUNR66Gcjs.c)("Definition must resolve to either a URL pointer or base64 algo",_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{definition:t}});let s=await _chunkLLUNR66Gcjs.m.call(void 0, "io",n,e);if(!s||typeof s!="object")throw new (0, _chunkLLUNR66Gcjs.c)("Invalid IO response structure",_chunkLLUNR66Gcjs.b.INVALID_INPUT,{context:{response:s,definition:t}});let o=Le(_chunkLLUNR66Gcjs.r.call(void 0, s,"warnings")),i=Le(_chunkLLUNR66Gcjs.r.call(void 0, s,"errors")),a=_chunkLLUNR66Gcjs.r.call(void 0, s,"inputs"),u=_chunkLLUNR66Gcjs.r.call(void 0, s,"outputs");return{inputs:Array.isArray(a)?a.map(Me):[],outputs:Array.isArray(u)?u.map(Fe):[],...o&&{loadWarnings:o},...i&&{loadErrors:i}}}function Le(t){if(!Array.isArray(t))return;let e=t.map(mt).filter(r=>r!==void 0);return e.length>0?e:void 0}function mt(t){if(t==null)return;let e;if(typeof t=="string")e=t;else if(typeof t=="object"){let r=_chunkLLUNR66Gcjs.r.call(void 0, t,"message");if(typeof r=="string"&&r.trim().length>0)e=r;else try{e=_nullishCoalesce(JSON.stringify(t), () => (String(t)))}catch (e6){e=String(t)}}else e=String(t);return e.trim().length>0?e:void 0}async function $(t,e){x("fetchParsedDefinitionIO",_nullishCoalesce(e.suppressBrowserWarning, () => (e.suppressClientSideWarning)));let{inputs:r,outputs:n,loadWarnings:s,loadErrors:o}=await M(t,e),{inputs:i,parseErrors:a}=Oe(r);return{inputs:i,outputs:n,...a.length>0&&{parseErrors:a},...s&&{loadWarnings:s},...o&&{loadErrors:o}}}var X=class t{constructor(e){_chunkLLUNR66Gcjs.a.call(void 0, this,"innerTree");_chunkLLUNR66Gcjs.a.call(void 0, this,"paramName");this.paramName=e,this.innerTree={}}append(e,r){let n=t.formatPathString(e);this.innerTree[n]||(this.innerTree[n]=[]);let s=r.map(o=>({data:t.serializeValue(o)}));return this.innerTree[n].push(...s),this}appendSingle(e,r){return this.append(e,[r])}fromDataTreeDefault(e){this.innerTree={};for(let[r,n]of Object.entries(e)){if(!Array.isArray(n))continue;let s=t.parsePathString(r);this.append(s,n)}return this}appendFlat(e){let r=Array.isArray(e)?e:[e];return this.append([0],r)}flatten(){let e=[];for(let r of Object.values(this.innerTree))if(Array.isArray(r))for(let n of r)e.push(t.deserializeValue(n.data));return e}getPaths(){return Object.keys(this.innerTree)}getPath(e){let r=t.formatPathString(e),n=this.innerTree[r];if(n)return n.map(s=>t.deserializeValue(s.data))}toComputeFormat(){return{ParamName:this.paramName,InnerTree:this.innerTree}}getInnerTree(){return this.innerTree}getParamName(){return this.paramName}static fromInputParams(e){return e.filter(r=>t.hasValidValue(r.default)).map(r=>{let n=new t(r.nickname||"unnamed"),s=r.default;if(r.treeAccess&&C(s))n.fromDataTreeDefault(s),t.isNumericInput(r)&&n.applyNumericConstraints(r.minimum,r.maximum,r.nickname||"unnamed");else{let o=Array.isArray(s)?s:[s],i=t.processValues(o,r);n.appendFlat(i)}return n.toComputeFormat()})}static fromInputParam(e){return t.hasValidValue(e.default)?t.fromInputParams([e])[0]:void 0}static replaceTreeValue(e,r,n){let s=e.length>0&&e[0]instanceof t,o=t.buildFromValue(r,n);if(s){let f=e.slice(),c=f.findIndex(d=>d.getParamName()===r);return c!==-1?f[c]=o:f.push(o),f}let i=e.slice(),a=o.toComputeFormat(),u=i.findIndex(f=>f.ParamName===r);return u!==-1?i[u]=a:i.push(a),i}static buildFromValue(e,r){let n=new t(e);return C(r)?n.fromDataTreeDefault(r):n.appendFlat(r),n}static getTreeValue(e,r){let s=e.length>0&&e[0]instanceof t?t.readFromBuilders(e,r):t.readFromDataTrees(e,r);return s===null||s.length===0?null:s.length===1?s[0]:s}static readFromBuilders(e,r){let n=e.find(s=>s.getParamName()===r);return n?n.flatten():null}static readFromDataTrees(e,r){let n=e.find(i=>i.ParamName===r);if(!_optionalChain([n, 'optionalAccess', _39 => _39.InnerTree]))return null;let s=Object.keys(n.InnerTree)[0];if(!s)return null;let o=n.InnerTree[s];return Array.isArray(o)?o.map(i=>_optionalChain([i, 'optionalAccess', _40 => _40.data])!==void 0?t.deserializeValue(i.data):null):_optionalChain([o, 'optionalAccess', _41 => _41.data])!==void 0?[t.deserializeValue(o.data)]:o!==void 0?[o]:null}static parsePathString(e){let r=e.match(K);if(!r)throw new Error(`Invalid Grasshopper tree path: "${e}". Expected "{}", "{0}", or "{0;1;2}" (negative indices allowed, no empty segments).`);return r[1]?r[1].split(";").map(Number):[]}static formatPathString(e){return`{${e.join(";")}}`}applyNumericConstraints(e,r,n){for(let s of Object.values(this.innerTree))if(Array.isArray(s))for(let o of s){let i=t.deserializeValue(o.data);if(typeof i=="number"){let a=t.clampValue(i,e,r,n);o.data=t.serializeValue(a)}}}static serializeValue(e){return typeof e=="boolean"||typeof e=="number"||typeof e=="string"?e:typeof e=="object"&&e!==null?JSON.stringify(e):String(e)}static deserializeValue(e){if(typeof e=="boolean"||typeof e=="number"||typeof e!="string")return e;if(e.startsWith("{")||e.startsWith("["))try{return JSON.parse(e)}catch (e7){return e}let r=Number(e);return Number.isFinite(r)&&String(r)===e?r:e==="true"?!0:e==="false"?!1:e}static hasValidValue(e){return e==null?!1:typeof e=="string"?!0:!(Array.isArray(e)&&e.length===0||typeof e=="object"&&!Array.isArray(e)&&Object.keys(e).length===0)}static isNumericInput(e){return e.paramType==="Number"||e.paramType==="Integer"}static processValues(e,r){return e.map(n=>t.isNumericInput(r)&&typeof n=="number"?t.clampValue(n,r.minimum,r.maximum,r.nickname||"unnamed"):n).filter(n=>n!=null)}static clampValue(e,r,n,s){let o=e;return r!=null&&o<r&&(_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`${s}: ${e} below min ${r}, clamping`),o=r),n!=null&&o>n&&(_chunkLLUNR66Gcjs.h.call(void 0, ).warn(`${s}: ${e} above max ${n}, clamping`),o=n),o}};exports.a = T; exports.b = k; exports.c = le; exports.d = $e; exports.e = N; exports.f = E; exports.g = O; exports.h = L; exports.i = dt; exports.j = M; exports.k = $; exports.l = X;
-//# sourceMappingURL=chunk-G7NVQAK5.cjs.map