@floor/vlist 0.5.7 → 0.6.0

package/dist/data/index.js

@@ -1,233 +1 @@
-var $j=(U={})=>{let{chunkSize:G=100,maxCachedItems:Y=5000,evictionBuffer:N=200,onEvict:M}=U,Q=new Map,j=0,D=0,T=(q)=>{let X=Q.get(q);
-if(!X)X={items:Array(G),count:0,lastAccess:Date.now()},Q.set(q,X);
-else X.lastAccess=Date.now();
-return X},z=(q)=>{return Math.floor(q/G)},W=(q)=>{return q%G},y=()=>j,L=(q)=>{j=q},b=(q)=>{if(q<0||q>=j)return;
-let X=z(q),B=Q.get(X);
-if(!B)return;
-return B.items[W(q)]},C=(q)=>{if(q<0||q>=j)return!1;
-let X=z(q),B=Q.get(X);
-if(!B)return!1;
-return B.items[W(q)]!==void 0},u=(q,X)=>{let B=z(q),K=T(B),_=W(q),l=K.items[_]===void 0;
-if(K.items[_]=X,l)K.count++,D++;
-if(q>=j)j=q+1},H=(q,X)=>{for(let B=0;
-B<X.length;
-B++){let K=X[B];
-if(K!==void 0)u(q+B,K)}},Z=(q)=>{if(q<0||q>=j)return!1;
-let X=z(q),B=Q.get(X);
-if(!B)return!1;
-let K=W(q);
-if(B.items[K]===void 0)return!1;
-if(B.items[K]=void 0,B.count--,D--,B.count===0)Q.delete(X);
-return!0},F=(q,X)=>{let B=[];
-for(let K=q;
-K<=X&&K<j;
-K++)B.push(b(K));
-return B},V=(q,X)=>{for(let B=q;
-B<=X&&B<j;
-B++)if(!C(B))return!1;
-return!0},O=()=>{let q=[],X=null,B=Array.from(Q.keys()).sort((K,_)=>K-_);
-for(let K of B){let _=Q.get(K);
-if(!_)continue;
-let l=K*G;
-for(let R=0;
-R<G;
-R++){let p=l+R;
-if(p>=j)break;
-if(_.items[R]!==void 0)if(X===null)X={start:p,end:p};
-else if(p===X.end+1)X.end=p;
-else q.push(X),X={start:p,end:p};
-else if(X!==null)q.push(X),X=null}}
-if(X!==null)q.push(X);
-return q},h=(q,X)=>{let B=[],K=null;
-for(let _=q;
-_<=X&&_<j;
-_++)if(!C(_))if(K===null)K={start:_,end:_};
-else K.end=_;
-else if(K!==null)B.push(K),K=null;
-if(K!==null)B.push(K);
-return B},w=(q)=>{return Q.has(q)},k=(q)=>{let X=Q.get(q);
-if(X)X.lastAccess=Date.now()},A=(q,X)=>{if(q>X||Q.size===0)return;
-let B=Date.now(),K=z(Math.max(0,q)),_=z(Math.min(j-1,X));
-for(let l=K;
-l<=_;
-l++){let R=Q.get(l);
-if(R)R.lastAccess=B}},f=(q,X)=>{if(D<=Y)return 0;
-let B=Math.max(0,q-N),K=Math.min(j-1,X+N),_=z(B),l=z(K),R=0,p=[];
-for(let[i,qj]of Q)if(i<_||i>l)R+=qj.count,p.push(i),D-=qj.count,Q.delete(i);
-if(R>0&&M)M(R,p);
-return R},I=()=>{if(D<=Y)return 0;
-let q=Array.from(Q.entries()).sort(([,K],[,_])=>K.lastAccess-_.lastAccess),X=0,B=[];
-for(let[K,_]of q){if(D<=Y)break;
-X+=_.count,D-=_.count,B.push(K),Q.delete(K)}
-if(X>0&&M)M(X,B);
-return X},r=()=>{return{totalItems:j,cachedItems:D,cachedChunks:Q.size,chunkSize:G,maxCachedItems:Y,memoryEfficiency:j>0?1-D/j:1}},t=()=>D,e=()=>{Q.clear(),D=0};
-return{chunkSize:G,maxCachedItems:Y,getTotal:y,setTotal:L,get:b,has:C,set:u,setRange:H,delete:Z,getRange:F,isRangeLoaded:V,getLoadedRanges:O,findUnloadedRanges:h,getChunkIndex:z,isChunkLoaded:w,touchChunk:k,touchChunksForRange:A,evictDistant:f,evictToLimit:I,getStats:r,getCachedCount:t,clear:e,reset:()=>{e(),j=0}}},Uj=(U)=>{if(U.length===0)return[];
-let G=[...U].sort((N,M)=>N.start-M.start),Y=[{...G[0]}];
-for(let N=1;
-N<G.length;
-N++){let M=G[N],Q=Y[Y.length-1];
-if(M.start<=Q.end+1)Q.end=Math.max(Q.end,M.end);
-else Y.push({...M})}
-return Y},Xj=(U,G,Y)=>{let N=Math.floor(U.start/Y)*Y,M=Math.ceil((U.end+1)/Y)*Y-1,Q={start:N,end:M};
-if(G.length===0)return[Q];
-let j=[],D=Uj(G),T=Q.start;
-for(let z of D){if(z.end<T)continue;
-if(z.start>Q.end)break;
-if(z.start>T)j.push({start:T,end:Math.min(z.start-1,Q.end)});
-if(T=z.end+1,T>Q.end)break}
-if(T<=Q.end)j.push({start:T,end:Q.end});
-return j};
-var Yj=(U={})=>{let{enabled:G=!0,maskCharacter:Y="█",randomVariance:N=!0,maxSampleSize:M=20,customGenerator:Q}=U,j=null,D=!1,T=0,z=(Z)=>{if(!G||D||Z.length===0)return;
-let F=new Map,V=new Map,O=Math.min(Z.length,M);
-for(let h=0;
-h<O;
-h++){let w=Z[h];
-if(!w||typeof w!=="object")continue;
-for(let[k,A]of Object.entries(w)){if(k.startsWith("_")||k==="id")continue;
-if(!V.has(k))V.set(k,{lengths:[],types:new Set});
-let f=V.get(k),I=Array.isArray(A)?"array":typeof A;
-if(f.types.add(I),typeof A==="string")f.lengths.push(A.length);
-else if(A!==null&&A!==void 0)f.lengths.push(String(A).length)}}
-for(let[h,w]of V){if(w.lengths.length===0)continue;
-let k=Math.min(...w.lengths),A=Math.max(...w.lengths),f=Math.round(w.lengths.reduce((r,t)=>r+t,0)/w.lengths.length),I="string";
-if(w.types.has("number")&&w.types.size===1)I="number";
-else if(w.types.has("boolean")&&w.types.size===1)I="boolean";
-else if(w.types.has("array"))I="array";
-else if(w.types.has("object")&&!w.types.has("string"))I="object";
-F.set(h,{minLength:k,maxLength:A,avgLength:f,type:I})}
-j=F,D=!0},W=()=>D,y=(Z)=>{let F=Z.avgLength;
-if(N&&Z.minLength!==Z.maxLength){if(F=Math.floor(Math.random()*(Z.maxLength-Z.minLength+1)+Z.minLength),Math.random()<0.3)F=Math.max(1,F+Math.floor(Math.random()*3)-1)}
-return Y.repeat(Math.max(1,F))},L=(Z)=>{if(Q)return{...Q(Z),["_isPlaceholder"]:!0};
-let F={id:`__placeholder_${T++}`,["_isPlaceholder"]:!0,_index:Z};
-if(!j||j.size===0)return F.label=Y.repeat(12),F;
-for(let[V,O]of j)switch(O.type){case"string":F[V]=y(O);
-break;
-case"number":F[V]=0;
-break;
-case"boolean":F[V]=!1;
-break;
-case"array":F[V]=[];
-break;
-case"object":F[V]={};
-break;
-default:F[V]=y(O)}
-return F};
-return{analyzeStructure:z,hasAnalyzedStructure:W,generate:L,generateRange:(Z,F)=>{let V=[];
-for(let O=Z;
-O<=F;
-O++)V.push(L(O));
-return V},isPlaceholder:(Z)=>{if(!Z||typeof Z!=="object")return!1;
-return Z._isPlaceholder===!0},getPlaceholderKey:()=>"_isPlaceholder",clear:()=>{j=null,D=!1,T=0}}},d=(U)=>{if(!U||typeof U!=="object")return!1;
-return U._isPlaceholder===!0},Nj=(U)=>{return U.filter((G)=>!d(G))},Fj=(U)=>{let G=0;
-for(let Y of U)if(Y!==void 0&&!d(Y))G++;
-return G},Ej=(U,G,Y)=>{let N=0;
-for(let M=0;
-M<G.length;
-M++){let Q=Y+M,j=U[Q];
-if(j===void 0||d(j)){if(U[Q]=G[M],d(j))N++}}
-return N};
-var Lj=50,Bj=(U={})=>{let{adapter:G,initialItems:Y,initialTotal:N,storage:M,placeholder:Q,pageSize:j=Lj,onStateChange:D,onItemsLoaded:T,onItemsEvicted:z}=U,W=$j({...M,onEvict:(J,$)=>{z?.(J),O()}}),y=null,L=()=>{if(!y)y=Yj(Q);
-return y},b=new Map,C=!1,u,H=!0,Z,F=[],V=new Map,O=()=>{D?.(e())},h=()=>{b.clear();
-let J=W.getLoadedRanges();
-for(let $ of J)for(let P=$.start;
-P<=$.end;
-P++){let E=W.get(P);
-if(E&&!d(E))b.set(E.id,P)}},w=(J,$)=>{if(!d($))b.set($.id,J)},k=(J)=>{b.delete(J)},A=(J,$)=>{return`${J}-${$}`},f=()=>W.getTotal(),I=()=>W.getCachedCount(),r=()=>C,t=()=>H,e=()=>({total:W.getTotal(),cached:W.getCachedCount(),isLoading:C,pendingRanges:F,error:u,hasMore:H,cursor:Z}),Zj=()=>W,q=()=>L(),X=(J)=>{let $=W.get(J);
-if($!==void 0)return $;
-if(J>=0&&J<W.getTotal())return L().generate(J);
-return},B=(J)=>{let $=b.get(J);
-if($===void 0)return;
-return W.get($)},K=(J)=>{return b.get(J)??-1},_=(J)=>{let $=W.get(J);
-return $!==void 0&&!d($)},l=(J,$)=>{let P=[],E=W.getTotal(),g=0,x=0;
-W.touchChunksForRange(J,Math.min($,E-1));
-for(let c=J;
-c<=$&&c<E;
-c++){let s=W.get(c);
-if(s!==void 0)P.push(s),g++;
-else P.push(L().generate(c)),x++}
-return P},R=(J)=>{W.setTotal(J),H=W.getCachedCount()<J,O()},p=(J,$=0,P)=>{if(y&&!y.hasAnalyzedStructure()&&J.length>0)y.analyzeStructure(J);
-for(let E=0;
-E<J.length;
-E++){let g=J[E];
-if(g!==void 0){let x=$+E;
-W.set(x,g),w(x,g)}}
-if(P!==void 0)W.setTotal(P);
-else if($+J.length>W.getTotal())W.setTotal($+J.length);
-H=W.getCachedCount()<W.getTotal(),T?.(J,$,W.getTotal()),O()},i=(J,$)=>{let P=b.get(J);
-if(P===void 0)return!1;
-let E=W.get(P);
-if(!E)return!1;
-let g={...E,...$};
-if(W.set(P,g),$.id!==void 0&&$.id!==J)k(J),w(P,g);
-return O(),!0},qj=(J)=>{let $=b.get(J);
-if($===void 0)return!1;
-W.delete($),k(J);
-let P=W.getTotal();
-if(P>0)W.setTotal(P-1);
-return O(),!0},Jj=async(J,$)=>{if(!G)return;
-let P=A(J,$);
-if(V.has(P))return;
-let E=W.getLoadedRanges(),g=Xj({start:J,end:$},E,W.chunkSize);
-if(g.length===0)return;
-let x=W.chunkSize,c=[];
-for(let v of g){let a=Math.floor(v.start/x),n=Math.floor(v.end/x);
-for(let S=a;
-S<=n;
-S++){let o=S*x,m=o+x-1,Qj=A(o,m);
-if(!c.some((Wj)=>Wj.start===o)&&!V.has(Qj))c.push({start:o,end:m})}}
-let s=[];
-for(let v of g){let a=Math.floor(v.start/x),n=Math.floor(v.end/x);
-for(let S=a;
-S<=n;
-S++){let o=S*x,m=o+x-1,Qj=A(o,m);
-if(V.has(Qj)){let Wj=V.get(Qj);
-if(!s.includes(Wj))s.push(Wj)}}}
-for(let v of c){let a=A(v.start,v.end),n=(async()=>{F.push(v),C=!0,u=void 0,O();
-try{let S=v.end-v.start+1,o={offset:v.start,limit:S,cursor:void 0},m=await G.read(o);
-if(p(m.items,v.start,m.total),m.cursor)Z=m.cursor;
-if(m.hasMore!==void 0)H=m.hasMore;
-else if(m.total!==void 0)H=W.getCachedCount()<m.total}
-catch(S){u=S instanceof Error?S:Error(String(S))}
-finally{V.delete(a),F=F.filter((S)=>S.start!==v.start||S.end!==v.end),C=V.size>0,O()}})();
-V.set(a,n),s.push(n)}
-await Promise.all(s)},Aj=async(J,$)=>{if(W.isRangeLoaded(J,$))return;
-await Jj(J,$)},Dj=async()=>{if(!G)return;
-await Jj(0,j-1)},Oj=async()=>{if(!G||C||!H)return!1;
-let J=W.getCachedCount(),$=W.getTotal(),P=J,E=Math.min(P+j-1,$>0?$-1:P+j-1);
-if(P>=$&&$>0)return H=!1,!1;
-return await Jj(P,E),W.getCachedCount()>J},zj=async()=>{if(W.clear(),b.clear(),y)y.clear();
-Z=void 0,H=!0,u=void 0,O(),await Dj()},Hj=(J,$)=>{if(W.evictDistant(J,$)>0)h()},yj=()=>{W.clear(),b.clear(),Z=void 0,u=void 0,F=[],C=!1,O()},bj=()=>{if(W.reset(),b.clear(),y)y.clear();
-Z=void 0,H=!0,u=void 0,F=[],C=!1,O()};
-if(Y&&Y.length>0)p(Y,0,N??Y.length);
-else if(N!==void 0)W.setTotal(N);
-return{getState:e,getTotal:f,getCached:I,getIsLoading:r,getHasMore:t,getStorage:Zj,getPlaceholders:q,getItem:X,getItemById:B,getIndexById:K,isItemLoaded:_,getItemsInRange:l,setTotal:R,setItems:p,updateItem:i,removeItem:qj,loadRange:Jj,ensureRange:Aj,loadInitial:Dj,loadMore:Oj,reload:zj,evictDistant:Hj,clear:yj,reset:bj}};
-var Vj=(U,G,Y,N,M,Q)=>{if(N===0||G===0)return Q.start=0,Q.end=-1,Q;
-let j=Y.indexAtOffset(U),D=Y.indexAtOffset(U+G);
-if(D<N-1)D++;
-return Q.start=Math.max(0,j),Q.end=Math.min(N-1,Math.max(0,D)),Q},wj=(U,G,Y,N)=>{if(Y===0)return N.start=0,N.end=-1,N;
-return N.start=Math.max(0,U.start-G),N.end=Math.min(Y-1,U.end+G),N};
-var Gj=(U,G,Y,N,M,Q=Vj)=>{return Q(U.scrollTop,U.containerHeight,G,Y,M,U.visibleRange),wj(U.visibleRange,N,Y,U.renderRange),U.totalHeight=M.virtualHeight,U.actualHeight=M.actualHeight,U.isCompressed=M.isCompressed,U.compressionRatio=M.ratio,U};
-var Kj=200,jj=50;
-var Mj=15,Pj=2,_j=50;
-var Tj=(U)=>{let{adapter:G,loading:Y}=U,N=Y?.cancelThreshold??Mj,M=Y?.preloadThreshold??Pj,Q=Y?.preloadAhead??_j;
-return{name:"withData",priority:20,methods:["reload"],setup(j){let{emitter:D}=j,T=j.config.reverse,z=j.config.overscan,W=Bj({adapter:G,pageSize:jj,onStateChange:()=>{if(j.state.isInitialized)j.heightCache.rebuild(j.getVirtualTotal()),j.updateCompressionMode(),j.state.viewportState=Gj(j.state.viewportState,j.heightCache,j.getVirtualTotal(),z,j.getCachedCompression()),j.updateContentSize(j.state.viewportState.totalHeight),j.renderIfNeeded()},onItemsLoaded:(Z,F,V)=>{if(j.state.isInitialized)j.heightCache.rebuild(j.getVirtualTotal()),j.forceRender(),D.emit("load:end",{items:Z,total:V})}});
-j.replaceDataManager(W);
-let y=null,L=null,b=0,C=()=>{if(L){let Z=L;
-L=null,j.dataManager.ensureRange(Z.start,Z.end).catch((F)=>{D.emit("error",{error:F,context:"ensureRange"})})}};
-j.afterScroll.push((Z,F)=>{if(j.state.isDestroyed)return;
-let V=j.scrollController.getVelocity(),h=j.scrollController.isTracking()&&V<=N;
-if(L&&b>N&&V<=N){let A=L;
-L=null,j.dataManager.ensureRange(A.start,A.end).catch((f)=>{D.emit("error",{error:f,context:"ensureRange"})})}
-if(b=V,h&&!j.dataManager.getIsLoading()&&j.dataManager.getHasMore()){if(T){if(Z<Kj)D.emit("load:start",{offset:j.dataManager.getCached(),limit:jj}),j.dataManager.loadMore().catch((A)=>{D.emit("error",{error:A,context:"loadMore"})})}
-else if(j.state.viewportState.totalHeight-Z-j.state.viewportState.containerHeight<Kj)D.emit("load:start",{offset:j.dataManager.getCached(),limit:jj}),j.dataManager.loadMore().catch((f)=>{D.emit("error",{error:f,context:"loadMore"})})}
-let{renderRange:w}=j.state.viewportState;
-if(!y||w.start!==y.start||w.end!==y.end)if(y={start:w.start,end:w.end},h){L=null;
-let{start:A,end:f}=w,I=j.getVirtualTotal();
-if(V>M)if(F==="down")f=Math.min(w.end+Q,I-1);
-else A=Math.max(w.start-Q,0);
-j.dataManager.ensureRange(A,f).catch((r)=>{D.emit("error",{error:r,context:"ensureRange"})})}
-else L={start:w.start,end:w.end}});
-let u=200,H=null;
-j.afterScroll.push((Z,F)=>{if(H!==null)clearTimeout(H);
-H=setTimeout(()=>{H=null,C()},u)}),j.destroyHandlers.push(()=>{if(H!==null)clearTimeout(H),H=null}),D.on("load:start",()=>{j.dom.root.setAttribute("aria-busy","true")}),D.on("load:end",()=>{j.dom.root.removeAttribute("aria-busy")}),j.methods.set("reload",async()=>{await j.dataManager.reload()}),D.emit("load:start",{offset:0,limit:jj}),j.dataManager.loadInitial().catch((Z)=>{D.emit("error",{error:Z,context:"loadInitial"})})}}};
-export{Tj as withData,Ej as replacePlaceholders,Uj as mergeRanges,d as isPlaceholderItem,Nj as filterPlaceholders,$j as createSparseStorage,Yj as createPlaceholderManager,Bj as createDataManager,Fj as countRealItems,Xj as calculateMissingRanges};
+var $j=(U={})=>{let{chunkSize:G=100,maxCachedItems:Y=5000,evictionBuffer:N=200,onEvict:M}=U,Q=new Map,j=0,D=0,T=(q)=>{let X=Q.get(q);if(!X)X={items:Array(G),count:0,lastAccess:Date.now()},Q.set(q,X);else X.lastAccess=Date.now();return X},z=(q)=>{return Math.floor(q/G)},W=(q)=>{return q%G},y=()=>j,L=(q)=>{j=q},b=(q)=>{if(q<0||q>=j)return;let X=z(q),B=Q.get(X);if(!B)return;return B.items[W(q)]},C=(q)=>{if(q<0||q>=j)return!1;let X=z(q),B=Q.get(X);if(!B)return!1;return B.items[W(q)]!==void 0},u=(q,X)=>{let B=z(q),K=T(B),_=W(q),l=K.items[_]===void 0;if(K.items[_]=X,l)K.count++,D++;if(q>=j)j=q+1},H=(q,X)=>{for(let B=0;B<X.length;B++){let K=X[B];if(K!==void 0)u(q+B,K)}},Z=(q)=>{if(q<0||q>=j)return!1;let X=z(q),B=Q.get(X);if(!B)return!1;let K=W(q);if(B.items[K]===void 0)return!1;if(B.items[K]=void 0,B.count--,D--,B.count===0)Q.delete(X);return!0},F=(q,X)=>{let B=[];for(let K=q;K<=X&&K<j;K++)B.push(b(K));return B},V=(q,X)=>{for(let B=q;B<=X&&B<j;B++)if(!C(B))return!1;return!0},O=()=>{let q=[],X=null,B=Array.from(Q.keys()).sort((K,_)=>K-_);for(let K of B){let _=Q.get(K);if(!_)continue;let l=K*G;for(let R=0;R<G;R++){let p=l+R;if(p>=j)break;if(_.items[R]!==void 0)if(X===null)X={start:p,end:p};else if(p===X.end+1)X.end=p;else q.push(X),X={start:p,end:p};else if(X!==null)q.push(X),X=null}}if(X!==null)q.push(X);return q},h=(q,X)=>{let B=[],K=null;for(let _=q;_<=X&&_<j;_++)if(!C(_))if(K===null)K={start:_,end:_};else K.end=_;else if(K!==null)B.push(K),K=null;if(K!==null)B.push(K);return B},w=(q)=>{return Q.has(q)},k=(q)=>{let X=Q.get(q);if(X)X.lastAccess=Date.now()},A=(q,X)=>{if(q>X||Q.size===0)return;let B=Date.now(),K=z(Math.max(0,q)),_=z(Math.min(j-1,X));for(let l=K;l<=_;l++){let R=Q.get(l);if(R)R.lastAccess=B}},f=(q,X)=>{if(D<=Y)return 0;let B=Math.max(0,q-N),K=Math.min(j-1,X+N),_=z(B),l=z(K),R=0,p=[];for(let[i,qj]of Q)if(i<_||i>l)R+=qj.count,p.push(i),D-=qj.count,Q.delete(i);if(R>0&&M)M(R,p);return R},I=()=>{if(D<=Y)return 0;let q=Array.from(Q.entries()).sort(([,K],[,_])=>K.lastAccess-_.lastAccess),X=0,B=[];for(let[K,_]of q){if(D<=Y)break;X+=_.count,D-=_.count,B.push(K),Q.delete(K)}if(X>0&&M)M(X,B);return X},r=()=>{return{totalItems:j,cachedItems:D,cachedChunks:Q.size,chunkSize:G,maxCachedItems:Y,memoryEfficiency:j>0?1-D/j:1}},t=()=>D,e=()=>{Q.clear(),D=0};return{chunkSize:G,maxCachedItems:Y,getTotal:y,setTotal:L,get:b,has:C,set:u,setRange:H,delete:Z,getRange:F,isRangeLoaded:V,getLoadedRanges:O,findUnloadedRanges:h,getChunkIndex:z,isChunkLoaded:w,touchChunk:k,touchChunksForRange:A,evictDistant:f,evictToLimit:I,getStats:r,getCachedCount:t,clear:e,reset:()=>{e(),j=0}}},Uj=(U)=>{if(U.length===0)return[];let G=[...U].sort((N,M)=>N.start-M.start),Y=[{...G[0]}];for(let N=1;N<G.length;N++){let M=G[N],Q=Y[Y.length-1];if(M.start<=Q.end+1)Q.end=Math.max(Q.end,M.end);else Y.push({...M})}return Y},Xj=(U,G,Y)=>{let N=Math.floor(U.start/Y)*Y,M=Math.ceil((U.end+1)/Y)*Y-1,Q={start:N,end:M};if(G.length===0)return[Q];let j=[],D=Uj(G),T=Q.start;for(let z of D){if(z.end<T)continue;if(z.start>Q.end)break;if(z.start>T)j.push({start:T,end:Math.min(z.start-1,Q.end)});if(T=z.end+1,T>Q.end)break}if(T<=Q.end)j.push({start:T,end:Q.end});return j};var Yj=(U={})=>{let{enabled:G=!0,maskCharacter:Y="█",randomVariance:N=!0,maxSampleSize:M=20,customGenerator:Q}=U,j=null,D=!1,T=0,z=(Z)=>{if(!G||D||Z.length===0)return;let F=new Map,V=new Map,O=Math.min(Z.length,M);for(let h=0;h<O;h++){let w=Z[h];if(!w||typeof w!=="object")continue;for(let[k,A]of Object.entries(w)){if(k.startsWith("_")||k==="id")continue;if(!V.has(k))V.set(k,{lengths:[],types:new Set});let f=V.get(k),I=Array.isArray(A)?"array":typeof A;if(f.types.add(I),typeof A==="string")f.lengths.push(A.length);else if(A!==null&&A!==void 0)f.lengths.push(String(A).length)}}for(let[h,w]of V){if(w.lengths.length===0)continue;let k=Math.min(...w.lengths),A=Math.max(...w.lengths),f=Math.round(w.lengths.reduce((r,t)=>r+t,0)/w.lengths.length),I="string";if(w.types.has("number")&&w.types.size===1)I="number";else if(w.types.has("boolean")&&w.types.size===1)I="boolean";else if(w.types.has("array"))I="array";else if(w.types.has("object")&&!w.types.has("string"))I="object";F.set(h,{minLength:k,maxLength:A,avgLength:f,type:I})}j=F,D=!0},W=()=>D,y=(Z)=>{let F=Z.avgLength;if(N&&Z.minLength!==Z.maxLength){if(F=Math.floor(Math.random()*(Z.maxLength-Z.minLength+1)+Z.minLength),Math.random()<0.3)F=Math.max(1,F+Math.floor(Math.random()*3)-1)}return Y.repeat(Math.max(1,F))},L=(Z)=>{if(Q)return{...Q(Z),["_isPlaceholder"]:!0};let F={id:`__placeholder_${T++}`,["_isPlaceholder"]:!0,_index:Z};if(!j||j.size===0)return F.label=Y.repeat(12),F;for(let[V,O]of j)switch(O.type){case"string":F[V]=y(O);break;case"number":F[V]=0;break;case"boolean":F[V]=!1;break;case"array":F[V]=[];break;case"object":F[V]={};break;default:F[V]=y(O)}return F};return{analyzeStructure:z,hasAnalyzedStructure:W,generate:L,generateRange:(Z,F)=>{let V=[];for(let O=Z;O<=F;O++)V.push(L(O));return V},isPlaceholder:(Z)=>{if(!Z||typeof Z!=="object")return!1;return Z._isPlaceholder===!0},getPlaceholderKey:()=>"_isPlaceholder",clear:()=>{j=null,D=!1,T=0}}},d=(U)=>{if(!U||typeof U!=="object")return!1;return U._isPlaceholder===!0},Nj=(U)=>{return U.filter((G)=>!d(G))},Fj=(U)=>{let G=0;for(let Y of U)if(Y!==void 0&&!d(Y))G++;return G},Ej=(U,G,Y)=>{let N=0;for(let M=0;M<G.length;M++){let Q=Y+M,j=U[Q];if(j===void 0||d(j)){if(U[Q]=G[M],d(j))N++}}return N};var Lj=50,Bj=(U={})=>{let{adapter:G,initialItems:Y,initialTotal:N,storage:M,placeholder:Q,pageSize:j=Lj,onStateChange:D,onItemsLoaded:T,onItemsEvicted:z}=U,W=$j({...M,onEvict:(J,$)=>{z?.(J),O()}}),y=null,L=()=>{if(!y)y=Yj(Q);return y},b=new Map,C=!1,u,H=!0,Z,F=[],V=new Map,O=()=>{D?.(e())},h=()=>{b.clear();let J=W.getLoadedRanges();for(let $ of J)for(let P=$.start;P<=$.end;P++){let E=W.get(P);if(E&&!d(E))b.set(E.id,P)}},w=(J,$)=>{if(!d($))b.set($.id,J)},k=(J)=>{b.delete(J)},A=(J,$)=>{return`${J}-${$}`},f=()=>W.getTotal(),I=()=>W.getCachedCount(),r=()=>C,t=()=>H,e=()=>({total:W.getTotal(),cached:W.getCachedCount(),isLoading:C,pendingRanges:F,error:u,hasMore:H,cursor:Z}),Zj=()=>W,q=()=>L(),X=(J)=>{let $=W.get(J);if($!==void 0)return $;if(J>=0&&J<W.getTotal())return L().generate(J);return},B=(J)=>{let $=b.get(J);if($===void 0)return;return W.get($)},K=(J)=>{return b.get(J)??-1},_=(J)=>{let $=W.get(J);return $!==void 0&&!d($)},l=(J,$)=>{let P=[],E=W.getTotal(),g=0,x=0;W.touchChunksForRange(J,Math.min($,E-1));for(let c=J;c<=$&&c<E;c++){let s=W.get(c);if(s!==void 0)P.push(s),g++;else P.push(L().generate(c)),x++}return P},R=(J)=>{W.setTotal(J),H=W.getCachedCount()<J,O()},p=(J,$=0,P)=>{if(y&&!y.hasAnalyzedStructure()&&J.length>0)y.analyzeStructure(J);for(let E=0;E<J.length;E++){let g=J[E];if(g!==void 0){let x=$+E;W.set(x,g),w(x,g)}}if(P!==void 0)W.setTotal(P);else if($+J.length>W.getTotal())W.setTotal($+J.length);H=W.getCachedCount()<W.getTotal(),T?.(J,$,W.getTotal()),O()},i=(J,$)=>{let P=b.get(J);if(P===void 0)return!1;let E=W.get(P);if(!E)return!1;let g={...E,...$};if(W.set(P,g),$.id!==void 0&&$.id!==J)k(J),w(P,g);return O(),!0},qj=(J)=>{let $=b.get(J);if($===void 0)return!1;W.delete($),k(J);let P=W.getTotal();if(P>0)W.setTotal(P-1);return O(),!0},Jj=async(J,$)=>{if(!G)return;let P=A(J,$);if(V.has(P))return;let E=W.getLoadedRanges(),g=Xj({start:J,end:$},E,W.chunkSize);if(g.length===0)return;let x=W.chunkSize,c=[];for(let v of g){let a=Math.floor(v.start/x),n=Math.floor(v.end/x);for(let S=a;S<=n;S++){let o=S*x,m=o+x-1,Qj=A(o,m);if(!c.some((Wj)=>Wj.start===o)&&!V.has(Qj))c.push({start:o,end:m})}}let s=[];for(let v of g){let a=Math.floor(v.start/x),n=Math.floor(v.end/x);for(let S=a;S<=n;S++){let o=S*x,m=o+x-1,Qj=A(o,m);if(V.has(Qj)){let Wj=V.get(Qj);if(!s.includes(Wj))s.push(Wj)}}}for(let v of c){let a=A(v.start,v.end),n=(async()=>{F.push(v),C=!0,u=void 0,O();try{let S=v.end-v.start+1,o={offset:v.start,limit:S,cursor:void 0},m=await G.read(o);if(p(m.items,v.start,m.total),m.cursor)Z=m.cursor;if(m.hasMore!==void 0)H=m.hasMore;else if(m.total!==void 0)H=W.getCachedCount()<m.total}catch(S){u=S instanceof Error?S:Error(String(S))}finally{V.delete(a),F=F.filter((S)=>S.start!==v.start||S.end!==v.end),C=V.size>0,O()}})();V.set(a,n),s.push(n)}await Promise.all(s)},Aj=async(J,$)=>{if(W.isRangeLoaded(J,$))return;await Jj(J,$)},Dj=async()=>{if(!G)return;await Jj(0,j-1)},Oj=async()=>{if(!G||C||!H)return!1;let J=W.getCachedCount(),$=W.getTotal(),P=J,E=Math.min(P+j-1,$>0?$-1:P+j-1);if(P>=$&&$>0)return H=!1,!1;return await Jj(P,E),W.getCachedCount()>J},zj=async()=>{if(W.clear(),b.clear(),y)y.clear();Z=void 0,H=!0,u=void 0,O(),await Dj()},Hj=(J,$)=>{if(W.evictDistant(J,$)>0)h()},yj=()=>{W.clear(),b.clear(),Z=void 0,u=void 0,F=[],C=!1,O()},bj=()=>{if(W.reset(),b.clear(),y)y.clear();Z=void 0,H=!0,u=void 0,F=[],C=!1,O()};if(Y&&Y.length>0)p(Y,0,N??Y.length);else if(N!==void 0)W.setTotal(N);return{getState:e,getTotal:f,getCached:I,getIsLoading:r,getHasMore:t,getStorage:Zj,getPlaceholders:q,getItem:X,getItemById:B,getIndexById:K,isItemLoaded:_,getItemsInRange:l,setTotal:R,setItems:p,updateItem:i,removeItem:qj,loadRange:Jj,ensureRange:Aj,loadInitial:Dj,loadMore:Oj,reload:zj,evictDistant:Hj,clear:yj,reset:bj}};var Vj=(U,G,Y,N,M,Q)=>{if(N===0||G===0)return Q.start=0,Q.end=-1,Q;let j=Y.indexAtOffset(U),D=Y.indexAtOffset(U+G);if(D<N-1)D++;return Q.start=Math.max(0,j),Q.end=Math.min(N-1,Math.max(0,D)),Q},wj=(U,G,Y,N)=>{if(Y===0)return N.start=0,N.end=-1,N;return N.start=Math.max(0,U.start-G),N.end=Math.min(Y-1,U.end+G),N};var Gj=(U,G,Y,N,M,Q=Vj)=>{return Q(U.scrollTop,U.containerHeight,G,Y,M,U.visibleRange),wj(U.visibleRange,N,Y,U.renderRange),U.totalHeight=M.virtualHeight,U.actualHeight=M.actualHeight,U.isCompressed=M.isCompressed,U.compressionRatio=M.ratio,U};var Kj=200,jj=50;var Mj=15,Pj=2,_j=50;var Tj=(U)=>{let{adapter:G,loading:Y}=U,N=Y?.cancelThreshold??Mj,M=Y?.preloadThreshold??Pj,Q=Y?.preloadAhead??_j;return{name:"withData",priority:20,methods:["reload"],setup(j){let{emitter:D}=j,T=j.config.reverse,z=j.config.overscan,W=Bj({adapter:G,pageSize:jj,onStateChange:()=>{if(j.state.isInitialized)j.heightCache.rebuild(j.getVirtualTotal()),j.updateCompressionMode(),j.state.viewportState=Gj(j.state.viewportState,j.heightCache,j.getVirtualTotal(),z,j.getCachedCompression()),j.updateContentSize(j.state.viewportState.totalHeight),j.renderIfNeeded()},onItemsLoaded:(Z,F,V)=>{if(j.state.isInitialized)j.heightCache.rebuild(j.getVirtualTotal()),j.forceRender(),D.emit("load:end",{items:Z,total:V})}});j.replaceDataManager(W);let y=null,L=null,b=0,C=()=>{if(L){let Z=L;L=null,j.dataManager.ensureRange(Z.start,Z.end).catch((F)=>{D.emit("error",{error:F,context:"ensureRange"})})}};j.afterScroll.push((Z,F)=>{if(j.state.isDestroyed)return;let V=j.scrollController.getVelocity(),h=j.scrollController.isTracking()&&V<=N;if(L&&b>N&&V<=N){let A=L;L=null,j.dataManager.ensureRange(A.start,A.end).catch((f)=>{D.emit("error",{error:f,context:"ensureRange"})})}if(b=V,h&&!j.dataManager.getIsLoading()&&j.dataManager.getHasMore()){if(T){if(Z<Kj)D.emit("load:start",{offset:j.dataManager.getCached(),limit:jj}),j.dataManager.loadMore().catch((A)=>{D.emit("error",{error:A,context:"loadMore"})})}else if(j.state.viewportState.totalHeight-Z-j.state.viewportState.containerHeight<Kj)D.emit("load:start",{offset:j.dataManager.getCached(),limit:jj}),j.dataManager.loadMore().catch((f)=>{D.emit("error",{error:f,context:"loadMore"})})}let{renderRange:w}=j.state.viewportState;if(!y||w.start!==y.start||w.end!==y.end)if(y={start:w.start,end:w.end},h){L=null;let{start:A,end:f}=w,I=j.getVirtualTotal();if(V>M)if(F==="down")f=Math.min(w.end+Q,I-1);else A=Math.max(w.start-Q,0);j.dataManager.ensureRange(A,f).catch((r)=>{D.emit("error",{error:r,context:"ensureRange"})})}else L={start:w.start,end:w.end}});let u=200,H=null;j.afterScroll.push((Z,F)=>{if(H!==null)clearTimeout(H);H=setTimeout(()=>{H=null,C()},u)}),j.destroyHandlers.push(()=>{if(H!==null)clearTimeout(H),H=null}),D.on("load:start",()=>{j.dom.root.setAttribute("aria-busy","true")}),D.on("load:end",()=>{j.dom.root.removeAttribute("aria-busy")}),j.methods.set("reload",async()=>{await j.dataManager.reload()}),D.emit("load:start",{offset:0,limit:jj}),j.dataManager.loadInitial().catch((Z)=>{D.emit("error",{error:Z,context:"loadInitial"})})}}};export{Tj as withData,Ej as replacePlaceholders,Uj as mergeRanges,d as isPlaceholderItem,Nj as filterPlaceholders,$j as createSparseStorage,Yj as createPlaceholderManager,Bj as createDataManager,Fj as countRealItems,Xj as calculateMissingRanges};

