3 ms·
No, there's no need for a tradeoff at all in a properly implemented compiler. You can certainly compress a table in memory and still have that table be indexabl
by pcwalton 7y ago
No, there's no need for a tradeoff at all in a properly implemented compiler. You can certainly compress a table in memory and still have that table be indexable at runtime. Entropy coding is not the only type of compression that exists. DWARF solved this a decade ago.
- f2f 7y agoyou never wrote a compiler, you piggy-backed on others'. stop shitting on go in every thread. rust is fine, stick with it.
- harikb 7y agoI thought Go did use DWARF for debugging info. Your remark sound as if some easy optimization was ignored. Can you please elaborate?
- pcwalton 7y agoThis "pclntab" format duplicates what DWARF does, but is not DWARF: https://golang.org/src/debug/gosym/pclntab.go https://golang.org/src/debug/gosym/pclntab.go