Commit b5c7426

authored

Merge pull request #58 from amejiarosario/feature/hashmap

Feature/hashmap

2 parents 8ea61ce + 2f24f57 commit b5c7426Copy full SHA for b5c7426

File tree

+41

-2

lines changed

+41

-2

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -301,7 +301,7 @@ Hash Map it’s very optimal for searching values by key in constant time O(1)`
`301`	`301`	`.2+.^s\| Data Structure 2+^s\| Searching By .2+^.^s\| Insert .2+^.^s\| Delete .2+^.^s\| Space Complexity`
`302`	`302`	`^\|_Index/Key_ ^\|_Value_`
`303`	`303`	`\| Hash Map (naïve) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n) ^\|O(n)`
`304`		`-\| Hash Map (optimized) ^\|O(1)* ^\|O(n) ^\|O(1)* ^\|O(1)* ^\|O(1)*`
	`304`	`+\| Hash Map (optimized) ^\|O(1) ^\|O(n) ^\|O(1)* ^\|O(1) ^\|O(n)`
`305`	`305`	`\|===`
`306`	`306`	`{empty}* = Amortized run time. E.g. rehashing might affect run time.`
`307`	`307`	`// end::table[]`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -30,6 +30,17 @@ class HashMap {`
`30`	`30`	`this.reset();`
`31`	`31`	`}`
`32`	`32`
	`33`	`+ /**`
	`34`	`+ * Reset or reinitialize all values on the hashmap.`
	`35`	`+ *`
	`36`	`+ * Used for rehashing, clear and initializing the map.`
	`37`	`+ *`
	`38`	`+ * @param {array} buckets - New bucket.`
	`39`	`+ * @param {number} size - The new size of the hashmap.`
	`40`	`+ * @param {number} collisions - The number of collisions.`
	`41`	`+ * @param {array} keysTrackerArray - The array of keys in insertion order`
	`42`	`+ * @param {number} keysTrackerIndex - The last index of keysTrackerArray`
	`43`	`+ */`
`33`	`44`	`reset(`
`34`	`45`	`buckets = new Array(this.initialCapacity),`
`35`	`46`	`size = 0,`
`@@ -273,6 +284,13 @@ class HashMap {`
`273`	`284`	`get length() {`
`274`	`285`	`return this.size;`
`275`	`286`	`}`
	`287`	`+`
	`288`	`+ /**`
	`289`	`+ * Removes all key/value pairs from the Map object.`
	`290`	`+ */`
	`291`	`+ clear() {`
	`292`	`+ this.reset();`
	`293`	`+ }`
`276`	`294`	`}`
`277`	`295`
`278`	`296`	`// Aliases`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -265,7 +265,7 @@ describe('HashMap Tests', () => {`
`265`	`265`	`hashMap.delete('All About That Bass');`
`266`	`266`	`hashMap.set('All About That Bass', 'Meghan Trainor');`
`267`	`267`	`expect(hashMap.keysTrackerIndex).toBe(12);`
`268`		`- // should hava a hole`
	`268`	`+ // should have a hole`
`269`	`269`	`expect(hashMap.keysTrackerArray).toEqual(['Pineapple', 'Despacito', 'Bailando', 'Dura', 'Lean On', 'Hello',`
`270`	`270`	`undefined,`
`271`	`271`	`'Wake Me Up', 'Brother', 'Faded', 'The Spectre', 'All About That Bass']);`

Lines changed: 14 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -138,5 +138,19 @@ mapImplementations.forEach((MapImplementation) => {`
`138`	`138`	`]);`
`139`	`139`	`});`
`140`	`140`	`});`
	`141`	`+`
	`142`	`+ describe('#clear', () => {`
	`143`	`+ beforeEach(() => {`
	`144`	`+ map.set(1, 2);`
	`145`	`+ map.set(2, 'dos');`
	`146`	`+ map.set(3, 3);`
	`147`	`+ });`
	`148`	`+`
	`149`	`+ it('should work', () => {`
	`150`	`+ expect(map.size).toBe(3);`
	`151`	`+ expect(map.clear()).toEqual();`
	`152`	`+ expect(map.size).toBe(0);`
	`153`	`+ });`
	`154`	`+ });`
`141`	`155`	`});`
`142`	`156`	`});`

Lines changed: 7 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -133,6 +133,13 @@ class TreeMap {`
`133`	`133`	`yield [node.value, node.data()];`
`134`	`134`	`}`
`135`	`135`	`}`
	`136`	`+`
	`137`	`+ /**`
	`138`	`+ * Removes all key/value pairs from the Map object.`
	`139`	`+ */`
	`140`	`+ clear() {`
	`141`	`+ this.tree = new Tree();`
	`142`	`+ }`
`136`	`143`	`}`
`137`	`144`
`138`	`145`	`// Aliases`

Comments

(0)