package/dist/features/async/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * vlist - Data Domain
+ * Data management, sparse storage, and placeholder generation
+ */
+export { withAsync, type DataPluginConfig } from "./plugin";
+export { createDataManager, mergeRanges, calculateMissingRanges, isPlaceholderItem, filterPlaceholders, countRealItems, type DataManager, type DataManagerConfig, type DataState, } from "./manager";
+export { createSparseStorage, type SparseStorage, type SparseStorageConfig, type SparseStorageStats, } from "./sparse";
+export { createPlaceholderManager, replacePlaceholders, type PlaceholderManager, type PlaceholderConfig, } from "./placeholder";
+//# sourceMappingURL=index.d.ts.map

package/dist/features/async/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/features/async/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,SAAS,EAAE,KAAK,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAG5D,OAAO,EACL,iBAAiB,EACjB,WAAW,EACX,sBAAsB,EACtB,iBAAiB,EACjB,kBAAkB,EAClB,cAAc,EACd,KAAK,WAAW,EAChB,KAAK,iBAAiB,EACtB,KAAK,SAAS,GACf,MAAM,WAAW,CAAC;AAGnB,OAAO,EACL,mBAAmB,EACnB,KAAK,aAAa,EAClB,KAAK,mBAAmB,EACxB,KAAK,kBAAkB,GACxB,MAAM,UAAU,CAAC;AAGlB,OAAO,EACL,wBAAwB,EACxB,mBAAmB,EACnB,KAAK,kBAAkB,EACvB,KAAK,iBAAiB,GACvB,MAAM,eAAe,CAAC"}

