02-25-2026, 09:27 PM
Isn't the easiest, and fastest way, simply to load the entire file in one go and then parse it and save the data in an array? Then just binary search on the index of the array until you find out if it's in there or not. No random file access needed, no instr searches which go byte by byte looking for a match. Just one array which is completely stored in memory and then a fast search for less than a few dozen binary comparisons to get the answer.
It's how we've did it countless times before on the forums, with a bazillion demos and examples to draw from out there. Why is everyone feeling the need to look for some different way to do things now? Just stick to the tried and true little routines that work so effortlessly.
It's how we've did it countless times before on the forums, with a bazillion demos and examples to draw from out there. Why is everyone feeling the need to look for some different way to do things now? Just stick to the tried and true little routines that work so effortlessly.

