data-structure-typed 1.46.2 → 1.46.4

package/src/data-structures/queue/deque.ts

@@ -7,8 +7,8 @@
  */
 
 
-import { IterableWithSizeOrLength, IterateDirection } from "../../types";
-import { calcMinUnitsRequired, rangeCheck, throwRangeError } from "../../utils";
+import { IterableWithSizeOrLength } from "../../types";
+import { calcMinUnitsRequired, rangeCheck } from "../../utils";
 
 /**
  * Deque can provide random access with O(1) time complexity
@@ -17,89 +17,6 @@ import { calcMinUnitsRequired, rangeCheck, throwRangeError } from "../../utils";
  * Deque is implemented using a dynamic array. Inserting or deleting beyond both ends of the array may require moving elements or reallocating space.
  */
 
-export class DequeIterator<E> {
-  iterateDirection: IterateDirection;
-
-  index: number;
-  readonly deque: Deque<E>;
-
-  /**
-   * The constructor initializes the index, iterate direction, and prev/next functions for a
-   * DequeIterator object.
-   * @param {number} index - The index parameter represents the current index position of the iterator
-   * within the deque. It is a number that indicates the position of the element that the iterator is
-   * currently pointing to.
-   * @param deque - The `deque` parameter is an instance of the `Deque` class. It represents a
-   * double-ended queue data structure, which allows elements to be added or removed from both ends.
-   * @param iterateDirection - The `iterateDirection` parameter is an optional parameter that specifies
-   * the direction in which the iterator should iterate over the elements of the `deque`. It has a
-   * default value of `IterateDirection.DEFAULT`.
-   * @returns The constructor is not returning anything. It is used to initialize the properties of the
-   * object being created.
-   */
-  constructor(index: number, deque: Deque<E>, iterateDirection = IterateDirection.DEFAULT) {
-    this.index = index;
-    this.iterateDirection = iterateDirection;
-    if (this.iterateDirection === IterateDirection.DEFAULT) {
-      this.prev = function () {
-        if (this.index === 0) {
-          throwRangeError();
-        }
-        this.index -= 1;
-        return this;
-      };
-      this.next = function () {
-        if (this.index === this.deque.size) {
-          throwRangeError();
-        }
-        this.index += 1;
-        return this;
-      };
-    } else {
-      this.prev = function () {
-        if (this.index === this.deque.size - 1) {
-          throwRangeError();
-        }
-        this.index += 1;
-        return this;
-      };
-      this.next = function () {
-        if (this.index === -1) {
-          throwRangeError();
-        }
-        this.index -= 1;
-        return this;
-      };
-    }
-    this.deque = deque;
-  }
-
-  get current() {
-    return this.deque.getAt(this.index);
-  }
-
-  set current(newElement: E) {
-    this.deque.setAt(this.index, newElement);
-  }
-
-  isAccessible() {
-    return this.index !== this.deque.size;
-  }
-
-  prev(): DequeIterator<E> {
-    return this;
-  }
-
-  next(): DequeIterator<E> {
-    return this;
-  }
-
-  clone() {
-    return new DequeIterator<E>(this.index, this.deque, this.iterateDirection);
-  }
-
-}
-
 export class Deque<E> {
   protected _bucketFirst = 0;
   protected _firstInBucket = 0;
@@ -123,7 +40,7 @@ export class Deque<E> {
     if ('length' in elements) {
       if (elements.length instanceof Function) _size = elements.length(); else _size = elements.length;
     } else {
-      if (elements.size instanceof Function) _size = elements.size();else _size = elements.size;
+      if (elements.size instanceof Function) _size = elements.size(); else _size = elements.size;
     }
 
     this._bucketSize = bucketSize;
@@ -245,38 +162,26 @@ export class Deque<E> {
   }
 
   /**
-   * The `begin()` function returns a new iterator for a deque starting from the first element.
-   * @returns A new instance of the DequeIterator class is being returned.
-   */
-  begin() {
-    return new DequeIterator<E>(0, this);
-  }
-
-  /**
-   * The `end()` function returns a new `DequeIterator` object with the size and reference to the
-   * current deque.
-   * @returns A new instance of the DequeIterator class is being returned.
+   * The below function is a generator that yields elements from a collection one by one.
    */
-  end() {
-    return new DequeIterator<E>(this.size, this);
-  }
-
-  /**
-   * The reverseBegin function returns a new DequeIterator object that starts at the last element of
-   * the deque and iterates in reverse direction.
-   * @returns A new instance of the DequeIterator class is being returned.
-   */
-  reverseBegin() {
-    return new DequeIterator<E>(this.size - 1, this, IterateDirection.REVERSE);
+  * begin(): Generator<E> {
+    let index = 0;
+    while (index < this.size) {
+      yield this.getAt(index);
+      index++;
+    }
   }
 
   /**
-   * The reverseEnd() function returns a new DequeIterator object that iterates over the elements of a
-   * Deque in reverse order.
-   * @returns A new instance of the DequeIterator class is being returned.
+   * The function `reverseBegin()` is a generator that yields elements in reverse order starting from
+   * the last element.
    */
-  reverseEnd() {
-    return new DequeIterator<E>(-1, this, IterateDirection.REVERSE);
+  * reverseBegin(): Generator<E> {
+    let index = this.size - 1;
+    while (index >= 0) {
+      yield this.getAt(index);
+      index--;
+    }
   }
 
   /**
@@ -431,7 +336,7 @@ export class Deque<E> {
    * @returns The element at the specified position in the data structure is being returned.
    */
   getAt(pos: number): E {
-    rangeCheck!(pos, 0, this.size - 1);
+    rangeCheck(pos, 0, this.size - 1);
     const {
       bucketIndex,
       indexInBucket
@@ -456,7 +361,7 @@ export class Deque<E> {
    * position in the data structure.
    */
   setAt(pos: number, element: E) {
-    rangeCheck!(pos, 0, this.size - 1);
+    rangeCheck(pos, 0, this.size - 1);
     const {
       bucketIndex,
       indexInBucket
@@ -486,7 +391,7 @@ export class Deque<E> {
    */
   insertAt(pos: number, element: E, num = 1) {
     const length = this.size;
-    rangeCheck!(pos, 0, length);
+    rangeCheck(pos, 0, length);
     if (pos === 0) {
       while (num--) this.unshift(element);
     } else if (pos === this.size) {
@@ -550,7 +455,7 @@ export class Deque<E> {
    * @returns The size of the data structure after the deletion operation is performed.
    */
   deleteAt(pos: number) {
-    rangeCheck!(pos, 0, this.size - 1);
+    rangeCheck(pos, 0, this.size - 1);
     if (pos === 0) this.shift();
     else if (pos === this.size - 1) this.pop();
     else {
@@ -605,50 +510,6 @@ export class Deque<E> {
     return this.size;
   }
 
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The function deletes an element from a deque using an iterator and returns the next iterator.
-   * @param iter - The parameter `iter` is of type `DequeIterator<E>`. It represents an iterator object
-   * that is used to iterate over elements in a deque (double-ended queue).
-   * @returns the updated iterator after deleting an element from the deque.
-   */
-  deleteByIterator(iter: DequeIterator<E>) {
-    const index = iter.index;
-    this.deleteAt(index);
-    iter = iter.next();
-    return iter;
-  }
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   */
-
-  /**
-   * Time Complexity: O(n)
-   * Space Complexity: O(1)
-   *
-   * The function `findIterator` searches for an element in a deque and returns an iterator pointing to
-   * the element if found, otherwise it returns an iterator pointing to the end of the deque.
-   * @param {E} element - The `element` parameter is the element that you want to find in the deque.
-   * @returns The method `findIterator(element: E)` returns a `DequeIterator<E>` object.
-   */
-  findIterator(element: E) {
-    for (let i = 0; i < this.size; ++i) {
-      if (this.getAt(i) === element) {
-        return new DequeIterator<E>(i, this);
-      }
-    }
-    return this.end();
-  }
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)

package/src/types/data-structures/hash/hash-map.ts

@@ -4,3 +4,9 @@ export type HashMapLinkedNode<K, V> = {
   next: HashMapLinkedNode<K, V>;
   prev: HashMapLinkedNode<K, V>;
 };
+
+export type HashMapOptions<K, V> = {
+  elements: Iterable<[K, V]>;
+  hashFn: (key: K) => string;
+  objHashFn: (key: K) => WeakKey
+}

package/src/types/data-structures/hash/index.ts

@@ -1,8 +1,4 @@
-export * from './coordinate-map';
-export * from './coordinate-set';
 export * from './hash-map';
 export * from './hash-table';
-export * from './tree-map';
-export * from './tree-set';
 
 export type HashFunction<K> = (key: K) => number;

package/src/utils/utils.ts

@@ -93,7 +93,7 @@ export const throwRangeError = (message = 'The value is off-limits.'): void => {
   throw new RangeError(message);
 };
 
-export const isObjOrFunc = (input: unknown): input is Record<string, unknown> | ((...args: any[]) => any) => {
+export const isWeakKey = (input: unknown): input is WeakKey => {
   const inputType = typeof input;
   return (inputType === 'object' && input !== null) || inputType === 'function';
 };

package/test/performance/data-structures/hash/hash-map.test.ts

@@ -5,44 +5,119 @@ import { magnitude } from '../../../utils';
 import { isCompetitor } from '../../../config';
 
 const suite = new Benchmark.Suite();
-const { TEN_THOUSAND } = magnitude;
+const { MILLION } = magnitude;
 
-suite.add(`${TEN_THOUSAND.toLocaleString()} set`, () => {
+suite.add(`${MILLION.toLocaleString()} set`, () => {
   const hm = new HashMap<number, number>();
 
-  for (let i = 0; i < TEN_THOUSAND; i++) {
+  for (let i = 0; i < MILLION; i++) {
     hm.set(i, i);
   }
 });
+
 if (isCompetitor) {
-  suite.add(`${TEN_THOUSAND.toLocaleString()} CPT set`, () => {
+  suite.add(`${MILLION.toLocaleString()} CPT set`, () => {
     const hm = new CHashMap<number, number>();
 
-    for (let i = 0; i < TEN_THOUSAND; i++) {
+    for (let i = 0; i < MILLION; i++) {
       hm.setElement(i, i);
     }
   });
 }
-suite.add(`${TEN_THOUSAND.toLocaleString()} set & get`, () => {
+
+suite.add(`${MILLION.toLocaleString()} Map set`, () => {
+  const hm = new Map<number, number>();
+
+  for (let i = 0; i < MILLION; i++) hm.set(i, i);
+});
+
+suite.add(`${MILLION.toLocaleString()} Set add`, () => {
+  const hs = new Set<number>();
+
+  for (let i = 0; i < MILLION; i++) hs.add(i);
+});
+
+suite.add(`${MILLION.toLocaleString()} set & get`, () => {
   const hm = new HashMap<number, number>();
 
-  for (let i = 0; i < TEN_THOUSAND; i++) {
+  for (let i = 0; i < MILLION; i++) {
     hm.set(i, i);
   }
-  for (let i = 0; i < TEN_THOUSAND; i++) {
+  for (let i = 0; i < MILLION; i++) {
     hm.get(i);
   }
 });
+
 if (isCompetitor) {
-  suite.add(`${TEN_THOUSAND.toLocaleString()} CPT set & get`, () => {
+  suite.add(`${MILLION.toLocaleString()} CPT set & get`, () => {
     const hm = new CHashMap<number, number>();
 
-    for (let i = 0; i < TEN_THOUSAND; i++) {
+    for (let i = 0; i < MILLION; i++) {
       hm.setElement(i, i);
     }
-    for (let i = 0; i < TEN_THOUSAND; i++) {
+    for (let i = 0; i < MILLION; i++) {
       hm.getElementByKey(i);
     }
   });
 }
+
+suite.add(`${MILLION.toLocaleString()} Map set & get`, () => {
+  const hm = new Map<number, number>();
+
+  for (let i = 0; i < MILLION; i++) {
+    hm.set(i, i);
+  }
+  for (let i = 0; i < MILLION; i++) {
+    hm.get(i);
+  }
+});
+
+suite.add(`${MILLION.toLocaleString()} Set add & has`, () => {
+  const hs = new Set<number>();
+
+  for (let i = 0; i < MILLION; i++) hs.add(i);
+
+  for (let i = 0; i < MILLION; i++) hs.has(i);
+
+});
+
+suite.add(`${MILLION.toLocaleString()} ObjKey set & get`, () => {
+  const hm = new HashMap<[number, number], number>();
+  const objKeys:[number, number][] = [];
+  for (let i = 0; i < MILLION; i++) {
+    const obj: [number, number] = [i, i];
+    objKeys.push(obj)
+    hm.set(obj, i);
+  }
+  for (let i = 0; i < MILLION; i++) {
+    hm.get(objKeys[i]);
+  }
+});
+
+suite.add(`${MILLION.toLocaleString()} Map ObjKey set & get`, () => {
+  const hm = new Map<[number, number], number>();
+  const objs:[number, number][] = [];
+  for (let i = 0; i < MILLION; i++) {
+    const obj: [number, number] = [i, i];
+    objs.push(obj)
+    hm.set(obj, i);
+  }
+  for (let i = 0; i < MILLION; i++) {
+    hm.get(objs[i]);
+  }
+});
+
+suite.add(`${MILLION.toLocaleString()} Set ObjKey add & has`, () => {
+  const hs = new Set<[number, number]>();
+  const objs:[number, number][] = [];
+  for (let i = 0; i < MILLION; i++) {
+    const obj: [number, number] = [i, i];
+    objs.push(obj)
+    hs.add(obj);
+  }
+  for (let i = 0; i < MILLION; i++) {
+    hs.has(objs[i]);
+  }
+});
+
 export { suite };

package/test/performance/reportor.ts

@@ -25,17 +25,20 @@ const reportDistPath = path.join(parentDirectory, 'benchmark');
 
 const testDir = path.join(__dirname, 'data-structures');
 const allFiles = fastGlob.sync(path.join(testDir, '**', '*.test.ts'));
-let testFiles: string[] = [];
+let testFiles: string[];
+
+let isIndividual = false;
 if (args.length > 0) {
   console.log(`arguments: ${args.join(' ')}`)
 
   testFiles = allFiles.filter(file =>
     args.every(word => file.includes(word))
   );
-
+  isIndividual = true;
   console.log(`${testFiles.map(file => coloredLabeled('Matched', file)).join(`
 `)}`);
 } else {
+  isIndividual = false;
   testFiles = allFiles;
 }
 
@@ -129,7 +132,7 @@ const composeReport = () => {
   html += `</div>
                     </body>
                   </html>`;
-  replaceMarkdownContent(
+  if (!isIndividual) replaceMarkdownContent(
     '[//]: # (No deletion!!! Start of Replace Section)', // Start tag
     '[//]: # (No deletion!!! End of Replace Section)', // end identifier
     htmlTables // New content to be inserted

package/test/unit/data-structures/hash/hash-map.test.ts

@@ -172,15 +172,14 @@ describe('HashMap', () => {
     stdMap.forEach((value, key) => {
       if (index === 0) {
         expect(hashMap.first).toEqual([key, value]);
-        expect(hashMap.begin.current[0]).toEqual(key);
+        expect(hashMap.begin().next().value).toEqual([key, value]);
       } else if (index === hashMap.size - 1) {
         expect(hashMap.last).toEqual([key, value]);
-        expect(hashMap.reverseBegin.current[0]).toEqual(key);
+        expect(hashMap.reverseBegin().next().value).toEqual([key, value]);
       } else if (index <= 1000) {
         expect(hashMap.getAt(index)).toEqual([key, value]);
       }
       expect(hashMap.get(key)).toEqual(value);
-      expect(hashMap.getIterator(key).current[1]).toEqual(value);
       index++;
     });
   }
@@ -210,8 +209,8 @@ describe('HashMap', () => {
   test('should iterate correctly with reverse iterators', () => {
     hashMap.set('key1', 'value1');
     hashMap.set('key2', 'value2');
-    const iterator = hashMap.reverseBegin;
-    expect(iterator.next().current).toEqual(['key1', 'value1']);
+    const iterator = hashMap.reverseBegin();
+    expect(iterator.next().value).toEqual(['key2', 'value2']);
   });
 
   test('should return the last element', () => {
@@ -230,3 +229,35 @@ describe('HashMap', () => {
     expect(hashMap.getAt(1)).toEqual(['key2', 'value2']);
   });
 });
+
+describe('HashMap for coordinate object keys', () => {
+  const hashMap: HashMap<[number, number], number> = new HashMap();
+  const codObjs: [number, number][] = [];
+
+  test('set elements in hash map', () => {
+    for (let i = 0; i < 1000; i++) {
+      const codObj: [number, number] = [getRandomInt(-10000, 10000), i];
+      codObjs.push(codObj);
+      hashMap.set(codObj, i);
+    }
+  });
+
+  test('get elements in hash map', () => {
+    for (let i = 0; i < 1000; i++) {
+      const codObj = codObjs[i];
+      if (codObj) {
+        expect(hashMap.get(codObj)).toBe(i);
+      }
+    }
+  });
+
+  test('delete elements in hash map', () => {
+    for (let i = 0; i < 1000; i++) {
+      if (i === 500) expect(hashMap.size).toBe(500)
+      const codObj = codObjs[i];
+      if (codObj) hashMap.delete(codObj);
+    }
+    expect(hashMap.size).toBe(0);
+  });
+
+});

package/test/unit/data-structures/queue/deque.test.ts

@@ -419,4 +419,32 @@ describe('Deque', () => {
     expect(deque.indexOf(2)).toBe(1);
     expect(deque.indexOf(4)).toBe(-1);
   });
+
+
+  //Test begin method
+  describe('begin()', () => {
+    it('should return an iterator at the beginning of the deque', () => {
+      deque.push(1);
+      deque.push(2);
+      deque.push(3);
+
+      const iterator = deque.begin();
+
+      expect(iterator.next().value).toBe(1);
+    });
+  });
+
+  // Test the reverse Begin method
+  describe('reverseBegin()', () => {
+    it('should return a reverse iterator at the beginning of the deque', () => {
+      deque.push(1);
+      deque.push(2);
+      deque.push(3);
+
+      const iterator = deque.reverseBegin();
+
+      expect(iterator.next().value).toBe(3);
+    });
+  });
+
 });

package/dist/cjs/data-structures/hash/coordinate-map.d.ts

@@ -1,44 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-export declare class CoordinateMap<V> extends Map<any, V> {
-    constructor(joint?: string);
-    protected _joint: string;
-    get joint(): string;
-    /**
-     * The "has" function overrides the base class's "has" function and checks if a key exists in the map by joining the
-     * key array with a specified delimiter.
-     * @param {number[]} key - The parameter "key" is an array of numbers.
-     * @returns The `has` method is being overridden to return the result of calling the `has` method of the superclass
-     * (`super.has`) with the `key` array joined together using the `_joint` property.
-     */
-    has(key: number[]): boolean;
-    /**
-     * The function overrides the set method of a Map object to convert the key from an array to a string using a specified
-     * delimiter before calling the original set method.
-     * @param {number[]} key - The key parameter is an array of numbers.
-     * @param {V} value - The value parameter is the value that you want to associate with the specified key.
-     * @returns The `set` method is returning the result of calling the `set` method of the superclass
-     * (`super.set(key.join(this._joint), value)`).
-     */
-    set(key: number[], value: V): this;
-    /**
-     * The function overrides the get method to join the key array with a specified joint and then calls the super get
-     * method.
-     * @param {number[]} key - An array of numbers
-     * @returns The code is returning the value associated with the specified key in the map.
-     */
-    get(key: number[]): V | undefined;
-    /**
-     * The function overrides the delete method and joins the key array using a specified joint character before calling
-     * the super delete method.
-     * @param {number[]} key - An array of numbers that represents the key to be deleted.
-     * @returns The `delete` method is returning the result of calling the `delete` method on the superclass, with the
-     * `key` array joined together using the `_joint` property.
-     */
-    delete(key: number[]): boolean;
-}

package/dist/cjs/data-structures/hash/coordinate-map.js

@@ -1,63 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CoordinateMap = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-class CoordinateMap extends Map {
-    constructor(joint) {
-        super();
-        this._joint = '_';
-        if (joint !== undefined)
-            this._joint = joint;
-    }
-    get joint() {
-        return this._joint;
-    }
-    /**
-     * The "has" function overrides the base class's "has" function and checks if a key exists in the map by joining the
-     * key array with a specified delimiter.
-     * @param {number[]} key - The parameter "key" is an array of numbers.
-     * @returns The `has` method is being overridden to return the result of calling the `has` method of the superclass
-     * (`super.has`) with the `key` array joined together using the `_joint` property.
-     */
-    has(key) {
-        return super.has(key.join(this._joint));
-    }
-    /**
-     * The function overrides the set method of a Map object to convert the key from an array to a string using a specified
-     * delimiter before calling the original set method.
-     * @param {number[]} key - The key parameter is an array of numbers.
-     * @param {V} value - The value parameter is the value that you want to associate with the specified key.
-     * @returns The `set` method is returning the result of calling the `set` method of the superclass
-     * (`super.set(key.join(this._joint), value)`).
-     */
-    set(key, value) {
-        return super.set(key.join(this._joint), value);
-    }
-    /**
-     * The function overrides the get method to join the key array with a specified joint and then calls the super get
-     * method.
-     * @param {number[]} key - An array of numbers
-     * @returns The code is returning the value associated with the specified key in the map.
-     */
-    get(key) {
-        return super.get(key.join(this._joint));
-    }
-    /**
-     * The function overrides the delete method and joins the key array using a specified joint character before calling
-     * the super delete method.
-     * @param {number[]} key - An array of numbers that represents the key to be deleted.
-     * @returns The `delete` method is returning the result of calling the `delete` method on the superclass, with the
-     * `key` array joined together using the `_joint` property.
-     */
-    delete(key) {
-        return super.delete(key.join(this._joint));
-    }
-}
-exports.CoordinateMap = CoordinateMap;
-//# sourceMappingURL=coordinate-map.js.map

package/dist/cjs/data-structures/hash/coordinate-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"coordinate-map.js","sourceRoot":"","sources":["../../../../src/data-structures/hash/coordinate-map.ts"],"names":[],"mappings":";;;AAAA;;;;;;GAMG;AACH,MAAa,aAAiB,SAAQ,GAAW;IAC/C,YAAY,KAAc;QACxB,KAAK,EAAE,CAAC;QAIA,WAAM,GAAG,GAAG,CAAC;QAHrB,IAAI,KAAK,KAAK,SAAS;YAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IAC/C,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACM,GAAG,CAAC,GAAa;QACxB,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;OAOG;IACM,GAAG,CAAC,GAAa,EAAE,KAAQ;QAClC,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IAED;;;;;OAKG;IACM,GAAG,CAAC,GAAa;QACxB,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;OAMG;IACM,MAAM,CAAC,GAAa;QAC3B,OAAO,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7C,CAAC;CACF;AAvDD,sCAuDC"}