Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Hash lookup on the total number of events. But in JS this is basically dust given how often this occurs.


Hash lookup is O(1)


With a perfect hash function. But it's still going to be closer to O(1) than O(log n)




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: