Reply to thread

Message: [QUOTE="Ole Nielsby, post: 3710078"] Thanks - I wasn't aware of these. (Google didn't tell, or I overlooked them.) It seems std::lower_bound() is marginally faster than my own binary search, so I'll stick to that. I wouldn't do this in an ordinary application - but I find it worthwile to optimize the central parts of my interpreter somewhat aggressively, for the same reasons that makes compiler-writers fine-tune the code generation for marginal gains: it affects not just a single application but every application written in the language. [/QUOTE]