GC-less Hash-Tables (AA)

[Nordlöw]

Have anybody cooked any GC-less variants of hash-tables 
(associative arrays) that take keys and values with value 
semantics only.

Similar to how
    X[]

relates to

    std.containers.Array!X

I need this to index my nodes in graphs with tens of millions of 
nodes.