|
| 1 | +type Key = {board: string, player: number}; |
| 2 | +type Value = {state: Key, score: number}; |
| 3 | + |
| 4 | +function generateKeyObject(): Key { |
| 5 | + const board = Math.random().toString(36).substring(2, 15) + Math.random().toString(36).substring(2, 15); |
| 6 | + const player = Math.random(); |
| 7 | + return {board, player} |
| 8 | +} |
| 9 | + |
| 10 | +function generateValueObject(key: Key): Value { |
| 11 | + const score = Math.random(); |
| 12 | + return {state: {board: key.board, player: key.player}, score} |
| 13 | +} |
| 14 | + |
| 15 | +const getRandomIntInclusive = (min: number, max: number) => { |
| 16 | + min = Math.ceil(min) |
| 17 | + max = Math.floor(max) |
| 18 | + return Math.floor(Math.random() * (max - min + 1)) + min // The maximum is inclusive and the minimum is inclusive |
| 19 | + } |
| 20 | + |
| 21 | +let numberOfEntries = 3000000; |
| 22 | +// Generate an array of keys |
| 23 | +let keys = []; |
| 24 | + |
| 25 | +for (let i = 0; i < numberOfEntries; i++) { |
| 26 | + keys.push(generateKeyObject()); |
| 27 | +} |
| 28 | + |
| 29 | +// Generate an array of values |
| 30 | +let values = []; |
| 31 | + |
| 32 | +for (let i = 0; i < numberOfEntries; i++) { |
| 33 | + values.push(generateValueObject(keys[i])); |
| 34 | +} |
| 35 | + |
| 36 | + |
| 37 | +/********************** MAP **********************************/ |
| 38 | + |
| 39 | +const map = new Map(); |
| 40 | + |
| 41 | +let elapsedTime = 0; |
| 42 | +// Set |
| 43 | +for (let i = 0; i < numberOfEntries; i++) { |
| 44 | + const start = Date.now() |
| 45 | + const keyString = JSON.stringify(keys[i]); |
| 46 | + map.set(keyString, values[i]); |
| 47 | + const stop = Date.now() |
| 48 | + elapsedTime += stop-start; |
| 49 | +} |
| 50 | +console.log(`Map set total time: ${(elapsedTime / 1000)}`); |
| 51 | + |
| 52 | + |
| 53 | +// Get |
| 54 | +elapsedTime = 0; |
| 55 | +for (let i = 0; i < numberOfEntries; i++) { |
| 56 | + const index = getRandomIntInclusive(0, numberOfEntries - 1); |
| 57 | + const start = Date.now() |
| 58 | + const keyString = JSON.stringify(keys[index]); |
| 59 | + const result = map.get(keyString); |
| 60 | + const stop = Date.now() |
| 61 | + elapsedTime += stop-start; |
| 62 | + if (result !== values[index]) throw new Error('Oops, there is a problem with the Get operation of Map'); |
| 63 | +} |
| 64 | +console.log(`Map get total time: ${(elapsedTime / 1000)}`); |
| 65 | + |
| 66 | + |
| 67 | +/********************** HASHTABLE w/ Array ****************************/ |
| 68 | + |
| 69 | + |
| 70 | +class HashTable { |
| 71 | + private buckets_: Map<Key, Value>[] = [] |
| 72 | + constructor(private bucketCount_: number) { |
| 73 | + for (let i=0; i< this.bucketCount_;i++){ |
| 74 | + this.buckets_.push(new Map()); |
| 75 | + } |
| 76 | + } |
| 77 | + |
| 78 | + hashFunction_(obj: Key) { |
| 79 | + let key = JSON.stringify(obj); |
| 80 | + let hash = 0; |
| 81 | + if (key.length === 0) return hash; |
| 82 | + for (let i = 0; i < key.length; i++) { |
| 83 | + hash = (hash<<5) - hash; |
| 84 | + hash = hash + key.charCodeAt(i); |
| 85 | + hash = hash & hash; // Convert to 32bit integer |
| 86 | + } |
| 87 | + return Math.abs(hash); |
| 88 | + } |
| 89 | + |
| 90 | + getBucketIndex_(obj: Key) { |
| 91 | + return this.hashFunction_(obj) % this.bucketCount_; |
| 92 | + } |
| 93 | + |
| 94 | + getBucket_(obj: Key) { |
| 95 | + return this.buckets_[this.getBucketIndex_(obj)]; |
| 96 | + } |
| 97 | + |
| 98 | + set(key: Key, value: Value) { |
| 99 | + this.getBucket_(key).set(key, value); |
| 100 | + } |
| 101 | + get(lookupKey: Key) { |
| 102 | + return this.getBucket_(lookupKey).get(lookupKey); |
| 103 | + } |
| 104 | +} |
| 105 | + |
| 106 | +const hashTable = new HashTable(numberOfEntries); |
| 107 | + |
| 108 | +elapsedTime = 0; |
| 109 | +// Set |
| 110 | +for (let i = 0; i < numberOfEntries; i++) { |
| 111 | + const start = Date.now() |
| 112 | + hashTable.set(keys[i], values[i]); |
| 113 | + const stop = Date.now() |
| 114 | + elapsedTime += stop-start; |
| 115 | +} |
| 116 | +console.log(`Hashtable set total time: ${(elapsedTime / 1000)}`); |
| 117 | + |
| 118 | +// Get |
| 119 | +elapsedTime = 0; |
| 120 | +for (let i = 0; i < numberOfEntries; i++) { |
| 121 | + const index = getRandomIntInclusive(0, numberOfEntries - 1); |
| 122 | + const start = Date.now() |
| 123 | + const result = hashTable.get(keys[index]) |
| 124 | + const stop = Date.now() |
| 125 | + elapsedTime += stop-start; |
| 126 | + if (result !== values[index]) throw new Error('Oops, there is a problem with the Get operation of HashTable'); |
| 127 | +} |
| 128 | +console.log(`Hashtable get total time: ${(elapsedTime / 1000)}`); |
| 129 | + |
| 130 | + |
| 131 | + |
| 132 | + |
| 133 | +/********************** SEARCH TREE *************************/ |
| 134 | + |
| 135 | + |
0 commit comments