scratch

I like skeeto's version [0], but it allows for unbounded parsing due to unbounded zero padding of decimals, so therefore not constant time. Probably only requires an additional counter for the number of digits seen to mitigate that, but it would probably yucky the code a bit. [0]: https://github.com/skeeto/scratch/blob/2af9b076117838b93fc2f...

I like the sentiment, I love C. But this book seems riddled with errors and baffling decisions. First of all, the fixed points are LITERALLY NOT FIXED POINTS. They're decimal floats. Fixed points are just integers that re-scale when multiplied or divided. There is no exponent field, no nothing. The author seems to have confused the notion "fixed points allow for precise calculations of monetary values" to mean that they're decimal. They're not. That section of the book contradicts itself constantly and also the code is wrong. Also an ordered vector is used to implement a map/set. Because: > Most people would likely instinctively reach for hash tables, and typically spend the next few months researching optimal hash algorithms and table designs. > A binary searched vector is as simple as it gets and performs pretty well while being more pr

> Is it over-engineering to use a static 16-entry perfect hash of file name extensions to filter out the five supported languages? It's patently absurd. I also like the ATOMIC_RADD for populating the line count: https://github.com/skeeto/scratch/blob/5129fd45153999924334c... This entire program is too clever by half, while still not doing a "correct" source line count (it just counts new lines).

Yes: https://github.com/skeeto/scratch/blob/5129fd45153999924334c...