schemind 0.0.2 → 0.0.3

package/README.md

@@ -1,11 +1,57 @@
-![NPM Version](https://img.shields.io/npm/v/schemind)
+# schemind
+[![NPM Version](https://img.shields.io/npm/v/schemind?link=https%3A%2F%2Fwww.npmjs.com%2Fpackage%2Fschemind)](https://www.npmjs.com/package/schemind)
 ![Code Coverage](https://raw.githubusercontent.com/kpietraszko/schemind/refs/heads/main/badge.svg)
+[![Brotli Size](https://deno.bundlejs.com/badge?q=schemind&treeshake=[*]&config={%22compression%22:%22brotli%22})](https://bundlejs.com/?q=schemind&treeshake=%5B*%5D&config=%7B%22compression%22%3A%22brotli%22%7D)
 
-# schemind
-Read and write to messages serialized as arrays (aka indexed keys) by defining a schema.
+Read and write to messages serialized as arrays (aka indexed keys messages) by defining a schema. Protocol‑agnostic.
 
 ## What?
-TODO
+In formats like JSON, a message normally looks something like this:
+```json
+{
+  "id": 1,
+  "fullName": "John Doe",
+  "email": "johndoe@example.com",
+  "birthDate": "1973-01-22",
+  "address": {
+    "street": "123 Main Street",
+    "city": "Anytown",
+    "zipcode": "12345-6789",
+    "geo": {
+      "lat": 42.1234,
+      "lng": -71.2345
+    }
+  },
+  "website": "www.johndoe.com"
+}
+```
+*I'm using JSON as an example here, but schemind is essentially protocol-agnostic. I use it with MessagePack.*
+
+If you desperately need to make this message more compact, you could alternatively serialize it as such:
+```json
+[
+  1,
+  "John Doe",
+  "johndoe@example.com",
+  "1973-01-22",
+  [
+    "123 Main Street",
+    "Anytown",
+    "12345-6789",
+    [
+      42.1234,
+      -71.2345
+    ]
+  ],
+  "www.johndoe.com"
+]
+```
+
+This is sometimes referred to as a message with *indexed keys*.
+
+*Note that this obviously has some drawbacks: [recommended reading about the pros and cons of this format](https://github.com/MessagePack-CSharp/MessagePack-CSharp#use-indexed-keys-instead-of-string-keys-contractless).*
+
+**Schemind** helps you create and read such messages, if your (de)serializer doesn't support this technique.
 
 ## Installation
 
@@ -16,13 +62,23 @@ npm install schemind
 ## Usage
 TODO
 
-## FAQ 
-TODO
+## FAQ
+### Shouldn't this be an extension of a serializer?
+Probably.
+
+### Wouldn't it be better to use protobuf at this point?
+Possibly. But if you're already using JSON / MessagePack / CBOR etc. in your app, and you need more compact messages for some features — *schemind* could be useful.
+
+Additionally, in some languages (backend or frontend) there's a MessagePack or JSON implementation that's faster, or allocates less memory, than protobuf.
+
+### Why is `get` so inconvenient?
+The `get` function prioritizes performance over convenience. The main goal here is to avoid any heap allocations (beyond what your deserializer allocates). I use *schemind* in performance-critical scenarios, where avoiding GC pauses is crucial.  
+Use the `toPlainObject` function instead, if you don't mind some extra allocations.
 
 ## Related work
-* https://github.com/MessagePack-CSharp/MessagePack-CSharp#use-indexed-keys-instead-of-string-keys-contractless
-* https://aarnott.github.io/Nerdbank.MessagePack/docs/customizing-serialization.html?q=indexed#serialize-objects-with-indexes-for-keys
+* [MessagePack-CSharp (.NET)](https://github.com/MessagePack-CSharp/MessagePack-CSharp#use-indexed-keys-instead-of-string-keys-contractless)
+* [Nerdbank.MessagePack (.NET)](https://aarnott.github.io/Nerdbank.MessagePack/docs/customizing-serialization.html?q=indexed#serialize-objects-with-indexes-for-keys)
 
 
-* https://github.com/Idein/msgpack-schema
-* https://github.com/serde-rs/serde/issues/959
+* [Idein/msgpack-schema (Rust)](https://github.com/Idein/msgpack-schema)
+* [serde (Rust)](https://github.com/serde-rs/serde/issues/959)

package/dist/schemind.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function h(e){return t=>t?(c(t,e),t):{indexesPathReversed:[e],fieldType:void 0}}function i(e){return Object.hasOwn(e,"fieldType")}function c(e,t){if(!i(e))for(const[o,s]of Object.entries(e)){const n=s;i(n)?n.indexesPathReversed.push(t):c(n,t)}}function f(e,t){const o=t.indexesPathReversed;let s=e;for(let r=t.indexesPathReversed.length-1;r>=1;r--)s=s[o[r]];const n=o[0];return s[n]}function a(e,t,o){const s=t.indexesPathReversed;let n=e;for(let d=t.indexesPathReversed.length-1;d>=1;d--)n[s[d]]===void 0&&(n[s[d]]=[]),n=n[s[d]];const r=s[0];n[r]=o}function l(e,t){const o={};for(const[s,n]of Object.entries(t)){const r=n;let d;i(r)?d=f(e,r):d=l(e,r),o[s]=d}return o}function x(e,t){const o=[];return u(o,e,t),o}function u(e,t,o){for(const[s,n]of Object.entries(o)){const r=n,d=t[s];i(r)?a(e,r,d):u(e,d,r)}}exports.get=f;exports.set=a;exports.toIndexedKeysMessage=x;exports.toPlainObject=l;exports.withIndex=h;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=Symbol("isSchemaLeaf");class r extends Error{constructor(){super("Invalid schema. Make sure there are no duplicate indexes, and that nested objects are also wrapped with withIndex."),this.name="InvalidSchemaError"}}function P(e){return h(e,[],0),e}function h(e,t,s){for(const[o,d]of Object.entries(e)){const n=d;i(n)?I(n,t,s):h(n,t,s+1)}}function I(e,t,s){if(t.some(n=>n.length===e.indexesPathReversed.length&&n.every((a,S)=>a===e.indexesPathReversed[S])))throw new r;if(t.push(e.indexesPathReversed),e.indexesPathReversed.length!==s+1)throw new r}function b(e){return t=>t?(l(t,e),t):{indexesPathReversed:[e],fieldType:void 0,[c]:!0}}function i(e){return Object.hasOwn(e,c)}function l(e,t){for(const[s,o]of Object.entries(e)){const d=o;i(d)?d.indexesPathReversed.push(t):l(d,t)}}function f(e,t){const s=t.indexesPathReversed;let o=e;for(let n=t.indexesPathReversed.length-1;n>=1;n--)o=o[s[n]];const d=s[0];return o[d]}function u(e,t,s){const o=t.indexesPathReversed;let d=e;for(let a=t.indexesPathReversed.length-1;a>=1;a--)d[o[a]]===void 0&&(d[o[a]]=[]),d=d[o[a]];const n=o[0];d[n]=s}function v(e,t){const s={};for(const[o,d]of Object.entries(t)){const n=d;let a;i(n)?a=f(e,n):a=v(e,n),s[o]=a}return s}function g(e,t){const s=[];return x(s,e,t),s}function x(e,t,s){for(const[o,d]of Object.entries(s)){const n=d,a=t[o];i(n)?u(e,n,a):x(e,a,n)}}exports.InvalidSchemaError=r;exports.get=f;exports.set=u;exports.toIndexedKeysMessage=g;exports.toPlainObject=v;exports.validateSchema=P;exports.withIndex=b;

package/dist/schemind.d.ts

@@ -1,27 +1,58 @@
 import { NonNegativeInteger } from 'type-fest';
 
-export declare function get<const TField>(message: readonly unknown[], schemaField: SchemaLeaf<TField>): TField;
+export declare function get<const TField>(message: readonly unknown[], schemaField: ValidSchemaLeaf<TField>): TField;
 
 declare type IndexedKeysMessageSchema<TSchema> = {
     [K in keyof TSchema]: TSchema[K] extends SchemaLeaf<infer TField> ? SchemaLeaf<TField> : IndexedKeysMessageSchema<TSchema[K]>;
 };
 
-declare type PlainObjectOfSchema<TSchema> = TSchema extends IndexedKeysMessageSchema<unknown> ? {
-    [K in keyof TSchema]: TSchema[K] extends SchemaLeaf<infer TField> ? TField : PlainObjectOfSchema<TSchema[K]>;
+declare type IndexesPath = number[];
+
+declare type Invalid<T extends string> = {
+    [invalid]: T;
+};
+
+declare const invalid: unique symbol;
+
+export declare class InvalidSchemaError extends Error {
+    constructor();
+}
+
+declare const isSchemaLeafTag: unique symbol;
+
+declare const isValidSchemaLeaf: unique symbol;
+
+declare type PlainObjectOfSchema<TSchema> = TSchema extends ValidIndexedKeysMessageSchema<unknown> ? {
+    [K in keyof TSchema]: TSchema[K] extends ValidSchemaLeaf<infer TField> ? TField : TSchema[K] extends SchemaLeaf<unknown> ? Invalid<"Schema needs to be validated before you use it!"> : PlainObjectOfSchema<TSchema[K]>;
 } : never;
 
 declare type ReturnedSchemaNode<TField, TNestedSchema> = TNestedSchema extends undefined ? SchemaLeaf<TField> : TNestedSchema;
 
 declare type SchemaLeaf<TField> = {
-    indexesPathReversed: number[];
+    indexesPathReversed: IndexesPath;
     fieldType: TField;
+    [isSchemaLeafTag]: true;
 };
 
-export declare function set<const TField>(targetMessage: unknown[], schemaField: SchemaLeaf<TField>, value: TField): void;
+export declare function set<const TField>(targetMessage: unknown[], schemaField: ValidSchemaLeaf<TField>, value: TField): void;
 
-export declare function toIndexedKeysMessage<TSchema extends IndexedKeysMessageSchema<TSchemaInner>, TSchemaInner>(plainObject: PlainObjectOfSchema<TSchema>, schema: TSchema): unknown[];
+export declare function toIndexedKeysMessage<TSchema extends ValidIndexedKeysMessageSchema<TSchemaInner>, TSchemaInner>(plainObject: PlainObjectOfSchema<TSchema>, schema: TSchema): unknown[];
 
-export declare function toPlainObject<TSchema extends IndexedKeysMessageSchema<TSchemaInner>, TSchemaInner>(message: readonly unknown[], schema: TSchema): PlainObjectOfSchema<TSchema>;
+export declare function toPlainObject<TSchema extends ValidIndexedKeysMessageSchema<TSchemaInner>, TSchemaInner>(message: readonly unknown[], schema: TSchema): PlainObjectOfSchema<TSchema>;
+
+declare type ToValidIndexedKeysMessageSchema<TSchema> = {
+    [K in keyof TSchema]: TSchema[K] extends SchemaLeaf<infer TField> ? ValidSchemaLeaf<TField> : ToValidIndexedKeysMessageSchema<TSchema[K]>;
+};
+
+export declare function validateSchema<TSchema extends IndexedKeysMessageSchema<TSchemaInner>, TSchemaInner>(schema: TSchema): ToValidIndexedKeysMessageSchema<TSchema>;
+
+export declare type ValidIndexedKeysMessageSchema<TSchema> = {
+    [K in keyof TSchema]: TSchema[K] extends ValidSchemaLeaf<infer TField> ? ValidSchemaLeaf<TField> : TSchema[K] extends SchemaLeaf<unknown> ? Invalid<"Schema needs to be validated before you use it, did you forget to call validateSchema()?"> : ToValidIndexedKeysMessageSchema<TSchema[K]>;
+};
+
+declare type ValidSchemaLeaf<TField> = SchemaLeaf<TField> & {
+    [isValidSchemaLeaf]: true;
+};
 
 export declare function withIndex<const TIndex extends number>(index: NonNegativeInteger<TIndex>): <const TField = undefined, TNestedSchema extends IndexedKeysMessageSchema<TNestedSchema> | undefined = undefined>(nestedSchema?: TNestedSchema) => ReturnedSchemaNode<TField, TNestedSchema>;
 

package/dist/schemind.iife.js

@@ -1 +1 @@
-var Schemind=function(i){"use strict";function v(e){return t=>t?(f(t,e),t):{indexesPathReversed:[e],fieldType:void 0}}function c(e){return Object.hasOwn(e,"fieldType")}function f(e,t){if(!c(e))for(const[d,s]of Object.entries(e)){const n=s;c(n)?n.indexesPathReversed.push(t):f(n,t)}}function a(e,t){const d=t.indexesPathReversed;let s=e;for(let o=t.indexesPathReversed.length-1;o>=1;o--)s=s[d[o]];const n=d[0];return s[n]}function u(e,t,d){const s=t.indexesPathReversed;let n=e;for(let r=t.indexesPathReversed.length-1;r>=1;r--)n[s[r]]===void 0&&(n[s[r]]=[]),n=n[s[r]];const o=s[0];n[o]=d}function l(e,t){const d={};for(const[s,n]of Object.entries(t)){const o=n;let r;c(o)?r=a(e,o):r=l(e,o),d[s]=r}return d}function I(e,t){const d=[];return h(d,e,t),d}function h(e,t,d){for(const[s,n]of Object.entries(d)){const o=n,r=t[s];c(o)?u(e,o,r):h(e,r,o)}}return i.get=a,i.set=u,i.toIndexedKeysMessage=I,i.toPlainObject=l,i.withIndex=v,Object.defineProperty(i,Symbol.toStringTag,{value:"Module"}),i}({});
+var Schemind=function(o){"use strict";const h=Symbol("isSchemaLeaf");class r extends Error{constructor(){super("Invalid schema. Make sure there are no duplicate indexes, and that nested objects are also wrapped with withIndex."),this.name="InvalidSchemaError"}}function x(e){return l(e,[],0),e}function l(e,t,s){for(const[i,d]of Object.entries(e)){const n=d;c(n)?I(n,t,s):l(n,t,s+1)}}function I(e,t,s){if(t.some(n=>n.length===e.indexesPathReversed.length&&n.every((a,R)=>a===e.indexesPathReversed[R])))throw new r;if(t.push(e.indexesPathReversed),e.indexesPathReversed.length!==s+1)throw new r}function b(e){return t=>t?(f(t,e),t):{indexesPathReversed:[e],fieldType:void 0,[h]:!0}}function c(e){return Object.hasOwn(e,h)}function f(e,t){for(const[s,i]of Object.entries(e)){const d=i;c(d)?d.indexesPathReversed.push(t):f(d,t)}}function u(e,t){const s=t.indexesPathReversed;let i=e;for(let n=t.indexesPathReversed.length-1;n>=1;n--)i=i[s[n]];const d=s[0];return i[d]}function v(e,t,s){const i=t.indexesPathReversed;let d=e;for(let a=t.indexesPathReversed.length-1;a>=1;a--)d[i[a]]===void 0&&(d[i[a]]=[]),d=d[i[a]];const n=i[0];d[n]=s}function S(e,t){const s={};for(const[i,d]of Object.entries(t)){const n=d;let a;c(n)?a=u(e,n):a=S(e,n),s[i]=a}return s}function g(e,t){const s=[];return P(s,e,t),s}function P(e,t,s){for(const[i,d]of Object.entries(s)){const n=d,a=t[i];c(n)?v(e,n,a):P(e,a,n)}}return o.InvalidSchemaError=r,o.get=u,o.set=v,o.toIndexedKeysMessage=g,o.toPlainObject=S,o.validateSchema=x,o.withIndex=b,Object.defineProperty(o,Symbol.toStringTag,{value:"Module"}),o}({});

package/dist/schemind.js

@@ -1,58 +1,81 @@
-function h(e) {
-  return (t) => t ? (c(t, e), t) : {
+const c = Symbol("isSchemaLeaf");
+class a extends Error {
+  constructor() {
+    super("Invalid schema. Make sure there are no duplicate indexes, and that nested objects are also wrapped with withIndex."), this.name = "InvalidSchemaError";
+  }
+}
+function I(e) {
+  return h(e, [], 0), e;
+}
+function h(e, t, s) {
+  for (const [o, d] of Object.entries(e)) {
+    const n = d;
+    r(n) ? v(n, t, s) : h(n, t, s + 1);
+  }
+}
+function v(e, t, s) {
+  if (t.some((n) => n.length === e.indexesPathReversed.length && n.every((i, u) => i === e.indexesPathReversed[u])))
+    throw new a();
+  if (t.push(e.indexesPathReversed), e.indexesPathReversed.length !== s + 1)
+    throw new a();
+}
+function R(e) {
+  return (t) => t ? (l(t, e), t) : {
     indexesPathReversed: [e],
-    fieldType: void 0
+    fieldType: void 0,
+    [c]: !0
   };
 }
-function i(e) {
-  return Object.hasOwn(e, "fieldType");
+function r(e) {
+  return Object.hasOwn(e, c);
 }
-function c(e, t) {
-  if (!i(e))
-    for (const [o, s] of Object.entries(e)) {
-      const n = s;
-      i(n) ? n.indexesPathReversed.push(t) : c(n, t);
-    }
+function l(e, t) {
+  for (const [s, o] of Object.entries(e)) {
+    const d = o;
+    r(d) ? d.indexesPathReversed.push(t) : l(d, t);
+  }
+}
+function x(e, t) {
+  const s = t.indexesPathReversed;
+  let o = e;
+  for (let n = t.indexesPathReversed.length - 1; n >= 1; n--)
+    o = o[s[n]];
+  const d = s[0];
+  return o[d];
 }
-function a(e, t) {
+function P(e, t, s) {
   const o = t.indexesPathReversed;
-  let s = e;
-  for (let r = t.indexesPathReversed.length - 1; r >= 1; r--)
-    s = s[o[r]];
+  let d = e;
+  for (let i = t.indexesPathReversed.length - 1; i >= 1; i--)
+    d[o[i]] === void 0 && (d[o[i]] = []), d = d[o[i]];
   const n = o[0];
-  return s[n];
+  d[n] = s;
 }
-function l(e, t, o) {
-  const s = t.indexesPathReversed;
-  let n = e;
-  for (let d = t.indexesPathReversed.length - 1; d >= 1; d--)
-    n[s[d]] === void 0 && (n[s[d]] = []), n = n[s[d]];
-  const r = s[0];
-  n[r] = o;
-}
-function u(e, t) {
-  const o = {};
-  for (const [s, n] of Object.entries(t)) {
-    const r = n;
-    let d;
-    i(r) ? d = a(e, r) : d = u(e, r), o[s] = d;
+function S(e, t) {
+  const s = {};
+  for (const [o, d] of Object.entries(t)) {
+    const n = d;
+    let i;
+    r(n) ? i = x(e, n) : i = S(e, n), s[o] = i;
   }
-  return o;
+  return s;
 }
-function x(e, t) {
-  const o = [];
-  return f(o, e, t), o;
+function p(e, t) {
+  const s = [];
+  return f(s, e, t), s;
 }
-function f(e, t, o) {
-  for (const [s, n] of Object.entries(o)) {
-    const r = n, d = t[s];
-    i(r) ? l(e, r, d) : f(e, d, r);
+function f(e, t, s) {
+  for (const [o, d] of Object.entries(s)) {
+    const n = d, i = t[o];
+    r(n) ? P(e, n, i) : f(e, i, n);
   }
 }
 export {
-  a as get,
-  l as set,
-  x as toIndexedKeysMessage,
-  u as toPlainObject,
-  h as withIndex
+  a as InvalidSchemaError,
+  x as get,
+  P as set,
+  p as toIndexedKeysMessage,
+  S as toPlainObject,
+  I as validateSchema,
+  R as withIndex
 };

package/dist/schemind.umd.cjs

@@ -1 +1 @@
-(function(f,r){typeof exports=="object"&&typeof module<"u"?r(exports):typeof define=="function"&&define.amd?define(["exports"],r):(f=typeof globalThis<"u"?globalThis:f||self,r(f.Schemind={}))})(this,function(f){"use strict";function r(e){return t=>t?(u(t,e),t):{indexesPathReversed:[e],fieldType:void 0}}function c(e){return Object.hasOwn(e,"fieldType")}function u(e,t){if(!c(e))for(const[o,s]of Object.entries(e)){const n=s;c(n)?n.indexesPathReversed.push(t):u(n,t)}}function a(e,t){const o=t.indexesPathReversed;let s=e;for(let d=t.indexesPathReversed.length-1;d>=1;d--)s=s[o[d]];const n=o[0];return s[n]}function l(e,t,o){const s=t.indexesPathReversed;let n=e;for(let i=t.indexesPathReversed.length-1;i>=1;i--)n[s[i]]===void 0&&(n[s[i]]=[]),n=n[s[i]];const d=s[0];n[d]=o}function h(e,t){const o={};for(const[s,n]of Object.entries(t)){const d=n;let i;c(d)?i=a(e,d):i=h(e,d),o[s]=i}return o}function x(e,t){const o=[];return v(o,e,t),o}function v(e,t,o){for(const[s,n]of Object.entries(o)){const d=n,i=t[s];c(d)?l(e,d,i):v(e,i,d)}}f.get=a,f.set=l,f.toIndexedKeysMessage=x,f.toPlainObject=h,f.withIndex=r,Object.defineProperty(f,Symbol.toStringTag,{value:"Module"})});
+(function(a,c){typeof exports=="object"&&typeof module<"u"?c(exports):typeof define=="function"&&define.amd?define(["exports"],c):(a=typeof globalThis<"u"?globalThis:a||self,c(a.Schemind={}))})(this,function(a){"use strict";const c=Symbol("isSchemaLeaf");class h extends Error{constructor(){super("Invalid schema. Make sure there are no duplicate indexes, and that nested objects are also wrapped with withIndex."),this.name="InvalidSchemaError"}}function P(e){return f(e,[],0),e}function f(e,t,s){for(const[i,d]of Object.entries(e)){const n=d;r(n)?I(n,t,s):f(n,t,s+1)}}function I(e,t,s){if(t.some(n=>n.length===e.indexesPathReversed.length&&n.every((o,g)=>o===e.indexesPathReversed[g])))throw new h;if(t.push(e.indexesPathReversed),e.indexesPathReversed.length!==s+1)throw new h}function b(e){return t=>t?(l(t,e),t):{indexesPathReversed:[e],fieldType:void 0,[c]:!0}}function r(e){return Object.hasOwn(e,c)}function l(e,t){for(const[s,i]of Object.entries(e)){const d=i;r(d)?d.indexesPathReversed.push(t):l(d,t)}}function u(e,t){const s=t.indexesPathReversed;let i=e;for(let n=t.indexesPathReversed.length-1;n>=1;n--)i=i[s[n]];const d=s[0];return i[d]}function v(e,t,s){const i=t.indexesPathReversed;let d=e;for(let o=t.indexesPathReversed.length-1;o>=1;o--)d[i[o]]===void 0&&(d[i[o]]=[]),d=d[i[o]];const n=i[0];d[n]=s}function x(e,t){const s={};for(const[i,d]of Object.entries(t)){const n=d;let o;r(n)?o=u(e,n):o=x(e,n),s[i]=o}return s}function m(e,t){const s=[];return S(s,e,t),s}function S(e,t,s){for(const[i,d]of Object.entries(s)){const n=d,o=t[i];r(n)?v(e,n,o):S(e,o,n)}}a.InvalidSchemaError=h,a.get=u,a.set=v,a.toIndexedKeysMessage=m,a.toPlainObject=x,a.validateSchema=P,a.withIndex=b,Object.defineProperty(a,Symbol.toStringTag,{value:"Module"})});

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "schemind",
-  "version": "0.0.2",
-  "description": "Read and write to messages serialized as arrays (indexed keys) by defining a schema; \nenabling smaller message size when using protocols such as msgpack or JSON.",
+  "version": "0.0.3",
+  "description": "Read and write to messages serialized as arrays (indexed keys) by defining a schema, \nenabling smaller message size when using protocols such as msgpack or JSON.",
   "keywords": [
     "serialization",
     "schema",
@@ -9,7 +9,7 @@
     "indexed keys",
     "array",
     "msgpack",
-    "pack",
+    "messagepack",
     "packed"
   ],
   "license": "MIT",
@@ -33,18 +33,18 @@
     "dist"
   ],
   "dependencies": {
-    "type-fest": "^4.30.0"
+    "type-fest": "^4.31.0"
   },
   "devDependencies": {
-    "@commitlint/cli": "^19.6.0",
+    "@commitlint/cli": "^19.6.1",
     "@commitlint/config-conventional": "^19.6.0",
-    "@types/node": "^22.10.1",
+    "@types/node": "^22.10.2",
     "camelcase": "^8.0.0",
     "changelogen": "^0.5.7",
     "husky": "^9.1.7",
     "typescript": "~5.7.2",
-    "vite": "^6.0.3",
-    "vite-plugin-dts": "^4.3.0",
+    "vite": "^6.0.6",
+    "vite-plugin-dts": "^4.4.0",
     "vitest": "2.1.8",
     "@vitest/coverage-v8": "2.1.8"
   },