Editorial: Use consistent wording for List interactions

[gibson042]

Align with ECMA-262:

• tc39/ecma262@2df27d3
• Editorial: consistency around List iteration ecma262#2152

[ben-allen]

I've found a couple of other examples of the wording you're fixing:

negotiation.html:64: 1. If _canonicalizedTag_ is not an element of _seen_, append _canonicalizedTag_ as the last element of _seen_.

negotiation.html:270: 1. If _availableLocale_ is not *undefined*, append _locale_ to the end of _subset_.

[ben-allen]

I'm wondering if by analogy to this change in 262:

<p>When an algorithm iterates over the elements of a List without specifying an order, the order used is the order of the elements in the List.</p>

we should add a sentence about how unless specified otherwise tables are iterated in table order, and then remove all the instances of , in table order, from loops

[ben-allen]

To my eye it looks like there's a couple you've missed, but this is otherwise fantastic

[sffc]

@gibson042 Can you take a look at @ben-allen's feedback? This looks almost mergeable.

[gibson042]

@ben-allen please re-review!

I've found a couple of other examples of the wording you're fixing:

negotiation.html:64: 1. If _canonicalizedTag_ is not an element of _seen_, append _canonicalizedTag_ as the last element of _seen_.

negotiation.html:270: 1. If _availableLocale_ is not *undefined*, append _locale_ to the end of _subset_.

Thanks; fixed.

I'm wondering if by analogy to this change in 262:

<p>When an algorithm iterates over the elements of a List without specifying an order, the order used is the order of the elements in the List.</p>

we should add a sentence about how unless specified otherwise tables are iterated in table order, and then remove all the instances of , in table order, from loops

I've held off on doing this because I can't find a satisfactory way that is both in scope and discoverable—the latter characteristic being important, and handled in ECMA-262 by internal cross referencing (note how e.g. FindViaPredicate step 4 iterates over indices, which is defined in either step 2 or 3 to be a List with a link to the very section establishing the "When an algorithm iterates over the elements of a List without specifying an order, the order used is the order of the elements in the List" convention). We can pursue this in a followup.