Returns number of key-value pairs.
a positive integer.
Complexity: O(1).
import std.algorithm.comparison : equal; auto h = Hashtable!(int, int)(); assert(h.length == 0); h.insert([1 : 10]); assert(h.length == 1);
See Implementation
Returns number of key-value pairs.