Commit 7694c20

committed

better docs

1 parent 040a11b commit 7694c20Copy full SHA for 7694c20

File tree

-6

lines changed

-6

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -9,12 +9,12 @@ const Tree = require('../../trees/red-black-tree'); // fast insertion`
`9`	`9`	`*`
`10`	`10`	`* Implementing a Map with a tree, TreeMap,`
`11`	`11`	`* has a couple of advantages over a HashMap:`
`12`		`- * •Keys are always sorted.`
`13`		`- * •Statistical data can be easily obtained like median,`
	`12`	`+ * •Keys are always sorted.`
	`13`	`+ * •Statistical data can be easily obtained like median,`
`14`	`14`	`* highest, lowest key.`
`15`		`- * •Collisions are not a concern so in the worst case is`
	`15`	`+ * •Collisions are not a concern so in the worst case is`
`16`	`16`	`* still O(log n).`
`17`		`- * •Trees are more space efficient and doesn’t need to`
	`17`	`+ * •Trees are more space efficient and doesn’t need to`
`18`	`18`	`* allocate memory beforehand (e.g. HashMap’s initial capacity)`
`19`	`19`	`* nor you have to rehash when is getting full.`
`20`	`20`	`*`

Lines changed: 4 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -17,14 +17,16 @@ class HashMapSet {`
`17`	`17`
`18`	`18`	`/**`
`19`	`19`	`* Add a new value (duplicates will be added only once)`
	`20`	`+ * Avg. Runtime: O(1)`
`20`	`21`	`* @param {any} value`
`21`	`22`	`*/`
`22`	`23`	`add(value) {`
`23`	`24`	`this.hashMap.set(value);`
`24`	`25`	`}`
`25`	`26`
`26`	`27`	`/**`
`27`		`- * check if value is already on the set`
	`28`	`+ * Check if value is already on the set`
	`29`	`+ * Avg. Runtime: O(1)`
`28`	`30`	`* @param {any} value`
`29`	`31`	`*/`
`30`	`32`	`has(value) {`
`@@ -40,6 +42,7 @@ class HashMapSet {`
`40`	`42`
`41`	`43`	`/**`
`42`	`44`	`* Delete a value from the set`
	`45`	`+ * Avg. Runtime: O(1)`
`43`	`46`	`* @param {any} value`
`44`	`47`	`*/`
`45`	`48`	`delete(value) {`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -40,7 +40,7 @@ class TreeSet {`
`40`	`40`	`* @returns {boolean} true if exists or false otherwise`
`41`	`41`	`*/`
`42`	`42`	`has(value) {`
`43`		`- return !!this.tree.get(value);`
	`43`	`+ return this.tree.has(value);`
`44`	`44`	`}`
`45`	`45`
`46`	`46`	`/**`

Comments

(0)