Isn't a Hashtable Type already included in BMAX which is called TMap.
No. TMap is a Set implemented as a binary search tree. And what is the advantage of this system in comparison to the TMap type?
'This system' has close to constant look-up times. TMap has Log(n). Also this hashTable implementation doesn't appear to be a Set (that is, the same object can be indexed more than once).It's a trade of between speed and space.