foreach for string[string]AA

[bachmeier via Digitalmars-d-learn]

On Tuesday, 28 February 2017 at 15:33:46 UTC, ikod wrote:

> AA implemented as hash table, so it doesn't preserve insertion 
> order. You have to sort keys when you need:
>
> import std.algorithm;
> import std.stdio;
> void main() {
> 	auto aa = ["one":1,
> 			   "two":2
> 			   ];
> 	foreach(k; sort(aa.keys)) {
> 		writeln(k);
> 	}
> }

That will only work if sorting recovers the insertion order. An 
easy way to save the insertion order would be to use an array of 
structs. If an associate array is really needed, you can create a 
struct that contains the associative array and a string[] holding 
the keys.