Use HashTable in TrieNode.

trekhleb · trekhleb · commit e6de25ecb348 · 2018-05-31T21:37:13.000+03:00
diff --git a/src/data-structures/trie/TrieNode.js b/src/data-structures/trie/TrieNode.js
@@ -1,8 +1,10 @@
+import HashTable from '../hash-table/HashTable';
+
 export default class TrieNode {
   constructor(character, isCompleteWord = false) {
     this.character = character;
     this.isCompleteWord = isCompleteWord;
-    this.children = new Map();
+    this.children = new HashTable();
   }
 
   getChild(character) {
@@ -22,7 +24,7 @@ export default class TrieNode {
   }
 
   suggestChildren() {
-    return [...this.children.keys()];
+    return [...this.children.getKeys()];
   }
 
   toString() {

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,10 @@`
	`1`	`+import HashTable from '../hash-table/HashTable';`
	`2`	`+`
`1`	`3`	`export default class TrieNode {`
`2`	`4`	`constructor(character, isCompleteWord = false) {`
`3`	`5`	`this.character = character;`
`4`	`6`	`this.isCompleteWord = isCompleteWord;`
`5`		`- this.children = new Map();`
	`7`	`+ this.children = new HashTable();`
`6`	`8`	`}`
`7`	`9`
`8`	`10`	`getChild(character) {`
`@@ -22,7 +24,7 @@ export default class TrieNode {`
`22`	`24`	`}`
`23`	`25`
`24`	`26`	`suggestChildren() {`
`25`		`- return [...this.children.keys()];`
	`27`	`+ return [...this.children.getKeys()];`
`26`	`28`	`}`
`27`	`29`
`28`	`30`	`toString() {`