So it's not just a hash table then. Because a hash table would automatically jump straight to an array index based on the hash function applied that created the key... so it's more of a combination of a linked list with a hash function, which really largely defeats the whole point of having a key in the first place, you might as well just have a binary search in an array - although I suppose you get less wasted memory that way.
TMaps
BlitzMax Forums/BlitzMax Programming/TMapsThe forum is locked. These are the original blitzbasic.com forums, kept so they can still be read. No new topics, replies or edits can be made here. To join in, head over to the Blitz3D+ forums.