You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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().)
In the algorithm for
checkIntersection
[1] (checkEnclosure
analogously) it says:which ought to say
checkIntersection
.[1] https://svgwg.org/svg2-draft/struct.html#__svg__SVGSVGElement__checkIntersection (this was the "closest" reference I could find - wishful thinking would have it actually reference the algorithm for said method) - search for "When checkIntersection".
The text was updated successfully, but these errors were encountered: