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

The dependency (slotting algorithm <- assigned slot) exists in the following sentence.

> The *slotting algorithm* must be used to determine the *assigned slot* for a node and must be equivalent to processing the following steps:



--

> I don't think the current approach works. There's a couple of places where it's observable whether or not the algorithm has run. Either you need to just hook into mutation or you need to make sure it's run by the time it's being observed. Currently it doesn't really seem like either is required.

Should we clarify the timing? AFAIR, the spec had a sentence, such as:

> The composed tree must be updated before the rendering occurs.

However, I removed this sentence because this sentence does not define *anything*.
I thought that declarative (lazy?) definition is the last hope.

As a dependency shows, we need to define the timing when we should construct a "flat tree", ultimately, if we are to define the timing exactly.  I have no idea how to define it nicely.


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