d

Author: mybells

src/js/data-structures/dictionary.js

@@ -1,6 +1,6 @@
 import { defaultToString } from '../util';
 import { ValuePair } from './models/value-pair';
-
+//字典实现
 export default class Dictionary {
   constructor(toStrFn = defaultToString) {
     this.toStrFn = toStrFn;
@@ -78,4 +78,4 @@ export default class Dictionary {
     }
     return objString;
   }
-}
+}

src/js/data-structures/hash-table-linear-probing-lazy.js

@@ -1,6 +1,6 @@
 import { defaultToString } from '../util';
 import { ValuePairLazy } from './models/value-pair-lazy';
-
+//散列表冲突解决-线性探查（软删除方法）
 export default class HashTableLinearProbingLazy {
   constructor(toStrFn = defaultToString) {
     this.toStrFn = toStrFn;
@@ -27,8 +27,8 @@ export default class HashTableLinearProbingLazy {
     if (key != null && value != null) {
       const position = this.hashCode(key);
       if (
-        this.table[position] == null
-        || (this.table[position] != null && this.table[position].isDeleted)
+        this.table[position] == null ||
+        (this.table[position] != null && this.table[position].isDeleted)
       ) {
         this.table[position] = new ValuePairLazy(key, value);
       } else {
@@ -51,18 +51,18 @@ export default class HashTableLinearProbingLazy {
       }
       let index = position + 1;
       while (
-        this.table[index] != null
-        && (this.table[index].key !== key || this.table[index].isDeleted)
+        this.table[index] != null &&
+        (this.table[index].key !== key || this.table[index].isDeleted)
       ) {
         if (this.table[index].key === key && this.table[index].isDeleted) {
           return undefined;
         }
         index++;
       }
       if (
-        this.table[index] != null
-        && this.table[index].key === key
-        && !this.table[index].isDeleted
+        this.table[index] != null &&
+        this.table[index].key === key &&
+        !this.table[index].isDeleted
       ) {
         return this.table[position].value;
       }
@@ -79,15 +79,15 @@ export default class HashTableLinearProbingLazy {
       }
       let index = position + 1;
       while (
-        this.table[index] != null
-        && (this.table[index].key !== key || this.table[index].isDeleted)
+        this.table[index] != null &&
+        (this.table[index].key !== key || this.table[index].isDeleted)
       ) {
         index++;
       }
       if (
-        this.table[index] != null
-        && this.table[index].key === key
-        && !this.table[index].isDeleted
+        this.table[index] != null &&
+        this.table[index].key === key &&
+        !this.table[index].isDeleted
       ) {
         this.table[index].isDeleted = true;
         return true;
@@ -129,4 +129,4 @@ export default class HashTableLinearProbingLazy {
     }
     return objString;
   }
-}
+}

src/js/data-structures/hash-table-linear-probing.js

@@ -1,6 +1,7 @@
 import { defaultToString } from '../util';
 import { ValuePair } from './models/value-pair';
 
+//散列表冲突解决-线性探查（移动方法）
 export default class HashTableLinearProbing {
   constructor(toStrFn = defaultToString) {
     this.toStrFn = toStrFn;
@@ -121,4 +122,4 @@ export default class HashTableLinearProbing {
     }
     return objString;
   }
-}
+}

src/js/data-structures/hash-table-separate-chaining.js

@@ -1,7 +1,7 @@
 import { defaultToString } from '../util';
 import LinkedList from './linked-list';
 import { ValuePair } from './models/value-pair';
-
+//散列表冲突解决-分离链接
 export default class HashTableSeparateChaining {
   constructor(toStrFn = defaultToString) {
     this.toStrFn = toStrFn;
@@ -103,4 +103,4 @@ export default class HashTableSeparateChaining {
     }
     return objString;
   }
-}
+}

src/js/data-structures/hash-table.js

@@ -1,6 +1,6 @@
 import { defaultToString } from '../util';
 import { ValuePair } from './models/value-pair';
-
+//散列表
 export default class HashTable {
   constructor(toStrFn = defaultToString) {
     this.toStrFn = toStrFn;
@@ -82,4 +82,4 @@ export default class HashTable {
     }
     return objString;
   }
-}
+}