This is an archived snapshot of W3C's public bugzilla bug tracker, decommissioned in April 2019. Please see the home page for more details.
6.3 Event Retargeting, retargeting algorithm "4. Let RELATIVE-TARGET-TREE be the lowest common inclusive ancestor tree of CURRENT-TARGET-TREE and ORIGINAL-TARGET-TREE " Thes two nodes might not have a common ancestor. I assume the algo should hst return null in that case
(In reply to Erik Arvidsson from comment #0) > 6.3 Event Retargeting, retargeting algorithm > > "4. Let RELATIVE-TARGET-TREE be the lowest common inclusive ancestor tree of > CURRENT-TARGET-TREE and ORIGINAL-TARGET-TREE > " > > Thes two nodes might not have a common ancestor. I assume the algo should > hst return null in that case As long as the current target and the relative target are in the same tree of trees, there must be the lowest common inclusive ancestor tree. The current spec doesn't mention anything about what should happen if the current target and the related target are in different tree of trees. However, that should not happen in the context of event dispatching, I think. Let me close this bug.