keeping track of the open cards for update

[Monte Goulding]

On 27/07/2013, at 6:38 AM, Richard Gaskin <ambassador at fourthworld.com> wrote:

> Yes, I've always believed that name was the slowest option, but it's the iteration that made me thinking that ordinal references would be at least as fast, and possibly faster since the lookup is ordinal by nature anyway but ordinal references require no additional ID comparison.

I'm not really sure what you mean by ordinal references.

--
Monte Goulding

M E R Goulding - software development services
mergExt - There's an external for that!