T[][T] -> [(k1, v1), ..., (k1, vn), ..., (kn, v1), ..., (kn, vn)]

[Tobias Pankrath]

>> Is there any other way to create a range of simple (key,value) 
>> pairs for the array, but needs to allocate (hash.keys return 
>> an array of keys) and then again look up every key.
>
> import std.algorithm : zip;
> import std.traits    : isAssociativeArray;
>
> auto byKeyValuePair(AA)(AA aa) if (isAssociativeArray!AA)
> {
> 	return zip(aa.byKey, aa.byValue);
> }

That byKey and byValue adhere to the same order is not backed up 
by the documenation, I suppose?