- From: Fredrik Söderqvist via GitHub <sysbot+gh@w3.org>
- Date: Sun, 28 Oct 2018 09:38:18 +0000
- To: public-svg-issues@w3.org
> That method would call itself then. No it wouldn't, see below. (And above...) > The idea is to get the list of descendants first and perform the actual task in step 2-5. Yes, and to do that (invoke [1]), the algorithm dispatches using the method it is invoked from, which for `checkIntersection()` or `checkEnclosure()` would mean that - as written - the list of descendants would always be empty (because we're never invoking this algorithm from `getIntersectionList()` or `getEnclosureList()`.) [1] https://svgwg.org/svg2-draft/struct.html#TermFindIntersectingOrEnclosedDescendants -- GitHub Notification of comment by fsoder Please view or discuss this issue at https://github.com/w3c/svgwg/issues/558#issuecomment-433689972 using your GitHub account
Received on Sunday, 28 October 2018 09:38:20 UTC