package/dist/features/async/manager.d.ts

@@ -0,0 +1,103 @@
+/**
+ * vlist - Data Management
+ * Handles data with sparse storage for million+ item support
+ */
+import type { VListItem, VListAdapter, Range } from "../../types";
+import { type SparseStorage, type SparseStorageConfig } from "./sparse";
+import { type PlaceholderConfig, type PlaceholderManager } from "./placeholder";
+/** Data manager configuration */
+export interface DataManagerConfig<T extends VListItem = VListItem> {
+    /** Async data adapter */
+    adapter?: VListAdapter<T>;
+    /** Initial items (optional) */
+    initialItems?: T[];
+    /** Initial total count (if known) */
+    initialTotal?: number;
+    /** Sparse storage configuration */
+    storage?: SparseStorageConfig;
+    /** Placeholder configuration */
+    placeholder?: PlaceholderConfig;
+    /** Items per load request (default: 50) */
+    pageSize?: number;
+    /** Callback when state changes */
+    onStateChange?: (state: DataState<T>) => void;
+    /** Callback when items are loaded */
+    onItemsLoaded?: (items: T[], offset: number, total: number) => void;
+    /** Callback when items are evicted */
+    onItemsEvicted?: (count: number) => void;
+}
+/** Data state */
+export interface DataState<_T extends VListItem = VListItem> {
+    /** Total items (declared, may be larger than loaded) */
+    total: number;
+    /** Number of items in memory */
+    cached: number;
+    /** Whether data is loading */
+    isLoading: boolean;
+    /** Pending load ranges */
+    pendingRanges: Range[];
+    /** Error from last operation */
+    error: Error | undefined;
+    /** Whether more items exist */
+    hasMore: boolean;
+    /** Current cursor (for cursor pagination) */
+    cursor: string | undefined;
+}
+/** Data manager instance */
+export interface DataManager<T extends VListItem = VListItem> {
+    /** Get current state */
+    getState: () => DataState<T>;
+    /** Get total item count (direct getter, no allocation) */
+    getTotal: () => number;
+    /** Get cached item count (direct getter, no allocation) */
+    getCached: () => number;
+    /** Check if currently loading (direct getter, no allocation) */
+    getIsLoading: () => boolean;
+    /** Check if more items available (direct getter, no allocation) */
+    getHasMore: () => boolean;
+    /** Get sparse storage */
+    getStorage: () => SparseStorage<T>;
+    /** Get placeholder manager */
+    getPlaceholders: () => PlaceholderManager<T>;
+    /** Get item at index (may return placeholder if not loaded) */
+    getItem: (index: number) => T | undefined;
+    /** Get item by ID */
+    getItemById: (id: string | number) => T | undefined;
+    /** Get index by ID (-1 if not found) */
+    getIndexById: (id: string | number) => number;
+    /** Check if item at index is loaded (not placeholder) */
+    isItemLoaded: (index: number) => boolean;
+    /** Get items in range (includes placeholders for unloaded) */
+    getItemsInRange: (start: number, end: number) => T[];
+    /** Set total item count */
+    setTotal: (total: number) => void;
+    /** Set items at offset */
+    setItems: (items: T[], offset?: number, total?: number) => void;
+    /** Update item by ID */
+    updateItem: (id: string | number, updates: Partial<T>) => boolean;
+    /** Remove item by ID */
+    removeItem: (id: string | number) => boolean;
+    /** Load items for a range */
+    loadRange: (start: number, end: number) => Promise<void>;
+    /** Ensure range is loaded (no-op if already loaded) */
+    ensureRange: (start: number, end: number) => Promise<void>;
+    /** Load initial data */
+    loadInitial: () => Promise<void>;
+    /** Load more items (infinite scroll) */
+    loadMore: () => Promise<boolean>;
+    /** Reload all data */
+    reload: () => Promise<void>;
+    /** Evict items far from visible range */
+    evictDistant: (visibleStart: number, visibleEnd: number) => void;
+    /** Clear all data */
+    clear: () => void;
+    /** Reset to initial state */
+    reset: () => void;
+}
+/**
+ * Create a data manager with sparse storage support
+ */
+export declare const createDataManager: <T extends VListItem = VListItem>(config?: DataManagerConfig<T>) => DataManager<T>;
+export { mergeRanges, calculateMissingRanges } from "./sparse";
+export { isPlaceholderItem, filterPlaceholders, countRealItems, } from "./placeholder";
+//# sourceMappingURL=manager.d.ts.map

