In the PR#49's algorithm of requestPointerLock is currently missing the description about how entries in lock requests queue are processed. Without an explicit text, we will leave open the incorrect (?) assumption that all entries will be synchronously dequeued at the end.
In the PR#49's algorithm of requestPointerLock is currently missing the description about how entries in
lock requests queueare processed. Without an explicit text, we will leave open the incorrect (?) assumption that all entries will be synchronously dequeued at the end.