style: pefer destructuring

src/.eslintrc.json

@@ -6,6 +6,10 @@
   "plugins": ["compat"],
   "rules": {
     "no-console": "error",
-    "compat/compat": "error"
+    "compat/compat": "error",
+    "prefer-destructuring": ["error", {
+      "object": true,
+      "array": false
+    }]
   }
 }

src/hash/base.ts

@@ -117,7 +117,7 @@ export abstract class HashContainer<K, V> extends Container<K | [K, V]> {
     }
   }
   clear() {
-    const HASH_TAG = this.HASH_TAG;
+    const { HASH_TAG } = this;
     this._objMap.forEach(function (el) {
       delete (<Record<symbol, number>><unknown>el._key)[HASH_TAG];
     });

src/sequential/deque.ts

@@ -100,7 +100,8 @@ class Deque<T> extends SequentialContainer<T> {
     for (let i = this._first.x; i < this._bucketNum; ++i) {
       newMap[newMap.length] = this._map[i];
     }
-    for (let i = 0; i < this._last.x; ++i) {
+    const lastX = this._last.x;
+    for (let i = 0; i < lastX; ++i) {
       newMap[newMap.length] = this._map[i];
     }
     newMap[newMap.length] = [...this._map[this._last.x]];
@@ -197,13 +198,14 @@ class Deque<T> extends SequentialContainer<T> {
   _push(item: T) {
     if (this._length > 0) {
       this._last = this._getNextPosition(this._last);
-      if (this._last.x === 0 && this._last.y === 0) {
+      const { x, y } = this._last;
+      if (x === 0 && y === 0) {
         this._map.push(new Array(this._bucketSize));
         this._last = { x: this._bucketNum, y: 0 };
         this._bucketNum += 1;
       } else if (
-        this._last.x === this._first.x &&
-        this._last.y === this._first.y
+        x === this._first.x &&
+        y === this._first.y
       ) this._reAllocate();
     }
     this._length += 1;
@@ -233,9 +235,10 @@ class Deque<T> extends SequentialContainer<T> {
   _unshift(item: T) {
     if (this._length > 0) {
       this._first = this._getPrevPosition(this._first);
+      const { x, y } = this._first;
       if (
-        this._first.x === this._last.x &&
-        this._first.y === this._last.y
+        x === this._last.x &&
+        y === this._last.y
       ) this._reAllocate();
     }
     this._length += 1;
@@ -287,7 +290,7 @@ class Deque<T> extends SequentialContainer<T> {
     return this._length;
   }
   erase(iter: DequeIterator<T>) {
-    const _node = iter._node;
+    const { _node } = iter;
     if (_node < 0 || _node >= this._length) {
       throw new RangeError('Invalid deque iterator!');
     }

src/sequential/vector.ts

@@ -93,7 +93,7 @@ class Vector<T> extends SequentialContainer<T> {
     return this._vector[index];
   }
   erase(iter: VectorIterator<T>) {
-    const _node = iter._node;
+    const { _node } = iter;
     iter = iter.next();
     this.splice(_node, 1);
     return iter;
@@ -112,7 +112,7 @@ class Vector<T> extends SequentialContainer<T> {
     this._vector[index] = item;
   }
   find(item: T, cmp: CompareFn<T> = compareFromS2L) {
-    const length = this.length;
+    const { length } = this;
     for (let i = 0; i < length; ++i) {
       // istanbul ignore else
       if (cmp(this._vector[i], item) === 0) {
@@ -130,7 +130,7 @@ class Vector<T> extends SequentialContainer<T> {
   }
   unique(cmp: CompareFn<T> = compareFromS2L) {
     let index = 1;
-    const length = this.length;
+    const { length } = this;
     for (let i = 1; i < length; ++i) {
       if (cmp(this._vector[i], this._vector[i - 1]) !== 0) {
         this._vector[index++] = this._vector[i];
@@ -193,7 +193,7 @@ class Vector<T> extends SequentialContainer<T> {
     return this._vector.values();
   }
   forEach(callback: (value: T, index: number, container: this) => void) {
-    const length = this.length;
+    const { length } = this;
     for (let i = 0; i < length; ++i) {
       callback(this._vector[i], i, this);
     }

src/utils/math.ts

@@ -11,4 +11,4 @@ export function ceil(a: number, b: number) {
 /**
  * @internal
  */
-export const floor = Math.floor;
+export const { floor } = Math;