package/dist/features/async/manager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"manager.d.ts","sourceRoot":"","sources":["../../../src/features/async/manager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,YAAY,EAAiB,KAAK,EAAE,MAAM,aAAa,CAAC;AAEjF,OAAO,EAGL,KAAK,aAAa,EAClB,KAAK,mBAAmB,EACzB,MAAM,UAAU,CAAC;AAElB,OAAO,EAGL,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACxB,MAAM,eAAe,CAAC;AAMvB,iCAAiC;AACjC,MAAM,WAAW,iBAAiB,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS;IAChE,yBAAyB;IACzB,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IAE1B,+BAA+B;IAC/B,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC;IAEnB,qCAAqC;IACrC,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB,mCAAmC;IACnC,OAAO,CAAC,EAAE,mBAAmB,CAAC;IAE9B,gCAAgC;IAChC,WAAW,CAAC,EAAE,iBAAiB,CAAC;IAEhC,2CAA2C;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,kCAAkC;IAClC,aAAa,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC;IAE9C,qCAAqC;IACrC,aAAa,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IAEpE,sCAAsC;IACtC,cAAc,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CAC1C;AAED,iBAAiB;AACjB,MAAM,WAAW,SAAS,CAAC,EAAE,SAAS,SAAS,GAAG,SAAS;IACzD,wDAAwD;IACxD,KAAK,EAAE,MAAM,CAAC;IAEd,gCAAgC;IAChC,MAAM,EAAE,MAAM,CAAC;IAEf,8BAA8B;IAC9B,SAAS,EAAE,OAAO,CAAC;IAEnB,0BAA0B;IAC1B,aAAa,EAAE,KAAK,EAAE,CAAC;IAEvB,gCAAgC;IAChC,KAAK,EAAE,KAAK,GAAG,SAAS,CAAC;IAEzB,+BAA+B;IAC/B,OAAO,EAAE,OAAO,CAAC;IAEjB,6CAA6C;IAC7C,MAAM,EAAE,MAAM,GAAG,SAAS,CAAC;CAC5B;AAED,4BAA4B;AAC5B,MAAM,WAAW,WAAW,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS;IAE1D,wBAAwB;IACxB,QAAQ,EAAE,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC;IAG7B,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,MAAM,CAAC;IAEvB,2DAA2D;IAC3D,SAAS,EAAE,MAAM,MAAM,CAAC;IAExB,gEAAgE;IAChE,YAAY,EAAE,MAAM,OAAO,CAAC;IAE5B,mEAAmE;IACnE,UAAU,EAAE,MAAM,OAAO,CAAC;IAE1B,yBAAyB;IACzB,UAAU,EAAE,MAAM,aAAa,CAAC,CAAC,CAAC,CAAC;IAEnC,8BAA8B;IAC9B,eAAe,EAAE,MAAM,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAG7C,+DAA+D;IAC/D,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,SAAS,CAAC;IAE1C,qBAAqB;IACrB,WAAW,EAAE,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,SAAS,CAAC;IAEpD,wCAAwC;IACxC,YAAY,EAAE,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,KAAK,MAAM,CAAC;IAE9C,yDAAyD;IACzD,YAAY,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IAEzC,8DAA8D;IAC9D,eAAe,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;IAGrD,2BAA2B;IAC3B,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IAElC,0BAA0B;IAC1B,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,IAAI,CAAC;IAEhE,wBAAwB;IACxB,UAAU,EAAE,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC;IAElE,wBAAwB;IACxB,UAAU,EAAE,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,KAAK,OAAO,CAAC;IAG7C,6BAA6B;IAC7B,SAAS,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAEzD,uDAAuD;IACvD,WAAW,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAE3D,wBAAwB;IACxB,WAAW,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IAEjC,wCAAwC;IACxC,QAAQ,EAAE,MAAM,OAAO,CAAC,OAAO,CAAC,CAAC;IAEjC,sBAAsB;IACtB,MAAM,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;IAG5B,yCAAyC;IACzC,YAAY,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,KAAK,IAAI,CAAC;IAGjE,qBAAqB;IACrB,KAAK,EAAE,MAAM,IAAI,CAAC;IAElB,6BAA6B;IAC7B,KAAK,EAAE,MAAM,IAAI,CAAC;CACnB;AAYD;;GAEG;AACH,eAAO,MAAM,iBAAiB,GAAI,CAAC,SAAS,SAAS,GAAG,SAAS,EAC/D,SAAQ,iBAAiB,CAAC,CAAC,CAAM,KAChC,WAAW,CAAC,CAAC,CAgiBf,CAAC;AAMF,OAAO,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,UAAU,CAAC;AAC/D,OAAO,EACL,iBAAiB,EACjB,kBAAkB,EAClB,cAAc,GACf,MAAM,eAAe,CAAC"}

