- From: Hayato Ito <notifications@github.com>
- Date: Mon, 28 Mar 2016 01:52:35 -0700
- To: w3c/webcomponents <webcomponents@noreply.github.com>
Received on Monday, 28 March 2016 08:53:06 UTC
Okay. 1. If A and B are both Node objects, nothing changes. The current definition should work. 2. Otherwise: 2.1 Let ANCESTOR-A be the nearest *ancestor* (in the event path) Node from A 2.2 Let ANCESTOR-B be the nearest *ancestor* (in the event path) Node from B 2.3 If both ANCESTOR-A and ANCESTOR-B exist, let's apply "unclosed node" check for them 2.4. Otherwise, do not filter A (Include A in deepPath()) Does this sound good? --- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://github.com/w3c/webcomponents/issues/432#issuecomment-202308671
Received on Monday, 28 March 2016 08:53:06 UTC