A one-of-a-kind resume builder that keeps your privacy in mind. Completely secure, customizable, portable, open-source and free forever. Try it out today!
TypeScript agent-skillsaidsh-pluginhacktoberfestjavascriptmcp-serverreactresume-builderself-hostedtypescript
import { Unzip, UnzipInflate } from "fflate";
export class ZipEntryTooLargeError extends Error {
readonly entry: string;
constructor(entry: string) {
super(`"${entry}" is too large.`);
this.entry = entry;
}
}
// Each pushed slice inflates in one step, so this bounds the overshoot past the limit (about 1,000× for deflate).
const SLICE_BYTES = 16 * 1024;
/**
* Inflates the first entry of each name `select` accepts and nothing else. A ZIP's declared sizes can lie, so
* inflation stops as soon as an entry actually produces more than `maxEntryBytes`: neither memory nor CPU follows
* the archive's claims. Callers bound the number of names they accept, or pass `maxTotalBytes` when a pattern can
* match many entries.
*/
export function unzipEntries(
data: Uint8Array,
select: (name: string) => boolean,
maxEntryBytes: number,
maxTotalBytes = Number.POSITIVE_INFINITY,
): Record<string, Uint8Array> {
const entries = new Map<string, Uint8Array[]>();
let totalBytes = 0;
let entryCount = 0;
const unzip = new Unzip((file) => {
if (++entryCount > 2_000) throw new Error("ZIP contains too many entries.");
if (entries.has(file.name) || !select(file.name)) return;
const chunks: Uint8Array[] = [];
let size = 0;
entries.set(file.name, chunks);
file.ondata = (error, chunk) => {
if (error) throw error;
size += chunk.length;
totalBytes += chunk.length;
if (size > maxEntryBytes || totalBytes > maxTotalBytes) throw new ZipEntryTooLargeError(file.name);
chunks.push(chunk);
};
file.start();
});
unzip.register(UnzipInflate);
for (let offset = 0; offset < data.length; offset += SLICE_BYTES) {
unzip.push(data.subarray(offset, offset + SLICE_BYTES), offset + SLICE_BYTES >= data.length);
}
const files: Record<string, Uint8Array> = {};
for (const [name, chunks] of entries) {
const file = new Uint8Array(chunks.reduce((total, chunk) => total + chunk.length, 0));
let offset = 0;
for (const chunk of chunks) {
file.set(chunk, offset);
offset += chunk.length;
}
files[name] = file;
}
return files;
}