package/dist/features/async/placeholder.d.ts

@@ -0,0 +1,62 @@
+/**
+ * vlist - Placeholder System
+ * Smart placeholder generation for loading states
+ *
+ * Key features:
+ * - Analyzes loaded data to generate realistic placeholders
+ * - Supports masked text with configurable character
+ * - Random length variance for natural appearance
+ * - Efficient placeholder detection
+ */
+import type { VListItem } from "../../types";
+/** Placeholder configuration */
+export interface PlaceholderConfig {
+    /** Enable placeholder generation (default: true) */
+    enabled?: boolean;
+    /** Character used for masking text (default: '█') */
+    maskCharacter?: string;
+    /** Add random variance to text lengths (default: true) */
+    randomVariance?: boolean;
+    /** Maximum items to sample for structure analysis (default: 20) */
+    maxSampleSize?: number;
+    /** Custom placeholder generator */
+    customGenerator?: (index: number) => VListItem;
+}
+/** Placeholder manager instance */
+export interface PlaceholderManager<T extends VListItem = VListItem> {
+    /** Analyze data structure from sample items */
+    analyzeStructure: (items: T[]) => void;
+    /** Check if structure has been analyzed */
+    hasAnalyzedStructure: () => boolean;
+    /** Generate a single placeholder item */
+    generate: (index: number) => T;
+    /** Generate multiple placeholder items */
+    generateRange: (start: number, end: number) => T[];
+    /** Check if an item is a placeholder */
+    isPlaceholder: (item: unknown) => boolean;
+    /** Get the placeholder flag key */
+    getPlaceholderKey: () => string;
+    /** Clear analyzed structure */
+    clear: () => void;
+}
+/**
+ * Create a placeholder manager
+ */
+export declare const createPlaceholderManager: <T extends VListItem = VListItem>(config?: PlaceholderConfig) => PlaceholderManager<T>;
+/**
+ * Check if an item is a placeholder (standalone function)
+ */
+export declare const isPlaceholderItem: (item: unknown) => boolean;
+/**
+ * Filter out placeholder items from an array
+ */
+export declare const filterPlaceholders: <T extends VListItem>(items: T[]) => T[];
+/**
+ * Count non-placeholder items in an array
+ */
+export declare const countRealItems: <T extends VListItem>(items: (T | undefined)[]) => number;
+/**
+ * Replace placeholders in a sparse array with real items
+ */
+export declare const replacePlaceholders: <T extends VListItem>(target: (T | undefined)[], items: T[], offset: number) => number;
+//# sourceMappingURL=placeholder.d.ts.map

