3 ms·
Hash lookup on the total number of events. But in JS this is basically dust given how often this occurs.
by Spivak 9y ago
Hash lookup on the total number of events. But in JS this is basically dust given how often this occurs.
- acjohnson55 9y agoHash lookup is O(1)
- learc83 9y agoWith a perfect hash function. But it's still going to be closer to O(1) than O(log n)