Refterm Lecture Part 4 - Glyph Hash Table

Over just the past few months there was all this hubbub about building a high performance terminal emulator for Windows since Microsoft is unable to do so. Here's that series: * How fast should an unoptimized terminal run? * Refterm v2 - Resource usage, binary splat, glyph sizing, and more * Refterm Lecture Part 1 - Philosophies of Optimization * Refterm Lecture Part 2 - Slow Code Isolation * Refterm Lecture Part 3 - Minimal Buffer Processing * Refterm Lecture Part 4 - Glyph Hash Table * Refterm Lecture Part 5 - Parsing with SIMD Source: https://github.com/cmuratori/refterm

…bitmap stuff was wasteful. How do you think TTF rendering works? It's the same thing! The only difference is that you use a font renderer to build the raster font at startup from a vector font. Check out this short series about refterm, which deliberately uses a slow system font renderer, but places a hash table in front to amortize its costs: * link to this video * link to this video * link to this video * link to this video * link to this video * link to this video * https://github.com/cmuratori/refterm…

> My naive thought was that I could achieve that by indexing. Not naive, that's exactly what you need! > If you have any recommendations about optimization techniques The reason I put together that quick example was because CSV was fresh in my mind from writing an article about CSV parsing earlier this week. You can vastly speed up parsing with SIMD. Though if you do it right you won't need it beyond building an index. > Ok, first I need to learn how to do that :P. An article posted here a few months ago: Implementing Hash Tables in C The article is a bit on the generic side, which complicates matters more than necessary. A bespoke, simple, open address, linear probing hash table can o…