package/dist/features/async/placeholder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"placeholder.d.ts","sourceRoot":"","sources":["../../../src/features/async/placeholder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAM7C,gCAAgC;AAChC,MAAM,WAAW,iBAAiB;IAChC,oDAAoD;IACpD,OAAO,CAAC,EAAE,OAAO,CAAC;IAElB,qDAAqD;IACrD,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,0DAA0D;IAC1D,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB,mEAAmE;IACnE,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB,mCAAmC;IACnC,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,SAAS,CAAC;CAChD;AAiBD,mCAAmC;AACnC,MAAM,WAAW,kBAAkB,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS;IACjE,+CAA+C;IAC/C,gBAAgB,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC;IAEvC,2CAA2C;IAC3C,oBAAoB,EAAE,MAAM,OAAO,CAAC;IAEpC,yCAAyC;IACzC,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC;IAE/B,0CAA0C;IAC1C,aAAa,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;IAEnD,wCAAwC;IACxC,aAAa,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,OAAO,CAAC;IAE1C,mCAAmC;IACnC,iBAAiB,EAAE,MAAM,MAAM,CAAC;IAEhC,+BAA+B;IAC/B,KAAK,EAAE,MAAM,IAAI,CAAC;CACnB;AAeD;;GAEG;AACH,eAAO,MAAM,wBAAwB,GAAI,CAAC,SAAS,SAAS,GAAG,SAAS,EACtE,SAAQ,iBAAsB,KAC7B,kBAAkB,CAAC,CAAC,CA+OtB,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,iBAAiB,GAAI,MAAM,OAAO,KAAG,OAMjD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,kBAAkB,GAAI,CAAC,SAAS,SAAS,EAAE,OAAO,CAAC,EAAE,KAAG,CAAC,EAErE,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,cAAc,GAAI,CAAC,SAAS,SAAS,EAChD,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,KACvB,MAUF,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,SAAS,SAAS,EACrD,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,EACzB,OAAO,CAAC,EAAE,EACV,QAAQ,MAAM,KACb,MAiBF,CAAC"}

