- From: Hayato Ito <notifications@github.com>
- Date: Thu, 18 Feb 2016 05:50:51 -0800
- To: w3c/webcomponents <webcomponents@noreply.github.com>
Received on Thursday, 18 February 2016 13:51:43 UTC
I think you will not get a good definition by the current approach. I recommend you to have a more formal approach: e.g. algorithm: - Input: a document composed tree - Output: set of groups algorithm: - Input: node, NODE, in a document composed tree - Output: a group which NODE belongs to Thus, we can clearly define the disjoint sets. Then, algorithm: - Input: node A and node B where A nad B joins the same group - Output: A or B, which comes before in the group Thus, the *oder* is clearly defined. --- Reply to this email directly or view it on GitHub: https://github.com/w3c/webcomponents/pull/381#issuecomment-185732144
Received on Thursday, 18 February 2016 13:51:43 UTC