I love this stuff. I&#x27;m currently working on a project where, left to my own devices, I would have come up with some complicated scheme that would reduce an O(n) (or even O(n^2)) task to O(log n). Fortunately, the guidelines I&#x27;ve been given (government, of course) offer a series of extremely-hard-to-understand-but-O(1) methods for retrieving the data. I haven&#x27;t benchmarked it yet, but i&#x27;d imagine that my process would take about 5ms per record, and this process will probably take something on the order of 5 microseconds per record.<p>I&#x27;m learning all kinds of tricks that older developers can probably do in their sleep. Very cool.<p>(Note: the reason I say &quot;older&quot; instead of &quot;experienced&quot;, even though for these purposes they&#x27;re interchangeable, is that the tricks I&#x27;m learning are coming from a COBOL codebase written back in the 70s that I&#x27;m modernizing into Go.)<p>I also learned a long time ago that lookup tables for common requests are a no-brainer. If you only have 256 possible answers to a formula, just stick them in a lookup table.<p>Love it.