@ripwords/myinvois-client 0.2.41 → 0.3.0

package/dist/apiQueue-B6Q644Bz.js

@@ -0,0 +1,201 @@
+//#region src/utils/apiQueue.ts
+const queues = {};
+const LIMITS = {
+	loginTaxpayer: {
+		max: 12,
+		perMs: 6e4
+	},
+	loginIntermediary: {
+		max: 12,
+		perMs: 6e4
+	},
+	submitDocuments: {
+		max: 100,
+		perMs: 6e4
+	},
+	getSubmission: {
+		max: 300,
+		perMs: 6e4
+	},
+	cancelDocument: {
+		max: 12,
+		perMs: 6e4
+	},
+	rejectDocument: {
+		max: 12,
+		perMs: 6e4
+	},
+	getDocument: {
+		max: 60,
+		perMs: 6e4
+	},
+	getDocumentDetails: {
+		max: 125,
+		perMs: 6e4
+	},
+	getRecentDocuments: {
+		max: 12,
+		perMs: 6e4
+	},
+	searchDocuments: {
+		max: 12,
+		perMs: 6e4
+	},
+	searchTin: {
+		max: 60,
+		perMs: 6e4
+	},
+	taxpayerQr: {
+		max: 60,
+		perMs: 6e4
+	},
+	default: {
+		max: 12,
+		perMs: 6e4
+	}
+};
+/**
+* Clean up old timestamps outside the sliding window
+*/
+function cleanupTimestamps(timestamps, windowMs, now) {
+	return timestamps.filter((ts) => now - ts < windowMs);
+}
+/**
+* Calculate when we can make the next request without exceeding the rate limit
+*/
+function getNextAvailableTime(timestamps, max, windowMs, now) {
+	if (timestamps.length < max) return now;
+	const oldestTimestamp = timestamps[0];
+	if (!oldestTimestamp) return now;
+	return oldestTimestamp + windowMs;
+}
+/**
+* Public helper to schedule a request according to the category's limits.
+* Rate limits are enforced per clientId, so multiple instances with the same
+* clientId will share rate limiters, while different clientIds get separate limiters.
+*
+* This implementation uses a sliding window to track all requests within the time window.
+*/
+function queueRequest(clientId, category, task, debug = false) {
+	const key = `${clientId}:${category}`;
+	if (!queues[key]) queues[key] = {
+		running: 0,
+		queue: [],
+		requestTimestamps: [],
+		nextTimer: null
+	};
+	const queue = queues[key];
+	const { max, perMs } = LIMITS[category] ?? LIMITS.default;
+	return new Promise((resolve, reject) => {
+		const run = () => {
+			const now$1 = Date.now();
+			queue.requestTimestamps = cleanupTimestamps(queue.requestTimestamps, perMs, now$1);
+			if (queue.requestTimestamps.length >= max) {
+				const nextAvailable = getNextAvailableTime(queue.requestTimestamps, max, perMs, now$1);
+				const waitTime = nextAvailable - now$1;
+				if (debug) console.log(`[apiQueue] 🚫 Rate limit reached (${queue.requestTimestamps.length}/${max} in last ${perMs}ms). Queuing request. Need to wait ${waitTime.toFixed(0)}ms. Queue size: ${queue.queue.length + 1}`);
+				queue.queue.push({
+					run,
+					addedAt: now$1
+				});
+				return;
+			}
+			queue.requestTimestamps.push(now$1);
+			queue.running++;
+			if (debug) console.log(`[apiQueue] ▶️  Executing request (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Running: ${queue.running}. Queue size: ${queue.queue.length}`);
+			task().then(resolve).catch(reject).finally(() => {
+				queue.running--;
+				if (debug) console.log(`[apiQueue] ✅ Request completed (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Running: ${queue.running}. Queue size: ${queue.queue.length}`);
+				processQueue(key, debug, category);
+			});
+		};
+		const now = Date.now();
+		queue.requestTimestamps = cleanupTimestamps(queue.requestTimestamps, perMs, now);
+		if (queue.queue.length > 0 || queue.requestTimestamps.length >= max) {
+			queue.queue.push({
+				run,
+				addedAt: now
+			});
+			if (debug) console.log(`[apiQueue] ⏳ Queued request (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Queue size: ${queue.queue.length}`);
+			processQueue(key, debug, category);
+		} else run();
+	});
+}
+function processQueue(key, debug, category) {
+	const queue = queues[key];
+	if (!queue || queue.queue.length === 0) return;
+	const { max, perMs } = LIMITS[category] ?? LIMITS.default;
+	const now = Date.now();
+	queue.requestTimestamps = cleanupTimestamps(queue.requestTimestamps, perMs, now);
+	if (queue.requestTimestamps.length < max) {
+		const next = queue.queue.shift();
+		if (next) {
+			if (debug) {
+				const waitTime = Date.now() - next.addedAt;
+				console.log(`[apiQueue] 🚀 Processing queued request (${category}). Waited: ${waitTime.toFixed(0)}ms. Queue size: ${queue.queue.length}`);
+			}
+			next.run();
+		}
+		if (queue.queue.length > 0) processQueue(key, debug, category);
+	} else {
+		const nextAvailable = getNextAvailableTime(queue.requestTimestamps, max, perMs, now);
+		const delay = Math.max(0, nextAvailable - now + 50);
+		if (debug) console.log(`[apiQueue] ⏸️  Delaying queue processing (${category}). Will retry in ${delay.toFixed(0)}ms. Queue size: ${queue.queue.length}`);
+		if (!queue.nextTimer) queue.nextTimer = setTimeout(() => {
+			queue.nextTimer = null;
+			processQueue(key, debug, category);
+		}, delay);
+	}
+}
+/**
+* Cleanup function to clear all queues and timers for a specific client.
+* Useful for testing or cleanup on application shutdown.
+*/
+function clearQueue(clientId, category) {
+	if (category) {
+		const key = `${clientId}:${category}`;
+		const queue = queues[key];
+		if (queue) {
+			if (queue.nextTimer) {
+				clearTimeout(queue.nextTimer);
+				queue.nextTimer = null;
+			}
+			queue.queue = [];
+			queue.requestTimestamps = [];
+			queue.running = 0;
+		}
+	} else Object.keys(queues).forEach((key) => {
+		if (key.startsWith(`${clientId}:`)) {
+			const queue = queues[key];
+			if (queue?.nextTimer) {
+				clearTimeout(queue.nextTimer);
+				queue.nextTimer = null;
+			}
+			delete queues[key];
+		}
+	});
+}
+/**
+* Very naive path-based category detection. If no matcher fits, the `default` category
+* (effectively unlimited) is returned. Adjust these heuristics as your API surface evolves.
+*/
+function categorizeRequest(path, method = "GET") {
+	const cleanPath = path.toLowerCase();
+	const isPost = method?.toUpperCase() === "POST";
+	if (cleanPath.includes("/documentsubmissions")) return isPost ? "submitDocuments" : "getSubmission";
+	if (cleanPath.includes("/documents/recent")) return "getRecentDocuments";
+	if (cleanPath.includes("/documents/search")) return "searchDocuments";
+	if (cleanPath.includes("/documents/state/") && cleanPath.endsWith("/state")) return "cancelDocument";
+	if (/\/documents\/[^/]+\/raw$/.test(cleanPath)) return "getDocument";
+	if (/\/documents\/[^/]+\/details$/.test(cleanPath)) return "getDocumentDetails";
+	if (cleanPath.includes("/taxpayer/search/tin")) return "searchTin";
+	if (cleanPath.includes("/taxpayer/validate/")) return "searchTin";
+	if (cleanPath.includes("/taxpayer/qrcode")) return "taxpayerQr";
+	if (cleanPath.includes("/searchtin")) return "searchTin";
+	if (cleanPath.includes("/qrcode")) return "taxpayerQr";
+	if (cleanPath.includes("/connect/token")) return "loginTaxpayer";
+	return "default";
+}
+
+//#endregion
+export { categorizeRequest, clearQueue, queueRequest };

package/dist/apiQueue-DgKWaQDS.cjs

@@ -0,0 +1,220 @@
+
+//#region src/utils/apiQueue.ts
+const queues = {};
+const LIMITS = {
+	loginTaxpayer: {
+		max: 12,
+		perMs: 6e4
+	},
+	loginIntermediary: {
+		max: 12,
+		perMs: 6e4
+	},
+	submitDocuments: {
+		max: 100,
+		perMs: 6e4
+	},
+	getSubmission: {
+		max: 300,
+		perMs: 6e4
+	},
+	cancelDocument: {
+		max: 12,
+		perMs: 6e4
+	},
+	rejectDocument: {
+		max: 12,
+		perMs: 6e4
+	},
+	getDocument: {
+		max: 60,
+		perMs: 6e4
+	},
+	getDocumentDetails: {
+		max: 125,
+		perMs: 6e4
+	},
+	getRecentDocuments: {
+		max: 12,
+		perMs: 6e4
+	},
+	searchDocuments: {
+		max: 12,
+		perMs: 6e4
+	},
+	searchTin: {
+		max: 60,
+		perMs: 6e4
+	},
+	taxpayerQr: {
+		max: 60,
+		perMs: 6e4
+	},
+	default: {
+		max: 12,
+		perMs: 6e4
+	}
+};
+/**
+* Clean up old timestamps outside the sliding window
+*/
+function cleanupTimestamps(timestamps, windowMs, now) {
+	return timestamps.filter((ts) => now - ts < windowMs);
+}
+/**
+* Calculate when we can make the next request without exceeding the rate limit
+*/
+function getNextAvailableTime(timestamps, max, windowMs, now) {
+	if (timestamps.length < max) return now;
+	const oldestTimestamp = timestamps[0];
+	if (!oldestTimestamp) return now;
+	return oldestTimestamp + windowMs;
+}
+/**
+* Public helper to schedule a request according to the category's limits.
+* Rate limits are enforced per clientId, so multiple instances with the same
+* clientId will share rate limiters, while different clientIds get separate limiters.
+*
+* This implementation uses a sliding window to track all requests within the time window.
+*/
+function queueRequest(clientId, category, task, debug = false) {
+	const key = `${clientId}:${category}`;
+	if (!queues[key]) queues[key] = {
+		running: 0,
+		queue: [],
+		requestTimestamps: [],
+		nextTimer: null
+	};
+	const queue = queues[key];
+	const { max, perMs } = LIMITS[category] ?? LIMITS.default;
+	return new Promise((resolve, reject) => {
+		const run = () => {
+			const now$1 = Date.now();
+			queue.requestTimestamps = cleanupTimestamps(queue.requestTimestamps, perMs, now$1);
+			if (queue.requestTimestamps.length >= max) {
+				const nextAvailable = getNextAvailableTime(queue.requestTimestamps, max, perMs, now$1);
+				const waitTime = nextAvailable - now$1;
+				if (debug) console.log(`[apiQueue] 🚫 Rate limit reached (${queue.requestTimestamps.length}/${max} in last ${perMs}ms). Queuing request. Need to wait ${waitTime.toFixed(0)}ms. Queue size: ${queue.queue.length + 1}`);
+				queue.queue.push({
+					run,
+					addedAt: now$1
+				});
+				return;
+			}
+			queue.requestTimestamps.push(now$1);
+			queue.running++;
+			if (debug) console.log(`[apiQueue] ▶️  Executing request (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Running: ${queue.running}. Queue size: ${queue.queue.length}`);
+			task().then(resolve).catch(reject).finally(() => {
+				queue.running--;
+				if (debug) console.log(`[apiQueue] ✅ Request completed (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Running: ${queue.running}. Queue size: ${queue.queue.length}`);
+				processQueue(key, debug, category);
+			});
+		};
+		const now = Date.now();
+		queue.requestTimestamps = cleanupTimestamps(queue.requestTimestamps, perMs, now);
+		if (queue.queue.length > 0 || queue.requestTimestamps.length >= max) {
+			queue.queue.push({
+				run,
+				addedAt: now
+			});
+			if (debug) console.log(`[apiQueue] ⏳ Queued request (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Queue size: ${queue.queue.length}`);
+			processQueue(key, debug, category);
+		} else run();
+	});
+}
+function processQueue(key, debug, category) {
+	const queue = queues[key];
+	if (!queue || queue.queue.length === 0) return;
+	const { max, perMs } = LIMITS[category] ?? LIMITS.default;
+	const now = Date.now();
+	queue.requestTimestamps = cleanupTimestamps(queue.requestTimestamps, perMs, now);
+	if (queue.requestTimestamps.length < max) {
+		const next = queue.queue.shift();
+		if (next) {
+			if (debug) {
+				const waitTime = Date.now() - next.addedAt;
+				console.log(`[apiQueue] 🚀 Processing queued request (${category}). Waited: ${waitTime.toFixed(0)}ms. Queue size: ${queue.queue.length}`);
+			}
+			next.run();
+		}
+		if (queue.queue.length > 0) processQueue(key, debug, category);
+	} else {
+		const nextAvailable = getNextAvailableTime(queue.requestTimestamps, max, perMs, now);
+		const delay = Math.max(0, nextAvailable - now + 50);
+		if (debug) console.log(`[apiQueue] ⏸️  Delaying queue processing (${category}). Will retry in ${delay.toFixed(0)}ms. Queue size: ${queue.queue.length}`);
+		if (!queue.nextTimer) queue.nextTimer = setTimeout(() => {
+			queue.nextTimer = null;
+			processQueue(key, debug, category);
+		}, delay);
+	}
+}
+/**
+* Cleanup function to clear all queues and timers for a specific client.
+* Useful for testing or cleanup on application shutdown.
+*/
+function clearQueue(clientId, category) {
+	if (category) {
+		const key = `${clientId}:${category}`;
+		const queue = queues[key];
+		if (queue) {
+			if (queue.nextTimer) {
+				clearTimeout(queue.nextTimer);
+				queue.nextTimer = null;
+			}
+			queue.queue = [];
+			queue.requestTimestamps = [];
+			queue.running = 0;
+		}
+	} else Object.keys(queues).forEach((key) => {
+		if (key.startsWith(`${clientId}:`)) {
+			const queue = queues[key];
+			if (queue?.nextTimer) {
+				clearTimeout(queue.nextTimer);
+				queue.nextTimer = null;
+			}
+			delete queues[key];
+		}
+	});
+}
+/**
+* Very naive path-based category detection. If no matcher fits, the `default` category
+* (effectively unlimited) is returned. Adjust these heuristics as your API surface evolves.
+*/
+function categorizeRequest(path, method = "GET") {
+	const cleanPath = path.toLowerCase();
+	const isPost = method?.toUpperCase() === "POST";
+	if (cleanPath.includes("/documentsubmissions")) return isPost ? "submitDocuments" : "getSubmission";
+	if (cleanPath.includes("/documents/recent")) return "getRecentDocuments";
+	if (cleanPath.includes("/documents/search")) return "searchDocuments";
+	if (cleanPath.includes("/documents/state/") && cleanPath.endsWith("/state")) return "cancelDocument";
+	if (/\/documents\/[^/]+\/raw$/.test(cleanPath)) return "getDocument";
+	if (/\/documents\/[^/]+\/details$/.test(cleanPath)) return "getDocumentDetails";
+	if (cleanPath.includes("/taxpayer/search/tin")) return "searchTin";
+	if (cleanPath.includes("/taxpayer/validate/")) return "searchTin";
+	if (cleanPath.includes("/taxpayer/qrcode")) return "taxpayerQr";
+	if (cleanPath.includes("/searchtin")) return "searchTin";
+	if (cleanPath.includes("/qrcode")) return "taxpayerQr";
+	if (cleanPath.includes("/connect/token")) return "loginTaxpayer";
+	return "default";
+}
+
+//#endregion
+Object.defineProperty(exports, 'categorizeRequest', {
+  enumerable: true,
+  get: function () {
+    return categorizeRequest;
+  }
+});
+Object.defineProperty(exports, 'clearQueue', {
+  enumerable: true,
+  get: function () {
+    return clearQueue;
+  }
+});
+Object.defineProperty(exports, 'queueRequest', {
+  enumerable: true,
+  get: function () {
+    return queueRequest;
+  }
+});
+//# sourceMappingURL=apiQueue-DgKWaQDS.cjs.map

