@vscode/chat-lib 0.0.1

package/src/_internal/util/vs/base/common/buffer.ts

@@ -0,0 +1,501 @@
+//!!! DO NOT modify, this file was COPIED from 'microsoft/vscode'
+
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+import { Lazy } from './lazy';
+import * as streams from './stream';
+
+interface NodeBuffer {
+	allocUnsafe(size: number): Uint8Array;
+	isBuffer(obj: any): obj is NodeBuffer;
+	from(arrayBuffer: ArrayBufferLike, byteOffset?: number, length?: number): Uint8Array;
+	from(data: string): Uint8Array;
+}
+
+declare const Buffer: NodeBuffer;
+
+const hasBuffer = (typeof Buffer !== 'undefined');
+const indexOfTable = new Lazy(() => new Uint8Array(256));
+
+let textEncoder: { encode: (input: string) => Uint8Array } | null;
+let textDecoder: { decode: (input: Uint8Array) => string } | null;
+
+export class VSBuffer {
+
+	/**
+	 * When running in a nodejs context, the backing store for the returned `VSBuffer` instance
+	 * might use a nodejs Buffer allocated from node's Buffer pool, which is not transferrable.
+	 */
+	static alloc(byteLength: number): VSBuffer {
+		if (hasBuffer) {
+			return new VSBuffer(Buffer.allocUnsafe(byteLength));
+		} else {
+			return new VSBuffer(new Uint8Array(byteLength));
+		}
+	}
+
+	/**
+	 * When running in a nodejs context, if `actual` is not a nodejs Buffer, the backing store for
+	 * the returned `VSBuffer` instance might use a nodejs Buffer allocated from node's Buffer pool,
+	 * which is not transferrable.
+	 */
+	static wrap(actual: Uint8Array): VSBuffer {
+		if (hasBuffer && !(Buffer.isBuffer(actual))) {
+			// https://nodejs.org/dist/latest-v10.x/docs/api/buffer.html#buffer_class_method_buffer_from_arraybuffer_byteoffset_length
+			// Create a zero-copy Buffer wrapper around the ArrayBuffer pointed to by the Uint8Array
+			actual = Buffer.from(actual.buffer, actual.byteOffset, actual.byteLength);
+		}
+		return new VSBuffer(actual);
+	}
+
+	/**
+	 * When running in a nodejs context, the backing store for the returned `VSBuffer` instance
+	 * might use a nodejs Buffer allocated from node's Buffer pool, which is not transferrable.
+	 */
+	static fromString(source: string, options?: { dontUseNodeBuffer?: boolean }): VSBuffer {
+		const dontUseNodeBuffer = options?.dontUseNodeBuffer || false;
+		if (!dontUseNodeBuffer && hasBuffer) {
+			return new VSBuffer(Buffer.from(source));
+		} else {
+			if (!textEncoder) {
+				textEncoder = new TextEncoder();
+			}
+			return new VSBuffer(textEncoder.encode(source));
+		}
+	}
+
+	/**
+	 * When running in a nodejs context, the backing store for the returned `VSBuffer` instance
+	 * might use a nodejs Buffer allocated from node's Buffer pool, which is not transferrable.
+	 */
+	static fromByteArray(source: number[]): VSBuffer {
+		const result = VSBuffer.alloc(source.length);
+		for (let i = 0, len = source.length; i < len; i++) {
+			result.buffer[i] = source[i];
+		}
+		return result;
+	}
+
+	/**
+	 * When running in a nodejs context, the backing store for the returned `VSBuffer` instance
+	 * might use a nodejs Buffer allocated from node's Buffer pool, which is not transferrable.
+	 */
+	static concat(buffers: VSBuffer[], totalLength?: number): VSBuffer {
+		if (typeof totalLength === 'undefined') {
+			totalLength = 0;
+			for (let i = 0, len = buffers.length; i < len; i++) {
+				totalLength += buffers[i].byteLength;
+			}
+		}
+
+		const ret = VSBuffer.alloc(totalLength);
+		let offset = 0;
+		for (let i = 0, len = buffers.length; i < len; i++) {
+			const element = buffers[i];
+			ret.set(element, offset);
+			offset += element.byteLength;
+		}
+
+		return ret;
+	}
+
+	static isNativeBuffer(buffer: unknown): boolean {
+		return hasBuffer && Buffer.isBuffer(buffer);
+	}
+
+	readonly buffer: Uint8Array;
+	readonly byteLength: number;
+
+	private constructor(buffer: Uint8Array) {
+		this.buffer = buffer;
+		this.byteLength = this.buffer.byteLength;
+	}
+
+	/**
+	 * When running in a nodejs context, the backing store for the returned `VSBuffer` instance
+	 * might use a nodejs Buffer allocated from node's Buffer pool, which is not transferrable.
+	 */
+	clone(): VSBuffer {
+		const result = VSBuffer.alloc(this.byteLength);
+		result.set(this);
+		return result;
+	}
+
+	toString(): string {
+		if (hasBuffer) {
+			return this.buffer.toString();
+		} else {
+			if (!textDecoder) {
+				textDecoder = new TextDecoder();
+			}
+			return textDecoder.decode(this.buffer);
+		}
+	}
+
+	slice(start?: number, end?: number): VSBuffer {
+		// IMPORTANT: use subarray instead of slice because TypedArray#slice
+		// creates shallow copy and NodeBuffer#slice doesn't. The use of subarray
+		// ensures the same, performance, behaviour.
+		return new VSBuffer(this.buffer.subarray(start, end));
+	}
+
+	set(array: VSBuffer, offset?: number): void;
+	set(array: Uint8Array, offset?: number): void;
+	set(array: ArrayBuffer, offset?: number): void;
+	set(array: ArrayBufferView, offset?: number): void;
+	set(array: VSBuffer | Uint8Array | ArrayBuffer | ArrayBufferView, offset?: number): void;
+	set(array: VSBuffer | Uint8Array | ArrayBuffer | ArrayBufferView, offset?: number): void {
+		if (array instanceof VSBuffer) {
+			this.buffer.set(array.buffer, offset);
+		} else if (array instanceof Uint8Array) {
+			this.buffer.set(array, offset);
+		} else if (array instanceof ArrayBuffer) {
+			this.buffer.set(new Uint8Array(array), offset);
+		} else if (ArrayBuffer.isView(array)) {
+			this.buffer.set(new Uint8Array(array.buffer, array.byteOffset, array.byteLength), offset);
+		} else {
+			throw new Error(`Unknown argument 'array'`);
+		}
+	}
+
+	readUInt32BE(offset: number): number {
+		return readUInt32BE(this.buffer, offset);
+	}
+
+	writeUInt32BE(value: number, offset: number): void {
+		writeUInt32BE(this.buffer, value, offset);
+	}
+
+	readUInt32LE(offset: number): number {
+		return readUInt32LE(this.buffer, offset);
+	}
+
+	writeUInt32LE(value: number, offset: number): void {
+		writeUInt32LE(this.buffer, value, offset);
+	}
+
+	readUInt8(offset: number): number {
+		return readUInt8(this.buffer, offset);
+	}
+
+	writeUInt8(value: number, offset: number): void {
+		writeUInt8(this.buffer, value, offset);
+	}
+
+	indexOf(subarray: VSBuffer | Uint8Array, offset = 0) {
+		return binaryIndexOf(this.buffer, subarray instanceof VSBuffer ? subarray.buffer : subarray, offset);
+	}
+
+	equals(other: VSBuffer): boolean {
+		if (this === other) {
+			return true;
+		}
+
+		if (this.byteLength !== other.byteLength) {
+			return false;
+		}
+
+		return this.buffer.every((value, index) => value === other.buffer[index]);
+	}
+}
+
+/**
+ * Like String.indexOf, but works on Uint8Arrays.
+ * Uses the boyer-moore-horspool algorithm to be reasonably speedy.
+ */
+export function binaryIndexOf(haystack: Uint8Array, needle: Uint8Array, offset = 0): number {
+	const needleLen = needle.byteLength;
+	const haystackLen = haystack.byteLength;
+
+	if (needleLen === 0) {
+		return 0;
+	}
+
+	if (needleLen === 1) {
+		return haystack.indexOf(needle[0]);
+	}
+
+	if (needleLen > haystackLen - offset) {
+		return -1;
+	}
+
+	// find index of the subarray using boyer-moore-horspool algorithm
+	const table = indexOfTable.value;
+	table.fill(needle.length);
+	for (let i = 0; i < needle.length; i++) {
+		table[needle[i]] = needle.length - i - 1;
+	}
+
+	let i = offset + needle.length - 1;
+	let j = i;
+	let result = -1;
+	while (i < haystackLen) {
+		if (haystack[i] === needle[j]) {
+			if (j === 0) {
+				result = i;
+				break;
+			}
+
+			i--;
+			j--;
+		} else {
+			i += Math.max(needle.length - j, table[haystack[i]]);
+			j = needle.length - 1;
+		}
+	}
+
+	return result;
+}
+
+export function readUInt16LE(source: Uint8Array, offset: number): number {
+	return (
+		((source[offset + 0] << 0) >>> 0) |
+		((source[offset + 1] << 8) >>> 0)
+	);
+}
+
+export function writeUInt16LE(destination: Uint8Array, value: number, offset: number): void {
+	destination[offset + 0] = (value & 0b11111111);
+	value = value >>> 8;
+	destination[offset + 1] = (value & 0b11111111);
+}
+
+export function readUInt32BE(source: Uint8Array, offset: number): number {
+	return (
+		source[offset] * 2 ** 24
+		+ source[offset + 1] * 2 ** 16
+		+ source[offset + 2] * 2 ** 8
+		+ source[offset + 3]
+	);
+}
+
+export function writeUInt32BE(destination: Uint8Array, value: number, offset: number): void {
+	destination[offset + 3] = value;
+	value = value >>> 8;
+	destination[offset + 2] = value;
+	value = value >>> 8;
+	destination[offset + 1] = value;
+	value = value >>> 8;
+	destination[offset] = value;
+}
+
+export function readUInt32LE(source: Uint8Array, offset: number): number {
+	return (
+		((source[offset + 0] << 0) >>> 0) |
+		((source[offset + 1] << 8) >>> 0) |
+		((source[offset + 2] << 16) >>> 0) |
+		((source[offset + 3] << 24) >>> 0)
+	);
+}
+
+export function writeUInt32LE(destination: Uint8Array, value: number, offset: number): void {
+	destination[offset + 0] = (value & 0b11111111);
+	value = value >>> 8;
+	destination[offset + 1] = (value & 0b11111111);
+	value = value >>> 8;
+	destination[offset + 2] = (value & 0b11111111);
+	value = value >>> 8;
+	destination[offset + 3] = (value & 0b11111111);
+}
+
+export function readUInt8(source: Uint8Array, offset: number): number {
+	return source[offset];
+}
+
+export function writeUInt8(destination: Uint8Array, value: number, offset: number): void {
+	destination[offset] = value;
+}
+
+export interface VSBufferReadable extends streams.Readable<VSBuffer> { }
+
+export interface VSBufferReadableStream extends streams.ReadableStream<VSBuffer> { }
+
+export interface VSBufferWriteableStream extends streams.WriteableStream<VSBuffer> { }
+
+export interface VSBufferReadableBufferedStream extends streams.ReadableBufferedStream<VSBuffer> { }
+
+export function readableToBuffer(readable: VSBufferReadable): VSBuffer {
+	return streams.consumeReadable<VSBuffer>(readable, chunks => VSBuffer.concat(chunks));
+}
+
+export function bufferToReadable(buffer: VSBuffer): VSBufferReadable {
+	return streams.toReadable<VSBuffer>(buffer);
+}
+
+export function streamToBuffer(stream: streams.ReadableStream<VSBuffer>): Promise<VSBuffer> {
+	return streams.consumeStream<VSBuffer>(stream, chunks => VSBuffer.concat(chunks));
+}
+
+export async function bufferedStreamToBuffer(bufferedStream: streams.ReadableBufferedStream<VSBuffer>): Promise<VSBuffer> {
+	if (bufferedStream.ended) {
+		return VSBuffer.concat(bufferedStream.buffer);
+	}
+
+	return VSBuffer.concat([
+
+		// Include already read chunks...
+		...bufferedStream.buffer,
+
+		// ...and all additional chunks
+		await streamToBuffer(bufferedStream.stream)
+	]);
+}
+
+export function bufferToStream(buffer: VSBuffer): streams.ReadableStream<VSBuffer> {
+	return streams.toStream<VSBuffer>(buffer, chunks => VSBuffer.concat(chunks));
+}
+
+export function streamToBufferReadableStream(stream: streams.ReadableStreamEvents<Uint8Array | string>): streams.ReadableStream<VSBuffer> {
+	return streams.transform<Uint8Array | string, VSBuffer>(stream, { data: data => typeof data === 'string' ? VSBuffer.fromString(data) : VSBuffer.wrap(data) }, chunks => VSBuffer.concat(chunks));
+}
+
+export function newWriteableBufferStream(options?: streams.WriteableStreamOptions): streams.WriteableStream<VSBuffer> {
+	return streams.newWriteableStream<VSBuffer>(chunks => VSBuffer.concat(chunks), options);
+}
+
+export function prefixedBufferReadable(prefix: VSBuffer, readable: VSBufferReadable): VSBufferReadable {
+	return streams.prefixedReadable(prefix, readable, chunks => VSBuffer.concat(chunks));
+}
+
+export function prefixedBufferStream(prefix: VSBuffer, stream: VSBufferReadableStream): VSBufferReadableStream {
+	return streams.prefixedStream(prefix, stream, chunks => VSBuffer.concat(chunks));
+}
+
+/** Decodes base64 to a uint8 array. URL-encoded and unpadded base64 is allowed. */
+export function decodeBase64(encoded: string) {
+	let building = 0;
+	let remainder = 0;
+	let bufi = 0;
+
+	// The simpler way to do this is `Uint8Array.from(atob(str), c => c.charCodeAt(0))`,
+	// but that's about 10-20x slower than this function in current Chromium versions.
+
+	const buffer = new Uint8Array(Math.floor(encoded.length / 4 * 3));
+	const append = (value: number) => {
+		switch (remainder) {
+			case 3:
+				buffer[bufi++] = building | value;
+				remainder = 0;
+				break;
+			case 2:
+				buffer[bufi++] = building | (value >>> 2);
+				building = value << 6;
+				remainder = 3;
+				break;
+			case 1:
+				buffer[bufi++] = building | (value >>> 4);
+				building = value << 4;
+				remainder = 2;
+				break;
+			default:
+				building = value << 2;
+				remainder = 1;
+		}
+	};
+
+	for (let i = 0; i < encoded.length; i++) {
+		const code = encoded.charCodeAt(i);
+		// See https://datatracker.ietf.org/doc/html/rfc4648#section-4
+		// This branchy code is about 3x faster than an indexOf on a base64 char string.
+		if (code >= 65 && code <= 90) {
+			append(code - 65); // A-Z starts ranges from char code 65 to 90
+		} else if (code >= 97 && code <= 122) {
+			append(code - 97 + 26); // a-z starts ranges from char code 97 to 122, starting at byte 26
+		} else if (code >= 48 && code <= 57) {
+			append(code - 48 + 52); // 0-9 starts ranges from char code 48 to 58, starting at byte 52
+		} else if (code === 43 || code === 45) {
+			append(62); // "+" or "-" for URLS
+		} else if (code === 47 || code === 95) {
+			append(63); // "/" or "_" for URLS
+		} else if (code === 61) {
+			break; // "="
+		} else {
+			throw new SyntaxError(`Unexpected base64 character ${encoded[i]}`);
+		}
+	}
+
+	const unpadded = bufi;
+	while (remainder > 0) {
+		append(0);
+	}
+
+	// slice is needed to account for overestimation due to padding
+	return VSBuffer.wrap(buffer).slice(0, unpadded);
+}
+
+const base64Alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+const base64UrlSafeAlphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_';
+
+/** Encodes a buffer to a base64 string. */
+export function encodeBase64({ buffer }: VSBuffer, padded = true, urlSafe = false) {
+	const dictionary = urlSafe ? base64UrlSafeAlphabet : base64Alphabet;
+	let output = '';
+
+	const remainder = buffer.byteLength % 3;
+
+	let i = 0;
+	for (; i < buffer.byteLength - remainder; i += 3) {
+		const a = buffer[i + 0];
+		const b = buffer[i + 1];
+		const c = buffer[i + 2];
+
+		output += dictionary[a >>> 2];
+		output += dictionary[(a << 4 | b >>> 4) & 0b111111];
+		output += dictionary[(b << 2 | c >>> 6) & 0b111111];
+		output += dictionary[c & 0b111111];
+	}
+
+	if (remainder === 1) {
+		const a = buffer[i + 0];
+		output += dictionary[a >>> 2];
+		output += dictionary[(a << 4) & 0b111111];
+		if (padded) { output += '=='; }
+	} else if (remainder === 2) {
+		const a = buffer[i + 0];
+		const b = buffer[i + 1];
+		output += dictionary[a >>> 2];
+		output += dictionary[(a << 4 | b >>> 4) & 0b111111];
+		output += dictionary[(b << 2) & 0b111111];
+		if (padded) { output += '='; }
+	}
+
+	return output;
+}
+
+const hexChars = '0123456789abcdef';
+export function encodeHex({ buffer }: VSBuffer): string {
+	let result = '';
+	for (let i = 0; i < buffer.length; i++) {
+		const byte = buffer[i];
+		result += hexChars[byte >>> 4];
+		result += hexChars[byte & 0x0f];
+	}
+	return result;
+}
+
+export function decodeHex(hex: string): VSBuffer {
+	if (hex.length % 2 !== 0) {
+		throw new SyntaxError('Hex string must have an even length');
+	}
+	const out = new Uint8Array(hex.length >> 1);
+	for (let i = 0; i < hex.length;) {
+		out[i >> 1] = (decodeHexChar(hex, i++) << 4) | decodeHexChar(hex, i++);
+	}
+	return VSBuffer.wrap(out);
+}
+
+function decodeHexChar(str: string, position: number) {
+	const s = str.charCodeAt(position);
+	if (s >= 48 && s <= 57) { // '0'-'9'
+		return s - 48;
+	} else if (s >= 97 && s <= 102) { // 'a'-'f'
+		return s - 87;
+	} else if (s >= 65 && s <= 70) { // 'A'-'F'
+		return s - 55;
+	} else {
+		throw new SyntaxError(`Invalid hex character at position ${position}`);
+	}
+}

package/src/_internal/util/vs/base/common/cache.ts

@@ -0,0 +1,122 @@
+//!!! DO NOT modify, this file was COPIED from 'microsoft/vscode'
+
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+import { CancellationToken, CancellationTokenSource } from './cancellation';
+import { IDisposable } from './lifecycle';
+
+export interface CacheResult<T> extends IDisposable {
+	promise: Promise<T>;
+}
+
+export class Cache<T> {
+
+	private result: CacheResult<T> | null = null;
+	constructor(private task: (ct: CancellationToken) => Promise<T>) { }
+
+	get(): CacheResult<T> {
+		if (this.result) {
+			return this.result;
+		}
+
+		const cts = new CancellationTokenSource();
+		const promise = this.task(cts.token);
+
+		this.result = {
+			promise,
+			dispose: () => {
+				this.result = null;
+				cts.cancel();
+				cts.dispose();
+			}
+		};
+
+		return this.result;
+	}
+}
+
+export function identity<T>(t: T): T {
+	return t;
+}
+
+interface ICacheOptions<TArg> {
+	/**
+	 * The cache key is used to identify the cache entry.
+	 * Strict equality is used to compare cache keys.
+	*/
+	getCacheKey: (arg: TArg) => unknown;
+}
+
+/**
+ * Uses a LRU cache to make a given parametrized function cached.
+ * Caches just the last key/value.
+*/
+export class LRUCachedFunction<TArg, TComputed> {
+	private lastCache: TComputed | undefined = undefined;
+	private lastArgKey: unknown | undefined = undefined;
+
+	private readonly _fn: (arg: TArg) => TComputed;
+	private readonly _computeKey: (arg: TArg) => unknown;
+
+	constructor(fn: (arg: TArg) => TComputed);
+	constructor(options: ICacheOptions<TArg>, fn: (arg: TArg) => TComputed);
+	constructor(arg1: ICacheOptions<TArg> | ((arg: TArg) => TComputed), arg2?: (arg: TArg) => TComputed) {
+		if (typeof arg1 === 'function') {
+			this._fn = arg1;
+			this._computeKey = identity;
+		} else {
+			this._fn = arg2!;
+			this._computeKey = arg1.getCacheKey;
+		}
+	}
+
+	public get(arg: TArg): TComputed {
+		const key = this._computeKey(arg);
+		if (this.lastArgKey !== key) {
+			this.lastArgKey = key;
+			this.lastCache = this._fn(arg);
+		}
+		return this.lastCache!;
+	}
+}
+
+/**
+ * Uses an unbounded cache to memoize the results of the given function.
+*/
+export class CachedFunction<TArg, TComputed> {
+	private readonly _map = new Map<TArg, TComputed>();
+	private readonly _map2 = new Map<unknown, TComputed>();
+	public get cachedValues(): ReadonlyMap<TArg, TComputed> {
+		return this._map;
+	}
+
+	private readonly _fn: (arg: TArg) => TComputed;
+	private readonly _computeKey: (arg: TArg) => unknown;
+
+	constructor(fn: (arg: TArg) => TComputed);
+	constructor(options: ICacheOptions<TArg>, fn: (arg: TArg) => TComputed);
+	constructor(arg1: ICacheOptions<TArg> | ((arg: TArg) => TComputed), arg2?: (arg: TArg) => TComputed) {
+		if (typeof arg1 === 'function') {
+			this._fn = arg1;
+			this._computeKey = identity;
+		} else {
+			this._fn = arg2!;
+			this._computeKey = arg1.getCacheKey;
+		}
+	}
+
+	public get(arg: TArg): TComputed {
+		const key = this._computeKey(arg);
+		if (this._map2.has(key)) {
+			return this._map2.get(key)!;
+		}
+
+		const value = this._fn(arg);
+		this._map.set(arg, value);
+		this._map2.set(key, value);
+		return value;
+	}
+}