Comment on Beating hash tables with trees? The ART-ful radix trieparentComments−saagarjha7yYou can consider the entire virtual memory space to be a big vector, where a pointer is just an index into it!−jstimpfle7yHowever that's a pretty poor vector. It's not homogeneous (you put things of different shapes inside). That also implies you need sophisticated memory management, leading to further overheads. You cannot meaningfully iterate it.−saagarjha7yI was mostly joking…−jstimpfle7yYes and I'm serious :-)−photon-torpedo7yYes, that's exactly how we do it in Fortran 77.
Comments
You can consider the entire virtual memory space to be a big vector, where a pointer is just an index into it!
However that's a pretty poor vector. It's not homogeneous (you put things of different shapes inside). That also implies you need sophisticated memory management, leading to further overheads. You cannot meaningfully iterate it.
I was mostly joking…
Yes and I'm serious :-)
Yes, that's exactly how we do it in Fortran 77.