> So indeed iterating over the keys and stopping after first one makes sense, I > think there is no function to retrieve the first added element. And I think I > can remember someone asking how to get the n-th. added element, conclusion > was to use a loop similar as you do.
Thanks, Stefan. I'd though I was just being silly and missing something obvious. Good to know this is a reasonable solution. > use > > > iterator pairs[A, B](t: OrderedTable[A, B]): (A, B) > > > Run > > and break-out after first (does "... in insertion order." kind of implies > FIFO?) element. Hi, lucian. That's what I did in the code sample I provided, but I used the `keys` iterator instead of `pairs`.