package/dist/apiQueue-DgKWaQDS.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"apiQueue-DgKWaQDS.cjs","names":["queues: Record<string, Queue>","LIMITS: Record<ApiCategory, { max: number; perMs: number }>","timestamps: number[]","windowMs: number","now: number","max: number","clientId: string","category: ApiCategory","task: Task<T>","now","key: string","debug: boolean","category?: ApiCategory","path: string","method: string"],"sources":["../src/utils/apiQueue.ts"],"sourcesContent":["// A very small utility that provides per-endpoint request queuing with rate-limits.\n// The goal is to make sure that we never exceed the vendor-defined limits while also ensuring\n// that every request is eventually executed.\n//\n// NOTE: This is intentionally minimal – no external dependencies are introduced.\n// If you need more advanced features (persistence, jitter, etc.) consider a library such as `bottleneck`.\n\n/*\nRate-limit specification (per 60-second window)\n----------------------------------------------\nLogin as Taxpayer System         : 12\nLogin as Intermediary System     : 12\nSubmit Documents                 : 100\nGet Submission                   : 300\nCancel Document                  : 12\nReject Document                  : 12\nGet Document                     : 60\nGet Document Details             : 125\nGet Recent Documents             : 12\nSearch Documents                 : 12\nSearch Taxpayer's TIN            : 60\nTaxpayer's QR Code               : 60\n*/\n\nexport type ApiCategory =\n  | 'loginTaxpayer'\n  | 'loginIntermediary'\n  | 'submitDocuments'\n  | 'getSubmission'\n  | 'cancelDocument'\n  | 'rejectDocument'\n  | 'getDocument'\n  | 'getDocumentDetails'\n  | 'getRecentDocuments'\n  | 'searchDocuments'\n  | 'searchTin'\n  | 'taxpayerQr'\n  | 'default'\n\ntype Task<T> = () => Promise<T>\n\ninterface Queue {\n  running: number\n  queue: Array<{ run: () => void; addedAt: number }>\n  requestTimestamps: number[] // Track all request timestamps in the sliding window\n  nextTimer: NodeJS.Timeout | null // Track scheduled timer to avoid pile-up\n}\n\nconst queues: Record<string, Queue> = {}\n\n// Rate limits: max requests per time window (in ms)\nconst LIMITS: Record<ApiCategory, { max: number; perMs: number }> = {\n  loginTaxpayer: { max: 12, perMs: 60000 }, // 12 req/60s\n  loginIntermediary: { max: 12, perMs: 60000 }, // 12 req/60s\n  submitDocuments: { max: 100, perMs: 60000 }, // 100 req/60s\n  getSubmission: { max: 300, perMs: 60000 }, // 300 req/60s\n  cancelDocument: { max: 12, perMs: 60000 }, // 12 req/60s\n  rejectDocument: { max: 12, perMs: 60000 }, // 12 req/60s\n  getDocument: { max: 60, perMs: 60000 }, // 60 req/60s\n  getDocumentDetails: { max: 125, perMs: 60000 }, // 125 req/60s\n  getRecentDocuments: { max: 12, perMs: 60000 }, // 12 req/60s\n  searchDocuments: { max: 12, perMs: 60000 }, // 12 req/60s\n  searchTin: { max: 60, perMs: 60000 }, // 60 req/60s\n  taxpayerQr: { max: 60, perMs: 60000 }, // 60 req/60s\n  default: { max: 12, perMs: 60000 }, // 12 req/60s (minimum limit)\n}\n\n/**\n * Clean up old timestamps outside the sliding window\n */\nfunction cleanupTimestamps(\n  timestamps: number[],\n  windowMs: number,\n  now: number,\n): number[] {\n  return timestamps.filter(ts => now - ts < windowMs)\n}\n\n/**\n * Calculate when we can make the next request without exceeding the rate limit\n */\nfunction getNextAvailableTime(\n  timestamps: number[],\n  max: number,\n  windowMs: number,\n  now: number,\n): number {\n  if (timestamps.length < max) {\n    return now // Can execute immediately\n  }\n\n  // We're at the limit. Find when the oldest request will expire\n  const oldestTimestamp = timestamps[0]\n  if (!oldestTimestamp) {\n    return now // Shouldn't happen, but fallback to now\n  }\n  return oldestTimestamp + windowMs\n}\n\n/**\n * Public helper to schedule a request according to the category's limits.\n * Rate limits are enforced per clientId, so multiple instances with the same\n * clientId will share rate limiters, while different clientIds get separate limiters.\n *\n * This implementation uses a sliding window to track all requests within the time window.\n */\nexport function queueRequest<T>(\n  clientId: string,\n  category: ApiCategory,\n  task: Task<T>,\n  debug = false,\n): Promise<T> {\n  const key = `${clientId}:${category}`\n  if (!queues[key]) {\n    queues[key] = {\n      running: 0,\n      queue: [],\n      requestTimestamps: [],\n      nextTimer: null,\n    }\n  }\n\n  const queue = queues[key]!\n  const { max, perMs } = LIMITS[category] ?? LIMITS.default\n\n  return new Promise<T>((resolve, reject) => {\n    const run = () => {\n      const now = Date.now()\n\n      // Clean up old timestamps before checking\n      queue.requestTimestamps = cleanupTimestamps(\n        queue.requestTimestamps,\n        perMs,\n        now,\n      )\n\n      // Check if we can execute now\n      if (queue.requestTimestamps.length >= max) {\n        // We've hit the rate limit, need to wait\n        const nextAvailable = getNextAvailableTime(\n          queue.requestTimestamps,\n          max,\n          perMs,\n          now,\n        )\n        const waitTime = nextAvailable - now\n\n        if (debug) {\n          console.log(\n            `[apiQueue] 🚫 Rate limit reached (${queue.requestTimestamps.length}/${max} in last ${perMs}ms). Queuing request. Need to wait ${waitTime.toFixed(0)}ms. Queue size: ${queue.queue.length + 1}`,\n          )\n        }\n\n        // Re-queue this request to try again later\n        queue.queue.push({ run, addedAt: now })\n        // Don't call processQueue here - let the scheduled timer handle it\n        // to avoid potential requeue loops\n        return\n      }\n\n      // Record this request timestamp\n      queue.requestTimestamps.push(now)\n      queue.running++\n\n      if (debug) {\n        console.log(\n          `[apiQueue] ▶️  Executing request (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Running: ${queue.running}. Queue size: ${queue.queue.length}`,\n        )\n      }\n\n      task()\n        .then(resolve)\n        .catch(reject)\n        .finally(() => {\n          queue.running--\n          if (debug) {\n            console.log(\n              `[apiQueue] ✅ Request completed (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Running: ${queue.running}. Queue size: ${queue.queue.length}`,\n            )\n          }\n          processQueue(key, debug, category)\n        })\n    }\n\n    // Add to queue or run immediately\n    const now = Date.now()\n    queue.requestTimestamps = cleanupTimestamps(\n      queue.requestTimestamps,\n      perMs,\n      now,\n    )\n\n    if (queue.queue.length > 0 || queue.requestTimestamps.length >= max) {\n      // Either there's already a queue, or we're at the rate limit\n      queue.queue.push({ run, addedAt: now })\n      if (debug) {\n        console.log(\n          `[apiQueue] ⏳ Queued request (${category}). Requests in window: ${queue.requestTimestamps.length}/${max}. Queue size: ${queue.queue.length}`,\n        )\n      }\n      processQueue(key, debug, category)\n    } else {\n      // Can run immediately\n      run()\n    }\n  })\n}\n\nfunction processQueue(key: string, debug: boolean, category: ApiCategory) {\n  const queue = queues[key]\n  if (!queue || queue.queue.length === 0) return\n\n  const { max, perMs } = LIMITS[category] ?? LIMITS.default\n  const now = Date.now()\n\n  // Clean up old timestamps\n  queue.requestTimestamps = cleanupTimestamps(\n    queue.requestTimestamps,\n    perMs,\n    now,\n  )\n\n  // Check if we can process the next request\n  if (queue.requestTimestamps.length < max) {\n    // We have capacity, process immediately\n    const next = queue.queue.shift()\n    if (next) {\n      if (debug) {\n        const waitTime = Date.now() - next.addedAt\n        console.log(\n          `[apiQueue] 🚀 Processing queued request (${category}). Waited: ${waitTime.toFixed(0)}ms. Queue size: ${queue.queue.length}`,\n        )\n      }\n      next.run()\n    }\n    // After one runs, immediately try again (in case there's more space)\n    if (queue.queue.length > 0) {\n      processQueue(key, debug, category)\n    }\n  } else {\n    // We're at capacity, schedule for when the oldest request expires\n    const nextAvailable = getNextAvailableTime(\n      queue.requestTimestamps,\n      max,\n      perMs,\n      now,\n    )\n    const delay = Math.max(0, nextAvailable - now + 50) // +50ms buffer for timer precision\n\n    if (debug) {\n      console.log(\n        `[apiQueue] ⏸️  Delaying queue processing (${category}). Will retry in ${delay.toFixed(0)}ms. Queue size: ${queue.queue.length}`,\n      )\n    }\n\n    // Only schedule a timer if one isn't already scheduled\n    // This prevents timer pile-up during bursts\n    if (!queue.nextTimer) {\n      queue.nextTimer = setTimeout(() => {\n        queue.nextTimer = null\n        processQueue(key, debug, category)\n      }, delay)\n    }\n  }\n}\n\n/**\n * Cleanup function to clear all queues and timers for a specific client.\n * Useful for testing or cleanup on application shutdown.\n */\nexport function clearQueue(clientId: string, category?: ApiCategory): void {\n  if (category) {\n    const key = `${clientId}:${category}`\n    const queue = queues[key]\n    if (queue) {\n      if (queue.nextTimer) {\n        clearTimeout(queue.nextTimer)\n        queue.nextTimer = null\n      }\n      queue.queue = []\n      queue.requestTimestamps = []\n      queue.running = 0\n    }\n  } else {\n    // Clear all queues for this client\n    Object.keys(queues).forEach(key => {\n      if (key.startsWith(`${clientId}:`)) {\n        const queue = queues[key]\n        if (queue?.nextTimer) {\n          clearTimeout(queue.nextTimer)\n          queue.nextTimer = null\n        }\n        delete queues[key]\n      }\n    })\n  }\n}\n\n/**\n * Very naive path-based category detection. If no matcher fits, the `default` category\n * (effectively unlimited) is returned. Adjust these heuristics as your API surface evolves.\n */\nexport function categorizeRequest(\n  path: string,\n  method: string = 'GET',\n): ApiCategory {\n  const cleanPath = path.toLowerCase()\n  const isPost = method?.toUpperCase() === 'POST'\n\n  if (cleanPath.includes('/documentsubmissions')) {\n    return isPost ? 'submitDocuments' : 'getSubmission'\n  }\n\n  // -----------------------------\n  // v1.0 API endpoint matchers\n  // -----------------------------\n\n  // Get Recent Documents - /api/v1.0/documents/recent\n  if (cleanPath.includes('/documents/recent')) {\n    return 'getRecentDocuments'\n  }\n\n  // Search Documents - /api/v1.0/documents/search\n  if (cleanPath.includes('/documents/search')) {\n    return 'searchDocuments'\n  }\n\n  // Document state actions (cancel/reject) - PUT /api/v1.0/documents/state/{uuid}/state\n  // Both cancel and reject use the same endpoint, differentiated only by request body\n  if (cleanPath.includes('/documents/state/') && cleanPath.endsWith('/state')) {\n    // Both cancelDocument and rejectDocument share the same rate limit (12 RPM)\n    // Use cancelDocument category for both since they share the same bucket\n    return 'cancelDocument'\n  }\n\n  // Document raw content - /api/v1.0/documents/{uuid}/raw\n  if (/\\/documents\\/[^/]+\\/raw$/.test(cleanPath)) {\n    return 'getDocument'\n  }\n\n  // Document details - /api/v1.0/documents/{uuid}/details\n  if (/\\/documents\\/[^/]+\\/details$/.test(cleanPath)) {\n    return 'getDocumentDetails'\n  }\n\n  // Taxpayer TIN search & validation share same limit bucket\n  if (cleanPath.includes('/taxpayer/search/tin')) return 'searchTin'\n  if (cleanPath.includes('/taxpayer/validate/')) return 'searchTin'\n\n  // Taxpayer QR code info\n  if (cleanPath.includes('/taxpayer/qrcode')) return 'taxpayerQr'\n\n  // Legacy matchers (kept for backward compatibility)\n  if (cleanPath.includes('/searchtin')) return 'searchTin'\n  if (cleanPath.includes('/qrcode')) return 'taxpayerQr'\n  if (cleanPath.includes('/connect/token')) {\n    return 'loginTaxpayer'\n  }\n\n  return 'default'\n}\n"],"mappings":";;AAgDA,MAAMA,SAAgC,CAAE;AAGxC,MAAMC,SAA8D;CAClE,eAAe;EAAE,KAAK;EAAI,OAAO;CAAO;CACxC,mBAAmB;EAAE,KAAK;EAAI,OAAO;CAAO;CAC5C,iBAAiB;EAAE,KAAK;EAAK,OAAO;CAAO;CAC3C,eAAe;EAAE,KAAK;EAAK,OAAO;CAAO;CACzC,gBAAgB;EAAE,KAAK;EAAI,OAAO;CAAO;CACzC,gBAAgB;EAAE,KAAK;EAAI,OAAO;CAAO;CACzC,aAAa;EAAE,KAAK;EAAI,OAAO;CAAO;CACtC,oBAAoB;EAAE,KAAK;EAAK,OAAO;CAAO;CAC9C,oBAAoB;EAAE,KAAK;EAAI,OAAO;CAAO;CAC7C,iBAAiB;EAAE,KAAK;EAAI,OAAO;CAAO;CAC1C,WAAW;EAAE,KAAK;EAAI,OAAO;CAAO;CACpC,YAAY;EAAE,KAAK;EAAI,OAAO;CAAO;CACrC,SAAS;EAAE,KAAK;EAAI,OAAO;CAAO;AACnC;;;;AAKD,SAAS,kBACPC,YACAC,UACAC,KACU;AACV,QAAO,WAAW,OAAO,QAAM,MAAM,KAAK,SAAS;AACpD;;;;AAKD,SAAS,qBACPF,YACAG,KACAF,UACAC,KACQ;AACR,KAAI,WAAW,SAAS,IACtB,QAAO;CAIT,MAAM,kBAAkB,WAAW;AACnC,MAAK,gBACH,QAAO;AAET,QAAO,kBAAkB;AAC1B;;;;;;;;AASD,SAAgB,aACdE,UACAC,UACAC,MACA,QAAQ,OACI;CACZ,MAAM,OAAO,EAAE,SAAS,GAAG,SAAS;AACpC,MAAK,OAAO,KACV,QAAO,OAAO;EACZ,SAAS;EACT,OAAO,CAAE;EACT,mBAAmB,CAAE;EACrB,WAAW;CACZ;CAGH,MAAM,QAAQ,OAAO;CACrB,MAAM,EAAE,KAAK,OAAO,GAAG,OAAO,aAAa,OAAO;AAElD,QAAO,IAAI,QAAW,CAAC,SAAS,WAAW;EACzC,MAAM,MAAM,MAAM;GAChB,MAAMC,QAAM,KAAK,KAAK;AAGtB,SAAM,oBAAoB,kBACxB,MAAM,mBACN,OACAA,MACD;AAGD,OAAI,MAAM,kBAAkB,UAAU,KAAK;IAEzC,MAAM,gBAAgB,qBACpB,MAAM,mBACN,KACA,OACAA,MACD;IACD,MAAM,WAAW,gBAAgBA;AAEjC,QAAI,MACF,SAAQ,KACL,oCAAoC,MAAM,kBAAkB,OAAO,GAAG,IAAI,WAAW,MAAM,qCAAqC,SAAS,QAAQ,EAAE,CAAC,kBAAkB,MAAM,MAAM,SAAS,EAAE,EAC/L;AAIH,UAAM,MAAM,KAAK;KAAE;KAAK,SAASA;IAAK,EAAC;AAGvC;GACD;AAGD,SAAM,kBAAkB,KAAKA,MAAI;AACjC,SAAM;AAEN,OAAI,MACF,SAAQ,KACL,oCAAoC,SAAS,yBAAyB,MAAM,kBAAkB,OAAO,GAAG,IAAI,aAAa,MAAM,QAAQ,gBAAgB,MAAM,MAAM,OAAO,EAC5K;AAGH,SAAM,CACH,KAAK,QAAQ,CACb,MAAM,OAAO,CACb,QAAQ,MAAM;AACb,UAAM;AACN,QAAI,MACF,SAAQ,KACL,kCAAkC,SAAS,yBAAyB,MAAM,kBAAkB,OAAO,GAAG,IAAI,aAAa,MAAM,QAAQ,gBAAgB,MAAM,MAAM,OAAO,EAC1K;AAEH,iBAAa,KAAK,OAAO,SAAS;GACnC,EAAC;EACL;EAGD,MAAM,MAAM,KAAK,KAAK;AACtB,QAAM,oBAAoB,kBACxB,MAAM,mBACN,OACA,IACD;AAED,MAAI,MAAM,MAAM,SAAS,KAAK,MAAM,kBAAkB,UAAU,KAAK;AAEnE,SAAM,MAAM,KAAK;IAAE;IAAK,SAAS;GAAK,EAAC;AACvC,OAAI,MACF,SAAQ,KACL,+BAA+B,SAAS,yBAAyB,MAAM,kBAAkB,OAAO,GAAG,IAAI,gBAAgB,MAAM,MAAM,OAAO,EAC5I;AAEH,gBAAa,KAAK,OAAO,SAAS;EACnC,MAEC,MAAK;CAER;AACF;AAED,SAAS,aAAaC,KAAaC,OAAgBJ,UAAuB;CACxE,MAAM,QAAQ,OAAO;AACrB,MAAK,SAAS,MAAM,MAAM,WAAW,EAAG;CAExC,MAAM,EAAE,KAAK,OAAO,GAAG,OAAO,aAAa,OAAO;CAClD,MAAM,MAAM,KAAK,KAAK;AAGtB,OAAM,oBAAoB,kBACxB,MAAM,mBACN,OACA,IACD;AAGD,KAAI,MAAM,kBAAkB,SAAS,KAAK;EAExC,MAAM,OAAO,MAAM,MAAM,OAAO;AAChC,MAAI,MAAM;AACR,OAAI,OAAO;IACT,MAAM,WAAW,KAAK,KAAK,GAAG,KAAK;AACnC,YAAQ,KACL,2CAA2C,SAAS,aAAa,SAAS,QAAQ,EAAE,CAAC,kBAAkB,MAAM,MAAM,OAAO,EAC5H;GACF;AACD,QAAK,KAAK;EACX;AAED,MAAI,MAAM,MAAM,SAAS,EACvB,cAAa,KAAK,OAAO,SAAS;CAErC,OAAM;EAEL,MAAM,gBAAgB,qBACpB,MAAM,mBACN,KACA,OACA,IACD;EACD,MAAM,QAAQ,KAAK,IAAI,GAAG,gBAAgB,MAAM,GAAG;AAEnD,MAAI,MACF,SAAQ,KACL,4CAA4C,SAAS,mBAAmB,MAAM,QAAQ,EAAE,CAAC,kBAAkB,MAAM,MAAM,OAAO,EAChI;AAKH,OAAK,MAAM,UACT,OAAM,YAAY,WAAW,MAAM;AACjC,SAAM,YAAY;AAClB,gBAAa,KAAK,OAAO,SAAS;EACnC,GAAE,MAAM;CAEZ;AACF;;;;;AAMD,SAAgB,WAAWD,UAAkBM,UAA8B;AACzE,KAAI,UAAU;EACZ,MAAM,OAAO,EAAE,SAAS,GAAG,SAAS;EACpC,MAAM,QAAQ,OAAO;AACrB,MAAI,OAAO;AACT,OAAI,MAAM,WAAW;AACnB,iBAAa,MAAM,UAAU;AAC7B,UAAM,YAAY;GACnB;AACD,SAAM,QAAQ,CAAE;AAChB,SAAM,oBAAoB,CAAE;AAC5B,SAAM,UAAU;EACjB;CACF,MAEC,QAAO,KAAK,OAAO,CAAC,QAAQ,SAAO;AACjC,MAAI,IAAI,YAAY,EAAE,SAAS,GAAG,EAAE;GAClC,MAAM,QAAQ,OAAO;AACrB,OAAI,OAAO,WAAW;AACpB,iBAAa,MAAM,UAAU;AAC7B,UAAM,YAAY;GACnB;AACD,UAAO,OAAO;EACf;CACF,EAAC;AAEL;;;;;AAMD,SAAgB,kBACdC,MACAC,SAAiB,OACJ;CACb,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,SAAS,QAAQ,aAAa,KAAK;AAEzC,KAAI,UAAU,SAAS,uBAAuB,CAC5C,QAAO,SAAS,oBAAoB;AAQtC,KAAI,UAAU,SAAS,oBAAoB,CACzC,QAAO;AAIT,KAAI,UAAU,SAAS,oBAAoB,CACzC,QAAO;AAKT,KAAI,UAAU,SAAS,oBAAoB,IAAI,UAAU,SAAS,SAAS,CAGzE,QAAO;AAIT,KAAI,2BAA2B,KAAK,UAAU,CAC5C,QAAO;AAIT,KAAI,+BAA+B,KAAK,UAAU,CAChD,QAAO;AAIT,KAAI,UAAU,SAAS,uBAAuB,CAAE,QAAO;AACvD,KAAI,UAAU,SAAS,sBAAsB,CAAE,QAAO;AAGtD,KAAI,UAAU,SAAS,mBAAmB,CAAE,QAAO;AAGnD,KAAI,UAAU,SAAS,aAAa,CAAE,QAAO;AAC7C,KAAI,UAAU,SAAS,UAAU,CAAE,QAAO;AAC1C,KAAI,UAAU,SAAS,iBAAiB,CACtC,QAAO;AAGT,QAAO;AACR"}

package/dist/index.cjs

@@ -8,7 +8,7 @@ const require_platformLogin = require('./platformLogin-Ch6hFKoU.cjs');
 const require_taxpayerValidation = require('./taxpayerValidation-D_jGaVty.cjs');
 const require_certificate = require('./certificate-CWmfCPdt.cjs');
 const require_getBaseUrl = require('./getBaseUrl-D0G4GZmp.cjs');
-const require_apiQueue = require('./apiQueue-Djd7WlnV.cjs');
+const require_apiQueue = require('./apiQueue-DgKWaQDS.cjs');
 
 //#region src/index.ts
 var MyInvoisClient = class MyInvoisClient {

package/dist/index.js

@@ -8,7 +8,7 @@ import { platformLogin } from "./platformLogin-CqI9OLYP.js";
 import { taxpayerQRCode, tinSearch, verifyTin } from "./taxpayerValidation-y6P-Es0S.js";
 import { extractCertificateInfo, getPemFromP12, validateKeyPair } from "./certificate-COwqszxD.js";
 import { getBaseUrl } from "./getBaseUrl-D7nUmoYb.js";
-import { categorizeRequest, queueRequest } from "./apiQueue-CCrZMnMu.js";
+import { categorizeRequest, queueRequest } from "./apiQueue-B6Q644Bz.js";
 
 //#region src/index.ts
 var MyInvoisClient = class MyInvoisClient {

package/dist/index10.cjs

@@ -1,5 +1,25 @@
-const require_certificate = require('./certificate-CWmfCPdt.cjs');
 
-exports.extractCertificateInfo = require_certificate.extractCertificateInfo;
-exports.getPemFromP12 = require_certificate.getPemFromP12;
-exports.validateKeyPair = require_certificate.validateKeyPair;
+//#region src/types/payment-modes.d.ts
+/**
+* Enum representing the allowed payment mode codes with descriptive names.
+* Provides a more readable way to reference payment modes.
+*
+* @example
+* const mode = PaymentModeCodeEnum.Cash;
+* console.log(mode); // Output: "01"
+*/
+let PaymentModeCodeEnum = /* @__PURE__ */ function(PaymentModeCodeEnum$1) {
+	PaymentModeCodeEnum$1["Cash"] = "01";
+	PaymentModeCodeEnum$1["Cheque"] = "02";
+	PaymentModeCodeEnum$1["BankTransfer"] = "03";
+	PaymentModeCodeEnum$1["CreditCard"] = "04";
+	PaymentModeCodeEnum$1["DebitCard"] = "05";
+	PaymentModeCodeEnum$1["EWalletDigitalWallet"] = "06";
+	PaymentModeCodeEnum$1["DigitalBank"] = "07";
+	PaymentModeCodeEnum$1["Others"] = "08";
+	return PaymentModeCodeEnum$1;
+}({});
+
+//#endregion
+exports.PaymentModeCodeEnum = PaymentModeCodeEnum;
+//# sourceMappingURL=index10.cjs.map

package/dist/index10.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index10.cjs","names":[],"sources":["../src/types/payment-modes.d.ts"],"sourcesContent":["/**\n * Represents the allowed codes for payment modes.\n * Based on the documentation: https://sdk.myinvois.hasil.gov.my/codes/payment-methods/\n */\nexport type PaymentModeCode =\n  | '01' // Cash\n  | '02' // Cheque\n  | '03' // Bank Transfer\n  | '04' // Credit Card\n  | '05' // Debit Card\n  | '06' // e-Wallet / Digital Wallet\n  | '07' // Digital Bank\n  | '08' // Others\n\n/**\n * Enum representing the allowed payment mode codes with descriptive names.\n * Provides a more readable way to reference payment modes.\n *\n * @example\n * const mode = PaymentModeCodeEnum.Cash;\n * console.log(mode); // Output: \"01\"\n */\nexport enum PaymentModeCodeEnum {\n  Cash = '01',\n  Cheque = '02',\n  BankTransfer = '03',\n  CreditCard = '04',\n  DebitCard = '05',\n  EWalletDigitalWallet = '06',\n  DigitalBank = '07',\n  Others = '08',\n}\n\n/**\n * Interface representing a payment mode entry.\n * Contains the code and its corresponding description.\n */\nexport interface PaymentMode {\n  code: PaymentModeCode\n  description: string\n}\n"],"mappings":";;;;;;;;;;AAsBA,IAAY,sEAAL;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACD"}

package/dist/index11.cjs

@@ -1,22 +0,0 @@
-require('./formatIdValue-i67o4kyD.cjs');
-const require_document = require('./document-CCza2JPL.cjs');
-
-exports.calculateCertificateDigest = require_document.calculateCertificateDigest;
-exports.calculateDocumentDigest = require_document.calculateDocumentDigest;
-exports.calculateExpectedTaxAmount = require_document.calculateExpectedTaxAmount;
-exports.calculateInvoiceTotals = require_document.calculateInvoiceTotals;
-exports.calculateSignedPropertiesDigest = require_document.calculateSignedPropertiesDigest;
-exports.canonicalizeJSON = require_document.canonicalizeJSON;
-exports.createFixedRateTaxLineItem = require_document.createFixedRateTaxLineItem;
-exports.createPercentageTaxLineItem = require_document.createPercentageTaxLineItem;
-exports.createSignedInfoAndSign = require_document.createSignedInfoAndSign;
-exports.createSignedProperties = require_document.createSignedProperties;
-exports.extractCertificateInfo = require_document.extractCertificateInfo;
-exports.generateCleanInvoiceObject = require_document.generateCleanInvoiceObject;
-exports.generateCleanUBLDocument = require_document.generateCleanUBLDocument;
-exports.generateCompleteDocument = require_document.generateCompleteDocument;
-exports.isFixedRateTax = require_document.isFixedRateTax;
-exports.isPercentageTax = require_document.isPercentageTax;
-exports.signDocumentString = require_document.signDocumentString;
-exports.sortObjectKeys = require_document.sortObjectKeys;
-exports.transformDocumentForHashing = require_document.transformDocumentForHashing;

package/dist/index12.cjs

@@ -1,3 +1,34 @@
-const require_formatIdValue = require('./formatIdValue-i67o4kyD.cjs');
 
-exports.formatIdValue = require_formatIdValue.formatIdValue;
+//#region src/types/state-codes.d.ts
+/**
+* Enum representing the allowed state codes with descriptive names.
+* Provides a more readable way to reference states.
+*
+* @example
+* const code = StateCodeEnum.Selangor;
+* console.log(code); // Output: "10"
+*/
+let StateCodeEnum = /* @__PURE__ */ function(StateCodeEnum$1) {
+	StateCodeEnum$1["Johor"] = "01";
+	StateCodeEnum$1["Kedah"] = "02";
+	StateCodeEnum$1["Kelantan"] = "03";
+	StateCodeEnum$1["Melaka"] = "04";
+	StateCodeEnum$1["NegeriSembilan"] = "05";
+	StateCodeEnum$1["Pahang"] = "06";
+	StateCodeEnum$1["PulauPinang"] = "07";
+	StateCodeEnum$1["Perak"] = "08";
+	StateCodeEnum$1["Perlis"] = "09";
+	StateCodeEnum$1["Selangor"] = "10";
+	StateCodeEnum$1["Terengganu"] = "11";
+	StateCodeEnum$1["Sabah"] = "12";
+	StateCodeEnum$1["Sarawak"] = "13";
+	StateCodeEnum$1["WPKualaLumpur"] = "14";
+	StateCodeEnum$1["WPLabuan"] = "15";
+	StateCodeEnum$1["WPPutrajaya"] = "16";
+	StateCodeEnum$1["NotApplicable"] = "17";
+	return StateCodeEnum$1;
+}({});
+
+//#endregion
+exports.StateCodeEnum = StateCodeEnum;
+//# sourceMappingURL=index12.cjs.map

package/dist/index12.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index12.cjs","names":[],"sources":["../src/types/state-codes.d.ts"],"sourcesContent":["/**\n * Represents the allowed codes for Malaysian states and federal territories.\n * Based on the documentation: https://sdk.myinvois.hasil.gov.my/codes/state-codes/\n */\nexport type StateCode =\n  | '01' // Johor\n  | '02' // Kedah\n  | '03' // Kelantan\n  | '04' // Melaka\n  | '05' // Negeri Sembilan\n  | '06' // Pahang\n  | '07' // Pulau Pinang\n  | '08' // Perak\n  | '09' // Perlis\n  | '10' // Selangor\n  | '11' // Terengganu\n  | '12' // Sabah\n  | '13' // Sarawak\n  | '14' // Wilayah Persekutuan Kuala Lumpur\n  | '15' // Wilayah Persekutuan Labuan\n  | '16' // Wilayah Persekutuan Putrajaya\n  | '17' // Not Applicable\n\n/**\n * Enum representing the allowed state codes with descriptive names.\n * Provides a more readable way to reference states.\n *\n * @example\n * const code = StateCodeEnum.Selangor;\n * console.log(code); // Output: \"10\"\n */\nexport enum StateCodeEnum {\n  Johor = '01',\n  Kedah = '02',\n  Kelantan = '03',\n  Melaka = '04',\n  NegeriSembilan = '05',\n  Pahang = '06',\n  PulauPinang = '07',\n  Perak = '08',\n  Perlis = '09',\n  Selangor = '10',\n  Terengganu = '11',\n  Sabah = '12',\n  Sarawak = '13',\n  WPKualaLumpur = '14',\n  WPLabuan = '15',\n  WPPutrajaya = '16',\n  NotApplicable = '17',\n}\n\n/**\n * Interface representing a state code entry.\n * Contains the code and its corresponding name.\n */\nexport interface State {\n  code: StateCode\n  name: string\n}\n"],"mappings":";;;;;;;;;;AA+BA,IAAY,0DAAL;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACD"}

package/dist/index13.cjs

@@ -1,3 +1,24 @@
-const require_getBaseUrl = require('./getBaseUrl-D0G4GZmp.cjs');
 
-exports.getBaseUrl = require_getBaseUrl.getBaseUrl;
+//#region src/types/tax-types.d.ts
+/**
+* Enum representing the allowed tax type codes with descriptive names.
+* Provides a more readable way to reference tax types.
+*
+* @example
+* const code = TaxTypeCodeEnum.SalesTax;
+* console.log(code); // Output: "01"
+*/
+let TaxTypeCodeEnum = /* @__PURE__ */ function(TaxTypeCodeEnum$1) {
+	TaxTypeCodeEnum$1["SalesTax"] = "01";
+	TaxTypeCodeEnum$1["ServiceTax"] = "02";
+	TaxTypeCodeEnum$1["TourismTax"] = "03";
+	TaxTypeCodeEnum$1["HighValueGoodsTax"] = "04";
+	TaxTypeCodeEnum$1["SalesTaxLowValueGoods"] = "05";
+	TaxTypeCodeEnum$1["NotApplicable"] = "06";
+	TaxTypeCodeEnum$1["TaxExemption"] = "E";
+	return TaxTypeCodeEnum$1;
+}({});
+
+//#endregion
+exports.TaxTypeCodeEnum = TaxTypeCodeEnum;
+//# sourceMappingURL=index13.cjs.map

package/dist/index13.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index13.cjs","names":[],"sources":["../src/types/tax-types.d.ts"],"sourcesContent":["/**\n * Represents the allowed codes for tax types.\n * Based on the documentation: https://sdk.myinvois.hasil.gov.my/codes/tax-types/\n */\nexport type TaxTypeCode =\n  | '01' // Sales Tax\n  | '02' // Service Tax\n  | '03' // Tourism Tax\n  | '04' // High-Value Goods Tax\n  | '05' // Sales Tax on Low Value Goods\n  | '06' // Not Applicable\n  | 'E' // Tax exemption (where applicable)\n\n/**\n * Enum representing the allowed tax type codes with descriptive names.\n * Provides a more readable way to reference tax types.\n *\n * @example\n * const code = TaxTypeCodeEnum.SalesTax;\n * console.log(code); // Output: \"01\"\n */\nexport enum TaxTypeCodeEnum {\n  SalesTax = '01',\n  ServiceTax = '02',\n  TourismTax = '03',\n  HighValueGoodsTax = '04',\n  SalesTaxLowValueGoods = '05',\n  NotApplicable = '06',\n  TaxExemption = 'E',\n}\n\n/**\n * Interface representing a tax type entry.\n * Contains the code and its corresponding description.\n */\nexport interface TaxType {\n  code: TaxTypeCode\n  description: string\n}\n"],"mappings":";;;;;;;;;;AAqBA,IAAY,8DAAL;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AACD"}