package/dist/features/async/plugin.d.ts

@@ -0,0 +1,60 @@
+/**
+ * vlist/data - Builder Plugin
+ * Wraps async data loading with sparse storage into a VListPlugin for the composable builder.
+ *
+ * Priority: 20 (runs before scrollbar and selection, after grid/groups)
+ *
+ * What it wires:
+ * - Replaces data manager — swaps the simple in-memory store with sparse storage
+ * - Scroll boundary detection — triggers loadMore() near the bottom (or top in reverse)
+ * - Velocity-aware loading — skips data fetching during fast scrolling, loads on idle
+ * - Placeholder generation — creates skeleton items for unloaded ranges
+ * - Request deduplication — prevents duplicate fetches for the same range
+ * - Idle handler — loads any pending ranges when scrolling stops
+ *
+ * Added methods: reload
+ * Added events: load:start, load:end, error
+ */
+import type { VListItem, VListAdapter } from "../../types";
+import type { VListPlugin } from "../../builder/types";
+/** Data plugin configuration */
+export interface DataPluginConfig<T extends VListItem = VListItem> {
+    /** Async data source (required) */
+    adapter: VListAdapter<T>;
+    /** Loading behavior configuration */
+    loading?: {
+        /** Velocity threshold above which data loading is skipped (px/ms). Default: 25 */
+        cancelThreshold?: number;
+        /** Velocity threshold for preloading (px/ms). Default: 2 */
+        preloadThreshold?: number;
+        /** Number of items to preload in scroll direction. Default: 50 */
+        preloadAhead?: number;
+    };
+}
+/**
+ * Create a data plugin for the builder.
+ *
+ * Adds async data loading with sparse storage, placeholders, and infinite scroll.
+ *
+ * ```ts
+ * import { vlist } from 'vlist/builder'
+ * import { withData } from 'vlist/data'
+ *
+ * const list = vlist({
+ *   container: '#app',
+ *   item: { height: 48, template: renderItem },
+ * })
+ * .use(withData({
+ *   adapter: {
+ *     read: async ({ offset, limit }) => {
+ *       const res = await fetch(`/api/items?offset=${offset}&limit=${limit}`)
+ *       const data = await res.json()
+ *       return { items: data.items, total: data.total, hasMore: data.hasMore }
+ *     }
+ *   }
+ * }))
+ * .build()
+ * ```
+ */
+export declare const withAsync: <T extends VListItem = VListItem>(config: DataPluginConfig<T>) => VListPlugin<T>;
+//# sourceMappingURL=plugin.d.ts.map

package/dist/features/async/plugin.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"plugin.d.ts","sourceRoot":"","sources":["../../../src/features/async/plugin.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,YAAY,EAAS,MAAM,aAAa,CAAC;AAClE,OAAO,KAAK,EAAE,WAAW,EAAkB,MAAM,qBAAqB,CAAC;AAiBvE,gCAAgC;AAChC,MAAM,WAAW,gBAAgB,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS;IAC/D,mCAAmC;IACnC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IAEzB,qCAAqC;IACrC,OAAO,CAAC,EAAE;QACR,kFAAkF;QAClF,eAAe,CAAC,EAAE,MAAM,CAAC;QAEzB,4DAA4D;QAC5D,gBAAgB,CAAC,EAAE,MAAM,CAAC;QAE1B,kEAAkE;QAClE,YAAY,CAAC,EAAE,MAAM,CAAC;KACvB,CAAC;CACH;AAMD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,SAAS,SAAS,GAAG,SAAS,EACvD,QAAQ,gBAAgB,CAAC,CAAC,CAAC,KAC1B,WAAW,CAAC,CAAC,CAiOf,CAAC"}

