Re: [webcomponents] When is the slotting algorithm run (#401)

That would mean though that without optimization we'd have to run this each mutation, for each node in the tree, including any associated shadow trees, and their associated shadow trees, etc., since `slot` elements could get removed or moved, children of host elements could get moved, etc.

It seems easier to specify this as a lazy algorithm if this is only used for `assignedSlot` and `getAssignedNodes()`.

(I'm assuming you mean the "slotting algorithm" and not the "flatted tree algorithm" when you say "this algorithm".)

---
Reply to this email directly or view it on GitHub:
https://github.com/w3c/webcomponents/issues/401#issuecomment-190635068