*Technically* it's a *lookup table* if you pre-compute them. Memoization would j... | Hacker News

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

		bluedino on Aug 17, 2021 \| parent \| context \| favorite \| on: Speeding up atan2f Technically it's a lookup table if you pre-compute them. Memoization would just be caching them as you do them.

tantalor on Aug 17, 2021 [–]

Not necessarily, you could "cache" them in a compilation step and then use the table at runtime.

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