Skip to content

Commit

Permalink
Close #152: keep new bikeshed from changing these IDs
Browse files Browse the repository at this point in the history
  • Loading branch information
tabatkins authored and annevk committed Jan 22, 2016
1 parent 7fd852a commit 62e332b
Show file tree
Hide file tree
Showing 2 changed files with 89 additions and 102 deletions.
57 changes: 23 additions & 34 deletions dom.bs
Original file line number Diff line number Diff line change
Expand Up @@ -792,12 +792,12 @@ Initially the attribute must be initialized to
Each <a>event</a> has the following associated
flags that are all initially unset:
<ul>
<li><dfn export for=Event>stop propagation flag</dfn>
<li><dfn export for=Event>stop immediate propagation flag</dfn>
<li><dfn export for=Event>canceled flag</dfn>
<li><dfn export for=Event>initialized flag</dfn>
<li><dfn export for=Event>dispatch flag</dfn>
<li><dfn export for=Event>in passive listener flag</dfn>
<li><dfn export for=Event id=stop-propagation-flag>stop propagation flag</dfn>
<li><dfn export for=Event id=stop-immediate-propagation-flag>stop immediate propagation flag</dfn>
<li><dfn export for=Event id=canceled-flag>canceled flag</dfn>
<li><dfn export for=Event id=initialized-flag>initialized flag</dfn>
<li><dfn export for=Event id=dispatch-flag>dispatch flag</dfn>
<li><dfn export for=Event id=in-passive-listener-flag>in passive listener flag</dfn>
</ul>

The
Expand Down Expand Up @@ -2260,12 +2260,10 @@ When a <a>collection</a> is created, a
filter and a root are associated with it.

The <a>collection</a> then
<dfn export for=Node lt="represented by the collection">represents</dfn> a view of the
subtree rooted at the <a>collection's</a>
root, containing only nodes that match the given filter. The view is linear.
In the absence of specific requirements to the contrary, the nodes within
the <a>collection</a> must be sorted in
<a>tree order</a>.
<dfn export for=Node lt="represented by the collection" id=represented-by-the-collection>represents</dfn>
a view of the subtree rooted at the <a>collection's</a> root, containing only nodes that match the
given filter. The view is linear. In the absence of specific requirements to the contrary, the nodes
within the <a>collection</a> must be sorted in <a>tree order</a>.


<h5 id=interface-nodelist>Interface {{NodeList}}</h5>
Expand Down Expand Up @@ -2470,11 +2468,11 @@ Each <a>node</a> has an associated list of
<a>registered observers</a>.
<!-- XXX also mention this in the {{Node}} section non-normatively? -->

A <dfn export for=MutationObserver>registered observer</dfn> consists of an <b>observer</b> (a
{{MutationObserver}} object) and <b>options</b> (a
A <dfn export for=MutationObserver id=registered-observer>registered observer</dfn> consists of an
<b>observer</b> (a {{MutationObserver}} object) and <b>options</b> (a
{{MutationObserverInit}} dictionary). A
<dfn export for=MutationObserver>transient registered observer</dfn> is a specific type of
<a>registered observer</a> that has a <b>source</b> which is a
<dfn export for=MutationObserver id=transient-registered-observer>transient registered observer</dfn>
is a specific type of <a>registered observer</a> that has a <b>source</b> which is a
<a>registered observer</a>.

<p class="note no-backref"><a>Transient registered observers</a> are used to track
Expand Down Expand Up @@ -6528,24 +6526,15 @@ The <dfn export id=concept-range-root for=Range>root</dfn> of a
<a>start node</a>.
<!-- start and end have an identical root -->

A <a>node</a> <var>node</var> is
<dfn export for=Range>contained</dfn> in a <a>range</a>
<var>range</var> if <var>node</var>'s
<a for=tree>root</a> is
the same as <var>range</var>'s
<a for=Range>root</a>, and (<var>node</var>, 0)
is <a for=Range>after</a> <var>range</var>'s
<a>start</a>, and (<var>node</var>,
<a>length</a> of <var>node</var>) is
<a for=Range>before</a> <var>range</var>'s
<a>end</a>.
A <a>node</a> <var>node</var> is <dfn export for=Range id=contained>contained</dfn> in a
<a>range</a> <var>range</var> if <var>node</var>'s <a for=tree>root</a> is the same as
<var>range</var>'s <a for=Range>root</a>, and (<var>node</var>, 0) is <a for=Range>after</a>
<var>range</var>'s <a>start</a>, and (<var>node</var>, <a>length</a> of <var>node</var>) is
<a for=Range>before</a> <var>range</var>'s <a>end</a>.

A <a>node</a> is <dfn export for=Range>partially contained</dfn>
in a <a>range</a> if it is an
<a>inclusive ancestor</a> of the
<a>range</a>'s
<a>start node</a> but not its
<a>end node</a>, or vice versa.
A <a>node</a> is <dfn export for=Range id=partially-contained>partially contained</dfn> in a
<a>range</a> if it is an <a>inclusive ancestor</a> of the <a>range</a>'s <a>start node</a> but not
its <a>end node</a>, or vice versa.

<div class=note>
Some facts to better understand these definitions:
Expand Down Expand Up @@ -8019,7 +8008,7 @@ interface NodeIterator {
{{createNodeIterator()}} method.

Each {{NodeIterator}} object has an associated
<dfn export for=NodeIterator>iterator collection</dfn>, which is a
<dfn export for=NodeIterator id="iterator-collection">iterator collection</dfn>, which is a
<a>collection</a> rooted at
<a for="traversal">root</a>, whose filter matches any
<a>node</a>.
Expand Down
Loading

0 comments on commit 62e332b

Please sign in to comment.