- From: ArkadiuszMichalski <notifications@github.com>
- Date: Fri, 08 Apr 2016 06:32:23 -0700
- To: whatwg/dom <dom@noreply.github.com>
Received on Friday, 8 April 2016 13:32:51 UTC
What is convenction when we have nested algorithms and some of them throws exception, this exception should be always rethrows in the calling algorithm (and marking it in prose)? Now it's unclear, especially for node mutations. Some analysis: `insertAdjacentElement(where, element)` (rethrow for "insert-adjacent") > "insert-adjacent" (rethrow for "pre-insert") > "pre-insert" (not rethrow for "ensure pre-insertion validity") > "ensure pre-insertion validity" (throw) " `appendChild(node)` (not rethrow for "append") > "append" (not rethrow for "pre-insert") > "pre-insert" (not rethrow for "ensure pre-insertion validity") > "ensure pre-insertion validity" (throw) `replaceChild(node, child)` (not rethrow for "replace") > "replace" (throw) Only three examples, but there are more, not olny for nodes, at once hard to locate all of them. --- You are receiving this because you are subscribed to this thread. Reply to this email directly or view it on GitHub: https://github.com/whatwg/dom/issues/209
Received on Friday, 8 April 2016 13:32:51 UTC