package/dist/features/async/sparse.d.ts

@@ -0,0 +1,91 @@
+/**
+ * vlist - Sparse Storage
+ * Efficient storage for million+ item virtual lists
+ */
+import type { VListItem, Range } from "../../types";
+/** Configuration for sparse storage */
+export interface SparseStorageConfig {
+    /** Number of items per chunk (default: 100) */
+    chunkSize?: number;
+    /** Maximum items to keep in memory (default: 5000) */
+    maxCachedItems?: number;
+    /** Extra items to keep around visible range during eviction (default: 200) */
+    evictionBuffer?: number;
+    /** Callback when items are evicted */
+    onEvict?: (evictedCount: number, evictedRanges: number[]) => void;
+}
+/** Storage statistics */
+export interface SparseStorageStats {
+    /** Total items declared (may be larger than loaded) */
+    totalItems: number;
+    /** Number of items currently in memory */
+    cachedItems: number;
+    /** Number of chunks in memory */
+    cachedChunks: number;
+    /** Chunk size */
+    chunkSize: number;
+    /** Maximum cached items allowed */
+    maxCachedItems: number;
+    /** Memory efficiency (cachedItems / totalItems) */
+    memoryEfficiency: number;
+}
+/** Sparse storage instance */
+export interface SparseStorage<T extends VListItem = VListItem> {
+    readonly chunkSize: number;
+    readonly maxCachedItems: number;
+    /** Get total item count */
+    getTotal: () => number;
+    /** Set total item count (for virtual scrolling height) */
+    setTotal: (total: number) => void;
+    /** Get item at index (undefined if not loaded) */
+    get: (index: number) => T | undefined;
+    /** Check if item at index is loaded */
+    has: (index: number) => boolean;
+    /** Set item at index */
+    set: (index: number, item: T) => void;
+    /** Set multiple items starting at offset */
+    setRange: (offset: number, items: T[]) => void;
+    /** Delete item at index */
+    delete: (index: number) => boolean;
+    /** Get items in range (includes undefined for unloaded) */
+    getRange: (start: number, end: number) => (T | undefined)[];
+    /** Check if range is fully loaded */
+    isRangeLoaded: (start: number, end: number) => boolean;
+    /** Get loaded ranges */
+    getLoadedRanges: () => Range[];
+    /** Find unloaded ranges within a given range */
+    findUnloadedRanges: (start: number, end: number) => Range[];
+    /** Get chunk index for item index */
+    getChunkIndex: (itemIndex: number) => number;
+    /** Check if chunk is loaded */
+    isChunkLoaded: (chunkIndex: number) => boolean;
+    /** Mark chunk as accessed (for LRU) */
+    touchChunk: (chunkIndex: number) => void;
+    /** Mark all chunks in a range as accessed with a single Date.now() call */
+    touchChunksForRange: (start: number, end: number) => void;
+    /** Evict chunks far from visible range */
+    evictDistant: (visibleStart: number, visibleEnd: number) => number;
+    /** Force eviction to meet memory limit */
+    evictToLimit: () => number;
+    /** Get storage statistics */
+    getStats: () => SparseStorageStats;
+    /** Get cached item count */
+    getCachedCount: () => number;
+    /** Clear all data */
+    clear: () => void;
+    /** Reset to initial state */
+    reset: () => void;
+}
+/**
+ * Create sparse storage for efficient large list handling
+ */
+export declare const createSparseStorage: <T extends VListItem = VListItem>(config?: SparseStorageConfig) => SparseStorage<T>;
+/**
+ * Merge adjacent/overlapping ranges
+ */
+export declare const mergeRanges: (ranges: Range[]) => Range[];
+/**
+ * Calculate ranges that need to be loaded
+ */
+export declare const calculateMissingRanges: (needed: Range, loaded: Range[], chunkSize: number) => Range[];
+//# sourceMappingURL=sparse.d.ts.map

package/dist/features/async/sparse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sparse.d.ts","sourceRoot":"","sources":["../../../src/features/async/sparse.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,aAAa,CAAC;AAMpD,uCAAuC;AACvC,MAAM,WAAW,mBAAmB;IAClC,+CAA+C;IAC/C,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,sDAAsD;IACtD,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB,8EAA8E;IAC9E,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB,sCAAsC;IACtC,OAAO,CAAC,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,KAAK,IAAI,CAAC;CACnE;AAcD,yBAAyB;AACzB,MAAM,WAAW,kBAAkB;IACjC,uDAAuD;IACvD,UAAU,EAAE,MAAM,CAAC;IAEnB,0CAA0C;IAC1C,WAAW,EAAE,MAAM,CAAC;IAEpB,iCAAiC;IACjC,YAAY,EAAE,MAAM,CAAC;IAErB,iBAAiB;IACjB,SAAS,EAAE,MAAM,CAAC;IAElB,mCAAmC;IACnC,cAAc,EAAE,MAAM,CAAC;IAEvB,mDAAmD;IACnD,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,8BAA8B;AAC9B,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,SAAS,GAAG,SAAS;IAE5D,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAGhC,2BAA2B;IAC3B,QAAQ,EAAE,MAAM,MAAM,CAAC;IAEvB,0DAA0D;IAC1D,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;IAGlC,kDAAkD;IAClD,GAAG,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,SAAS,CAAC;IAEtC,uCAAuC;IACvC,GAAG,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IAEhC,wBAAwB;IACxB,GAAG,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,KAAK,IAAI,CAAC;IAEtC,4CAA4C;IAC5C,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC;IAE/C,2BAA2B;IAC3B,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC;IAGnC,2DAA2D;IAC3D,QAAQ,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,CAAC;IAE5D,qCAAqC;IACrC,aAAa,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC;IAEvD,wBAAwB;IACxB,eAAe,EAAE,MAAM,KAAK,EAAE,CAAC;IAE/B,gDAAgD;IAChD,kBAAkB,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,KAAK,EAAE,CAAC;IAG5D,qCAAqC;IACrC,aAAa,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC;IAE7C,+BAA+B;IAC/B,aAAa,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC;IAE/C,uCAAuC;IACvC,UAAU,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,IAAI,CAAC;IAEzC,2EAA2E;IAC3E,mBAAmB,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,KAAK,IAAI,CAAC;IAG1D,0CAA0C;IAC1C,YAAY,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC;IAEnE,0CAA0C;IAC1C,YAAY,EAAE,MAAM,MAAM,CAAC;IAG3B,6BAA6B;IAC7B,QAAQ,EAAE,MAAM,kBAAkB,CAAC;IAEnC,4BAA4B;IAC5B,cAAc,EAAE,MAAM,MAAM,CAAC;IAG7B,qBAAqB;IACrB,KAAK,EAAE,MAAM,IAAI,CAAC;IAElB,6BAA6B;IAC7B,KAAK,EAAE,MAAM,IAAI,CAAC;CACnB;AAcD;;GAEG;AACH,eAAO,MAAM,mBAAmB,GAAI,CAAC,SAAS,SAAS,GAAG,SAAS,EACjE,SAAQ,mBAAwB,KAC/B,aAAa,CAAC,CAAC,CAyajB,CAAC;AAMF;;GAEG;AACH,eAAO,MAAM,WAAW,GAAI,QAAQ,KAAK,EAAE,KAAG,KAAK,EAqBlD,CAAC;AAEF;;GAEG;AACH,eAAO,MAAM,sBAAsB,GACjC,QAAQ,KAAK,EACb,QAAQ,KAAK,EAAE,EACf,WAAW,MAAM,KAChB,KAAK,EAkDP,CAAC"}

package/dist/features/grid/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * vlist - Grid Domain
+ * 2D grid/card layout with virtualized rows
+ */
+export { withGrid, type GridPluginConfig } from "./plugin";
+export { createGridLayout } from "./layout";
+export { createGridRenderer, type GridRenderer } from "./renderer";
+export type { GridConfig, GridLayout, GridPosition, ItemRange } from "./types";
+//# sourceMappingURL=index.d.ts.map

package/dist/features/grid/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/features/grid/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,QAAQ,EAAE,KAAK,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAG3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAG5C,OAAO,EAAE,kBAAkB,EAAE,KAAK,YAAY,EAAE,MAAM,YAAY,CAAC;AAGnE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC"}