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

		sarchertech on July 5, 2017 \| parent \| context \| favorite \| on: How to optimize React applications that use Redux With a perfect hash function. But it's still going to be closer to O(1) than O(log n)