123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130
// deno-lint-ignore no-explicit-anyexport default interface MyCircularDeque<T = any> {    isEmpty: () => boolean;    getFront: () => T | number;    deleteFront: () => boolean;    insertLast: (value: T) => boolean;    insertFront: (value: T) => boolean;    deleteLast: () => boolean;    getRear: () => T | number;    isFull: () => boolean;    max_size: number;}
// deno-lint-ignore no-explicit-anyexport default function MyCircularDeque<T = any>(    k = Infinity,): MyCircularDeque<T> {    // console.log('MyCircularDeque', k)    if (k < 1) throw Error("k greater than or equal  one");    const storage = new Map<bigint, T>();    let min = BigInt(0);    let max = BigInt(0);    const initial = 0n;    // function storage.size { return storage.size }    function insertLast(value: T): boolean {        if (isFull()) return false;
        if (storage.size) {            storage.set(max + 1n, value);            max++;        } else {            storage.set(initial, value);            max = initial;        }
        // console.log('insertLast', value, storage)        return true;    }
    function deleteFront(): boolean {        if (isEmpty()) return false;        else {            storage.delete(min);            min++;            // console.log('deleteFront', storage)            if (storage.size === 0) {                min = initial;            }            return true;        }        // if (storage.has(min)) {        //     // const r = storage.get(min);        //     storage.delete(min);        //     min++;        //     max--        //     console.log('deleteFront', storage)        //     return true        // } else { return false }
        // return r as T;    }
    function getFront(): T | number {        // console.log('getFront', storage)        if (isEmpty()) return -1;        const r = storage.get(min);        return r as T;    }
    function isEmpty(): boolean {        return 0 === storage.size;    }    function insertFront(value: T): boolean {        if (isFull()) return false;        if (storage.size) {            storage.set(min - 1n, value);            min--;        } else {            storage.set(initial, value);            min = initial;        }        // storage.set(min - 1n, value);        // min--;        // max++        // console.log('insertFront', value, storage)        return true;    }    function deleteLast(): boolean {        if (isEmpty()) return false;        else {            storage.delete(max);            max--;            // console.log('deleteLast', storage)            if (storage.size === 0) {                max = initial;            }            return true;        }        // if (storage.has(max - 1n + min)) {        //     // const r = storage.get(min);        //     storage.delete(max - 1n + min);        //     max--;        //     console.log('deleteLast', storage)        //     return true        // } else { return false }    }    function getRear(): T | number {        // console.log('getRear', storage)        if (isEmpty()) return -1;
        const r = storage.get(max);
        return r as T;    }    function isFull(): boolean {        return storage.size >= k;    }    return {        isEmpty,        getFront,        deleteFront,        insertLast,        insertFront,        deleteLast,        getRear,        isFull,        max_size: k,    };}