[WebLocks]: Specifying ordering for navigator.locks.query()

[andreas-butler]

Adds a paragraph explaining the ordering requirement for the state snapshot's ordering.

[inexorabletash]

That takes care of the non-normative text. Unfortunately the normative text will require more surgical updating.

• Snapshotting https://wicg.github.io/web-locks/#algorithm-snapshot-state - walks over the lock request queue and held lock set. Both are ordered types.
• The lock request queue has items prepended and enqueued in https://wicg.github.io/web-locks/#algorithm-request-lock
• The held lock set has items appended in https://wicg.github.io/web-locks/#algorithm-process-request

... which does mean the order is currently strictly specified.

• The ordering of the lock request queue is necessary for the abstract algorithm in the spec. This could be altered to be a set of queues partitioned by name, or changed to a list where items are inserted before/after all similarly named items but otherwise anywhere in the list.
• The ordering of the held lock set is only for making snapshots stable. This could be loosened to being just a set, with a note in the snapshot algorithm that the ordering is not specified.

[inexorabletash]

Merged!

I made two minor tweaks:

• Made the non-normative note about ordering an "aside"
• Switched queue_map to queueMap since lowerCamelCase is more common

I think technically we'd need to populate the map and not assume an entry exists for each name, but we can tackle that later.