[Tim] >> ... That is, it's up to the bit vector implementation >> to intelligently represent what's almost always going to be a >> relatively tiny slice of a theoretically massive address space. [Antoine] > True. That works if the operating system doesn't go too wild in > address space randomization, though ;-) I don't know that it's a real problem, but if it is I'm sure you know of efficient ways to implement sparse sets (for example, picture Python's set implementation, but slimmed down to handle just C uint64 members). I was hoping to spur a discussion of much higher level issues. I bet Larry was too ;-)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4