,
like this:
Note, this is an informative note.
- Conformant Algorithms
- Requirements phrased in the imperative as part of algorithms
- (such as "strip any leading space characters"
- or "return false and abort these steps")
- are to be interpreted with the meaning of the key word
- ("must", "should", "may", etc)
- used in introducing the algorithm.
- Conformance requirements phrased as algorithms or specific steps
- can be implemented in any manner,
- so long as the end result is equivalent.
- In particular, the algorithms defined in this specification
- are intended to be easy to understand
- and are not intended to be performant.
- Implementers are encouraged to optimize.
Index
diff --git a/tests/github/WICG/aom/spec/custom-element-semantics.console.txt b/tests/github/WICG/aom/spec/custom-element-semantics.console.txt
index 2f19626d32..d655fe357b 100644
--- a/tests/github/WICG/aom/spec/custom-element-semantics.console.txt
+++ b/tests/github/WICG/aom/spec/custom-element-semantics.console.txt
@@ -1,7 +1,5 @@
LINK ERROR: No 'idl' refs found for 'createInternals()'.
{{createInternals()}}
-LINE 310: No 'dfn' refs found for 'reflected' that are marked for export.
-reflected
LINE ~218: Couldn't find section '#custom-element-definition' in spec 'html':
[[HTML#custom-element-definition]]
LINE ~218: Couldn't find section '#element-definition' in spec 'html':
diff --git a/tests/github/WICG/aom/spec/custom-element-semantics.html b/tests/github/WICG/aom/spec/custom-element-semantics.html
index 6f80d987df..c531a706da 100644
--- a/tests/github/WICG/aom/spec/custom-element-semantics.html
+++ b/tests/github/WICG/aom/spec/custom-element-semantics.html
@@ -705,7 +705,7 @@ Default semantic properties for Custom Elem
-
Copyright © 1970 the Contributors to the Default semantic properties for Custom Elements Specification, published by the Web Platform Incubator Community Group under the W3C Community Contributor License Agreement (CLA).
+
Copyright © 1970 the Contributors to the Default semantic properties for Custom Elements Specification, published by the Web Platform Incubator Community Group under the W3C Community Contributor License Agreement (CLA).
A human-readable summary is available.
@@ -755,7 +755,6 @@ Table of Contents
Conformance
Index
@@ -967,7 +966,7 @@ 2.1. Introduction
2.1. Introduction
This section is non-normative
In general, the precedence of semantic properties is that
-any ARIA property set directly on the Element (either via setting an attribute or via the associated reflected property)
+any ARIA property set directly on the Element (either via setting an attribute or via the associated reflected property)
overrides a value for the same property on
the Element’s ElementInternals object,
and any ARIA property set either on the Element or the ElementInternals object
@@ -1073,20 +1072,6 @@
,
like this:
Note, this is an informative note.
- Conformant Algorithms
- Requirements phrased in the imperative as part of algorithms
- (such as "strip any leading space characters"
- or "return false and abort these steps")
- are to be interpreted with the meaning of the key word
- ("must", "should", "may", etc)
- used in introducing the algorithm.
- Conformance requirements phrased as algorithms or specific steps
- can be implemented in any manner,
- so long as the end result is equivalent.
- In particular, the algorithms defined in this specification
- are intended to be easy to understand
- and are not intended to be performant.
- Implementers are encouraged to optimize.
Index
@@ -1126,6 +1111,7 @@ custom element definition
define(name, constructor, options)
defined
+ reflect
[HTML-AAM] defines the following terms:
@@ -1151,7 +1137,7 @@ N
[HTML]
Anne van Kesteren; et al. HTML Standard. Living Standard. URL: https://html.spec.whatwg.org/multipage/
[HTML-AAM-1.0]
- Steve Faulkner; Scott O'Hara. HTML Accessibility API Mappings 1.0. URL: https://w3c.github.io/html-aam/
+ Scott O'Hara. HTML Accessibility API Mappings 1.0. URL: https://w3c.github.io/html-aam/
[RFC2119]
S. Bradner. Key words for use in RFCs to Indicate Requirement Levels. March 1997. Best Current Practice. URL: https://datatracker.ietf.org/doc/html/rfc2119
[WEBIDL]
@@ -1388,6 +1374,7 @@ I
"31559e1b": {"dfnID":"31559e1b","dfnText":"define(name, constructor, options)","external":true,"refSections":[{"refs":[{"id":"ref-for-dom-customelementregistry-define"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-dom-customelementregistry-define\u2460"},{"id":"ref-for-dom-customelementregistry-define\u2461"}],"title":"1.2. Changes to custom element definition"},{"refs":[{"id":"ref-for-dom-customelementregistry-define\u2462"}],"title":"2.1. Introduction"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#dom-customelementregistry-define"},
"3fca5a9e": {"dfnID":"3fca5a9e","dfnText":"map","external":true,"refSections":[{"refs":[{"id":"ref-for-ordered-map"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-ordered-map\u2460"}],"title":"1.1.2. Defining per-instance custom element semantics"}],"url":"https://infra.spec.whatwg.org/#ordered-map"},
"5889f566": {"dfnID":"5889f566","dfnText":"accessibility tree","external":true,"refSections":[{"refs":[{"id":"ref-for-dfn-accessibility-tree"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"}],"url":"https://www.w3.org/TR/core-aam-1.1/#dfn-accessibility-tree"},
+"5ab7b520": {"dfnID":"5ab7b520","dfnText":"reflect","external":true,"refSections":[{"refs":[{"id":"ref-for-reflect"}],"title":"2.1. Introduction"}],"url":"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect"},
"7e4580af": {"dfnID":"7e4580af","dfnText":"ElementDefinitionOptions","external":true,"refSections":[{"refs":[{"id":"ref-for-elementdefinitionoptions"},{"id":"ref-for-elementdefinitionoptions\u2460"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-elementdefinitionoptions\u2461"},{"id":"ref-for-elementdefinitionoptions\u2462"}],"title":"1.2. Changes to custom element definition"},{"refs":[{"id":"ref-for-elementdefinitionoptions\u2463"}],"title":"2. ARIA semantic precedence between ElementDefinitionOptions, ElementInternals and ARIA properties"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#elementdefinitionoptions"},
"81c9c6df": {"dfnID":"81c9c6df","dfnText":"accessible object","external":true,"refSections":[{"refs":[{"id":"ref-for-dfn-accessible-object"},{"id":"ref-for-dfn-accessible-object\u2460"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-dfn-accessible-object\u2461"}],"title":"1.1.2. Defining per-instance custom element semantics"}],"url":"https://www.w3.org/TR/core-aam-1.1/#dfn-accessible-object"},
"87f26218": {"dfnID":"87f26218","dfnText":"AriaAttributes","external":true,"refSections":[{"refs":[{"id":"ref-for-idl-def-ariaattributes"},{"id":"ref-for-idl-def-ariaattributes\u2460"},{"id":"ref-for-idl-def-ariaattributes\u2461"},{"id":"ref-for-idl-def-ariaattributes\u2462"}],"title":"1.2. Changes to custom element definition"}],"url":"https://www.w3.org/TR/wai-aria-1.2/#idl-def-ariaattributes"},
@@ -1795,6 +1782,7 @@ I
"#semantic-properties": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"aom-aria","spec":"aom-aria-1","status":"local","text":"semantic properties","type":"dfn","url":"#semantic-properties"},
"https://dom.spec.whatwg.org/#concept-element-custom": {"export":true,"for_":["Element"],"level":"1","normative":true,"shortname":"dom","spec":"dom","status":"current","text":"custom","type":"dfn","url":"https://dom.spec.whatwg.org/#concept-element-custom"},
"https://dom.spec.whatwg.org/#element": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"dom","spec":"dom","status":"current","text":"Element","type":"interface","url":"https://dom.spec.whatwg.org/#element"},
+"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"html","spec":"html","status":"current","text":"reflect","type":"dfn","url":"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"html","spec":"html","status":"current","text":"custom element","type":"dfn","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element-definition": {"export":true,"for_":[],"level":"","normative":true,"shortname":"html","spec":"html","status":"anchor-block","text":"custom element definition","type":"dfn","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element-definition"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#customelementregistry": {"export":true,"for_":[],"level":"","normative":true,"shortname":"html","spec":"html","status":"anchor-block","text":"CustomElementRegistry","type":"interface","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#customelementregistry"},
diff --git a/tests/github/WICG/aom/spec/input-events.html b/tests/github/WICG/aom/spec/input-events.html
index 8e7848e414..07757b6282 100644
--- a/tests/github/WICG/aom/spec/input-events.html
+++ b/tests/github/WICG/aom/spec/input-events.html
@@ -5,8 +5,8 @@
AOM Input Event Types
-
+
+
-
+
+
-
+
-
-
- 
+
Compatibility
Living Standard — Last Updated
@@ -69,7 +401,7 @@ Compatibility
- Participate:
-
- GitHub whatwg/compat (new issue, open issues)
+
- GitHub whatwg/compat (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/compat/commits
@@ -287,7 +619,7 @@
animation-name
-webkit-animation-duration
- animation-duration
+ animation-duration
-webkit-animation-timing-function
animation-timing-function
@@ -541,7 +873,7 @@ -webkit-background-clip property—when its value is text—creates a background clipping region from the outer text stroke of the foreground text (including alpha transparency).
-
The -webkit-background-clip property is a simple alias of the background-clip property for all other <box> values.
+ The -webkit-background-clip property is a simple alias of the background-clip property for all other <box> values.
Note that the root element has a different background painting area, and thus the -webkit-background-clip property has no effect when specified on it. See the backgrounds of special elements.
- border-box
@@ -985,17 +1317,20 @@
animation
- animation-delay
- animation-direction
-
- animation-duration
- animation-fill-mode
- animation-iteration-count
- animation-name
- animation-play-state
- animation-timing-function
+
-
+ [CSS-ANIMATIONS-2] defines the following terms:
+
+ - animation-duration
+
-
[CSS-BACKGROUNDS-3] defines the following terms:
- - <box>
- <line-width>
- background-clip
- background-origin
@@ -1007,6 +1342,11 @@
border-top-right-radius
- box-shadow
+ -
+ [CSS-BOX-4] defines the following terms:
+
+ - <box>
+
-
[CSS-COLOR-4] defines the following terms:
@@ -1173,25 +1513,29 @@ N
- [CSS-ALIGN-3]
- Elika Etemad; Tab Atkins Jr.. CSS Box Alignment Module Level 3. URL: https://drafts.csswg.org/css-align/
- [CSS-ANIMATIONS-1]
-
- Dean Jackson; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- David Baron; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- [CSS-ANIMATIONS-2]
+
- David Baron; Brian Birtles. CSS Animations Level 2. URL: https://drafts.csswg.org/css-animations-2/
- [CSS-BACKGROUNDS-3]
-
- Bert Bos; Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- [CSS-BOX-4]
+
- Elika Etemad. CSS Box Model Module Level 4. URL: https://drafts.csswg.org/css-box-4/
- [CSS-COLOR-4]
-
- Tab Atkins Jr.; Chris Lilley; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color/
+
- Chris Lilley; Tab Atkins Jr.; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color-4/
- [CSS-COLOR-5]
- Chris Lilley; et al. CSS Color Module Level 5. URL: https://drafts.csswg.org/css-color-5/
- [CSS-CONDITIONAL-3]
-
- David Baron; Elika Etemad; Chris Lilley. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
+
- Chris Lilley; David Baron; Elika Etemad. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
- [CSS-DISPLAY-3]
-
- Tab Atkins Jr.; Elika Etemad. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
+
- Elika Etemad; Tab Atkins Jr.. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
- [CSS-DISPLAY-4]
-
- CSS Display Module Level 4 URL: https://drafts.csswg.org/css-display-4/
+
- CSS Display Module Level 4. Editor's Draft. URL: https://drafts.csswg.org/css-display-4/
- [CSS-FLEXBOX-1]
- Tab Atkins Jr.; et al. CSS Flexible Box Layout Module Level 1. URL: https://drafts.csswg.org/css-flexbox-1/
- [CSS-MASKING-1]
- Dirk Schulze; Brian Birtles; Tab Atkins Jr.. CSS Masking Module Level 1. URL: https://drafts.fxtf.org/css-masking-1/
- [CSS-SIZE-ADJUST-1]
-
- CSS Mobile Text Size Adjustment Module Level 1 URL: https://drafts.csswg.org/css-size-adjust-1/
+
- CSS Mobile Text Size Adjustment Module Level 1. Editor's Draft. URL: https://drafts.csswg.org/css-size-adjust-1/
- [CSS-SIZING-3]
- Tab Atkins Jr.; Elika Etemad. CSS Box Sizing Module Level 3. URL: https://drafts.csswg.org/css-sizing-3/
- [CSS-TRANSFORMS-1]
@@ -1695,6 +2039,7 @@
I
"-webkit-repeating-linear-gradient": {"dfnID":"-webkit-repeating-linear-gradient","dfnText":"-webkit-repeating-linear-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-linear-gradient"},
"-webkit-repeating-radial-gradient": {"dfnID":"-webkit-repeating-radial-gradient","dfnText":"-webkit-repeating-radial-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-radial-gradient"},
"0460a504": {"dfnID":"0460a504","dfnText":"resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"},
+"06a8cc3f": {"dfnID":"06a8cc3f","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-2/#propdef-animation-duration"},
"09f2cf3e": {"dfnID":"09f2cf3e","dfnText":"transform-origin","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform-origin"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform-origin"},
"0bf92d15": {"dfnID":"0bf92d15","dfnText":"mask-composite","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-composite"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-composite"},
"11151628": {"dfnID":"11151628","dfnText":"mask-clip","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-clip"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-clip"},
@@ -1710,7 +2055,6 @@ I
"280c9a03": {"dfnID":"280c9a03","dfnText":"border-bottom-right-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-bottom-right-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-bottom-right-radius"},
"2f0492ac": {"dfnID":"2f0492ac","dfnText":"body","external":true,"refSections":[{"refs":[{"id":"ref-for-the-body-element"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-the-body-element\u2460"},{"id":"ref-for-the-body-element\u2461"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/sections.html#the-body-element"},
"3124d393": {"dfnID":"3124d393","dfnText":"linear-gradient","external":true,"refSections":[{"refs":[{"id":"ref-for-ltlinear-gradient"}],"title":"3.3.1. \n -webkit-linear-gradient()\n"}],"url":"https://www.w3.org/TR/2011/WD-css3-images-20110217/#ltlinear-gradient"},
-"342bb58f": {"dfnID":"342bb58f","dfnText":"","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#typedef-box"},
"35972864": {"dfnID":"35972864","dfnText":"active document","external":true,"refSections":[{"refs":[{"id":"ref-for-nav-document"}],"title":"4.2. window.orientation API"}],"url":"https://html.spec.whatwg.org/multipage/document-sequences.html#nav-document"},
"366fd15a": {"dfnID":"366fd15a","dfnText":"min-resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"},
"3a74ed0c": {"dfnID":"3a74ed0c","dfnText":"flex-flow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-flow"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-flow"},
@@ -1723,7 +2067,6 @@ I
"4d0e596d": {"dfnID":"4d0e596d","dfnText":"mask-border-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-border-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-border-repeat"},
"58a520d5": {"dfnID":"58a520d5","dfnText":"mask-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-repeat"},
"5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-window\u2461"},{"id":"ref-for-window\u2462"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"},
-"5e8da52b": {"dfnID":"5e8da52b","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation-duration"},
"5f1a81e7": {"dfnID":"5f1a81e7","dfnText":"border-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-radius"},
"5f1b7f60": {"dfnID":"5f1b7f60","dfnText":"@media","external":true,"refSections":[{"refs":[{"id":"ref-for-at-ruledef-media"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"},{"refs":[{"id":"ref-for-at-ruledef-media\u2460"}],"title":"3.2.2. \n -webkit-transform-3d\n"}],"url":"https://drafts.csswg.org/css-conditional-3/#at-ruledef-media"},
"5fd23811": {"dfnID":"5fd23811","dfnText":"fire an event","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-event-fire"}],"title":"4.2. window.orientation API"}],"url":"https://dom.spec.whatwg.org/#concept-event-fire"},
@@ -1790,6 +2133,7 @@ I
"e2e08d07": {"dfnID":"e2e08d07","dfnText":"transform","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform"},
"e3d4f907": {"dfnID":"e3d4f907","dfnText":"color","external":true,"refSections":[{"refs":[{"id":"ref-for-animtype-color"}],"title":"3.4.7.1. Foreground Text Color: the \n-webkit-text-fill-color property"},{"refs":[{"id":"ref-for-animtype-color\u2460"}],"title":"3.4.7.2. Text Stroke Color: the \n-webkit-text-stroke-color property"}],"url":"https://drafts.csswg.org/css-transitions/#animtype-color"},
"e6ccf9d2": {"dfnID":"e6ccf9d2","dfnText":"ScreenOrientation","external":true,"refSections":[{"refs":[{"id":"ref-for-screenorientation-interface"}],"title":"4.2.1. window.orientation angle"},{"refs":[{"id":"ref-for-screenorientation-interface\u2460"}],"title":"Acknowledgements"}],"url":"https://w3c.github.io/screen-orientation/#screenorientation-interface"},
+"e7382b89": {"dfnID":"e7382b89","dfnText":"","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-box-4/#typedef-box"},
"e983d6ca": {"dfnID":"e983d6ca","dfnText":"WebKitCSSMatrix","external":true,"refSections":[{"refs":[{"id":"ref-for-webkitcssmatrix"}],"title":"4.1. The WebKitCSSMatrix interface"}],"url":"https://drafts.fxtf.org/geometry-1/#webkitcssmatrix"},
"eda608e1": {"dfnID":"eda608e1","dfnText":"animation","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation"},
"edc3a18b": {"dfnID":"edc3a18b","dfnText":"flex-grow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-grow"}],"title":"3.4.1. Simple property aliases"},{"refs":[{"id":"ref-for-propdef-flex-grow\u2460"}],"title":"3.4.4. Property mappings"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-grow"},
@@ -2264,9 +2608,9 @@ I
"use strict";
{
let linkTitleData = {
-"https://drafts.csswg.org/css-backgrounds-3/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | svg viewport origin box | view-box",
"https://drafts.csswg.org/css-backgrounds-3/#typedef-line-width": "Expands to: medium | thick | thin",
-"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: aliceblue | antiquewhite | aqua | aquamarine | azure | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | cadetblue | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | green | greenyellow | grey | honeydew | hotpink | indianred | indigo | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | magenta | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | seagreen | seashell | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | tomato | transparent | turquoise | violet | wheat | white | whitesmoke | yellow | yellowgreen",
+"https://drafts.csswg.org/css-box-4/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | view-box",
+"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: | accentcolor | accentcolortext | activeborder | activecaption | activetext | aliceblue | antiquewhite | appworkspace | aqua | aquamarine | azure | background | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | buttonborder | buttonface | buttonhighlight | buttonshadow | buttontext | cadetblue | canvas | canvastext | captiontext | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | field | fieldtext | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | graytext | green | greenyellow | grey | highlight | highlighttext | honeydew | hotpink | inactiveborder | inactivecaption | inactivecaptiontext | indianred | indigo | infobackground | infotext | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | linktext | magenta | mark | marktext | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | menu | menutext | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | scrollbar | seagreen | seashell | selecteditem | selecteditemtext | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | threeddarkshadow | threedface | threedhighlight | threedlightshadow | threedshadow | tomato | transparent | turquoise | violet | visitedtext | wheat | white | whitesmoke | window | windowframe | windowtext | yellow | yellowgreen",
};
function setTypeTitles() {
@@ -2280,6 +2624,63 @@ I
document.addEventListener("DOMContentLoaded", setTypeTitles);
}
+
-
-
-
-
-
- 
+
Console
Living Standard — Last Updated
@@ -69,7 +401,7 @@ Console
- Participate:
-
- GitHub whatwg/console (new issue, open issues)
+
- GitHub whatwg/console (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/console/commits
@@ -853,7 +1185,7 @@
I
In all current engines.
- Firefox28+Safari4+Chrome1+
+ Firefox28+Safari4+Chrome2+
Opera11+Edge79+
@@ -889,7 +1221,7 @@ I
In all current engines.
- Firefox30+Safari4+Chrome1+
+ Firefox30+Safari4+Chrome2+
Opera11+Edge79+
@@ -925,7 +1257,7 @@ I
In all current engines.
- Firefox5+Safari4+Chrome1+
+ Firefox5+Safari4+Chrome2+
Opera11+Edge79+
@@ -943,7 +1275,7 @@ I
In all current engines.
- Firefox8+Safari4+Chrome1+
+ Firefox8+Safari4+Chrome2+
Opera11+Edge79+
@@ -961,7 +1293,7 @@ I
In all current engines.
- Firefox39+Safari4+Chrome1+
+ Firefox39+Safari4+Chrome2+
Opera11+Edge79+
@@ -997,7 +1329,7 @@ I
In all current engines.
- Firefox9+Safari4+Chrome1+
+ Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1033,7 +1365,7 @@ I
In all current engines.
- Firefox9+Safari4+Chrome1+
+ Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1105,7 +1437,7 @@ I
In all current engines.
- Firefox10+Safari4+Chrome1+
+ Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1123,7 +1455,7 @@ I
In all current engines.
- Firefox10+Safari4+Chrome1+
+ Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1138,7 +1470,7 @@ I
✔MDN
-
+
In all current engines.
Firefox62+Safari13+Chrome71+
@@ -1159,7 +1491,7 @@ I
In all current engines.
- Firefox6+Safari4+Chrome1+
+ Firefox6+Safari4+Chrome2+
Opera11+Edge79+
@@ -1874,6 +2206,63 @@ I
}
}
+
-
-
-
-
-
- 
+
DOM
Living Standard — Last Updated
@@ -69,7 +401,7 @@ DOM
- Participate:
-
- GitHub whatwg/dom (new issue, open issues)
+
- GitHub whatwg/dom (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/dom/commits
@@ -242,12 +574,12 @@
1.1.
null or an object, and has children, which is an ordered set of objects. An object A whose parent is object B is a child of B.
The root of an object is itself, if its parent is null, or else it is the root of its parent. The root of a tree is any object participating in that tree whose parent is null.
An object A is called a descendant of an object B, if either A is a child of B or A is a child of an
-object C that is a descendant of B.
+object C that is a descendant of B.
An inclusive descendant is
-an object or one of its descendants.
- An object A is called an ancestor of an object B if and only if B is a descendant of A.
+an object or one of its descendants.
+ An object A is called an ancestor of an object B if and only if B is a descendant of A.
An inclusive ancestor is
-an object or one of its ancestors.
+an object or one of its ancestors.
An object A is called a sibling of an object B, if and only if B and A share the same non-null parent.
An inclusive sibling is an
object or one of its siblings.
@@ -258,9 +590,9 @@ 1.1.
same tree and A comes
after B in tree order.
The first child of an object is its
-first child or null if it has no children.
+first child or null if it has no children.
The last child of an object is its
-last child or null if it has no children.
+last child or null if it has no children.
The previous sibling of an
object is its first preceding sibling or null if it has no preceding sibling.
The next sibling of an
@@ -353,7 +685,7 @@
}
- When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s bubbles is true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in
+
When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s bubbles is true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in
reverse tree order.
Let’s look at an example of how events work in a tree:
<!doctype html>
@@ -455,7 +787,7 @@ event listeners after the current one finishes running and, when dispatched in a tree, also prevents event from reaching any
other objects.
event . bubbles
- - Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
+
- Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
event . cancelable
- Returns true or false depending on how event was initialized. Its return
value does not always carry meaning, but true can indicate that part of the operation
@@ -1435,7 +1767,7 @@
- Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
+ Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
To illustrate, consider this HTML document:
<!DOCTYPE html>
< html class = e >
@@ -1475,7 +1807,7 @@ The most excellent Live DOM Viewer can be used to explore this matter in more detail.
4.2. Node tree
Document, DocumentType, DocumentFragment, Element, Text, ProcessingInstruction, and Comment objects (simply called nodes) participate in a tree, simply named the node tree.
- A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
+ A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
Document
-
@@ -1515,9 +1847,9 @@
Its data’s length.
- Any other node
-
-
Its number of children.
+ Its number of children.
- A node is considered empty if its length is zero.
+ A node is considered empty if its length is zero.
4.2.1. Document tree
A document tree is a node tree whose root is a document.
The document element of a document is the element whose parent is that document, if it exists; otherwise null.
@@ -1604,10 +1936,10 @@ mode is not "open", then return null.
-
If shadow’s slot assignment is "manual", then
- return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise
+ return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise
null.
-
-
Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
+ Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
To find slottables for a given slot slot, run these steps:
@@ -1628,7 +1960,7 @@ For each slottable slottable of slot’s manually assigned nodes, if slottable’s parent is host, append slottable to result.
-
-
Otherwise, for each slottable child slottable of host, in tree order:
+ Otherwise, for each slottable child slottable of host, in tree order:
-
Let foundSlot be the result of finding a slot given slottable.
@@ -1647,7 +1979,7 @@ finding slottables given slot.
-
-
If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
+ If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
-
For each node in slottables:
@@ -1719,17 +2051,17 @@
DocumentFragment node
-
-
If node has more than one element child or has a Text node child.
- Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
+ If node has more than one element child or has a Text node child.
+ Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
- element
-
-
parent has an element child, child is
+
parent has an element child, child is
a doctype, or child is non-null and a doctype is following child.
- doctype
-
-
parent has a doctype child, child is non-null
+
parent has a doctype child, child is non-null
and an element is preceding child, or child is null
- and parent has an element child.
+ and parent has an element child.
To pre-insert a node into a parent before a child, run these steps:
@@ -1751,7 +2083,7 @@ To insert a node into a parent before a child, with an optional suppress observers flag, run these steps:
-
-
Let nodes be node’s children, if node is a DocumentFragment node; otherwise « node ».
+ Let nodes be node’s children, if node is a DocumentFragment node; otherwise « node ».
-
Let count be nodes’s size.
-
@@ -1760,7 +2092,7 @@
If node is a DocumentFragment node, then:
-
-
+
-
Queue a tree mutation record for node with « », nodes, null, and
null.
@@ -1784,9 +2116,9 @@
Adopt node into parent’s node document.
-
-
+
-
-
Otherwise, insert node into parent’s children before child’s index.
+ Otherwise, insert node into parent’s children before child’s index.
-
If parent is a shadow host whose shadow root’s slot assignment is "named" and node is a slottable, then assign a slot for node.
-
@@ -1837,14 +2169,14 @@
DocumentFragment node
-
-
If node has more than one element child or has a Text node child.
- Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
+ If node has more than one element child or has a Text node child.
+ Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
- element
-
-
parent has an element child that is not child or a doctype is following child.
+ parent has an element child that is not child or a doctype is following child.
- doctype
-
-
parent has a doctype child that is not child,
+
parent has a doctype child that is not child,
or an element is preceding child.
The above statements differ from the pre-insert algorithm.
@@ -1866,7 +2198,7 @@
The above can only be false if child is node.
-
-
Let nodes be node’s children if node is a DocumentFragment node; otherwise « node ».
+ Let nodes be node’s children if node is a DocumentFragment node; otherwise « node ».
-
Insert node into parent before referenceChild with the suppress observers flag set.
-
@@ -1877,15 +2209,15 @@
To replace all with a node within a parent, run these steps:
-
-
Let removedNodes be parent’s children.
+ Let removedNodes be parent’s children.
-
Let addedNodes be the empty set.
-
-
If node is a DocumentFragment node, then set addedNodes to node’s children.
+ If node is a DocumentFragment node, then set addedNodes to node’s children.
-
Otherwise, if node is non-null, set addedNodes to « node ».
-
-
Remove all parent’s children, in tree order, with the suppress observers flag set.
+ Remove all parent’s children, in tree order, with the suppress observers flag set.
-
If node is non-null, then insert node into parent before null with the suppress observers flag set.
-
@@ -1930,7 +2262,7 @@
Let oldNextSibling be node’s next sibling.
-
-
+
-
If node is assigned, then run assign slottables for node’s assigned slot.
-
@@ -1980,9 +2312,9 @@
node . getElementById(elementId)
-
-
Returns the first element within node’s descendants whose ID is elementId.
+ Returns the first element within node’s descendants whose ID is elementId.
- The getElementById(elementId) method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if
+
The getElementById(elementId) method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if
there is no such element, null.
4.2.5. Mixin DocumentOrShadowRoot
interface mixin DocumentOrShadowRoot
collection = node . children
- - Returns the child elements.
+
- Returns the child elements.
element = node . firstElementChild
- - Returns the first child that is an element; otherwise null.
+
- Returns the first child that is an element; otherwise null.
element = node . lastElementChild
- - Returns the last child that is an element; otherwise null.
+
- Returns the last child that is an element; otherwise null.
node . prepend(nodes)
-
Inserts nodes before the first child of node, while
@@ -2044,24 +2376,24 @@
node tree are violated.
node . replaceChildren(nodes)
-
-
Replace all children of node with nodes,
+
Replace all children of node with nodes,
while replacing strings in nodes with equivalent Text nodes.
Throws a "HierarchyRequestError" DOMException if the constraints of
the node tree are violated.
node . querySelector(selectors)
- - Returns the first element that is a descendant of node that
+
- Returns the first element that is a descendant of node that
matches selectors.
node . querySelectorAll(selectors)
- - Returns all element descendants of node that
+
- Returns all element descendants of node that
match selectors.
- The children getter steps are to return an HTMLCollection collection rooted at this matching only element children.
+ The children getter steps are to return an HTMLCollection collection rooted at this matching only element children.
The firstElementChild getter steps are to return
-the first child that is an element; otherwise null.
+the first child that is an element; otherwise null.
The lastElementChild getter steps are to return
-the last child that is an element; otherwise null.
+the last child that is an element; otherwise null.
The childElementCount getter steps are to return
-the number of children of this that are elements.
+the number of children of this that are elements.
The prepend(nodes) method steps are:
-
@@ -2345,7 +2677,7 @@
A registered observer consists of an observer (a MutationObserver object) and options (a MutationObserverInit dictionary).
A transient registered observer is a registered observer that also consists of a source (a registered observer).
Transient registered observers are used to track mutations within
-a given node’s descendants after node has been removed so
+a given node’s descendants after node has been removed so
they do not get lost when subtree is set to true on node’s parent.
4.3.1. Interface MutationObserver
[Exposed =Window ]
@@ -2391,7 +2723,7 @@ <
can be used:
childList
- - Set to true if mutations to target’s children are to be observed.
+
- Set to true if mutations to target’s children are to be observed.
attributes
- Set to true if mutations to target’s attributes are to be observed. Can be omitted if
attributeOldValue or attributeFilter is
specified.
@@ -2399,7 +2731,7 @@ <
- Set to true if mutations to target’s data are to be observed. Can be omitted if
characterDataOldValue is specified.
subtree
- Set to true if mutations to not just target, but
- also target’s descendants are to be
+ also target’s descendants are to be
observed.
attributeOldValue
- Set to true if
attributes is true or omitted
@@ -2551,7 +2883,7 @@ type.
For "attributes", it is the element whose attribute changed. For
"characterData", it is the CharacterData node. For "childList",
- it is the node whose children changed.
+ it is the node whose children changed.
record . addedNodes
record . removedNodes
- Return the nodes added and removed
@@ -2761,9 +3093,9 @@
parentElement
- Returns the parent element.
node . hasChildNodes()
- - Returns whether node has children.
+
- Returns whether node has children.
node . childNodes
- - Returns the children.
+
- Returns the children.
node . firstChild
- Returns the first child.
node . lastChild
@@ -2784,8 +3116,8 @@ parentNode getter steps are to return this’s parent.
The parentElement getter steps are to return this’s parent element.
- The hasChildNodes() method steps are to return true if this has children; otherwise false.
- The childNodes getter steps are to return a NodeList rooted at this matching only children.
+ The hasChildNodes() method steps are to return true if this has children; otherwise false.
+ The childNodes getter steps are to return a NodeList rooted at this matching only children.
The firstChild getter steps are to return this’s first child.
The lastChild getter steps are to return this’s last child.
The previousSibling getter steps are to return this’s previous sibling.
@@ -2815,7 +3147,7 @@ ProcessingInstruction
Comment
-
-
Replace data with node this, offset 0, count this’s length, and data new value.
+ Replace data with node this, offset 0, count this’s length, and data new value.
- Any other node
-
Do nothing.
@@ -2858,7 +3190,7 @@ ProcessingInstruction
Comment
-
-
Replace data with node this, offset 0, count this’s length, and data the given value.
+ Replace data with node this, offset 0, count this’s length, and data the given value.
- Any other node
-
Do nothing.
@@ -2869,9 +3201,9 @@ empty exclusive Text nodes and concatenates the data of remaining contiguous exclusive Text nodes into the first of their nodes.
The normalize() method steps are to run these steps for
-each descendant exclusive Text node node of this:
+each descendant exclusive Text node node of this:
- - Let length be node’s length.
+
- Let length be node’s length.
- If length is zero, then remove node and continue with the
next exclusive
Text node, if any.
- Let data be the concatenation of the data of node’s contiguous exclusive
Text nodes (excluding itself), in tree order.
@@ -2890,7 +3222,7 @@ live range whose end node is currentNode’s parent and end offset is currentNode’s index, set its end node to node and its end offset to length.
-
-
Add currentNode’s length to length.
+ Add currentNode’s length to length.
-
Set currentNode to its next sibling.
@@ -2899,7 +3231,7 @@
node . cloneNode([deep = false])
- - Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
+
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
node . isEqualNode(otherNode)
- Returns whether node and otherNode have the same properties.
@@ -2951,7 +3283,7 @@
node document and document to copy, if copy is a document, and set copy’s node document to document otherwise.
- Run any cloning steps defined for node in other applicable specifications and pass copy, node, document and the clone children flag if set, as parameters.
-
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
+
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
- Return copy.
The cloneNode(deep) method steps are:
@@ -2983,8 +3315,8 @@ element, each attribute in its attribute list has an attribute that equals an attribute in B’s attribute list.
- - A and B have the same number of children.
-
- Each child of A equals the child of B at the identical index.
+
- A and B have the same number of children.
+
- Each child of A equals the child of B at the identical index.
The isEqualNode(otherNode) method steps are to
return true if otherNode is non-null and this equals otherNode; otherwise false.
@@ -3005,9 +3337,9 @@ Node . DOCUMENT_POSITION_FOLLOWING (4)
- Set when other is following node.
Node . DOCUMENT_POSITION_CONTAINS- Set when other is an ancestor of node.
+
- Set when other is an ancestor of node.
Node . DOCUMENT_POSITION_CONTAINED_BY- Set when other is a descendant of node.
+
- Set when other is a descendant of node.
node . contains(other)
- Returns true if other is an inclusive descendant of node;
@@ -3062,16 +3394,16 @@
Math. random() value can
be used.
-
-
If node1 is an ancestor of node2 and attr1 is null,
+
If node1 is an ancestor of node2 and attr1 is null,
or node1 is node2 and attr2 is non-null, then return the result of
adding DOCUMENT_POSITION_CONTAINS to DOCUMENT_POSITION_PRECEDING.
-
-
If node1 is a descendant of node2 and attr2 is null,
+
If node1 is a descendant of node2 and attr2 is null,
or node1 is node2 and attr1 is non-null, then return the result of
adding DOCUMENT_POSITION_CONTAINED_BY to DOCUMENT_POSITION_FOLLOWING.
-
If node1 is preceding node2, then return DOCUMENT_POSITION_PRECEDING.
- Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children,
+
Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children,
despite attributes not participating in a tree.
-
Return DOCUMENT_POSITION_FOLLOWING.
@@ -3194,10 +3526,10 @@ *" (U+002A), return a HTMLCollection rooted
- at root, whose filter matches only descendant elements.
+ at root, whose filter matches only descendant elements.
-
Otherwise, if root’s node document is an HTML document,
- return a HTMLCollection rooted at root, whose filter matches the following descendant elements:
+ return a HTMLCollection rooted at root, whose filter matches the following descendant elements:
-
Whose namespace is the HTML namespace and whose qualified name is qualifiedName, in ASCII lowercase.
@@ -3205,18 +3537,18 @@ namespace is not the HTML namespace and whose qualified name is qualifiedName.
-
-
Otherwise, return a HTMLCollection rooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
+ Otherwise, return a HTMLCollection rooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
When invoked with the same argument, and as long as root’s node document’s type has not changed, the same HTMLCollection object may be returned as returned by an earlier call.
The list of elements with namespace namespace and local name localName for a node root is the HTMLCollection returned by the following algorithm:
- If namespace is the empty string, set it to null.
-
- If both namespace and localName are "
*" (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements.
+ - If both namespace and localName are "
*" (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements.
- Otherwise, if namespace is "
*"
- (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose local name is localName.
+ (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose local name is localName.
- Otherwise, if localName is "
*"
- (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace.
- - Otherwise, return a
HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
+ (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace.
+ - Otherwise, return a
HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
When invoked with the same arguments, the same HTMLCollection object may be returned as returned by an earlier call.
The list of elements with class names classNames for a node root is the HTMLCollection returned by the following algorithm:
@@ -3225,7 +3557,7 @@ HTMLCollection.
-
Return a HTMLCollection rooted at root,
- whose filter matches descendant elements that have all their classes in classes.
+ whose filter matches descendant elements that have all their classes in classes.
The comparisons for the classes must be done in an ASCII case-insensitive manner if root’s node document’s mode is "quirks"; otherwise in an identical to manner.
When invoked with the same argument, the same HTMLCollection object may be returned as returned by an earlier call.
@@ -3333,15 +3665,15 @@ Returns the document element.
- collection = document .
getElementsByTagName(qualifiedName)
-
-
If qualifiedName is "*" returns a HTMLCollection of all descendant elements.
- Otherwise, returns a HTMLCollection of all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)
+ If qualifiedName is "*" returns a HTMLCollection of all descendant elements.
+ Otherwise, returns a HTMLCollection of all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)
- collection = document .
getElementsByTagNameNS(namespace, localName)
-
If namespace and localName are
- "
*" returns a HTMLCollection of all descendant elements.
- If only namespace is "*" returns a HTMLCollection of all descendant elements whose local name is localName.
- If only localName is "*" returns a HTMLCollection of all descendant elements whose namespace is namespace.
- Otherwise, returns a HTMLCollection of all descendant elements whose namespace is namespace and local name is localName.
+ "*" returns a HTMLCollection of all descendant elements.
+ If only namespace is "*" returns a HTMLCollection of all descendant elements whose local name is localName.
+ If only localName is "*" returns a HTMLCollection of all descendant elements whose namespace is namespace.
+ Otherwise, returns a HTMLCollection of all descendant elements whose namespace is namespace and local name is localName.
- collection = document .
getElementsByClassName(classNames)
- collection = element .
getElementsByClassName(classNames)
- Returns a
HTMLCollection of the elements in the object on which
@@ -3351,7 +3683,7 @@ classNames argument is interpreted as a
space-separated list of classes.
- The doctype getter steps are to return the child of this that is a doctype; otherwise null.
+ The doctype getter steps are to return the child of this that is a doctype; otherwise null.
The documentElement getter steps are to return this’s document element.
The getElementsByTagName(qualifiedName) method steps are to return the list of elements with qualified name qualifiedName for this.
Thus, in an HTML document, document. getElementsByTagName( "FOO" ) will match <FOO> elements that are not in the HTML namespace, and <foo> elements that are in
@@ -3481,7 +3813,7 @@
- clone = document . importNode(node [, deep = false])
-
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
+ Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
If node is a document or a shadow root, throws a
"NotSupportedError" DOMException.
- node = document .
adoptNode(node)
@@ -3590,7 +3922,7 @@
"devicemotionevent"
DeviceMotionEvent
- [DEVICE-ORIENTATION]
+ [DEVICE-ORIENTATION]
"deviceorientationevent"
DeviceOrientationEvent
@@ -3871,7 +4203,7 @@ In shadow-including tree order is shadow-including preorder, depth-first traversal of a node tree. Shadow-including preorder, depth-first traversal of a node tree tree is preorder, depth-first traversal of tree, with for each shadow host encountered in tree, shadow-including preorder, depth-first traversal of that element’s shadow root’s node tree just after it is encountered.
The shadow-including root of an object is its root’s host’s shadow-including root, if the
object’s root is a shadow root; otherwise its root.
- An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
+ An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
A shadow-including inclusive descendant is an object or one of its shadow-including descendants.
An object A is a shadow-including ancestor of an object B, if and only if B is a shadow-including descendant of A.
A shadow-including inclusive ancestor is an object or one of its shadow-including ancestors.
@@ -4067,7 +4399,7 @@ If result’s attribute list is not empty,
then throw a "NotSupportedError" DOMException.
-
-
If result has children, then throw a
+
If result has children, then throw a
"NotSupportedError" DOMException.
-
If result’s parent is not null, then throw a
@@ -4718,16 +5050,16 @@
data.
To replace data of node node with offset offset, count count, and data data, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- If offset plus count is greater than length, then set count to length minus offset.
-
Queue a mutation record of "characterData" for node with
null, null, node’s data, « », « », null, and null.
- - Insert data into node’s data after offset code units.
+
- Insert data into node’s data after offset code units.
- Let delete offset be offset + data’s length.
-
- Starting from delete offset code units, remove count code units from node’s data.
+
- Starting from delete offset code units, remove count code units from node’s data.
-
For each live range whose start node is node and start offset is greater than offset but less than or equal to offset plus count, set its start offset to offset.
-
@@ -4736,24 +5068,24 @@
For each live range whose start node is node and start offset is greater than offset plus count, increase its start offset by data’s length and decrease it by count.
-
For each live range whose end node is node and end offset is greater than offset plus count, increase its end offset by data’s length and decrease it by count.
- - If node’s parent is non-null, then run the children changed steps for node’s parent.
+
- If node’s parent is non-null, then run the children changed steps for node’s parent.
To substring data with node node, offset offset, and count count, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- If offset plus count is
- greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then
+ greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then
return.
-
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
+
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
- The data getter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.
- The length getter steps are to return this’s length.
+ The data getter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.
+ The length getter steps are to return this’s length.
The substringData(offset, count) method steps are to return the result of running substring data with node this,
offset offset, and count count.
The appendData(data) method steps are
-to replace data with node this, offset this’s length, count 0,
+to replace data with node this, offset this’s length, count 0,
and data data.
The insertData(offset, data) method steps are to replace data with node this, offset offset, count 0,
and data data.
@@ -4782,19 +5114,19 @@ contiguous exclusive Text nodes of a node node are node, node’s previous sibling exclusive Text node,
if any, and its contiguous exclusive Text nodes, and node’s next sibling exclusive Text node, if any, and its contiguous exclusive Text nodes, avoiding any duplicates.
The child text content of a node node is the concatenation of the data of all
-the Text node children of node, in tree order.
- The descendant text content of a node node is the concatenation of the data of all the Text node descendants of node, in tree order.
+the Text node children of node, in tree order.
+ The descendant text content of a node node is the concatenation of the data of all the Text node descendants of node, in tree order.
The new Text(data) constructor steps are to set this’s data to data and this’s node document to current global object’s associated Document.
To split a Text node node with offset offset, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- Let count be length minus offset.
- Let new data be the result of substringing data with node node, offset offset, and count count.
- Let new node be a new
Text node, with the same node document as node. Set new node’s data to new data.
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
-
If parent is not null, then:
@@ -4878,7 +5210,7 @@ 5.2. Boundary points
A boundary point is a tuple consisting of a node (a node) and an offset (a non-negative integer).
A correct boundary point’s offset will
-be between 0 and the boundary point’s node’s length, inclusive.
+be between 0 and the boundary point’s node’s length, inclusive.
The position of a boundary point (nodeA, offsetA) relative to a boundary point (nodeB, offsetB) is before, equal, or after, as returned by these steps:
-
@@ -4889,12 +5221,12 @@
following nodeB, then if the position of (nodeB, offsetB) relative to
(nodeA, offsetA) is before, return after, and if it is after, return before.
-
-
If nodeA is an ancestor of nodeB:
+ If nodeA is an ancestor of nodeB:
-
Let child be nodeB.
-
-
While child is not a child of nodeA, set child to its parent.
+ While child is not a child of nodeA, set child to its parent.
-
@@ -5003,7 +5335,7 @@ Algorithms that modify a tree (in particular the insert, remove, replace data, and split algorithms) modify live ranges associated with that tree.
The root of a live range is the root of its start node.
A node node is contained in a live range range if node’s root is range’s root, and (node, 0) is after range’s start, and
-(node, node’s length) is before range’s end.
+(node, node’s length) is before range’s end.
A node is partially contained in a live range if it’s an inclusive ancestor of the live range’s start node but not its end node, or vice versa.
Some facts to better understand these definitions:
@@ -5012,27 +5344,27 @@ live range consists of all contained nodes, plus possibly some of the contents of the start node and end node if those are Text, ProcessingInstruction, or Comment nodes.
-
The nodes that are contained in a live range will generally not be
- contiguous, because the parent of a contained node will not always be contained.
+ contiguous, because the parent of a contained node will not always be contained.
-
-
However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
+ However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
-
The start node and end node of a live range are
never contained within it.
-
The first contained node (if there are any) will
- always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
+ always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
-
There exists a partially contained node if and only if
the start node and end node are different.
-
The commonAncestorContainer attribute value is neither contained nor partially contained.
-
-
If the start node is an ancestor of the end node,
+
If the start node is an ancestor of the end node,
the common inclusive ancestor will be the start node. Exactly one
- of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
+ of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
-
If the start node is not an inclusive ancestor of the end node, nor vice versa, the common inclusive ancestor will be
- distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and
+ distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and
only if it lies between those two.
@@ -5048,12 +5380,12 @@
- container = range .
commonAncestorContainer
- Returns the node, furthest away from
- the document, that is an ancestor of both range’s start node and end node.
+ the document, that is an ancestor of both range’s start node and end node.
The commonAncestorContainer getter steps are:
- Let container be start node.
-
- While container is not an inclusive ancestor of end node, let container be container’s parent.
+
- While container is not an inclusive ancestor of end node, let container be container’s parent.
- Return container.
@@ -5062,7 +5394,7 @@ doctype, then throw an
"InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- Let bp be the boundary point (node, offset).
-
@@ -5089,14 +5421,14 @@
set the end of this to boundary point (node, offset).
The setStartBefore(node) method steps are:
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError" DOMException.
- Set the start of this to boundary point (parent, node’s index).
The setStartAfter(node) method steps are:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5104,14 +5436,14 @@
setEndBefore(node) method steps are:
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError" DOMException.
- Set the end of this to boundary point (parent, node’s index).
The setEndAfter(node) method steps are:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5121,7 +5453,7 @@
select a node node within a range range, run these steps:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5137,7 +5469,7 @@
doctype, throw an
"InvalidNodeTypeError" DOMException.
- - Let length be the length of node.
+
- Let length be the length of node.
- Set start to the boundary point (node, 0).
- Set end to the boundary point (node, length).
@@ -5188,19 +5520,19 @@ this’s start node, start offset, end node, and end offset, respectively.
- If original start node and original end node are the same, and they are a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original end offset minus original start offset, and data the empty string, and then return.
- - Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
+
- Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
- If original start node is an inclusive ancestor of original end node, set new node to original start node and new offset to original start offset.
-
Otherwise:
- Let reference node equal original start node.
-
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
+
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one
+ Set new node to the parent of reference node, and new offset to one
plus the index of reference node.
-
If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
- - If original start node is a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.
+ - If original start node is a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.
-
For each node in nodes to remove, in tree order, remove node.
- If original end node is a
Text, ProcessingInstruction, or Comment node, replace data with node original end node, offset 0, count original end offset and data the empty string.
@@ -5225,16 +5557,16 @@ inclusive ancestor of original end node, set common ancestor to
- its own parent.
+ its own parent.
- Let first partially contained child be null.
-
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
+
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
-
- If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
+ If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense.
- For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
- it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
- - Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
+ For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
+ it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
+
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
-
If any member of contained children is a doctype, then throw a
"HierarchyRequestError" DOMException.
@@ -5247,19 +5579,19 @@ parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
+ - While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one plus reference node’s index.
-
If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ Set new node to the parent of reference node, and new offset to one plus reference node’s index.
+ If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
-
If first partially contained child is a
Text, ProcessingInstruction, or Comment node:
In this case, first partially contained child is original start node.
- Let clone be a clone of original start node.
-
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
+
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
-
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
+
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
-
Otherwise, if first partially contained child is not
@@ -5270,7 +5602,7 @@
live range whose start is
(original start node, original start offset) and
whose end is
- (first partially contained child, first partially contained child’s length).
+ (first partially contained child, first partially contained child’s length).
-
Let subfragment be the result of extracting subrange.
- Append subfragment to clone.
@@ -5320,16 +5652,16 @@
inclusive ancestor of original end node, set common ancestor to its own parent.
+ - While common ancestor is not an inclusive ancestor of original end node, set common ancestor to its own parent.
- Let first partially contained child be null.
-
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
+
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
-
- If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
+ If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense.
- For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
- it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
- - Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
+ For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
+ it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
+
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
-
If any member of contained children is a doctype, then throw a
"HierarchyRequestError" DOMException.
@@ -5342,7 +5674,7 @@ In this case, first partially contained child is original start node.
- Let clone be a clone of original start node.
-
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
+
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
-
@@ -5354,7 +5686,7 @@
live range whose start is
(original start node, original start offset) and
whose end is
- (first partially contained child, first partially contained child’s length).
+ (first partially contained child, first partially contained child’s length).
-
Let subfragment be the result of cloning the contents of subrange.
- Append subfragment to clone.
@@ -5392,23 +5724,23 @@
cloning the contents of this.
To insert a node node into a live range range, run these steps:
- - If range’s start node is a
ProcessingInstruction or Comment node, is a Text node whose parent is null, or is node,
+ - If range’s start node is a
ProcessingInstruction or Comment node, is a Text node whose parent is null, or is node,
then throw a "HierarchyRequestError" DOMException.
- Let referenceNode be null.
- If range’s start node is a
Text node,
set referenceNode to that Text node.
- - Otherwise, set referenceNode to the child of start node whose index is start offset, and null if
- there is no such child.
-
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
+
- Otherwise, set referenceNode to the child of start node whose index is start offset, and null if
+ there is no such child.
+
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
- Ensure pre-insertion validity of node into parent before referenceNode.
- If range’s start node is a
Text node, set referenceNode to the result of splitting it with
offset range’s start offset.
- If node is referenceNode, set referenceNode to its next sibling.
-
-
-
- Let newOffset be parent’s length if referenceNode is null,
+
+
- Let newOffset be parent’s length if referenceNode is null,
and referenceNode’s index otherwise.
-
- Increase newOffset by node’s length if node is a
DocumentFragment node, and one otherwise.
+ - Increase newOffset by node’s length if node is a
DocumentFragment node, and one otherwise.
- Pre-insert node into parent before referenceNode.
-
If range is collapsed, then set range’s end to (parent, newOffset).
@@ -5425,7 +5757,7 @@ extracting this.
-
-
If newParent has children, then replace all with null
+
If newParent has children, then replace all with null
within newParent.
-
@@ -5451,7 +5783,7 @@
root is different from this’s root, return false.
- If node is a doctype, then throw an
"
InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- If (node, offset) is before start or after end, return false.
- Return true.
@@ -5461,7 +5793,7 @@
root is different from this’s root, then throw a "WrongDocumentError" DOMException.
- If node is a doctype, then throw an
"
InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- If (node, offset) is before start, return −1.
- If (node, offset) is after end, return 1.
@@ -5471,7 +5803,7 @@
intersectsNode(node) method steps are:
- If node’s root is different from this’s root, return false.
-
- Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, return true.
- Let offset be node’s index.
- If (parent, offset) is before end and (parent, offset plus 1) is after start, return true.
@@ -5566,7 +5898,7 @@
Steps are not terminated here.
-
-
Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
+ Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
The root getter steps are to return this’s root.
@@ -5649,7 +5981,7 @@ While node is non-null and is not this’s root:
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If node is non-null and filtering node within this returns FILTER_ACCEPT, then set this’s current to node and return node.
@@ -5686,7 +6018,7 @@
If sibling is non-null, then set node to sibling and break.
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, walker’s root, or walker’s current, then return null.
-
@@ -5727,7 +6059,7 @@
node’s previous sibling if type is previous.
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If node is null or walker’s root, then return
null.
@@ -5754,7 +6086,7 @@
Let result be the result of filtering node within this.
-
-
While result is not FILTER_REJECT and node has a child:
+ While result is not FILTER_REJECT and node has a child:
-
Set node to node’s last child.
@@ -5767,9 +6099,9 @@ Set sibling to node’s previous sibling.
-
-
If node is this’s root or node’s parent is null, then return null.
+ If node is this’s root or node’s parent is null, then return null.
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If the return value of filtering node within this is FILTER_ACCEPT, then set this’s current to node and return node.
@@ -5786,7 +6118,7 @@ While true:
-
-
While result is not FILTER_REJECT and node has a child:
+ While result is not FILTER_REJECT and node has a child:
-
Set node to its first child.
@@ -5809,7 +6141,7 @@
If sibling is non-null, then set node to sibling and break.
-
-
Set temporary to temporary’s parent.
+ Set temporary to temporary’s parent.
-
Set result to the result of filtering node within this.
@@ -7604,11 +7936,6 @@ upgrade an element
- valid custom element name
-
-
- [I18N-GLOSSARY] defines the following terms:
-
- - code units
-
-
[INFRA] defines the following terms:
@@ -7746,7 +8073,7 @@ N
- [CONSOLE]
- Dominic Farolino; Robert Kowalski; Terin Stock. Console Standard. Living Standard. URL: https://console.spec.whatwg.org/
- [DEVICE-ORIENTATION]
-
- Rich Tibbett; et al. DeviceOrientation Event Specification. URL: https://w3c.github.io/deviceorientation/
+
- Reilly Grant; Raphael Kubo da Costa; Marcos Caceres. Device Orientation and Motion. URL: https://w3c.github.io/deviceorientation/
- [DOM]
- Anne van Kesteren. DOM Standard. Living Standard. URL: https://dom.spec.whatwg.org/
- [ECMASCRIPT]
@@ -7757,8 +8084,6 @@
N
- Yoav Weiss. High Resolution Time. URL: https://w3c.github.io/hr-time/
- [HTML]
- Anne van Kesteren; et al. HTML Standard. Living Standard. URL: https://html.spec.whatwg.org/multipage/
-
- [I18N-GLOSSARY]
-
- Richard Ishida; Addison Phillips. Internationalization Glossary. URL: https://w3c.github.io/i18n-glossary/
- [INFRA]
- Anne van Kesteren; Domenic Denicola. Infra Standard. Living Standard. URL: https://infra.spec.whatwg.org/
- [SELECTORS4]
@@ -8488,25 +8813,25 @@
I
-
+
✔MDN
-
+
In all current engines.
- Firefox88+Safari15+Chrome93+
+ Firefox57+Safari11.1+Chrome66+
- Opera?Edge93+
+ Opera?Edge79+
- Edge (Legacy)?IENone
+ Edge (Legacy)16+IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.12.0+
+ Node.js15.0.0+
-
+
✔MDN
@@ -8524,21 +8849,21 @@ I
-
+
✔MDN
-
+
In all current engines.
- Firefox57+Safari11.1+Chrome66+
+ Firefox88+Safari15+Chrome93+
- Opera?Edge79+
+ Opera?Edge93+
- Edge (Legacy)16+IENone
+ Edge (Legacy)?IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.0.0+
+ Node.js15.12.0+
@@ -9115,7 +9440,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9144,7 +9469,7 @@ I
Element/previousElementSibling
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9714,7 +10039,7 @@ I
- DocumentFragment/childElementCount
+ DocumentFragment/childElementCount
In all current engines.
Firefox25+Safari9+Chrome29+
@@ -9730,7 +10055,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10186,7 +10511,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10199,7 +10524,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -10324,7 +10649,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10395,7 +10720,7 @@ I
DocumentFragment/querySelector
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10424,7 +10749,7 @@ I
DocumentFragment/querySelectorAll
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10534,6 +10859,22 @@ I
+
+ ✔MDN
+
+ DocumentFragment/getElementById
+ In all current engines.
+
+ Firefox28+Safari9+Chrome36+
+
+ Opera?Edge79+
+
+ Edge (Legacy)17+IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
@@ -10550,6 +10891,54 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
✔MDN
@@ -11369,7 +11758,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -11690,10 +12079,154 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+ MutationRecord/attributeNamespace
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+ MutationRecord/previousSibling
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
-
+
In all current engines.
Firefox14+Safari7+Chrome16+
@@ -11853,7 +12386,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1.1+Chrome1+
@@ -11920,7 +12453,7 @@ I
In all current engines.
- Firefox1+Safari4+Chrome1+
+ Firefox1+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -12013,7 +12546,7 @@ I
✔MDN
-
+
In all current engines.
Firefox49+Safari10+Chrome51+
@@ -12077,7 +12610,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -12285,7 +12818,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1.1+Chrome1+
@@ -12333,7 +12866,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12397,7 +12930,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12445,7 +12978,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12458,26 +12991,52 @@ I
-
+
✔MDN
-
+
+ In all current engines.
+
+ Firefox50+Safari10+Chrome51+
+
+ Opera?Edge79+
+
+ Edge (Legacy)16+IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+ Reference/Global_Objects/Array/@@iterator
+ In all current engines.
+
+ Firefox36+Safari10+Chrome51+
+
+ Opera?Edge79+
+
+ Edge (Legacy)?IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
In all current engines.
Firefox1+Safari1+Chrome1+
- Opera12.1+Edge79+
+ Opera8+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+
-
+
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -12490,19 +13049,19 @@ I
-
+
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
- Opera8+Edge79+
+ Opera12.1+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
@@ -12969,6 +13528,22 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox92+Safari16.4+Chrome86+
+
+ Opera?Edge86+
+
+ Edge (Legacy)?IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
@@ -13055,7 +13630,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -13084,7 +13659,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13116,7 +13691,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13132,7 +13707,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13148,7 +13723,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13164,7 +13739,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13180,7 +13755,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13196,7 +13771,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13212,7 +13787,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13289,6 +13864,22 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IENone
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
✔MDN
@@ -13788,7 +14379,7 @@ I
"56ad2aed": {"dfnID":"56ad2aed","dfnText":"insert","external":true,"refSections":[{"refs":[{"id":"ref-for-list-insert"}],"title":"4.2.3. Mutation algorithms"}],"url":"https://infra.spec.whatwg.org/#list-insert"},
"5832b143": {"dfnID":"5832b143","dfnText":"name","external":true,"refSections":[{"refs":[{"id":"ref-for-name"}],"title":"4.5. Interface Document"}],"url":"https://encoding.spec.whatwg.org/#name"},
"583654a9": {"dfnID":"583654a9","dfnText":"InvalidCharacterError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidcharactererror"}],"title":"1.4. Namespaces"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460"},{"id":"ref-for-invalidcharactererror\u2461"},{"id":"ref-for-invalidcharactererror\u2462"},{"id":"ref-for-invalidcharactererror\u2463"},{"id":"ref-for-invalidcharactererror\u2464"},{"id":"ref-for-invalidcharactererror\u2465"},{"id":"ref-for-invalidcharactererror\u2466"},{"id":"ref-for-invalidcharactererror\u2467"},{"id":"ref-for-invalidcharactererror\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u24ea"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2460"},{"id":"ref-for-invalidcharactererror\u2460\u2461"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2462"},{"id":"ref-for-invalidcharactererror\u2460\u2463"},{"id":"ref-for-invalidcharactererror\u2460\u2464"},{"id":"ref-for-invalidcharactererror\u2460\u2465"},{"id":"ref-for-invalidcharactererror\u2460\u2466"},{"id":"ref-for-invalidcharactererror\u2460\u2467"},{"id":"ref-for-invalidcharactererror\u2460\u2468"},{"id":"ref-for-invalidcharactererror\u2461\u24ea"}],"title":"7.1. Interface DOMTokenList"}],"url":"https://webidl.spec.whatwg.org/#invalidcharactererror"},
-"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"},
+"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"},{"id":"ref-for-code-unit\u2462"},{"id":"ref-for-code-unit\u2463"},{"id":"ref-for-code-unit\u2464"},{"id":"ref-for-code-unit\u2465"},{"id":"ref-for-code-unit\u2466"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"},
"5991ccfb": {"dfnID":"5991ccfb","dfnText":"relevant realm","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-relevant-realm"}],"title":"2.10. Firing events"}],"url":"https://html.spec.whatwg.org/multipage/webappapis.html#concept-relevant-realm"},
"5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"},{"id":"ref-for-window\u2461"}],"title":"2.3. Legacy extensions to the Window interface"},{"refs":[{"id":"ref-for-window\u2462"},{"id":"ref-for-window\u2463"},{"id":"ref-for-window\u2464"},{"id":"ref-for-window\u2465"}],"title":"2.9. Dispatching events"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"},
"5e0d3b02": {"dfnID":"5e0d3b02","dfnText":"match a selector against an element","external":true,"refSections":[{"refs":[{"id":"ref-for-match-a-selector-against-an-element"},{"id":"ref-for-match-a-selector-against-an-element\u2460"}],"title":"4.9. Interface Element"}],"url":"https://drafts.csswg.org/selectors-4/#match-a-selector-against-an-element"},
@@ -13813,7 +14404,6 @@ I
"797018a7": {"dfnID":"797018a7","dfnText":"InvalidStateError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidstateerror"}],"title":"2.7. Interface EventTarget"},{"refs":[{"id":"ref-for-invalidstateerror\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-invalidstateerror\u2461"}],"title":"6. Traversal"}],"url":"https://webidl.spec.whatwg.org/#invalidstateerror"},
"79e2abd0": {"dfnID":"79e2abd0","dfnText":"look up a custom element definition","external":true,"refSections":[{"refs":[{"id":"ref-for-look-up-a-custom-element-definition"},{"id":"ref-for-look-up-a-custom-element-definition\u2460"}],"title":"4.9. Interface Element"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#look-up-a-custom-element-definition"},
"7b0d918d": {"dfnID":"7b0d918d","dfnText":"break","external":true,"refSections":[{"refs":[{"id":"ref-for-iteration-break"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-iteration-break\u2460"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-iteration-break\u2461"},{"id":"ref-for-iteration-break\u2462"}],"title":"6.2. Interface TreeWalker"}],"url":"https://infra.spec.whatwg.org/#iteration-break"},
-"7cf8cfc4": {"dfnID":"7cf8cfc4","dfnText":"code units","external":true,"refSections":[{"refs":[{"id":"ref-for-def_code_unit"},{"id":"ref-for-def_code_unit\u2460"},{"id":"ref-for-def_code_unit\u2461"},{"id":"ref-for-def_code_unit\u2462"},{"id":"ref-for-def_code_unit\u2463"}],"title":"4.10. Interface CharacterData"}],"url":"https://w3c.github.io/i18n-glossary/#def_code_unit"},
"7f9469b5": {"dfnID":"7f9469b5","dfnText":"ascii case-insensitive","external":true,"refSections":[{"refs":[{"id":"ref-for-ascii-case-insensitive"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2460"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2461"}],"title":"4.9. Interface Element"}],"url":"https://infra.spec.whatwg.org/#ascii-case-insensitive"},
"85a289c7": {"dfnID":"85a289c7","dfnText":"svg namespace","external":true,"refSections":[{"refs":[{"id":"ref-for-svg-namespace"}],"title":"4.5.1. Interface DOMImplementation"}],"url":"https://infra.spec.whatwg.org/#svg-namespace"},
"8611edf0": {"dfnID":"8611edf0","dfnText":"InUseAttributeError","external":true,"refSections":[{"refs":[{"id":"ref-for-inuseattributeerror"}],"title":"4.9. Interface Element"}],"url":"https://webidl.spec.whatwg.org/#inuseattributeerror"},
@@ -13999,7 +14589,7 @@ I
"concept-node-filter": {"dfnID":"concept-node-filter","dfnText":"filter","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-filter"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-node-filter\u2460"},{"id":"ref-for-concept-node-filter\u2461"},{"id":"ref-for-concept-node-filter\u2462"},{"id":"ref-for-concept-node-filter\u2463"},{"id":"ref-for-concept-node-filter\u2464"},{"id":"ref-for-concept-node-filter\u2465"},{"id":"ref-for-concept-node-filter\u2466"},{"id":"ref-for-concept-node-filter\u2467"},{"id":"ref-for-concept-node-filter\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-node-filter"},
"concept-node-insert": {"dfnID":"concept-node-insert","dfnText":"insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert"},{"id":"ref-for-concept-node-insert\u2460"},{"id":"ref-for-concept-node-insert\u2461"},{"id":"ref-for-concept-node-insert\u2462"},{"id":"ref-for-concept-node-insert\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-insert\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-insert\u2465"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-insert\u2466"}],"title":"5.5. Interface Range"}],"url":"#concept-node-insert"},
"concept-node-insert-ext": {"dfnID":"concept-node-insert-ext","dfnText":"insertion steps","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert-ext"}],"title":"4.2.3. Mutation algorithms"}],"url":"#concept-node-insert-ext"},
-"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"},{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2463"},{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2468"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"5.2. Boundary points"}],"url":"#concept-node-length"},
+"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"},{"id":"ref-for-concept-node-length\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"},{"id":"ref-for-concept-node-length\u2468"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2461"},{"id":"ref-for-concept-node-length\u2460\u2462"},{"id":"ref-for-concept-node-length\u2460\u2463"},{"id":"ref-for-concept-node-length\u2460\u2464"},{"id":"ref-for-concept-node-length\u2460\u2465"},{"id":"ref-for-concept-node-length\u2460\u2466"},{"id":"ref-for-concept-node-length\u2460\u2467"},{"id":"ref-for-concept-node-length\u2460\u2468"},{"id":"ref-for-concept-node-length\u2461\u24ea"},{"id":"ref-for-concept-node-length\u2461\u2460"},{"id":"ref-for-concept-node-length\u2461\u2461"},{"id":"ref-for-concept-node-length\u2461\u2462"},{"id":"ref-for-concept-node-length\u2461\u2463"}],"title":"5.5. Interface Range"}],"url":"#concept-node-length"},
"concept-node-pre-insert": {"dfnID":"concept-node-pre-insert","dfnText":"pre-insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-insert"},{"id":"ref-for-concept-node-pre-insert\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2461"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2462"},{"id":"ref-for-concept-node-pre-insert\u2463"},{"id":"ref-for-concept-node-pre-insert\u2464"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2465"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2466"}],"title":"4.7. Interface DocumentFragment"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2467"},{"id":"ref-for-concept-node-pre-insert\u2468"},{"id":"ref-for-concept-node-pre-insert\u2460\u24ea"},{"id":"ref-for-concept-node-pre-insert\u2460\u2460"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2460\u2461"}],"title":"5.5. Interface Range"}],"url":"#concept-node-pre-insert"},
"concept-node-pre-remove": {"dfnID":"concept-node-pre-remove","dfnText":"pre-remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-remove"}],"title":"4.4. Interface Node"}],"url":"#concept-node-pre-remove"},
"concept-node-remove": {"dfnID":"concept-node-remove","dfnText":"remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-remove"},{"id":"ref-for-concept-node-remove\u2460"},{"id":"ref-for-concept-node-remove\u2461"},{"id":"ref-for-concept-node-remove\u2462"},{"id":"ref-for-concept-node-remove\u2463"},{"id":"ref-for-concept-node-remove\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-remove\u2465"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-remove\u2466"},{"id":"ref-for-concept-node-remove\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-remove\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u24ea"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u2460"},{"id":"ref-for-concept-node-remove\u2460\u2461"},{"id":"ref-for-concept-node-remove\u2460\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-node-remove"},
@@ -14050,9 +14640,9 @@ I
"concept-traverse-children": {"dfnID":"concept-traverse-children","dfnText":"traverse children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-children"},{"id":"ref-for-concept-traverse-children\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-children"},
"concept-traverse-siblings": {"dfnID":"concept-traverse-siblings","dfnText":"traverse siblings","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-siblings"},{"id":"ref-for-concept-traverse-siblings\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-siblings"},
"concept-tree": {"dfnID":"concept-tree","dfnText":"tree","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree"},{"id":"ref-for-concept-tree\u2460"},{"id":"ref-for-concept-tree\u2461"},{"id":"ref-for-concept-tree\u2462"},{"id":"ref-for-concept-tree\u2463"},{"id":"ref-for-concept-tree\u2464"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree\u2465"},{"id":"ref-for-concept-tree\u2466"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree\u2467"},{"id":"ref-for-concept-tree\u2468"},{"id":"ref-for-concept-tree\u2460\u24ea"},{"id":"ref-for-concept-tree\u2460\u2460"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2461"},{"id":"ref-for-concept-tree\u2460\u2462"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree\u2460\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2464"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2465"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2466"},{"id":"ref-for-concept-tree\u2460\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2468"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-concept-tree\u2461\u24ea"},{"id":"ref-for-concept-tree\u2461\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree\u2461\u2461"}],"title":"6. Traversal"}],"url":"#concept-tree"},
-"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2461"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2462"},{"id":"ref-for-concept-tree-ancestor\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2465"},{"id":"ref-for-concept-tree-ancestor\u2466"},{"id":"ref-for-concept-tree-ancestor\u2467"},{"id":"ref-for-concept-tree-ancestor\u2468"},{"id":"ref-for-concept-tree-ancestor\u2460\u24ea"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-ancestor"},
-"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"},{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"},{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"},{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"},{"id":"ref-for-concept-tree-child\u2462\u24ea"},{"id":"ref-for-concept-tree-child\u2462\u2460"},{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2463"},{"id":"ref-for-concept-tree-child\u2463\u2464"},{"id":"ref-for-concept-tree-child\u2463\u2465"},{"id":"ref-for-concept-tree-child\u2463\u2466"},{"id":"ref-for-concept-tree-child\u2463\u2467"},{"id":"ref-for-concept-tree-child\u2463\u2468"},{"id":"ref-for-concept-tree-child\u2464\u24ea"},{"id":"ref-for-concept-tree-child\u2464\u2460"},{"id":"ref-for-concept-tree-child\u2464\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2462"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2463"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2465"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2466"},{"id":"ref-for-concept-tree-child\u2464\u2467"},{"id":"ref-for-concept-tree-child\u2464\u2468"},{"id":"ref-for-concept-tree-child\u2465\u24ea"},{"id":"ref-for-concept-tree-child\u2465\u2460"},{"id":"ref-for-concept-tree-child\u2465\u2461"},{"id":"ref-for-concept-tree-child\u2465\u2462"},{"id":"ref-for-concept-tree-child\u2465\u2463"},{"id":"ref-for-concept-tree-child\u2465\u2464"},{"id":"ref-for-concept-tree-child\u2465\u2465"},{"id":"ref-for-concept-tree-child\u2465\u2466"},{"id":"ref-for-concept-tree-child\u2465\u2467"},{"id":"ref-for-concept-tree-child\u2465\u2468"},{"id":"ref-for-concept-tree-child\u2466\u24ea"},{"id":"ref-for-concept-tree-child\u2466\u2460"},{"id":"ref-for-concept-tree-child\u2466\u2461"},{"id":"ref-for-concept-tree-child\u2466\u2462"},{"id":"ref-for-concept-tree-child\u2466\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2466\u2464"},{"id":"ref-for-concept-tree-child\u2466\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"},
-"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"},{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462"},{"id":"ref-for-concept-tree-descendant\u2463"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2464"},{"id":"ref-for-concept-tree-descendant\u2465"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2466"},{"id":"ref-for-concept-tree-descendant\u2467"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u24ea"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u2460"},{"id":"ref-for-concept-tree-descendant\u2460\u2461"},{"id":"ref-for-concept-tree-descendant\u2460\u2462"},{"id":"ref-for-concept-tree-descendant\u2460\u2463"},{"id":"ref-for-concept-tree-descendant\u2460\u2464"},{"id":"ref-for-concept-tree-descendant\u2460\u2465"},{"id":"ref-for-concept-tree-descendant\u2460\u2466"},{"id":"ref-for-concept-tree-descendant\u2460\u2467"},{"id":"ref-for-concept-tree-descendant\u2460\u2468"},{"id":"ref-for-concept-tree-descendant\u2461\u24ea"},{"id":"ref-for-concept-tree-descendant\u2461\u2460"},{"id":"ref-for-concept-tree-descendant\u2461\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461\u2462"},{"id":"ref-for-concept-tree-descendant\u2461\u2463"},{"id":"ref-for-concept-tree-descendant\u2461\u2464"},{"id":"ref-for-concept-tree-descendant\u2461\u2465"},{"id":"ref-for-concept-tree-descendant\u2461\u2466"},{"id":"ref-for-concept-tree-descendant\u2461\u2467"},{"id":"ref-for-concept-tree-descendant\u2461\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u24ea"}],"title":"4.8. Interface ShadowRoot"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2460"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2461"},{"id":"ref-for-concept-tree-descendant\u2462\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-descendant"},
+"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"2.2. Interface Event"}],"url":"#concept-tree-ancestor"},
+"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"},{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"},{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"},{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u24ea"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"},{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"},{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"},{"id":"ref-for-concept-tree-child\u2463\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"},
+"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"4.3. Mutation observers"}],"url":"#concept-tree-descendant"},
"concept-tree-first-child": {"dfnID":"concept-tree-first-child","dfnText":"first child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-first-child"},{"id":"ref-for-concept-tree-first-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2461"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2462"},{"id":"ref-for-concept-tree-first-child\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2464"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2465"},{"id":"ref-for-concept-tree-first-child\u2466"},{"id":"ref-for-concept-tree-first-child\u2467"},{"id":"ref-for-concept-tree-first-child\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-first-child"},
"concept-tree-following": {"dfnID":"concept-tree-following","dfnText":"following","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-following"},{"id":"ref-for-concept-tree-following\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-following\u2461"},{"id":"ref-for-concept-tree-following\u2462"},{"id":"ref-for-concept-tree-following\u2463"},{"id":"ref-for-concept-tree-following\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-following\u2465"},{"id":"ref-for-concept-tree-following\u2466"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2467"},{"id":"ref-for-concept-tree-following\u2468"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2461"},{"id":"ref-for-concept-tree-following\u2460\u2462"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-following"},
"concept-tree-host-including-inclusive-ancestor": {"dfnID":"concept-tree-host-including-inclusive-ancestor","dfnText":"host-including inclusive ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor"},{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2461"}],"title":"4.7. Interface DocumentFragment"}],"url":"#concept-tree-host-including-inclusive-ancestor"},
@@ -14063,7 +14653,7 @@ I
"concept-tree-last-child": {"dfnID":"concept-tree-last-child","dfnText":"last child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-last-child"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2461"},{"id":"ref-for-concept-tree-last-child\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2463"},{"id":"ref-for-concept-tree-last-child\u2464"},{"id":"ref-for-concept-tree-last-child\u2465"},{"id":"ref-for-concept-tree-last-child\u2466"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-last-child"},
"concept-tree-next-sibling": {"dfnID":"concept-tree-next-sibling","dfnText":"next sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-next-sibling"},{"id":"ref-for-concept-tree-next-sibling\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2463"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2464"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2467"},{"id":"ref-for-concept-tree-next-sibling\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2464"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2467"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-next-sibling"},
"concept-tree-order": {"dfnID":"concept-tree-order","dfnText":"tree order","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-order"},{"id":"ref-for-concept-tree-order\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-order\u2461"},{"id":"ref-for-concept-tree-order\u2462"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-order\u2463"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-order\u2464"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-order\u2465"}],"title":"4.2.2.1. Slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2466"},{"id":"ref-for-concept-tree-order\u2467"},{"id":"ref-for-concept-tree-order\u2468"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u24ea"}],"title":"4.2.2.4. Assigning slottables and slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2460"},{"id":"ref-for-concept-tree-order\u2460\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2462"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2463"}],"title":"4.2.10. Old-style collections: NodeList and HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2464"}],"title":"4.2.10.1. Interface NodeList"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2465"},{"id":"ref-for-concept-tree-order\u2460\u2466"}],"title":"4.2.10.2. Interface HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2467"},{"id":"ref-for-concept-tree-order\u2460\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2460"},{"id":"ref-for-concept-tree-order\u2461\u2461"},{"id":"ref-for-concept-tree-order\u2461\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2463"},{"id":"ref-for-concept-tree-order\u2461\u2464"},{"id":"ref-for-concept-tree-order\u2461\u2465"},{"id":"ref-for-concept-tree-order\u2461\u2466"},{"id":"ref-for-concept-tree-order\u2461\u2467"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2468"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-order"},
-"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"},{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2466"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"},{"id":"ref-for-concept-tree-parent\u2464\u2467"},{"id":"ref-for-concept-tree-parent\u2464\u2468"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u24ea"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"},{"id":"ref-for-concept-tree-parent\u2465\u2464"},{"id":"ref-for-concept-tree-parent\u2465\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"},
+"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"},{"id":"ref-for-concept-tree-parent\u2462\u2466"},{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2467"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2468"},{"id":"ref-for-concept-tree-parent\u2465\u24ea"},{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"},
"concept-tree-participate": {"dfnID":"concept-tree-participate","dfnText":"participates","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-participate"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-participate\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-participate\u2461"},{"id":"ref-for-concept-tree-participate\u2462"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-participate\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-participate\u2464"}],"title":"4.4. Interface Node"}],"url":"#concept-tree-participate"},
"concept-tree-preceding": {"dfnID":"concept-tree-preceding","dfnText":"preceding","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-preceding"},{"id":"ref-for-concept-tree-preceding\u2460"},{"id":"ref-for-concept-tree-preceding\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2462"},{"id":"ref-for-concept-tree-preceding\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2464"},{"id":"ref-for-concept-tree-preceding\u2465"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2466"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2467"},{"id":"ref-for-concept-tree-preceding\u2468"},{"id":"ref-for-concept-tree-preceding\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2461"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-preceding"},
"concept-tree-previous-sibling": {"dfnID":"concept-tree-previous-sibling","dfnText":"previous sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-previous-sibling"},{"id":"ref-for-concept-tree-previous-sibling\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2463"},{"id":"ref-for-concept-tree-previous-sibling\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2465"},{"id":"ref-for-concept-tree-previous-sibling\u2466"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2467"},{"id":"ref-for-concept-tree-previous-sibling\u2468"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2460\u24ea"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2462"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-previous-sibling"},
@@ -15204,6 +15794,63 @@ I
}
}
+
-
-
-
+
-
-
- 
+
Encoding
Living Standard — Last Updated
@@ -70,7 +402,7 @@ Encoding
- Participate:
-
N
[HTML]
Anne van Kesteren; et al. HTML Standard. Living Standard. URL: https://html.spec.whatwg.org/multipage/
[HTML-AAM-1.0]
- Steve Faulkner; Scott O'Hara. HTML Accessibility API Mappings 1.0. URL: https://w3c.github.io/html-aam/
+ Scott O'Hara. HTML Accessibility API Mappings 1.0. URL: https://w3c.github.io/html-aam/
[RFC2119]
S. Bradner. Key words for use in RFCs to Indicate Requirement Levels. March 1997. Best Current Practice. URL: https://datatracker.ietf.org/doc/html/rfc2119
[WEBIDL]
@@ -1388,6 +1374,7 @@ I
"31559e1b": {"dfnID":"31559e1b","dfnText":"define(name, constructor, options)","external":true,"refSections":[{"refs":[{"id":"ref-for-dom-customelementregistry-define"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-dom-customelementregistry-define\u2460"},{"id":"ref-for-dom-customelementregistry-define\u2461"}],"title":"1.2. Changes to custom element definition"},{"refs":[{"id":"ref-for-dom-customelementregistry-define\u2462"}],"title":"2.1. Introduction"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#dom-customelementregistry-define"},
"3fca5a9e": {"dfnID":"3fca5a9e","dfnText":"map","external":true,"refSections":[{"refs":[{"id":"ref-for-ordered-map"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-ordered-map\u2460"}],"title":"1.1.2. Defining per-instance custom element semantics"}],"url":"https://infra.spec.whatwg.org/#ordered-map"},
"5889f566": {"dfnID":"5889f566","dfnText":"accessibility tree","external":true,"refSections":[{"refs":[{"id":"ref-for-dfn-accessibility-tree"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"}],"url":"https://www.w3.org/TR/core-aam-1.1/#dfn-accessibility-tree"},
+"5ab7b520": {"dfnID":"5ab7b520","dfnText":"reflect","external":true,"refSections":[{"refs":[{"id":"ref-for-reflect"}],"title":"2.1. Introduction"}],"url":"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect"},
"7e4580af": {"dfnID":"7e4580af","dfnText":"ElementDefinitionOptions","external":true,"refSections":[{"refs":[{"id":"ref-for-elementdefinitionoptions"},{"id":"ref-for-elementdefinitionoptions\u2460"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-elementdefinitionoptions\u2461"},{"id":"ref-for-elementdefinitionoptions\u2462"}],"title":"1.2. Changes to custom element definition"},{"refs":[{"id":"ref-for-elementdefinitionoptions\u2463"}],"title":"2. ARIA semantic precedence between ElementDefinitionOptions, ElementInternals and ARIA properties"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#elementdefinitionoptions"},
"81c9c6df": {"dfnID":"81c9c6df","dfnText":"accessible object","external":true,"refSections":[{"refs":[{"id":"ref-for-dfn-accessible-object"},{"id":"ref-for-dfn-accessible-object\u2460"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-dfn-accessible-object\u2461"}],"title":"1.1.2. Defining per-instance custom element semantics"}],"url":"https://www.w3.org/TR/core-aam-1.1/#dfn-accessible-object"},
"87f26218": {"dfnID":"87f26218","dfnText":"AriaAttributes","external":true,"refSections":[{"refs":[{"id":"ref-for-idl-def-ariaattributes"},{"id":"ref-for-idl-def-ariaattributes\u2460"},{"id":"ref-for-idl-def-ariaattributes\u2461"},{"id":"ref-for-idl-def-ariaattributes\u2462"}],"title":"1.2. Changes to custom element definition"}],"url":"https://www.w3.org/TR/wai-aria-1.2/#idl-def-ariaattributes"},
@@ -1795,6 +1782,7 @@ I
"#semantic-properties": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"aom-aria","spec":"aom-aria-1","status":"local","text":"semantic properties","type":"dfn","url":"#semantic-properties"},
"https://dom.spec.whatwg.org/#concept-element-custom": {"export":true,"for_":["Element"],"level":"1","normative":true,"shortname":"dom","spec":"dom","status":"current","text":"custom","type":"dfn","url":"https://dom.spec.whatwg.org/#concept-element-custom"},
"https://dom.spec.whatwg.org/#element": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"dom","spec":"dom","status":"current","text":"Element","type":"interface","url":"https://dom.spec.whatwg.org/#element"},
+"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"html","spec":"html","status":"current","text":"reflect","type":"dfn","url":"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"html","spec":"html","status":"current","text":"custom element","type":"dfn","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element-definition": {"export":true,"for_":[],"level":"","normative":true,"shortname":"html","spec":"html","status":"anchor-block","text":"custom element definition","type":"dfn","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element-definition"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#customelementregistry": {"export":true,"for_":[],"level":"","normative":true,"shortname":"html","spec":"html","status":"anchor-block","text":"CustomElementRegistry","type":"interface","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#customelementregistry"},
diff --git a/tests/github/WICG/aom/spec/input-events.html b/tests/github/WICG/aom/spec/input-events.html
index 8e7848e414..07757b6282 100644
--- a/tests/github/WICG/aom/spec/input-events.html
+++ b/tests/github/WICG/aom/spec/input-events.html
@@ -5,8 +5,8 @@
AOM Input Event Types
-
+
+
-
+
+
-
+
-
-
-
+
Compatibility
Living Standard — Last Updated
@@ -69,7 +401,7 @@ Compatibility
- Participate:
-
- GitHub whatwg/compat (new issue, open issues)
+
- GitHub whatwg/compat (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/compat/commits
@@ -287,7 +619,7 @@
animation-name
-webkit-animation-duration
- animation-duration
+ animation-duration
-webkit-animation-timing-function
animation-timing-function
@@ -541,7 +873,7 @@ -webkit-background-clip property—when its value is text—creates a background clipping region from the outer text stroke of the foreground text (including alpha transparency).
-
The -webkit-background-clip property is a simple alias of the background-clip property for all other <box> values.
+ The -webkit-background-clip property is a simple alias of the background-clip property for all other <box> values.
Note that the root element has a different background painting area, and thus the -webkit-background-clip property has no effect when specified on it. See the backgrounds of special elements.
- border-box
@@ -985,17 +1317,20 @@
animation
- animation-delay
- animation-direction
-
- animation-duration
- animation-fill-mode
- animation-iteration-count
- animation-name
- animation-play-state
- animation-timing-function
+
-
+ [CSS-ANIMATIONS-2] defines the following terms:
+
+ - animation-duration
+
-
[CSS-BACKGROUNDS-3] defines the following terms:
- - <box>
- <line-width>
- background-clip
- background-origin
@@ -1007,6 +1342,11 @@
border-top-right-radius
- box-shadow
+ -
+ [CSS-BOX-4] defines the following terms:
+
+ - <box>
+
-
[CSS-COLOR-4] defines the following terms:
@@ -1173,25 +1513,29 @@ N
- [CSS-ALIGN-3]
- Elika Etemad; Tab Atkins Jr.. CSS Box Alignment Module Level 3. URL: https://drafts.csswg.org/css-align/
- [CSS-ANIMATIONS-1]
-
- Dean Jackson; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- David Baron; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- [CSS-ANIMATIONS-2]
+
- David Baron; Brian Birtles. CSS Animations Level 2. URL: https://drafts.csswg.org/css-animations-2/
- [CSS-BACKGROUNDS-3]
-
- Bert Bos; Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- [CSS-BOX-4]
+
- Elika Etemad. CSS Box Model Module Level 4. URL: https://drafts.csswg.org/css-box-4/
- [CSS-COLOR-4]
-
- Tab Atkins Jr.; Chris Lilley; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color/
+
- Chris Lilley; Tab Atkins Jr.; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color-4/
- [CSS-COLOR-5]
- Chris Lilley; et al. CSS Color Module Level 5. URL: https://drafts.csswg.org/css-color-5/
- [CSS-CONDITIONAL-3]
-
- David Baron; Elika Etemad; Chris Lilley. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
+
- Chris Lilley; David Baron; Elika Etemad. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
- [CSS-DISPLAY-3]
-
- Tab Atkins Jr.; Elika Etemad. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
+
- Elika Etemad; Tab Atkins Jr.. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
- [CSS-DISPLAY-4]
-
- CSS Display Module Level 4 URL: https://drafts.csswg.org/css-display-4/
+
- CSS Display Module Level 4. Editor's Draft. URL: https://drafts.csswg.org/css-display-4/
- [CSS-FLEXBOX-1]
- Tab Atkins Jr.; et al. CSS Flexible Box Layout Module Level 1. URL: https://drafts.csswg.org/css-flexbox-1/
- [CSS-MASKING-1]
- Dirk Schulze; Brian Birtles; Tab Atkins Jr.. CSS Masking Module Level 1. URL: https://drafts.fxtf.org/css-masking-1/
- [CSS-SIZE-ADJUST-1]
-
- CSS Mobile Text Size Adjustment Module Level 1 URL: https://drafts.csswg.org/css-size-adjust-1/
+
- CSS Mobile Text Size Adjustment Module Level 1. Editor's Draft. URL: https://drafts.csswg.org/css-size-adjust-1/
- [CSS-SIZING-3]
- Tab Atkins Jr.; Elika Etemad. CSS Box Sizing Module Level 3. URL: https://drafts.csswg.org/css-sizing-3/
- [CSS-TRANSFORMS-1]
@@ -1695,6 +2039,7 @@
I
"-webkit-repeating-linear-gradient": {"dfnID":"-webkit-repeating-linear-gradient","dfnText":"-webkit-repeating-linear-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-linear-gradient"},
"-webkit-repeating-radial-gradient": {"dfnID":"-webkit-repeating-radial-gradient","dfnText":"-webkit-repeating-radial-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-radial-gradient"},
"0460a504": {"dfnID":"0460a504","dfnText":"resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"},
+"06a8cc3f": {"dfnID":"06a8cc3f","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-2/#propdef-animation-duration"},
"09f2cf3e": {"dfnID":"09f2cf3e","dfnText":"transform-origin","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform-origin"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform-origin"},
"0bf92d15": {"dfnID":"0bf92d15","dfnText":"mask-composite","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-composite"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-composite"},
"11151628": {"dfnID":"11151628","dfnText":"mask-clip","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-clip"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-clip"},
@@ -1710,7 +2055,6 @@ I
"280c9a03": {"dfnID":"280c9a03","dfnText":"border-bottom-right-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-bottom-right-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-bottom-right-radius"},
"2f0492ac": {"dfnID":"2f0492ac","dfnText":"body","external":true,"refSections":[{"refs":[{"id":"ref-for-the-body-element"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-the-body-element\u2460"},{"id":"ref-for-the-body-element\u2461"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/sections.html#the-body-element"},
"3124d393": {"dfnID":"3124d393","dfnText":"linear-gradient","external":true,"refSections":[{"refs":[{"id":"ref-for-ltlinear-gradient"}],"title":"3.3.1. \n -webkit-linear-gradient()\n"}],"url":"https://www.w3.org/TR/2011/WD-css3-images-20110217/#ltlinear-gradient"},
-"342bb58f": {"dfnID":"342bb58f","dfnText":"","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#typedef-box"},
"35972864": {"dfnID":"35972864","dfnText":"active document","external":true,"refSections":[{"refs":[{"id":"ref-for-nav-document"}],"title":"4.2. window.orientation API"}],"url":"https://html.spec.whatwg.org/multipage/document-sequences.html#nav-document"},
"366fd15a": {"dfnID":"366fd15a","dfnText":"min-resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"},
"3a74ed0c": {"dfnID":"3a74ed0c","dfnText":"flex-flow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-flow"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-flow"},
@@ -1723,7 +2067,6 @@ I
"4d0e596d": {"dfnID":"4d0e596d","dfnText":"mask-border-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-border-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-border-repeat"},
"58a520d5": {"dfnID":"58a520d5","dfnText":"mask-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-repeat"},
"5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-window\u2461"},{"id":"ref-for-window\u2462"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"},
-"5e8da52b": {"dfnID":"5e8da52b","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation-duration"},
"5f1a81e7": {"dfnID":"5f1a81e7","dfnText":"border-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-radius"},
"5f1b7f60": {"dfnID":"5f1b7f60","dfnText":"@media","external":true,"refSections":[{"refs":[{"id":"ref-for-at-ruledef-media"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"},{"refs":[{"id":"ref-for-at-ruledef-media\u2460"}],"title":"3.2.2. \n -webkit-transform-3d\n"}],"url":"https://drafts.csswg.org/css-conditional-3/#at-ruledef-media"},
"5fd23811": {"dfnID":"5fd23811","dfnText":"fire an event","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-event-fire"}],"title":"4.2. window.orientation API"}],"url":"https://dom.spec.whatwg.org/#concept-event-fire"},
@@ -1790,6 +2133,7 @@ I
"e2e08d07": {"dfnID":"e2e08d07","dfnText":"transform","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform"},
"e3d4f907": {"dfnID":"e3d4f907","dfnText":"color","external":true,"refSections":[{"refs":[{"id":"ref-for-animtype-color"}],"title":"3.4.7.1. Foreground Text Color: the \n-webkit-text-fill-color property"},{"refs":[{"id":"ref-for-animtype-color\u2460"}],"title":"3.4.7.2. Text Stroke Color: the \n-webkit-text-stroke-color property"}],"url":"https://drafts.csswg.org/css-transitions/#animtype-color"},
"e6ccf9d2": {"dfnID":"e6ccf9d2","dfnText":"ScreenOrientation","external":true,"refSections":[{"refs":[{"id":"ref-for-screenorientation-interface"}],"title":"4.2.1. window.orientation angle"},{"refs":[{"id":"ref-for-screenorientation-interface\u2460"}],"title":"Acknowledgements"}],"url":"https://w3c.github.io/screen-orientation/#screenorientation-interface"},
+"e7382b89": {"dfnID":"e7382b89","dfnText":"","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-box-4/#typedef-box"},
"e983d6ca": {"dfnID":"e983d6ca","dfnText":"WebKitCSSMatrix","external":true,"refSections":[{"refs":[{"id":"ref-for-webkitcssmatrix"}],"title":"4.1. The WebKitCSSMatrix interface"}],"url":"https://drafts.fxtf.org/geometry-1/#webkitcssmatrix"},
"eda608e1": {"dfnID":"eda608e1","dfnText":"animation","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation"},
"edc3a18b": {"dfnID":"edc3a18b","dfnText":"flex-grow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-grow"}],"title":"3.4.1. Simple property aliases"},{"refs":[{"id":"ref-for-propdef-flex-grow\u2460"}],"title":"3.4.4. Property mappings"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-grow"},
@@ -2264,9 +2608,9 @@ I
"use strict";
{
let linkTitleData = {
-"https://drafts.csswg.org/css-backgrounds-3/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | svg viewport origin box | view-box",
"https://drafts.csswg.org/css-backgrounds-3/#typedef-line-width": "Expands to: medium | thick | thin",
-"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: aliceblue | antiquewhite | aqua | aquamarine | azure | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | cadetblue | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | green | greenyellow | grey | honeydew | hotpink | indianred | indigo | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | magenta | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | seagreen | seashell | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | tomato | transparent | turquoise | violet | wheat | white | whitesmoke | yellow | yellowgreen",
+"https://drafts.csswg.org/css-box-4/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | view-box",
+"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: | accentcolor | accentcolortext | activeborder | activecaption | activetext | aliceblue | antiquewhite | appworkspace | aqua | aquamarine | azure | background | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | buttonborder | buttonface | buttonhighlight | buttonshadow | buttontext | cadetblue | canvas | canvastext | captiontext | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | field | fieldtext | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | graytext | green | greenyellow | grey | highlight | highlighttext | honeydew | hotpink | inactiveborder | inactivecaption | inactivecaptiontext | indianred | indigo | infobackground | infotext | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | linktext | magenta | mark | marktext | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | menu | menutext | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | scrollbar | seagreen | seashell | selecteditem | selecteditemtext | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | threeddarkshadow | threedface | threedhighlight | threedlightshadow | threedshadow | tomato | transparent | turquoise | violet | visitedtext | wheat | white | whitesmoke | window | windowframe | windowtext | yellow | yellowgreen",
};
function setTypeTitles() {
@@ -2280,6 +2624,63 @@ I
document.addEventListener("DOMContentLoaded", setTypeTitles);
}
+
-
-
-
-
-
-
+
Console
Living Standard — Last Updated
@@ -69,7 +401,7 @@ Console
- Participate:
-
- GitHub whatwg/console (new issue, open issues)
+
- GitHub whatwg/console (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/console/commits
@@ -853,7 +1185,7 @@
I
In all current engines.
- Firefox28+Safari4+Chrome1+
+ Firefox28+Safari4+Chrome2+
Opera11+Edge79+
@@ -889,7 +1221,7 @@ I
In all current engines.
- Firefox30+Safari4+Chrome1+
+ Firefox30+Safari4+Chrome2+
Opera11+Edge79+
@@ -925,7 +1257,7 @@ I
In all current engines.
- Firefox5+Safari4+Chrome1+
+ Firefox5+Safari4+Chrome2+
Opera11+Edge79+
@@ -943,7 +1275,7 @@ I
In all current engines.
- Firefox8+Safari4+Chrome1+
+ Firefox8+Safari4+Chrome2+
Opera11+Edge79+
@@ -961,7 +1293,7 @@ I
In all current engines.
- Firefox39+Safari4+Chrome1+
+ Firefox39+Safari4+Chrome2+
Opera11+Edge79+
@@ -997,7 +1329,7 @@ I
In all current engines.
- Firefox9+Safari4+Chrome1+
+ Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1033,7 +1365,7 @@ I
In all current engines.
- Firefox9+Safari4+Chrome1+
+ Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1105,7 +1437,7 @@ I
In all current engines.
- Firefox10+Safari4+Chrome1+
+ Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1123,7 +1455,7 @@ I
In all current engines.
- Firefox10+Safari4+Chrome1+
+ Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1138,7 +1470,7 @@ I
✔MDN
-
+
In all current engines.
Firefox62+Safari13+Chrome71+
@@ -1159,7 +1491,7 @@ I
In all current engines.
- Firefox6+Safari4+Chrome1+
+ Firefox6+Safari4+Chrome2+
Opera11+Edge79+
@@ -1874,6 +2206,63 @@ I
}
}
+
-
-
-
-
-
-
+
DOM
Living Standard — Last Updated
@@ -69,7 +401,7 @@ DOM
- Participate:
-
- GitHub whatwg/dom (new issue, open issues)
+
- GitHub whatwg/dom (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/dom/commits
@@ -242,12 +574,12 @@
1.1.
null or an object, and has children, which is an ordered set of objects. An object A whose parent is object B is a child of B.
The root of an object is itself, if its parent is null, or else it is the root of its parent. The root of a tree is any object participating in that tree whose parent is null.
An object A is called a descendant of an object B, if either A is a child of B or A is a child of an
-object C that is a descendant of B.
+object C that is a descendant of B.
An inclusive descendant is
-an object or one of its descendants.
- An object A is called an ancestor of an object B if and only if B is a descendant of A.
+an object or one of its descendants.
+ An object A is called an ancestor of an object B if and only if B is a descendant of A.
An inclusive ancestor is
-an object or one of its ancestors.
+an object or one of its ancestors.
An object A is called a sibling of an object B, if and only if B and A share the same non-null parent.
An inclusive sibling is an
object or one of its siblings.
@@ -258,9 +590,9 @@ 1.1.
same tree and A comes
after B in tree order.
The first child of an object is its
-first child or null if it has no children.
+first child or null if it has no children.
The last child of an object is its
-last child or null if it has no children.
+last child or null if it has no children.
The previous sibling of an
object is its first preceding sibling or null if it has no preceding sibling.
The next sibling of an
@@ -353,7 +685,7 @@
}
- When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s bubbles is true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in
+
When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s bubbles is true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in
reverse tree order.
Let’s look at an example of how events work in a tree:
<!doctype html>
@@ -455,7 +787,7 @@ event listeners after the current one finishes running and, when dispatched in a tree, also prevents event from reaching any
other objects.
event . bubbles
- - Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
+
- Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
event . cancelable
- Returns true or false depending on how event was initialized. Its return
value does not always carry meaning, but true can indicate that part of the operation
@@ -1435,7 +1767,7 @@
- Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
+ Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
To illustrate, consider this HTML document:
<!DOCTYPE html>
< html class = e >
@@ -1475,7 +1807,7 @@ The most excellent Live DOM Viewer can be used to explore this matter in more detail.
4.2. Node tree
Document, DocumentType, DocumentFragment, Element, Text, ProcessingInstruction, and Comment objects (simply called nodes) participate in a tree, simply named the node tree.
- A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
+ A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
Document
-
@@ -1515,9 +1847,9 @@
Its data’s length.
- Any other node
-
-
Its number of children.
+ Its number of children.
- A node is considered empty if its length is zero.
+ A node is considered empty if its length is zero.
4.2.1. Document tree
A document tree is a node tree whose root is a document.
The document element of a document is the element whose parent is that document, if it exists; otherwise null.
@@ -1604,10 +1936,10 @@ mode is not "open", then return null.
-
If shadow’s slot assignment is "manual", then
- return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise
+ return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise
null.
-
-
Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
+ Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
To find slottables for a given slot slot, run these steps:
@@ -1628,7 +1960,7 @@ For each slottable slottable of slot’s manually assigned nodes, if slottable’s parent is host, append slottable to result.
-
-
Otherwise, for each slottable child slottable of host, in tree order:
+ Otherwise, for each slottable child slottable of host, in tree order:
-
Let foundSlot be the result of finding a slot given slottable.
@@ -1647,7 +1979,7 @@ finding slottables given slot.
-
-
If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
+ If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
-
For each node in slottables:
@@ -1719,17 +2051,17 @@
DocumentFragment node
-
-
If node has more than one element child or has a Text node child.
- Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
+ If node has more than one element child or has a Text node child.
+ Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
- element
-
-
parent has an element child, child is
+
parent has an element child, child is
a doctype, or child is non-null and a doctype is following child.
- doctype
-
-
parent has a doctype child, child is non-null
+
parent has a doctype child, child is non-null
and an element is preceding child, or child is null
- and parent has an element child.
+ and parent has an element child.
To pre-insert a node into a parent before a child, run these steps:
@@ -1751,7 +2083,7 @@ To insert a node into a parent before a child, with an optional suppress observers flag, run these steps:
-
-
Let nodes be node’s children, if node is a DocumentFragment node; otherwise « node ».
+ Let nodes be node’s children, if node is a DocumentFragment node; otherwise « node ».
-
Let count be nodes’s size.
-
@@ -1760,7 +2092,7 @@
If node is a DocumentFragment node, then:
-
-
+
-
Queue a tree mutation record for node with « », nodes, null, and
null.
@@ -1784,9 +2116,9 @@
Adopt node into parent’s node document.
-
-
+
-
-
Otherwise, insert node into parent’s children before child’s index.
+ Otherwise, insert node into parent’s children before child’s index.
-
If parent is a shadow host whose shadow root’s slot assignment is "named" and node is a slottable, then assign a slot for node.
-
@@ -1837,14 +2169,14 @@
DocumentFragment node
-
-
If node has more than one element child or has a Text node child.
- Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
+ If node has more than one element child or has a Text node child.
+ Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
- element
-
-
parent has an element child that is not child or a doctype is following child.
+ parent has an element child that is not child or a doctype is following child.
- doctype
-
-
parent has a doctype child that is not child,
+
parent has a doctype child that is not child,
or an element is preceding child.
The above statements differ from the pre-insert algorithm.
@@ -1866,7 +2198,7 @@
The above can only be false if child is node.
-
-
Let nodes be node’s children if node is a DocumentFragment node; otherwise « node ».
+ Let nodes be node’s children if node is a DocumentFragment node; otherwise « node ».
-
Insert node into parent before referenceChild with the suppress observers flag set.
-
@@ -1877,15 +2209,15 @@
To replace all with a node within a parent, run these steps:
-
-
Let removedNodes be parent’s children.
+ Let removedNodes be parent’s children.
-
Let addedNodes be the empty set.
-
-
If node is a DocumentFragment node, then set addedNodes to node’s children.
+ If node is a DocumentFragment node, then set addedNodes to node’s children.
-
Otherwise, if node is non-null, set addedNodes to « node ».
-
-
Remove all parent’s children, in tree order, with the suppress observers flag set.
+ Remove all parent’s children, in tree order, with the suppress observers flag set.
-
If node is non-null, then insert node into parent before null with the suppress observers flag set.
-
@@ -1930,7 +2262,7 @@
Let oldNextSibling be node’s next sibling.
-
-
+
-
If node is assigned, then run assign slottables for node’s assigned slot.
-
@@ -1980,9 +2312,9 @@
node . getElementById(elementId)
-
-
Returns the first element within node’s descendants whose ID is elementId.
+ Returns the first element within node’s descendants whose ID is elementId.
- The getElementById(elementId) method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if
+
The getElementById(elementId) method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if
there is no such element, null.
4.2.5. Mixin DocumentOrShadowRoot
interface mixin DocumentOrShadowRoot
collection = node . children
- - Returns the child elements.
+
- Returns the child elements.
element = node . firstElementChild
- - Returns the first child that is an element; otherwise null.
+
- Returns the first child that is an element; otherwise null.
element = node . lastElementChild
- - Returns the last child that is an element; otherwise null.
+
- Returns the last child that is an element; otherwise null.
node . prepend(nodes)
-
Inserts nodes before the first child of node, while
@@ -2044,24 +2376,24 @@
node tree are violated.
node . replaceChildren(nodes)
-
-
Replace all children of node with nodes,
+
Replace all children of node with nodes,
while replacing strings in nodes with equivalent Text nodes.
Throws a "HierarchyRequestError" DOMException if the constraints of
the node tree are violated.
node . querySelector(selectors)
- - Returns the first element that is a descendant of node that
+
- Returns the first element that is a descendant of node that
matches selectors.
node . querySelectorAll(selectors)
- - Returns all element descendants of node that
+
- Returns all element descendants of node that
match selectors.
- The children getter steps are to return an HTMLCollection collection rooted at this matching only element children.
+ The children getter steps are to return an HTMLCollection collection rooted at this matching only element children.
The firstElementChild getter steps are to return
-the first child that is an element; otherwise null.
+the first child that is an element; otherwise null.
The lastElementChild getter steps are to return
-the last child that is an element; otherwise null.
+the last child that is an element; otherwise null.
The childElementCount getter steps are to return
-the number of children of this that are elements.
+the number of children of this that are elements.
The prepend(nodes) method steps are:
-
@@ -2345,7 +2677,7 @@
A registered observer consists of an observer (a MutationObserver object) and options (a MutationObserverInit dictionary).
A transient registered observer is a registered observer that also consists of a source (a registered observer).
Transient registered observers are used to track mutations within
-a given node’s descendants after node has been removed so
+a given node’s descendants after node has been removed so
they do not get lost when subtree is set to true on node’s parent.
4.3.1. Interface MutationObserver
[Exposed =Window ]
@@ -2391,7 +2723,7 @@ <
can be used:
childList
- - Set to true if mutations to target’s children are to be observed.
+
- Set to true if mutations to target’s children are to be observed.
attributes
- Set to true if mutations to target’s attributes are to be observed. Can be omitted if
attributeOldValue or attributeFilter is
specified.
@@ -2399,7 +2731,7 @@ <
- Set to true if mutations to target’s data are to be observed. Can be omitted if
characterDataOldValue is specified.
subtree
- Set to true if mutations to not just target, but
- also target’s descendants are to be
+ also target’s descendants are to be
observed.
attributeOldValue
- Set to true if
attributes is true or omitted
@@ -2551,7 +2883,7 @@ type.
For "attributes", it is the element whose attribute changed. For
"characterData", it is the CharacterData node. For "childList",
- it is the node whose children changed.
+ it is the node whose children changed.
record . addedNodes
record . removedNodes
- Return the nodes added and removed
@@ -2761,9 +3093,9 @@
parentElement
- Returns the parent element.
node . hasChildNodes()
- - Returns whether node has children.
+
- Returns whether node has children.
node . childNodes
- - Returns the children.
+
- Returns the children.
node . firstChild
- Returns the first child.
node . lastChild
@@ -2784,8 +3116,8 @@ parentNode getter steps are to return this’s parent.
The parentElement getter steps are to return this’s parent element.
- The hasChildNodes() method steps are to return true if this has children; otherwise false.
- The childNodes getter steps are to return a NodeList rooted at this matching only children.
+ The hasChildNodes() method steps are to return true if this has children; otherwise false.
+ The childNodes getter steps are to return a NodeList rooted at this matching only children.
The firstChild getter steps are to return this’s first child.
The lastChild getter steps are to return this’s last child.
The previousSibling getter steps are to return this’s previous sibling.
@@ -2815,7 +3147,7 @@ ProcessingInstruction
Comment
-
-
Replace data with node this, offset 0, count this’s length, and data new value.
+ Replace data with node this, offset 0, count this’s length, and data new value.
- Any other node
-
Do nothing.
@@ -2858,7 +3190,7 @@ ProcessingInstruction
Comment
-
-
Replace data with node this, offset 0, count this’s length, and data the given value.
+ Replace data with node this, offset 0, count this’s length, and data the given value.
- Any other node
-
Do nothing.
@@ -2869,9 +3201,9 @@ empty exclusive Text nodes and concatenates the data of remaining contiguous exclusive Text nodes into the first of their nodes.
The normalize() method steps are to run these steps for
-each descendant exclusive Text node node of this:
+each descendant exclusive Text node node of this:
- - Let length be node’s length.
+
- Let length be node’s length.
- If length is zero, then remove node and continue with the
next exclusive
Text node, if any.
- Let data be the concatenation of the data of node’s contiguous exclusive
Text nodes (excluding itself), in tree order.
@@ -2890,7 +3222,7 @@ live range whose end node is currentNode’s parent and end offset is currentNode’s index, set its end node to node and its end offset to length.
-
-
Add currentNode’s length to length.
+ Add currentNode’s length to length.
-
Set currentNode to its next sibling.
@@ -2899,7 +3231,7 @@
node . cloneNode([deep = false])
- - Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
+
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
node . isEqualNode(otherNode)
- Returns whether node and otherNode have the same properties.
@@ -2951,7 +3283,7 @@
node document and document to copy, if copy is a document, and set copy’s node document to document otherwise.
- Run any cloning steps defined for node in other applicable specifications and pass copy, node, document and the clone children flag if set, as parameters.
-
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
+
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
- Return copy.
The cloneNode(deep) method steps are:
@@ -2983,8 +3315,8 @@ element, each attribute in its attribute list has an attribute that equals an attribute in B’s attribute list.
- - A and B have the same number of children.
-
- Each child of A equals the child of B at the identical index.
+
- A and B have the same number of children.
+
- Each child of A equals the child of B at the identical index.
The isEqualNode(otherNode) method steps are to
return true if otherNode is non-null and this equals otherNode; otherwise false.
@@ -3005,9 +3337,9 @@ Node . DOCUMENT_POSITION_FOLLOWING (4)
- Set when other is following node.
Node . DOCUMENT_POSITION_CONTAINS- Set when other is an ancestor of node.
+
- Set when other is an ancestor of node.
Node . DOCUMENT_POSITION_CONTAINED_BY- Set when other is a descendant of node.
+
- Set when other is a descendant of node.
node . contains(other)
- Returns true if other is an inclusive descendant of node;
@@ -3062,16 +3394,16 @@
Math. random() value can
be used.
-
-
If node1 is an ancestor of node2 and attr1 is null,
+
If node1 is an ancestor of node2 and attr1 is null,
or node1 is node2 and attr2 is non-null, then return the result of
adding DOCUMENT_POSITION_CONTAINS to DOCUMENT_POSITION_PRECEDING.
-
-
If node1 is a descendant of node2 and attr2 is null,
+
If node1 is a descendant of node2 and attr2 is null,
or node1 is node2 and attr1 is non-null, then return the result of
adding DOCUMENT_POSITION_CONTAINED_BY to DOCUMENT_POSITION_FOLLOWING.
-
If node1 is preceding node2, then return DOCUMENT_POSITION_PRECEDING.
- Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children,
+
Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children,
despite attributes not participating in a tree.
-
Return DOCUMENT_POSITION_FOLLOWING.
@@ -3194,10 +3526,10 @@ *" (U+002A), return a HTMLCollection rooted
- at root, whose filter matches only descendant elements.
+ at root, whose filter matches only descendant elements.
-
Otherwise, if root’s node document is an HTML document,
- return a HTMLCollection rooted at root, whose filter matches the following descendant elements:
+ return a HTMLCollection rooted at root, whose filter matches the following descendant elements:
-
Whose namespace is the HTML namespace and whose qualified name is qualifiedName, in ASCII lowercase.
@@ -3205,18 +3537,18 @@ namespace is not the HTML namespace and whose qualified name is qualifiedName.
-
-
Otherwise, return a HTMLCollection rooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
+ Otherwise, return a HTMLCollection rooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
When invoked with the same argument, and as long as root’s node document’s type has not changed, the same HTMLCollection object may be returned as returned by an earlier call.
The list of elements with namespace namespace and local name localName for a node root is the HTMLCollection returned by the following algorithm:
- If namespace is the empty string, set it to null.
-
- If both namespace and localName are "
*" (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements.
+ - If both namespace and localName are "
*" (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements.
- Otherwise, if namespace is "
*"
- (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose local name is localName.
+ (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose local name is localName.
- Otherwise, if localName is "
*"
- (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace.
- - Otherwise, return a
HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
+ (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace.
+ - Otherwise, return a
HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
When invoked with the same arguments, the same HTMLCollection object may be returned as returned by an earlier call.
The list of elements with class names classNames for a node root is the HTMLCollection returned by the following algorithm:
@@ -3225,7 +3557,7 @@ HTMLCollection.
-
Return a HTMLCollection rooted at root,
- whose filter matches descendant elements that have all their classes in classes.
+ whose filter matches descendant elements that have all their classes in classes.
The comparisons for the classes must be done in an ASCII case-insensitive manner if root’s node document’s mode is "quirks"; otherwise in an identical to manner.
When invoked with the same argument, the same HTMLCollection object may be returned as returned by an earlier call.
@@ -3333,15 +3665,15 @@ Returns the document element.
- collection = document .
getElementsByTagName(qualifiedName)
-
-
If qualifiedName is "*" returns a HTMLCollection of all descendant elements.
- Otherwise, returns a HTMLCollection of all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)
+ If qualifiedName is "*" returns a HTMLCollection of all descendant elements.
+ Otherwise, returns a HTMLCollection of all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)
- collection = document .
getElementsByTagNameNS(namespace, localName)
-
If namespace and localName are
- "
*" returns a HTMLCollection of all descendant elements.
- If only namespace is "*" returns a HTMLCollection of all descendant elements whose local name is localName.
- If only localName is "*" returns a HTMLCollection of all descendant elements whose namespace is namespace.
- Otherwise, returns a HTMLCollection of all descendant elements whose namespace is namespace and local name is localName.
+ "*" returns a HTMLCollection of all descendant elements.
+ If only namespace is "*" returns a HTMLCollection of all descendant elements whose local name is localName.
+ If only localName is "*" returns a HTMLCollection of all descendant elements whose namespace is namespace.
+ Otherwise, returns a HTMLCollection of all descendant elements whose namespace is namespace and local name is localName.
- collection = document .
getElementsByClassName(classNames)
- collection = element .
getElementsByClassName(classNames)
- Returns a
HTMLCollection of the elements in the object on which
@@ -3351,7 +3683,7 @@ classNames argument is interpreted as a
space-separated list of classes.
- The doctype getter steps are to return the child of this that is a doctype; otherwise null.
+ The doctype getter steps are to return the child of this that is a doctype; otherwise null.
The documentElement getter steps are to return this’s document element.
The getElementsByTagName(qualifiedName) method steps are to return the list of elements with qualified name qualifiedName for this.
Thus, in an HTML document, document. getElementsByTagName( "FOO" ) will match <FOO> elements that are not in the HTML namespace, and <foo> elements that are in
@@ -3481,7 +3813,7 @@
- clone = document . importNode(node [, deep = false])
-
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
+ Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
If node is a document or a shadow root, throws a
"NotSupportedError" DOMException.
- node = document .
adoptNode(node)
@@ -3590,7 +3922,7 @@
"devicemotionevent"
DeviceMotionEvent
- [DEVICE-ORIENTATION]
+ [DEVICE-ORIENTATION]
"deviceorientationevent"
DeviceOrientationEvent
@@ -3871,7 +4203,7 @@ In shadow-including tree order is shadow-including preorder, depth-first traversal of a node tree. Shadow-including preorder, depth-first traversal of a node tree tree is preorder, depth-first traversal of tree, with for each shadow host encountered in tree, shadow-including preorder, depth-first traversal of that element’s shadow root’s node tree just after it is encountered.
The shadow-including root of an object is its root’s host’s shadow-including root, if the
object’s root is a shadow root; otherwise its root.
- An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
+ An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
A shadow-including inclusive descendant is an object or one of its shadow-including descendants.
An object A is a shadow-including ancestor of an object B, if and only if B is a shadow-including descendant of A.
A shadow-including inclusive ancestor is an object or one of its shadow-including ancestors.
@@ -4067,7 +4399,7 @@ If result’s attribute list is not empty,
then throw a "NotSupportedError" DOMException.
-
-
If result has children, then throw a
+
If result has children, then throw a
"NotSupportedError" DOMException.
-
If result’s parent is not null, then throw a
@@ -4718,16 +5050,16 @@
data.
To replace data of node node with offset offset, count count, and data data, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- If offset plus count is greater than length, then set count to length minus offset.
-
Queue a mutation record of "characterData" for node with
null, null, node’s data, « », « », null, and null.
- - Insert data into node’s data after offset code units.
+
- Insert data into node’s data after offset code units.
- Let delete offset be offset + data’s length.
-
- Starting from delete offset code units, remove count code units from node’s data.
+
- Starting from delete offset code units, remove count code units from node’s data.
-
For each live range whose start node is node and start offset is greater than offset but less than or equal to offset plus count, set its start offset to offset.
-
@@ -4736,24 +5068,24 @@
For each live range whose start node is node and start offset is greater than offset plus count, increase its start offset by data’s length and decrease it by count.
-
For each live range whose end node is node and end offset is greater than offset plus count, increase its end offset by data’s length and decrease it by count.
- - If node’s parent is non-null, then run the children changed steps for node’s parent.
+
- If node’s parent is non-null, then run the children changed steps for node’s parent.
To substring data with node node, offset offset, and count count, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- If offset plus count is
- greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then
+ greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then
return.
-
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
+
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
- The data getter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.
- The length getter steps are to return this’s length.
+ The data getter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.
+ The length getter steps are to return this’s length.
The substringData(offset, count) method steps are to return the result of running substring data with node this,
offset offset, and count count.
The appendData(data) method steps are
-to replace data with node this, offset this’s length, count 0,
+to replace data with node this, offset this’s length, count 0,
and data data.
The insertData(offset, data) method steps are to replace data with node this, offset offset, count 0,
and data data.
@@ -4782,19 +5114,19 @@ contiguous exclusive Text nodes of a node node are node, node’s previous sibling exclusive Text node,
if any, and its contiguous exclusive Text nodes, and node’s next sibling exclusive Text node, if any, and its contiguous exclusive Text nodes, avoiding any duplicates.
The child text content of a node node is the concatenation of the data of all
-the Text node children of node, in tree order.
- The descendant text content of a node node is the concatenation of the data of all the Text node descendants of node, in tree order.
+the Text node children of node, in tree order.
+ The descendant text content of a node node is the concatenation of the data of all the Text node descendants of node, in tree order.
The new Text(data) constructor steps are to set this’s data to data and this’s node document to current global object’s associated Document.
To split a Text node node with offset offset, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- Let count be length minus offset.
- Let new data be the result of substringing data with node node, offset offset, and count count.
- Let new node be a new
Text node, with the same node document as node. Set new node’s data to new data.
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
-
If parent is not null, then:
@@ -4878,7 +5210,7 @@ 5.2. Boundary points
A boundary point is a tuple consisting of a node (a node) and an offset (a non-negative integer).
A correct boundary point’s offset will
-be between 0 and the boundary point’s node’s length, inclusive.
+be between 0 and the boundary point’s node’s length, inclusive.
The position of a boundary point (nodeA, offsetA) relative to a boundary point (nodeB, offsetB) is before, equal, or after, as returned by these steps:
-
@@ -4889,12 +5221,12 @@
following nodeB, then if the position of (nodeB, offsetB) relative to
(nodeA, offsetA) is before, return after, and if it is after, return before.
-
-
If nodeA is an ancestor of nodeB:
+ If nodeA is an ancestor of nodeB:
-
Let child be nodeB.
-
-
While child is not a child of nodeA, set child to its parent.
+ While child is not a child of nodeA, set child to its parent.
-
@@ -5003,7 +5335,7 @@ Algorithms that modify a tree (in particular the insert, remove, replace data, and split algorithms) modify live ranges associated with that tree.
The root of a live range is the root of its start node.
A node node is contained in a live range range if node’s root is range’s root, and (node, 0) is after range’s start, and
-(node, node’s length) is before range’s end.
+(node, node’s length) is before range’s end.
A node is partially contained in a live range if it’s an inclusive ancestor of the live range’s start node but not its end node, or vice versa.
Some facts to better understand these definitions:
@@ -5012,27 +5344,27 @@ live range consists of all contained nodes, plus possibly some of the contents of the start node and end node if those are Text, ProcessingInstruction, or Comment nodes.
-
The nodes that are contained in a live range will generally not be
- contiguous, because the parent of a contained node will not always be contained.
+ contiguous, because the parent of a contained node will not always be contained.
-
-
However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
+ However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
-
The start node and end node of a live range are
never contained within it.
-
The first contained node (if there are any) will
- always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
+ always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
-
There exists a partially contained node if and only if
the start node and end node are different.
-
The commonAncestorContainer attribute value is neither contained nor partially contained.
-
-
If the start node is an ancestor of the end node,
+
If the start node is an ancestor of the end node,
the common inclusive ancestor will be the start node. Exactly one
- of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
+ of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
-
If the start node is not an inclusive ancestor of the end node, nor vice versa, the common inclusive ancestor will be
- distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and
+ distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and
only if it lies between those two.
@@ -5048,12 +5380,12 @@
- container = range .
commonAncestorContainer
- Returns the node, furthest away from
- the document, that is an ancestor of both range’s start node and end node.
+ the document, that is an ancestor of both range’s start node and end node.
The commonAncestorContainer getter steps are:
- Let container be start node.
-
- While container is not an inclusive ancestor of end node, let container be container’s parent.
+
- While container is not an inclusive ancestor of end node, let container be container’s parent.
- Return container.
@@ -5062,7 +5394,7 @@ doctype, then throw an
"InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- Let bp be the boundary point (node, offset).
-
@@ -5089,14 +5421,14 @@
set the end of this to boundary point (node, offset).
The setStartBefore(node) method steps are:
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError" DOMException.
- Set the start of this to boundary point (parent, node’s index).
The setStartAfter(node) method steps are:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5104,14 +5436,14 @@
setEndBefore(node) method steps are:
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError" DOMException.
- Set the end of this to boundary point (parent, node’s index).
The setEndAfter(node) method steps are:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5121,7 +5453,7 @@
select a node node within a range range, run these steps:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5137,7 +5469,7 @@
doctype, throw an
"InvalidNodeTypeError" DOMException.
- - Let length be the length of node.
+
- Let length be the length of node.
- Set start to the boundary point (node, 0).
- Set end to the boundary point (node, length).
@@ -5188,19 +5520,19 @@ this’s start node, start offset, end node, and end offset, respectively.
- If original start node and original end node are the same, and they are a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original end offset minus original start offset, and data the empty string, and then return.
- - Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
+
- Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
- If original start node is an inclusive ancestor of original end node, set new node to original start node and new offset to original start offset.
-
Otherwise:
- Let reference node equal original start node.
-
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
+
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one
+ Set new node to the parent of reference node, and new offset to one
plus the index of reference node.
-
If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
- - If original start node is a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.
+ - If original start node is a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.
-
For each node in nodes to remove, in tree order, remove node.
- If original end node is a
Text, ProcessingInstruction, or Comment node, replace data with node original end node, offset 0, count original end offset and data the empty string.
@@ -5225,16 +5557,16 @@ inclusive ancestor of original end node, set common ancestor to
- its own parent.
+ its own parent.
- Let first partially contained child be null.
-
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
+
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
-
- If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
+ If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense.
- For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
- it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
- - Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
+ For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
+ it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
+
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
-
If any member of contained children is a doctype, then throw a
"HierarchyRequestError" DOMException.
@@ -5247,19 +5579,19 @@ parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
+ - While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one plus reference node’s index.
-
If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ Set new node to the parent of reference node, and new offset to one plus reference node’s index.
+ If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
-
If first partially contained child is a
Text, ProcessingInstruction, or Comment node:
In this case, first partially contained child is original start node.
- Let clone be a clone of original start node.
-
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
+
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
-
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
+
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
-
Otherwise, if first partially contained child is not
@@ -5270,7 +5602,7 @@
live range whose start is
(original start node, original start offset) and
whose end is
- (first partially contained child, first partially contained child’s length).
+ (first partially contained child, first partially contained child’s length).
-
Let subfragment be the result of extracting subrange.
- Append subfragment to clone.
@@ -5320,16 +5652,16 @@
inclusive ancestor of original end node, set common ancestor to its own parent.
+ - While common ancestor is not an inclusive ancestor of original end node, set common ancestor to its own parent.
- Let first partially contained child be null.
-
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
+
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
-
- If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
+ If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense.
- For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
- it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
- - Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
+ For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
+ it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
+
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
-
If any member of contained children is a doctype, then throw a
"HierarchyRequestError" DOMException.
@@ -5342,7 +5674,7 @@ In this case, first partially contained child is original start node.
- Let clone be a clone of original start node.
-
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
+
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
-
@@ -5354,7 +5686,7 @@
live range whose start is
(original start node, original start offset) and
whose end is
- (first partially contained child, first partially contained child’s length).
+ (first partially contained child, first partially contained child’s length).
-
Let subfragment be the result of cloning the contents of subrange.
- Append subfragment to clone.
@@ -5392,23 +5724,23 @@
cloning the contents of this.
To insert a node node into a live range range, run these steps:
- - If range’s start node is a
ProcessingInstruction or Comment node, is a Text node whose parent is null, or is node,
+ - If range’s start node is a
ProcessingInstruction or Comment node, is a Text node whose parent is null, or is node,
then throw a "HierarchyRequestError" DOMException.
- Let referenceNode be null.
- If range’s start node is a
Text node,
set referenceNode to that Text node.
- - Otherwise, set referenceNode to the child of start node whose index is start offset, and null if
- there is no such child.
-
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
+
- Otherwise, set referenceNode to the child of start node whose index is start offset, and null if
+ there is no such child.
+
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
- Ensure pre-insertion validity of node into parent before referenceNode.
- If range’s start node is a
Text node, set referenceNode to the result of splitting it with
offset range’s start offset.
- If node is referenceNode, set referenceNode to its next sibling.
-
-
-
- Let newOffset be parent’s length if referenceNode is null,
+
+
- Let newOffset be parent’s length if referenceNode is null,
and referenceNode’s index otherwise.
-
- Increase newOffset by node’s length if node is a
DocumentFragment node, and one otherwise.
+ - Increase newOffset by node’s length if node is a
DocumentFragment node, and one otherwise.
- Pre-insert node into parent before referenceNode.
-
If range is collapsed, then set range’s end to (parent, newOffset).
@@ -5425,7 +5757,7 @@ extracting this.
-
-
If newParent has children, then replace all with null
+
If newParent has children, then replace all with null
within newParent.
-
@@ -5451,7 +5783,7 @@
root is different from this’s root, return false.
- If node is a doctype, then throw an
"
InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- If (node, offset) is before start or after end, return false.
- Return true.
@@ -5461,7 +5793,7 @@
root is different from this’s root, then throw a "WrongDocumentError" DOMException.
- If node is a doctype, then throw an
"
InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- If (node, offset) is before start, return −1.
- If (node, offset) is after end, return 1.
@@ -5471,7 +5803,7 @@
intersectsNode(node) method steps are:
- If node’s root is different from this’s root, return false.
-
- Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, return true.
- Let offset be node’s index.
- If (parent, offset) is before end and (parent, offset plus 1) is after start, return true.
@@ -5566,7 +5898,7 @@
Steps are not terminated here.
-
-
Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
+ Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
The root getter steps are to return this’s root.
@@ -5649,7 +5981,7 @@ While node is non-null and is not this’s root:
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If node is non-null and filtering node within this returns FILTER_ACCEPT, then set this’s current to node and return node.
@@ -5686,7 +6018,7 @@
If sibling is non-null, then set node to sibling and break.
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, walker’s root, or walker’s current, then return null.
-
@@ -5727,7 +6059,7 @@
node’s previous sibling if type is previous.
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If node is null or walker’s root, then return
null.
@@ -5754,7 +6086,7 @@
Let result be the result of filtering node within this.
-
-
While result is not FILTER_REJECT and node has a child:
+ While result is not FILTER_REJECT and node has a child:
-
Set node to node’s last child.
@@ -5767,9 +6099,9 @@ Set sibling to node’s previous sibling.
-
-
If node is this’s root or node’s parent is null, then return null.
+ If node is this’s root or node’s parent is null, then return null.
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If the return value of filtering node within this is FILTER_ACCEPT, then set this’s current to node and return node.
@@ -5786,7 +6118,7 @@ While true:
-
-
While result is not FILTER_REJECT and node has a child:
+ While result is not FILTER_REJECT and node has a child:
-
Set node to its first child.
@@ -5809,7 +6141,7 @@
If sibling is non-null, then set node to sibling and break.
-
-
Set temporary to temporary’s parent.
+ Set temporary to temporary’s parent.
-
Set result to the result of filtering node within this.
@@ -7604,11 +7936,6 @@ upgrade an element
- valid custom element name
-
-
- [I18N-GLOSSARY] defines the following terms:
-
- - code units
-
-
[INFRA] defines the following terms:
@@ -7746,7 +8073,7 @@ N
- [CONSOLE]
- Dominic Farolino; Robert Kowalski; Terin Stock. Console Standard. Living Standard. URL: https://console.spec.whatwg.org/
- [DEVICE-ORIENTATION]
-
- Rich Tibbett; et al. DeviceOrientation Event Specification. URL: https://w3c.github.io/deviceorientation/
+
- Reilly Grant; Raphael Kubo da Costa; Marcos Caceres. Device Orientation and Motion. URL: https://w3c.github.io/deviceorientation/
- [DOM]
- Anne van Kesteren. DOM Standard. Living Standard. URL: https://dom.spec.whatwg.org/
- [ECMASCRIPT]
@@ -7757,8 +8084,6 @@
N
- Yoav Weiss. High Resolution Time. URL: https://w3c.github.io/hr-time/
- [HTML]
- Anne van Kesteren; et al. HTML Standard. Living Standard. URL: https://html.spec.whatwg.org/multipage/
-
- [I18N-GLOSSARY]
-
- Richard Ishida; Addison Phillips. Internationalization Glossary. URL: https://w3c.github.io/i18n-glossary/
- [INFRA]
- Anne van Kesteren; Domenic Denicola. Infra Standard. Living Standard. URL: https://infra.spec.whatwg.org/
- [SELECTORS4]
@@ -8488,25 +8813,25 @@
I
-
+
✔MDN
-
+
In all current engines.
- Firefox88+Safari15+Chrome93+
+ Firefox57+Safari11.1+Chrome66+
- Opera?Edge93+
+ Opera?Edge79+
- Edge (Legacy)?IENone
+ Edge (Legacy)16+IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.12.0+
+ Node.js15.0.0+
-
+
✔MDN
@@ -8524,21 +8849,21 @@ I
-
+
✔MDN
-
+
In all current engines.
- Firefox57+Safari11.1+Chrome66+
+ Firefox88+Safari15+Chrome93+
- Opera?Edge79+
+ Opera?Edge93+
- Edge (Legacy)16+IENone
+ Edge (Legacy)?IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.0.0+
+ Node.js15.12.0+
@@ -9115,7 +9440,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9144,7 +9469,7 @@ I
Element/previousElementSibling
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9714,7 +10039,7 @@ I
- DocumentFragment/childElementCount
+ DocumentFragment/childElementCount
In all current engines.
Firefox25+Safari9+Chrome29+
@@ -9730,7 +10055,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10186,7 +10511,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10199,7 +10524,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -10324,7 +10649,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10395,7 +10720,7 @@ I
DocumentFragment/querySelector
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10424,7 +10749,7 @@ I
DocumentFragment/querySelectorAll
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10534,6 +10859,22 @@ I
+
+ ✔MDN
+
+ DocumentFragment/getElementById
+ In all current engines.
+
+ Firefox28+Safari9+Chrome36+
+
+ Opera?Edge79+
+
+ Edge (Legacy)17+IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
@@ -10550,6 +10891,54 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
✔MDN
@@ -11369,7 +11758,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -11690,10 +12079,154 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+ MutationRecord/attributeNamespace
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+ MutationRecord/previousSibling
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
-
+
In all current engines.
Firefox14+Safari7+Chrome16+
@@ -11853,7 +12386,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1.1+Chrome1+
@@ -11920,7 +12453,7 @@ I
In all current engines.
- Firefox1+Safari4+Chrome1+
+ Firefox1+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -12013,7 +12546,7 @@ I
✔MDN
-
+
In all current engines.
Firefox49+Safari10+Chrome51+
@@ -12077,7 +12610,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -12285,7 +12818,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1.1+Chrome1+
@@ -12333,7 +12866,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12397,7 +12930,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12445,7 +12978,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12458,26 +12991,52 @@ I
-
+
✔MDN
-
+
+ In all current engines.
+
+ Firefox50+Safari10+Chrome51+
+
+ Opera?Edge79+
+
+ Edge (Legacy)16+IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+ Reference/Global_Objects/Array/@@iterator
+ In all current engines.
+
+ Firefox36+Safari10+Chrome51+
+
+ Opera?Edge79+
+
+ Edge (Legacy)?IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
In all current engines.
Firefox1+Safari1+Chrome1+
- Opera12.1+Edge79+
+ Opera8+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+
-
+
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -12490,19 +13049,19 @@ I
-
+
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
- Opera8+Edge79+
+ Opera12.1+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
@@ -12969,6 +13528,22 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox92+Safari16.4+Chrome86+
+
+ Opera?Edge86+
+
+ Edge (Legacy)?IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
@@ -13055,7 +13630,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -13084,7 +13659,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13116,7 +13691,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13132,7 +13707,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13148,7 +13723,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13164,7 +13739,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13180,7 +13755,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13196,7 +13771,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13212,7 +13787,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13289,6 +13864,22 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IENone
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
✔MDN
@@ -13788,7 +14379,7 @@ I
"56ad2aed": {"dfnID":"56ad2aed","dfnText":"insert","external":true,"refSections":[{"refs":[{"id":"ref-for-list-insert"}],"title":"4.2.3. Mutation algorithms"}],"url":"https://infra.spec.whatwg.org/#list-insert"},
"5832b143": {"dfnID":"5832b143","dfnText":"name","external":true,"refSections":[{"refs":[{"id":"ref-for-name"}],"title":"4.5. Interface Document"}],"url":"https://encoding.spec.whatwg.org/#name"},
"583654a9": {"dfnID":"583654a9","dfnText":"InvalidCharacterError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidcharactererror"}],"title":"1.4. Namespaces"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460"},{"id":"ref-for-invalidcharactererror\u2461"},{"id":"ref-for-invalidcharactererror\u2462"},{"id":"ref-for-invalidcharactererror\u2463"},{"id":"ref-for-invalidcharactererror\u2464"},{"id":"ref-for-invalidcharactererror\u2465"},{"id":"ref-for-invalidcharactererror\u2466"},{"id":"ref-for-invalidcharactererror\u2467"},{"id":"ref-for-invalidcharactererror\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u24ea"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2460"},{"id":"ref-for-invalidcharactererror\u2460\u2461"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2462"},{"id":"ref-for-invalidcharactererror\u2460\u2463"},{"id":"ref-for-invalidcharactererror\u2460\u2464"},{"id":"ref-for-invalidcharactererror\u2460\u2465"},{"id":"ref-for-invalidcharactererror\u2460\u2466"},{"id":"ref-for-invalidcharactererror\u2460\u2467"},{"id":"ref-for-invalidcharactererror\u2460\u2468"},{"id":"ref-for-invalidcharactererror\u2461\u24ea"}],"title":"7.1. Interface DOMTokenList"}],"url":"https://webidl.spec.whatwg.org/#invalidcharactererror"},
-"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"},
+"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"},{"id":"ref-for-code-unit\u2462"},{"id":"ref-for-code-unit\u2463"},{"id":"ref-for-code-unit\u2464"},{"id":"ref-for-code-unit\u2465"},{"id":"ref-for-code-unit\u2466"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"},
"5991ccfb": {"dfnID":"5991ccfb","dfnText":"relevant realm","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-relevant-realm"}],"title":"2.10. Firing events"}],"url":"https://html.spec.whatwg.org/multipage/webappapis.html#concept-relevant-realm"},
"5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"},{"id":"ref-for-window\u2461"}],"title":"2.3. Legacy extensions to the Window interface"},{"refs":[{"id":"ref-for-window\u2462"},{"id":"ref-for-window\u2463"},{"id":"ref-for-window\u2464"},{"id":"ref-for-window\u2465"}],"title":"2.9. Dispatching events"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"},
"5e0d3b02": {"dfnID":"5e0d3b02","dfnText":"match a selector against an element","external":true,"refSections":[{"refs":[{"id":"ref-for-match-a-selector-against-an-element"},{"id":"ref-for-match-a-selector-against-an-element\u2460"}],"title":"4.9. Interface Element"}],"url":"https://drafts.csswg.org/selectors-4/#match-a-selector-against-an-element"},
@@ -13813,7 +14404,6 @@ I
"797018a7": {"dfnID":"797018a7","dfnText":"InvalidStateError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidstateerror"}],"title":"2.7. Interface EventTarget"},{"refs":[{"id":"ref-for-invalidstateerror\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-invalidstateerror\u2461"}],"title":"6. Traversal"}],"url":"https://webidl.spec.whatwg.org/#invalidstateerror"},
"79e2abd0": {"dfnID":"79e2abd0","dfnText":"look up a custom element definition","external":true,"refSections":[{"refs":[{"id":"ref-for-look-up-a-custom-element-definition"},{"id":"ref-for-look-up-a-custom-element-definition\u2460"}],"title":"4.9. Interface Element"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#look-up-a-custom-element-definition"},
"7b0d918d": {"dfnID":"7b0d918d","dfnText":"break","external":true,"refSections":[{"refs":[{"id":"ref-for-iteration-break"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-iteration-break\u2460"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-iteration-break\u2461"},{"id":"ref-for-iteration-break\u2462"}],"title":"6.2. Interface TreeWalker"}],"url":"https://infra.spec.whatwg.org/#iteration-break"},
-"7cf8cfc4": {"dfnID":"7cf8cfc4","dfnText":"code units","external":true,"refSections":[{"refs":[{"id":"ref-for-def_code_unit"},{"id":"ref-for-def_code_unit\u2460"},{"id":"ref-for-def_code_unit\u2461"},{"id":"ref-for-def_code_unit\u2462"},{"id":"ref-for-def_code_unit\u2463"}],"title":"4.10. Interface CharacterData"}],"url":"https://w3c.github.io/i18n-glossary/#def_code_unit"},
"7f9469b5": {"dfnID":"7f9469b5","dfnText":"ascii case-insensitive","external":true,"refSections":[{"refs":[{"id":"ref-for-ascii-case-insensitive"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2460"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2461"}],"title":"4.9. Interface Element"}],"url":"https://infra.spec.whatwg.org/#ascii-case-insensitive"},
"85a289c7": {"dfnID":"85a289c7","dfnText":"svg namespace","external":true,"refSections":[{"refs":[{"id":"ref-for-svg-namespace"}],"title":"4.5.1. Interface DOMImplementation"}],"url":"https://infra.spec.whatwg.org/#svg-namespace"},
"8611edf0": {"dfnID":"8611edf0","dfnText":"InUseAttributeError","external":true,"refSections":[{"refs":[{"id":"ref-for-inuseattributeerror"}],"title":"4.9. Interface Element"}],"url":"https://webidl.spec.whatwg.org/#inuseattributeerror"},
@@ -13999,7 +14589,7 @@ I
"concept-node-filter": {"dfnID":"concept-node-filter","dfnText":"filter","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-filter"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-node-filter\u2460"},{"id":"ref-for-concept-node-filter\u2461"},{"id":"ref-for-concept-node-filter\u2462"},{"id":"ref-for-concept-node-filter\u2463"},{"id":"ref-for-concept-node-filter\u2464"},{"id":"ref-for-concept-node-filter\u2465"},{"id":"ref-for-concept-node-filter\u2466"},{"id":"ref-for-concept-node-filter\u2467"},{"id":"ref-for-concept-node-filter\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-node-filter"},
"concept-node-insert": {"dfnID":"concept-node-insert","dfnText":"insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert"},{"id":"ref-for-concept-node-insert\u2460"},{"id":"ref-for-concept-node-insert\u2461"},{"id":"ref-for-concept-node-insert\u2462"},{"id":"ref-for-concept-node-insert\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-insert\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-insert\u2465"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-insert\u2466"}],"title":"5.5. Interface Range"}],"url":"#concept-node-insert"},
"concept-node-insert-ext": {"dfnID":"concept-node-insert-ext","dfnText":"insertion steps","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert-ext"}],"title":"4.2.3. Mutation algorithms"}],"url":"#concept-node-insert-ext"},
-"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"},{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2463"},{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2468"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"5.2. Boundary points"}],"url":"#concept-node-length"},
+"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"},{"id":"ref-for-concept-node-length\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"},{"id":"ref-for-concept-node-length\u2468"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2461"},{"id":"ref-for-concept-node-length\u2460\u2462"},{"id":"ref-for-concept-node-length\u2460\u2463"},{"id":"ref-for-concept-node-length\u2460\u2464"},{"id":"ref-for-concept-node-length\u2460\u2465"},{"id":"ref-for-concept-node-length\u2460\u2466"},{"id":"ref-for-concept-node-length\u2460\u2467"},{"id":"ref-for-concept-node-length\u2460\u2468"},{"id":"ref-for-concept-node-length\u2461\u24ea"},{"id":"ref-for-concept-node-length\u2461\u2460"},{"id":"ref-for-concept-node-length\u2461\u2461"},{"id":"ref-for-concept-node-length\u2461\u2462"},{"id":"ref-for-concept-node-length\u2461\u2463"}],"title":"5.5. Interface Range"}],"url":"#concept-node-length"},
"concept-node-pre-insert": {"dfnID":"concept-node-pre-insert","dfnText":"pre-insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-insert"},{"id":"ref-for-concept-node-pre-insert\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2461"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2462"},{"id":"ref-for-concept-node-pre-insert\u2463"},{"id":"ref-for-concept-node-pre-insert\u2464"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2465"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2466"}],"title":"4.7. Interface DocumentFragment"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2467"},{"id":"ref-for-concept-node-pre-insert\u2468"},{"id":"ref-for-concept-node-pre-insert\u2460\u24ea"},{"id":"ref-for-concept-node-pre-insert\u2460\u2460"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2460\u2461"}],"title":"5.5. Interface Range"}],"url":"#concept-node-pre-insert"},
"concept-node-pre-remove": {"dfnID":"concept-node-pre-remove","dfnText":"pre-remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-remove"}],"title":"4.4. Interface Node"}],"url":"#concept-node-pre-remove"},
"concept-node-remove": {"dfnID":"concept-node-remove","dfnText":"remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-remove"},{"id":"ref-for-concept-node-remove\u2460"},{"id":"ref-for-concept-node-remove\u2461"},{"id":"ref-for-concept-node-remove\u2462"},{"id":"ref-for-concept-node-remove\u2463"},{"id":"ref-for-concept-node-remove\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-remove\u2465"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-remove\u2466"},{"id":"ref-for-concept-node-remove\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-remove\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u24ea"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u2460"},{"id":"ref-for-concept-node-remove\u2460\u2461"},{"id":"ref-for-concept-node-remove\u2460\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-node-remove"},
@@ -14050,9 +14640,9 @@ I
"concept-traverse-children": {"dfnID":"concept-traverse-children","dfnText":"traverse children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-children"},{"id":"ref-for-concept-traverse-children\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-children"},
"concept-traverse-siblings": {"dfnID":"concept-traverse-siblings","dfnText":"traverse siblings","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-siblings"},{"id":"ref-for-concept-traverse-siblings\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-siblings"},
"concept-tree": {"dfnID":"concept-tree","dfnText":"tree","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree"},{"id":"ref-for-concept-tree\u2460"},{"id":"ref-for-concept-tree\u2461"},{"id":"ref-for-concept-tree\u2462"},{"id":"ref-for-concept-tree\u2463"},{"id":"ref-for-concept-tree\u2464"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree\u2465"},{"id":"ref-for-concept-tree\u2466"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree\u2467"},{"id":"ref-for-concept-tree\u2468"},{"id":"ref-for-concept-tree\u2460\u24ea"},{"id":"ref-for-concept-tree\u2460\u2460"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2461"},{"id":"ref-for-concept-tree\u2460\u2462"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree\u2460\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2464"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2465"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2466"},{"id":"ref-for-concept-tree\u2460\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2468"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-concept-tree\u2461\u24ea"},{"id":"ref-for-concept-tree\u2461\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree\u2461\u2461"}],"title":"6. Traversal"}],"url":"#concept-tree"},
-"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2461"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2462"},{"id":"ref-for-concept-tree-ancestor\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2465"},{"id":"ref-for-concept-tree-ancestor\u2466"},{"id":"ref-for-concept-tree-ancestor\u2467"},{"id":"ref-for-concept-tree-ancestor\u2468"},{"id":"ref-for-concept-tree-ancestor\u2460\u24ea"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-ancestor"},
-"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"},{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"},{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"},{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"},{"id":"ref-for-concept-tree-child\u2462\u24ea"},{"id":"ref-for-concept-tree-child\u2462\u2460"},{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2463"},{"id":"ref-for-concept-tree-child\u2463\u2464"},{"id":"ref-for-concept-tree-child\u2463\u2465"},{"id":"ref-for-concept-tree-child\u2463\u2466"},{"id":"ref-for-concept-tree-child\u2463\u2467"},{"id":"ref-for-concept-tree-child\u2463\u2468"},{"id":"ref-for-concept-tree-child\u2464\u24ea"},{"id":"ref-for-concept-tree-child\u2464\u2460"},{"id":"ref-for-concept-tree-child\u2464\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2462"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2463"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2465"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2466"},{"id":"ref-for-concept-tree-child\u2464\u2467"},{"id":"ref-for-concept-tree-child\u2464\u2468"},{"id":"ref-for-concept-tree-child\u2465\u24ea"},{"id":"ref-for-concept-tree-child\u2465\u2460"},{"id":"ref-for-concept-tree-child\u2465\u2461"},{"id":"ref-for-concept-tree-child\u2465\u2462"},{"id":"ref-for-concept-tree-child\u2465\u2463"},{"id":"ref-for-concept-tree-child\u2465\u2464"},{"id":"ref-for-concept-tree-child\u2465\u2465"},{"id":"ref-for-concept-tree-child\u2465\u2466"},{"id":"ref-for-concept-tree-child\u2465\u2467"},{"id":"ref-for-concept-tree-child\u2465\u2468"},{"id":"ref-for-concept-tree-child\u2466\u24ea"},{"id":"ref-for-concept-tree-child\u2466\u2460"},{"id":"ref-for-concept-tree-child\u2466\u2461"},{"id":"ref-for-concept-tree-child\u2466\u2462"},{"id":"ref-for-concept-tree-child\u2466\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2466\u2464"},{"id":"ref-for-concept-tree-child\u2466\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"},
-"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"},{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462"},{"id":"ref-for-concept-tree-descendant\u2463"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2464"},{"id":"ref-for-concept-tree-descendant\u2465"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2466"},{"id":"ref-for-concept-tree-descendant\u2467"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u24ea"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u2460"},{"id":"ref-for-concept-tree-descendant\u2460\u2461"},{"id":"ref-for-concept-tree-descendant\u2460\u2462"},{"id":"ref-for-concept-tree-descendant\u2460\u2463"},{"id":"ref-for-concept-tree-descendant\u2460\u2464"},{"id":"ref-for-concept-tree-descendant\u2460\u2465"},{"id":"ref-for-concept-tree-descendant\u2460\u2466"},{"id":"ref-for-concept-tree-descendant\u2460\u2467"},{"id":"ref-for-concept-tree-descendant\u2460\u2468"},{"id":"ref-for-concept-tree-descendant\u2461\u24ea"},{"id":"ref-for-concept-tree-descendant\u2461\u2460"},{"id":"ref-for-concept-tree-descendant\u2461\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461\u2462"},{"id":"ref-for-concept-tree-descendant\u2461\u2463"},{"id":"ref-for-concept-tree-descendant\u2461\u2464"},{"id":"ref-for-concept-tree-descendant\u2461\u2465"},{"id":"ref-for-concept-tree-descendant\u2461\u2466"},{"id":"ref-for-concept-tree-descendant\u2461\u2467"},{"id":"ref-for-concept-tree-descendant\u2461\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u24ea"}],"title":"4.8. Interface ShadowRoot"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2460"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2461"},{"id":"ref-for-concept-tree-descendant\u2462\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-descendant"},
+"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"2.2. Interface Event"}],"url":"#concept-tree-ancestor"},
+"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"},{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"},{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"},{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u24ea"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"},{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"},{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"},{"id":"ref-for-concept-tree-child\u2463\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"},
+"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"4.3. Mutation observers"}],"url":"#concept-tree-descendant"},
"concept-tree-first-child": {"dfnID":"concept-tree-first-child","dfnText":"first child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-first-child"},{"id":"ref-for-concept-tree-first-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2461"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2462"},{"id":"ref-for-concept-tree-first-child\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2464"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2465"},{"id":"ref-for-concept-tree-first-child\u2466"},{"id":"ref-for-concept-tree-first-child\u2467"},{"id":"ref-for-concept-tree-first-child\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-first-child"},
"concept-tree-following": {"dfnID":"concept-tree-following","dfnText":"following","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-following"},{"id":"ref-for-concept-tree-following\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-following\u2461"},{"id":"ref-for-concept-tree-following\u2462"},{"id":"ref-for-concept-tree-following\u2463"},{"id":"ref-for-concept-tree-following\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-following\u2465"},{"id":"ref-for-concept-tree-following\u2466"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2467"},{"id":"ref-for-concept-tree-following\u2468"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2461"},{"id":"ref-for-concept-tree-following\u2460\u2462"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-following"},
"concept-tree-host-including-inclusive-ancestor": {"dfnID":"concept-tree-host-including-inclusive-ancestor","dfnText":"host-including inclusive ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor"},{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2461"}],"title":"4.7. Interface DocumentFragment"}],"url":"#concept-tree-host-including-inclusive-ancestor"},
@@ -14063,7 +14653,7 @@ I
"concept-tree-last-child": {"dfnID":"concept-tree-last-child","dfnText":"last child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-last-child"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2461"},{"id":"ref-for-concept-tree-last-child\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2463"},{"id":"ref-for-concept-tree-last-child\u2464"},{"id":"ref-for-concept-tree-last-child\u2465"},{"id":"ref-for-concept-tree-last-child\u2466"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-last-child"},
"concept-tree-next-sibling": {"dfnID":"concept-tree-next-sibling","dfnText":"next sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-next-sibling"},{"id":"ref-for-concept-tree-next-sibling\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2463"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2464"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2467"},{"id":"ref-for-concept-tree-next-sibling\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2464"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2467"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-next-sibling"},
"concept-tree-order": {"dfnID":"concept-tree-order","dfnText":"tree order","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-order"},{"id":"ref-for-concept-tree-order\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-order\u2461"},{"id":"ref-for-concept-tree-order\u2462"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-order\u2463"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-order\u2464"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-order\u2465"}],"title":"4.2.2.1. Slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2466"},{"id":"ref-for-concept-tree-order\u2467"},{"id":"ref-for-concept-tree-order\u2468"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u24ea"}],"title":"4.2.2.4. Assigning slottables and slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2460"},{"id":"ref-for-concept-tree-order\u2460\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2462"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2463"}],"title":"4.2.10. Old-style collections: NodeList and HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2464"}],"title":"4.2.10.1. Interface NodeList"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2465"},{"id":"ref-for-concept-tree-order\u2460\u2466"}],"title":"4.2.10.2. Interface HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2467"},{"id":"ref-for-concept-tree-order\u2460\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2460"},{"id":"ref-for-concept-tree-order\u2461\u2461"},{"id":"ref-for-concept-tree-order\u2461\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2463"},{"id":"ref-for-concept-tree-order\u2461\u2464"},{"id":"ref-for-concept-tree-order\u2461\u2465"},{"id":"ref-for-concept-tree-order\u2461\u2466"},{"id":"ref-for-concept-tree-order\u2461\u2467"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2468"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-order"},
-"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"},{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2466"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"},{"id":"ref-for-concept-tree-parent\u2464\u2467"},{"id":"ref-for-concept-tree-parent\u2464\u2468"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u24ea"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"},{"id":"ref-for-concept-tree-parent\u2465\u2464"},{"id":"ref-for-concept-tree-parent\u2465\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"},
+"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"},{"id":"ref-for-concept-tree-parent\u2462\u2466"},{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2467"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2468"},{"id":"ref-for-concept-tree-parent\u2465\u24ea"},{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"},
"concept-tree-participate": {"dfnID":"concept-tree-participate","dfnText":"participates","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-participate"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-participate\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-participate\u2461"},{"id":"ref-for-concept-tree-participate\u2462"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-participate\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-participate\u2464"}],"title":"4.4. Interface Node"}],"url":"#concept-tree-participate"},
"concept-tree-preceding": {"dfnID":"concept-tree-preceding","dfnText":"preceding","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-preceding"},{"id":"ref-for-concept-tree-preceding\u2460"},{"id":"ref-for-concept-tree-preceding\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2462"},{"id":"ref-for-concept-tree-preceding\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2464"},{"id":"ref-for-concept-tree-preceding\u2465"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2466"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2467"},{"id":"ref-for-concept-tree-preceding\u2468"},{"id":"ref-for-concept-tree-preceding\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2461"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-preceding"},
"concept-tree-previous-sibling": {"dfnID":"concept-tree-previous-sibling","dfnText":"previous sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-previous-sibling"},{"id":"ref-for-concept-tree-previous-sibling\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2463"},{"id":"ref-for-concept-tree-previous-sibling\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2465"},{"id":"ref-for-concept-tree-previous-sibling\u2466"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2467"},{"id":"ref-for-concept-tree-previous-sibling\u2468"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2460\u24ea"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2462"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-previous-sibling"},
@@ -15204,6 +15794,63 @@ I
}
}
+
-
-
-
+
-
-
-
+
Encoding
Living Standard — Last Updated
@@ -70,7 +402,7 @@ Encoding
- Participate:
-
I
"31559e1b": {"dfnID":"31559e1b","dfnText":"define(name, constructor, options)","external":true,"refSections":[{"refs":[{"id":"ref-for-dom-customelementregistry-define"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-dom-customelementregistry-define\u2460"},{"id":"ref-for-dom-customelementregistry-define\u2461"}],"title":"1.2. Changes to custom element definition"},{"refs":[{"id":"ref-for-dom-customelementregistry-define\u2462"}],"title":"2.1. Introduction"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#dom-customelementregistry-define"},
"3fca5a9e": {"dfnID":"3fca5a9e","dfnText":"map","external":true,"refSections":[{"refs":[{"id":"ref-for-ordered-map"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-ordered-map\u2460"}],"title":"1.1.2. Defining per-instance custom element semantics"}],"url":"https://infra.spec.whatwg.org/#ordered-map"},
"5889f566": {"dfnID":"5889f566","dfnText":"accessibility tree","external":true,"refSections":[{"refs":[{"id":"ref-for-dfn-accessibility-tree"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"}],"url":"https://www.w3.org/TR/core-aam-1.1/#dfn-accessibility-tree"},
+"5ab7b520": {"dfnID":"5ab7b520","dfnText":"reflect","external":true,"refSections":[{"refs":[{"id":"ref-for-reflect"}],"title":"2.1. Introduction"}],"url":"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect"},
"7e4580af": {"dfnID":"7e4580af","dfnText":"ElementDefinitionOptions","external":true,"refSections":[{"refs":[{"id":"ref-for-elementdefinitionoptions"},{"id":"ref-for-elementdefinitionoptions\u2460"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-elementdefinitionoptions\u2461"},{"id":"ref-for-elementdefinitionoptions\u2462"}],"title":"1.2. Changes to custom element definition"},{"refs":[{"id":"ref-for-elementdefinitionoptions\u2463"}],"title":"2. ARIA semantic precedence between ElementDefinitionOptions, ElementInternals and ARIA properties"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#elementdefinitionoptions"},
"81c9c6df": {"dfnID":"81c9c6df","dfnText":"accessible object","external":true,"refSections":[{"refs":[{"id":"ref-for-dfn-accessible-object"},{"id":"ref-for-dfn-accessible-object\u2460"}],"title":"1.1.1. Defining custom element semantics as part of the custom element definition"},{"refs":[{"id":"ref-for-dfn-accessible-object\u2461"}],"title":"1.1.2. Defining per-instance custom element semantics"}],"url":"https://www.w3.org/TR/core-aam-1.1/#dfn-accessible-object"},
"87f26218": {"dfnID":"87f26218","dfnText":"AriaAttributes","external":true,"refSections":[{"refs":[{"id":"ref-for-idl-def-ariaattributes"},{"id":"ref-for-idl-def-ariaattributes\u2460"},{"id":"ref-for-idl-def-ariaattributes\u2461"},{"id":"ref-for-idl-def-ariaattributes\u2462"}],"title":"1.2. Changes to custom element definition"}],"url":"https://www.w3.org/TR/wai-aria-1.2/#idl-def-ariaattributes"},
@@ -1795,6 +1782,7 @@ I
"#semantic-properties": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"aom-aria","spec":"aom-aria-1","status":"local","text":"semantic properties","type":"dfn","url":"#semantic-properties"},
"https://dom.spec.whatwg.org/#concept-element-custom": {"export":true,"for_":["Element"],"level":"1","normative":true,"shortname":"dom","spec":"dom","status":"current","text":"custom","type":"dfn","url":"https://dom.spec.whatwg.org/#concept-element-custom"},
"https://dom.spec.whatwg.org/#element": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"dom","spec":"dom","status":"current","text":"Element","type":"interface","url":"https://dom.spec.whatwg.org/#element"},
+"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"html","spec":"html","status":"current","text":"reflect","type":"dfn","url":"https://html.spec.whatwg.org/multipage/common-dom-interfaces.html#reflect"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element": {"export":true,"for_":[],"level":"1","normative":true,"shortname":"html","spec":"html","status":"current","text":"custom element","type":"dfn","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element-definition": {"export":true,"for_":[],"level":"","normative":true,"shortname":"html","spec":"html","status":"anchor-block","text":"custom element definition","type":"dfn","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#custom-element-definition"},
"https://html.spec.whatwg.org/multipage/custom-elements.html#customelementregistry": {"export":true,"for_":[],"level":"","normative":true,"shortname":"html","spec":"html","status":"anchor-block","text":"CustomElementRegistry","type":"interface","url":"https://html.spec.whatwg.org/multipage/custom-elements.html#customelementregistry"},
diff --git a/tests/github/WICG/aom/spec/input-events.html b/tests/github/WICG/aom/spec/input-events.html
index 8e7848e414..07757b6282 100644
--- a/tests/github/WICG/aom/spec/input-events.html
+++ b/tests/github/WICG/aom/spec/input-events.html
@@ -5,8 +5,8 @@
AOM Input Event Types
-
+
+
-
+
+
-
+
-
-
-
+
Compatibility
Living Standard — Last Updated
@@ -69,7 +401,7 @@ Compatibility
- Participate:
-
- GitHub whatwg/compat (new issue, open issues)
+
- GitHub whatwg/compat (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/compat/commits
@@ -287,7 +619,7 @@
animation-name
-webkit-animation-duration
- animation-duration
+ animation-duration
-webkit-animation-timing-function
animation-timing-function
@@ -541,7 +873,7 @@ -webkit-background-clip property—when its value is text—creates a background clipping region from the outer text stroke of the foreground text (including alpha transparency).
-
The -webkit-background-clip property is a simple alias of the background-clip property for all other <box> values.
+ The -webkit-background-clip property is a simple alias of the background-clip property for all other <box> values.
Note that the root element has a different background painting area, and thus the -webkit-background-clip property has no effect when specified on it. See the backgrounds of special elements.
- border-box
@@ -985,17 +1317,20 @@
animation
- animation-delay
- animation-direction
-
- animation-duration
- animation-fill-mode
- animation-iteration-count
- animation-name
- animation-play-state
- animation-timing-function
+
-
+ [CSS-ANIMATIONS-2] defines the following terms:
+
+ - animation-duration
+
-
[CSS-BACKGROUNDS-3] defines the following terms:
- - <box>
- <line-width>
- background-clip
- background-origin
@@ -1007,6 +1342,11 @@
border-top-right-radius
- box-shadow
+ -
+ [CSS-BOX-4] defines the following terms:
+
+ - <box>
+
-
[CSS-COLOR-4] defines the following terms:
@@ -1173,25 +1513,29 @@ N
- [CSS-ALIGN-3]
- Elika Etemad; Tab Atkins Jr.. CSS Box Alignment Module Level 3. URL: https://drafts.csswg.org/css-align/
- [CSS-ANIMATIONS-1]
-
- Dean Jackson; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- David Baron; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- [CSS-ANIMATIONS-2]
+
- David Baron; Brian Birtles. CSS Animations Level 2. URL: https://drafts.csswg.org/css-animations-2/
- [CSS-BACKGROUNDS-3]
-
- Bert Bos; Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- [CSS-BOX-4]
+
- Elika Etemad. CSS Box Model Module Level 4. URL: https://drafts.csswg.org/css-box-4/
- [CSS-COLOR-4]
-
- Tab Atkins Jr.; Chris Lilley; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color/
+
- Chris Lilley; Tab Atkins Jr.; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color-4/
- [CSS-COLOR-5]
- Chris Lilley; et al. CSS Color Module Level 5. URL: https://drafts.csswg.org/css-color-5/
- [CSS-CONDITIONAL-3]
-
- David Baron; Elika Etemad; Chris Lilley. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
+
- Chris Lilley; David Baron; Elika Etemad. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
- [CSS-DISPLAY-3]
-
- Tab Atkins Jr.; Elika Etemad. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
+
- Elika Etemad; Tab Atkins Jr.. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
- [CSS-DISPLAY-4]
-
- CSS Display Module Level 4 URL: https://drafts.csswg.org/css-display-4/
+
- CSS Display Module Level 4. Editor's Draft. URL: https://drafts.csswg.org/css-display-4/
- [CSS-FLEXBOX-1]
- Tab Atkins Jr.; et al. CSS Flexible Box Layout Module Level 1. URL: https://drafts.csswg.org/css-flexbox-1/
- [CSS-MASKING-1]
- Dirk Schulze; Brian Birtles; Tab Atkins Jr.. CSS Masking Module Level 1. URL: https://drafts.fxtf.org/css-masking-1/
- [CSS-SIZE-ADJUST-1]
-
- CSS Mobile Text Size Adjustment Module Level 1 URL: https://drafts.csswg.org/css-size-adjust-1/
+
- CSS Mobile Text Size Adjustment Module Level 1. Editor's Draft. URL: https://drafts.csswg.org/css-size-adjust-1/
- [CSS-SIZING-3]
- Tab Atkins Jr.; Elika Etemad. CSS Box Sizing Module Level 3. URL: https://drafts.csswg.org/css-sizing-3/
- [CSS-TRANSFORMS-1]
@@ -1695,6 +2039,7 @@
I
"-webkit-repeating-linear-gradient": {"dfnID":"-webkit-repeating-linear-gradient","dfnText":"-webkit-repeating-linear-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-linear-gradient"},
"-webkit-repeating-radial-gradient": {"dfnID":"-webkit-repeating-radial-gradient","dfnText":"-webkit-repeating-radial-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-radial-gradient"},
"0460a504": {"dfnID":"0460a504","dfnText":"resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"},
+"06a8cc3f": {"dfnID":"06a8cc3f","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-2/#propdef-animation-duration"},
"09f2cf3e": {"dfnID":"09f2cf3e","dfnText":"transform-origin","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform-origin"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform-origin"},
"0bf92d15": {"dfnID":"0bf92d15","dfnText":"mask-composite","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-composite"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-composite"},
"11151628": {"dfnID":"11151628","dfnText":"mask-clip","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-clip"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-clip"},
@@ -1710,7 +2055,6 @@ I
"280c9a03": {"dfnID":"280c9a03","dfnText":"border-bottom-right-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-bottom-right-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-bottom-right-radius"},
"2f0492ac": {"dfnID":"2f0492ac","dfnText":"body","external":true,"refSections":[{"refs":[{"id":"ref-for-the-body-element"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-the-body-element\u2460"},{"id":"ref-for-the-body-element\u2461"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/sections.html#the-body-element"},
"3124d393": {"dfnID":"3124d393","dfnText":"linear-gradient","external":true,"refSections":[{"refs":[{"id":"ref-for-ltlinear-gradient"}],"title":"3.3.1. \n -webkit-linear-gradient()\n"}],"url":"https://www.w3.org/TR/2011/WD-css3-images-20110217/#ltlinear-gradient"},
-"342bb58f": {"dfnID":"342bb58f","dfnText":"","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#typedef-box"},
"35972864": {"dfnID":"35972864","dfnText":"active document","external":true,"refSections":[{"refs":[{"id":"ref-for-nav-document"}],"title":"4.2. window.orientation API"}],"url":"https://html.spec.whatwg.org/multipage/document-sequences.html#nav-document"},
"366fd15a": {"dfnID":"366fd15a","dfnText":"min-resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"},
"3a74ed0c": {"dfnID":"3a74ed0c","dfnText":"flex-flow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-flow"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-flow"},
@@ -1723,7 +2067,6 @@ I
"4d0e596d": {"dfnID":"4d0e596d","dfnText":"mask-border-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-border-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-border-repeat"},
"58a520d5": {"dfnID":"58a520d5","dfnText":"mask-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-repeat"},
"5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-window\u2461"},{"id":"ref-for-window\u2462"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"},
-"5e8da52b": {"dfnID":"5e8da52b","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation-duration"},
"5f1a81e7": {"dfnID":"5f1a81e7","dfnText":"border-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-radius"},
"5f1b7f60": {"dfnID":"5f1b7f60","dfnText":"@media","external":true,"refSections":[{"refs":[{"id":"ref-for-at-ruledef-media"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"},{"refs":[{"id":"ref-for-at-ruledef-media\u2460"}],"title":"3.2.2. \n -webkit-transform-3d\n"}],"url":"https://drafts.csswg.org/css-conditional-3/#at-ruledef-media"},
"5fd23811": {"dfnID":"5fd23811","dfnText":"fire an event","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-event-fire"}],"title":"4.2. window.orientation API"}],"url":"https://dom.spec.whatwg.org/#concept-event-fire"},
@@ -1790,6 +2133,7 @@ I
"e2e08d07": {"dfnID":"e2e08d07","dfnText":"transform","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform"},
"e3d4f907": {"dfnID":"e3d4f907","dfnText":"color","external":true,"refSections":[{"refs":[{"id":"ref-for-animtype-color"}],"title":"3.4.7.1. Foreground Text Color: the \n-webkit-text-fill-color property"},{"refs":[{"id":"ref-for-animtype-color\u2460"}],"title":"3.4.7.2. Text Stroke Color: the \n-webkit-text-stroke-color property"}],"url":"https://drafts.csswg.org/css-transitions/#animtype-color"},
"e6ccf9d2": {"dfnID":"e6ccf9d2","dfnText":"ScreenOrientation","external":true,"refSections":[{"refs":[{"id":"ref-for-screenorientation-interface"}],"title":"4.2.1. window.orientation angle"},{"refs":[{"id":"ref-for-screenorientation-interface\u2460"}],"title":"Acknowledgements"}],"url":"https://w3c.github.io/screen-orientation/#screenorientation-interface"},
+"e7382b89": {"dfnID":"e7382b89","dfnText":"","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-box-4/#typedef-box"},
"e983d6ca": {"dfnID":"e983d6ca","dfnText":"WebKitCSSMatrix","external":true,"refSections":[{"refs":[{"id":"ref-for-webkitcssmatrix"}],"title":"4.1. The WebKitCSSMatrix interface"}],"url":"https://drafts.fxtf.org/geometry-1/#webkitcssmatrix"},
"eda608e1": {"dfnID":"eda608e1","dfnText":"animation","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation"},
"edc3a18b": {"dfnID":"edc3a18b","dfnText":"flex-grow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-grow"}],"title":"3.4.1. Simple property aliases"},{"refs":[{"id":"ref-for-propdef-flex-grow\u2460"}],"title":"3.4.4. Property mappings"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-grow"},
@@ -2264,9 +2608,9 @@ I
"use strict";
{
let linkTitleData = {
-"https://drafts.csswg.org/css-backgrounds-3/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | svg viewport origin box | view-box",
"https://drafts.csswg.org/css-backgrounds-3/#typedef-line-width": "Expands to: medium | thick | thin",
-"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: aliceblue | antiquewhite | aqua | aquamarine | azure | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | cadetblue | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | green | greenyellow | grey | honeydew | hotpink | indianred | indigo | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | magenta | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | seagreen | seashell | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | tomato | transparent | turquoise | violet | wheat | white | whitesmoke | yellow | yellowgreen",
+"https://drafts.csswg.org/css-box-4/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | view-box",
+"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: | accentcolor | accentcolortext | activeborder | activecaption | activetext | aliceblue | antiquewhite | appworkspace | aqua | aquamarine | azure | background | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | buttonborder | buttonface | buttonhighlight | buttonshadow | buttontext | cadetblue | canvas | canvastext | captiontext | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | field | fieldtext | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | graytext | green | greenyellow | grey | highlight | highlighttext | honeydew | hotpink | inactiveborder | inactivecaption | inactivecaptiontext | indianred | indigo | infobackground | infotext | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | linktext | magenta | mark | marktext | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | menu | menutext | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | scrollbar | seagreen | seashell | selecteditem | selecteditemtext | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | threeddarkshadow | threedface | threedhighlight | threedlightshadow | threedshadow | tomato | transparent | turquoise | violet | visitedtext | wheat | white | whitesmoke | window | windowframe | windowtext | yellow | yellowgreen",
};
function setTypeTitles() {
@@ -2280,6 +2624,63 @@ I
document.addEventListener("DOMContentLoaded", setTypeTitles);
}
+
-
-
-
-
-
-
+
Console
Living Standard — Last Updated
@@ -69,7 +401,7 @@ Console
- Participate:
-
- GitHub whatwg/console (new issue, open issues)
+
- GitHub whatwg/console (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/console/commits
@@ -853,7 +1185,7 @@
I
In all current engines.
- Firefox28+Safari4+Chrome1+
+ Firefox28+Safari4+Chrome2+
Opera11+Edge79+
@@ -889,7 +1221,7 @@ I
In all current engines.
- Firefox30+Safari4+Chrome1+
+ Firefox30+Safari4+Chrome2+
Opera11+Edge79+
@@ -925,7 +1257,7 @@ I
In all current engines.
- Firefox5+Safari4+Chrome1+
+ Firefox5+Safari4+Chrome2+
Opera11+Edge79+
@@ -943,7 +1275,7 @@ I
In all current engines.
- Firefox8+Safari4+Chrome1+
+ Firefox8+Safari4+Chrome2+
Opera11+Edge79+
@@ -961,7 +1293,7 @@ I
In all current engines.
- Firefox39+Safari4+Chrome1+
+ Firefox39+Safari4+Chrome2+
Opera11+Edge79+
@@ -997,7 +1329,7 @@ I
In all current engines.
- Firefox9+Safari4+Chrome1+
+ Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1033,7 +1365,7 @@ I
In all current engines.
- Firefox9+Safari4+Chrome1+
+ Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1105,7 +1437,7 @@ I
In all current engines.
- Firefox10+Safari4+Chrome1+
+ Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1123,7 +1455,7 @@ I
In all current engines.
- Firefox10+Safari4+Chrome1+
+ Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1138,7 +1470,7 @@ I
✔MDN
-
+
In all current engines.
Firefox62+Safari13+Chrome71+
@@ -1159,7 +1491,7 @@ I
In all current engines.
- Firefox6+Safari4+Chrome1+
+ Firefox6+Safari4+Chrome2+
Opera11+Edge79+
@@ -1874,6 +2206,63 @@ I
}
}
+
-
-
-
-
-
-
+
DOM
Living Standard — Last Updated
@@ -69,7 +401,7 @@ DOM
- Participate:
-
- GitHub whatwg/dom (new issue, open issues)
+
- GitHub whatwg/dom (new issue, open issues)
- Chat on Matrix
- Commits:
- GitHub whatwg/dom/commits
@@ -242,12 +574,12 @@
1.1.
null or an object, and has children, which is an ordered set of objects. An object A whose parent is object B is a child of B.
The root of an object is itself, if its parent is null, or else it is the root of its parent. The root of a tree is any object participating in that tree whose parent is null.
An object A is called a descendant of an object B, if either A is a child of B or A is a child of an
-object C that is a descendant of B.
+object C that is a descendant of B.
An inclusive descendant is
-an object or one of its descendants.
- An object A is called an ancestor of an object B if and only if B is a descendant of A.
+an object or one of its descendants.
+ An object A is called an ancestor of an object B if and only if B is a descendant of A.
An inclusive ancestor is
-an object or one of its ancestors.
+an object or one of its ancestors.
An object A is called a sibling of an object B, if and only if B and A share the same non-null parent.
An inclusive sibling is an
object or one of its siblings.
@@ -258,9 +590,9 @@ 1.1.
same tree and A comes
after B in tree order.
The first child of an object is its
-first child or null if it has no children.
+first child or null if it has no children.
The last child of an object is its
-last child or null if it has no children.
+last child or null if it has no children.
The previous sibling of an
object is its first preceding sibling or null if it has no preceding sibling.
The next sibling of an
@@ -353,7 +685,7 @@
}
- When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s bubbles is true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in
+
When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s bubbles is true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in
reverse tree order.
Let’s look at an example of how events work in a tree:
<!doctype html>
@@ -455,7 +787,7 @@ event listeners after the current one finishes running and, when dispatched in a tree, also prevents event from reaching any
other objects.
event . bubbles
- - Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
+
- Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
event . cancelable
- Returns true or false depending on how event was initialized. Its return
value does not always carry meaning, but true can indicate that part of the operation
@@ -1435,7 +1767,7 @@
- Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
+ Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
To illustrate, consider this HTML document:
<!DOCTYPE html>
< html class = e >
@@ -1475,7 +1807,7 @@ The most excellent Live DOM Viewer can be used to explore this matter in more detail.
4.2. Node tree
Document, DocumentType, DocumentFragment, Element, Text, ProcessingInstruction, and Comment objects (simply called nodes) participate in a tree, simply named the node tree.
- A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
+ A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
Document
-
@@ -1515,9 +1847,9 @@
Its data’s length.
- Any other node
-
-
Its number of children.
+ Its number of children.
- A node is considered empty if its length is zero.
+ A node is considered empty if its length is zero.
4.2.1. Document tree
A document tree is a node tree whose root is a document.
The document element of a document is the element whose parent is that document, if it exists; otherwise null.
@@ -1604,10 +1936,10 @@ mode is not "open", then return null.
-
If shadow’s slot assignment is "manual", then
- return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise
+ return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise
null.
-
-
Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
+ Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
To find slottables for a given slot slot, run these steps:
@@ -1628,7 +1960,7 @@ For each slottable slottable of slot’s manually assigned nodes, if slottable’s parent is host, append slottable to result.
-
-
Otherwise, for each slottable child slottable of host, in tree order:
+ Otherwise, for each slottable child slottable of host, in tree order:
-
Let foundSlot be the result of finding a slot given slottable.
@@ -1647,7 +1979,7 @@ finding slottables given slot.
-
-
If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
+ If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
-
For each node in slottables:
@@ -1719,17 +2051,17 @@
DocumentFragment node
-
-
If node has more than one element child or has a Text node child.
- Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
+ If node has more than one element child or has a Text node child.
+ Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
- element
-
-
parent has an element child, child is
+
parent has an element child, child is
a doctype, or child is non-null and a doctype is following child.
- doctype
-
-
parent has a doctype child, child is non-null
+
parent has a doctype child, child is non-null
and an element is preceding child, or child is null
- and parent has an element child.
+ and parent has an element child.
To pre-insert a node into a parent before a child, run these steps:
@@ -1751,7 +2083,7 @@ To insert a node into a parent before a child, with an optional suppress observers flag, run these steps:
-
-
Let nodes be node’s children, if node is a DocumentFragment node; otherwise « node ».
+ Let nodes be node’s children, if node is a DocumentFragment node; otherwise « node ».
-
Let count be nodes’s size.
-
@@ -1760,7 +2092,7 @@
If node is a DocumentFragment node, then:
-
-
+
-
Queue a tree mutation record for node with « », nodes, null, and
null.
@@ -1784,9 +2116,9 @@
Adopt node into parent’s node document.
-
-
+
-
-
Otherwise, insert node into parent’s children before child’s index.
+ Otherwise, insert node into parent’s children before child’s index.
-
If parent is a shadow host whose shadow root’s slot assignment is "named" and node is a slottable, then assign a slot for node.
-
@@ -1837,14 +2169,14 @@
DocumentFragment node
-
-
If node has more than one element child or has a Text node child.
- Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
+ If node has more than one element child or has a Text node child.
+ Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
- element
-
-
parent has an element child that is not child or a doctype is following child.
+ parent has an element child that is not child or a doctype is following child.
- doctype
-
-
parent has a doctype child that is not child,
+
parent has a doctype child that is not child,
or an element is preceding child.
The above statements differ from the pre-insert algorithm.
@@ -1866,7 +2198,7 @@
The above can only be false if child is node.
-
-
Let nodes be node’s children if node is a DocumentFragment node; otherwise « node ».
+ Let nodes be node’s children if node is a DocumentFragment node; otherwise « node ».
-
Insert node into parent before referenceChild with the suppress observers flag set.
-
@@ -1877,15 +2209,15 @@
To replace all with a node within a parent, run these steps:
-
-
Let removedNodes be parent’s children.
+ Let removedNodes be parent’s children.
-
Let addedNodes be the empty set.
-
-
If node is a DocumentFragment node, then set addedNodes to node’s children.
+ If node is a DocumentFragment node, then set addedNodes to node’s children.
-
Otherwise, if node is non-null, set addedNodes to « node ».
-
-
Remove all parent’s children, in tree order, with the suppress observers flag set.
+ Remove all parent’s children, in tree order, with the suppress observers flag set.
-
If node is non-null, then insert node into parent before null with the suppress observers flag set.
-
@@ -1930,7 +2262,7 @@
Let oldNextSibling be node’s next sibling.
-
-
+
-
If node is assigned, then run assign slottables for node’s assigned slot.
-
@@ -1980,9 +2312,9 @@
node . getElementById(elementId)
-
-
Returns the first element within node’s descendants whose ID is elementId.
+ Returns the first element within node’s descendants whose ID is elementId.
- The getElementById(elementId) method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if
+
The getElementById(elementId) method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if
there is no such element, null.
4.2.5. Mixin DocumentOrShadowRoot
interface mixin DocumentOrShadowRoot
collection = node . children
- - Returns the child elements.
+
- Returns the child elements.
element = node . firstElementChild
- - Returns the first child that is an element; otherwise null.
+
- Returns the first child that is an element; otherwise null.
element = node . lastElementChild
- - Returns the last child that is an element; otherwise null.
+
- Returns the last child that is an element; otherwise null.
node . prepend(nodes)
-
Inserts nodes before the first child of node, while
@@ -2044,24 +2376,24 @@
node tree are violated.
node . replaceChildren(nodes)
-
-
Replace all children of node with nodes,
+
Replace all children of node with nodes,
while replacing strings in nodes with equivalent Text nodes.
Throws a "HierarchyRequestError" DOMException if the constraints of
the node tree are violated.
node . querySelector(selectors)
- - Returns the first element that is a descendant of node that
+
- Returns the first element that is a descendant of node that
matches selectors.
node . querySelectorAll(selectors)
- - Returns all element descendants of node that
+
- Returns all element descendants of node that
match selectors.
- The children getter steps are to return an HTMLCollection collection rooted at this matching only element children.
+ The children getter steps are to return an HTMLCollection collection rooted at this matching only element children.
The firstElementChild getter steps are to return
-the first child that is an element; otherwise null.
+the first child that is an element; otherwise null.
The lastElementChild getter steps are to return
-the last child that is an element; otherwise null.
+the last child that is an element; otherwise null.
The childElementCount getter steps are to return
-the number of children of this that are elements.
+the number of children of this that are elements.
The prepend(nodes) method steps are:
-
@@ -2345,7 +2677,7 @@
A registered observer consists of an observer (a MutationObserver object) and options (a MutationObserverInit dictionary).
A transient registered observer is a registered observer that also consists of a source (a registered observer).
Transient registered observers are used to track mutations within
-a given node’s descendants after node has been removed so
+a given node’s descendants after node has been removed so
they do not get lost when subtree is set to true on node’s parent.
4.3.1. Interface MutationObserver
[Exposed =Window ]
@@ -2391,7 +2723,7 @@ <
can be used:
childList
- - Set to true if mutations to target’s children are to be observed.
+
- Set to true if mutations to target’s children are to be observed.
attributes
- Set to true if mutations to target’s attributes are to be observed. Can be omitted if
attributeOldValue or attributeFilter is
specified.
@@ -2399,7 +2731,7 @@ <
- Set to true if mutations to target’s data are to be observed. Can be omitted if
characterDataOldValue is specified.
subtree
- Set to true if mutations to not just target, but
- also target’s descendants are to be
+ also target’s descendants are to be
observed.
attributeOldValue
- Set to true if
attributes is true or omitted
@@ -2551,7 +2883,7 @@ type.
For "attributes", it is the element whose attribute changed. For
"characterData", it is the CharacterData node. For "childList",
- it is the node whose children changed.
+ it is the node whose children changed.
record . addedNodes
record . removedNodes
- Return the nodes added and removed
@@ -2761,9 +3093,9 @@
parentElement
- Returns the parent element.
node . hasChildNodes()
- - Returns whether node has children.
+
- Returns whether node has children.
node . childNodes
- - Returns the children.
+
- Returns the children.
node . firstChild
- Returns the first child.
node . lastChild
@@ -2784,8 +3116,8 @@ parentNode getter steps are to return this’s parent.
The parentElement getter steps are to return this’s parent element.
- The hasChildNodes() method steps are to return true if this has children; otherwise false.
- The childNodes getter steps are to return a NodeList rooted at this matching only children.
+ The hasChildNodes() method steps are to return true if this has children; otherwise false.
+ The childNodes getter steps are to return a NodeList rooted at this matching only children.
The firstChild getter steps are to return this’s first child.
The lastChild getter steps are to return this’s last child.
The previousSibling getter steps are to return this’s previous sibling.
@@ -2815,7 +3147,7 @@ ProcessingInstruction
Comment
-
-
Replace data with node this, offset 0, count this’s length, and data new value.
+ Replace data with node this, offset 0, count this’s length, and data new value.
- Any other node
-
Do nothing.
@@ -2858,7 +3190,7 @@ ProcessingInstruction
Comment
-
-
Replace data with node this, offset 0, count this’s length, and data the given value.
+ Replace data with node this, offset 0, count this’s length, and data the given value.
- Any other node
-
Do nothing.
@@ -2869,9 +3201,9 @@ empty exclusive Text nodes and concatenates the data of remaining contiguous exclusive Text nodes into the first of their nodes.
The normalize() method steps are to run these steps for
-each descendant exclusive Text node node of this:
+each descendant exclusive Text node node of this:
- - Let length be node’s length.
+
- Let length be node’s length.
- If length is zero, then remove node and continue with the
next exclusive
Text node, if any.
- Let data be the concatenation of the data of node’s contiguous exclusive
Text nodes (excluding itself), in tree order.
@@ -2890,7 +3222,7 @@ live range whose end node is currentNode’s parent and end offset is currentNode’s index, set its end node to node and its end offset to length.
-
-
Add currentNode’s length to length.
+ Add currentNode’s length to length.
-
Set currentNode to its next sibling.
@@ -2899,7 +3231,7 @@
node . cloneNode([deep = false])
- - Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
+
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
node . isEqualNode(otherNode)
- Returns whether node and otherNode have the same properties.
@@ -2951,7 +3283,7 @@
node document and document to copy, if copy is a document, and set copy’s node document to document otherwise.
- Run any cloning steps defined for node in other applicable specifications and pass copy, node, document and the clone children flag if set, as parameters.
-
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
+
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
- Return copy.
The cloneNode(deep) method steps are:
@@ -2983,8 +3315,8 @@ element, each attribute in its attribute list has an attribute that equals an attribute in B’s attribute list.
- - A and B have the same number of children.
-
- Each child of A equals the child of B at the identical index.
+
- A and B have the same number of children.
+
- Each child of A equals the child of B at the identical index.
The isEqualNode(otherNode) method steps are to
return true if otherNode is non-null and this equals otherNode; otherwise false.
@@ -3005,9 +3337,9 @@ Node . DOCUMENT_POSITION_FOLLOWING (4)
- Set when other is following node.
Node . DOCUMENT_POSITION_CONTAINS- Set when other is an ancestor of node.
+
- Set when other is an ancestor of node.
Node . DOCUMENT_POSITION_CONTAINED_BY- Set when other is a descendant of node.
+
- Set when other is a descendant of node.
node . contains(other)
- Returns true if other is an inclusive descendant of node;
@@ -3062,16 +3394,16 @@
Math. random() value can
be used.
-
-
If node1 is an ancestor of node2 and attr1 is null,
+
If node1 is an ancestor of node2 and attr1 is null,
or node1 is node2 and attr2 is non-null, then return the result of
adding DOCUMENT_POSITION_CONTAINS to DOCUMENT_POSITION_PRECEDING.
-
-
If node1 is a descendant of node2 and attr2 is null,
+
If node1 is a descendant of node2 and attr2 is null,
or node1 is node2 and attr1 is non-null, then return the result of
adding DOCUMENT_POSITION_CONTAINED_BY to DOCUMENT_POSITION_FOLLOWING.
-
If node1 is preceding node2, then return DOCUMENT_POSITION_PRECEDING.
- Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children,
+
Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children,
despite attributes not participating in a tree.
-
Return DOCUMENT_POSITION_FOLLOWING.
@@ -3194,10 +3526,10 @@ *" (U+002A), return a HTMLCollection rooted
- at root, whose filter matches only descendant elements.
+ at root, whose filter matches only descendant elements.
-
Otherwise, if root’s node document is an HTML document,
- return a HTMLCollection rooted at root, whose filter matches the following descendant elements:
+ return a HTMLCollection rooted at root, whose filter matches the following descendant elements:
-
Whose namespace is the HTML namespace and whose qualified name is qualifiedName, in ASCII lowercase.
@@ -3205,18 +3537,18 @@ namespace is not the HTML namespace and whose qualified name is qualifiedName.
-
-
Otherwise, return a HTMLCollection rooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
+ Otherwise, return a HTMLCollection rooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
When invoked with the same argument, and as long as root’s node document’s type has not changed, the same HTMLCollection object may be returned as returned by an earlier call.
The list of elements with namespace namespace and local name localName for a node root is the HTMLCollection returned by the following algorithm:
- If namespace is the empty string, set it to null.
-
- If both namespace and localName are "
*" (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements.
+ - If both namespace and localName are "
*" (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements.
- Otherwise, if namespace is "
*"
- (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose local name is localName.
+ (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose local name is localName.
- Otherwise, if localName is "
*"
- (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace.
- - Otherwise, return a
HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
+ (U+002A), return a HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace.
+ - Otherwise, return a
HTMLCollection rooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
When invoked with the same arguments, the same HTMLCollection object may be returned as returned by an earlier call.
The list of elements with class names classNames for a node root is the HTMLCollection returned by the following algorithm:
@@ -3225,7 +3557,7 @@ HTMLCollection.
-
Return a HTMLCollection rooted at root,
- whose filter matches descendant elements that have all their classes in classes.
+ whose filter matches descendant elements that have all their classes in classes.
The comparisons for the classes must be done in an ASCII case-insensitive manner if root’s node document’s mode is "quirks"; otherwise in an identical to manner.
When invoked with the same argument, the same HTMLCollection object may be returned as returned by an earlier call.
@@ -3333,15 +3665,15 @@ Returns the document element.
- collection = document .
getElementsByTagName(qualifiedName)
-
-
If qualifiedName is "*" returns a HTMLCollection of all descendant elements.
- Otherwise, returns a HTMLCollection of all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)
+ If qualifiedName is "*" returns a HTMLCollection of all descendant elements.
+ Otherwise, returns a HTMLCollection of all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)
- collection = document .
getElementsByTagNameNS(namespace, localName)
-
If namespace and localName are
- "
*" returns a HTMLCollection of all descendant elements.
- If only namespace is "*" returns a HTMLCollection of all descendant elements whose local name is localName.
- If only localName is "*" returns a HTMLCollection of all descendant elements whose namespace is namespace.
- Otherwise, returns a HTMLCollection of all descendant elements whose namespace is namespace and local name is localName.
+ "*" returns a HTMLCollection of all descendant elements.
+ If only namespace is "*" returns a HTMLCollection of all descendant elements whose local name is localName.
+ If only localName is "*" returns a HTMLCollection of all descendant elements whose namespace is namespace.
+ Otherwise, returns a HTMLCollection of all descendant elements whose namespace is namespace and local name is localName.
- collection = document .
getElementsByClassName(classNames)
- collection = element .
getElementsByClassName(classNames)
- Returns a
HTMLCollection of the elements in the object on which
@@ -3351,7 +3683,7 @@ classNames argument is interpreted as a
space-separated list of classes.
- The doctype getter steps are to return the child of this that is a doctype; otherwise null.
+ The doctype getter steps are to return the child of this that is a doctype; otherwise null.
The documentElement getter steps are to return this’s document element.
The getElementsByTagName(qualifiedName) method steps are to return the list of elements with qualified name qualifiedName for this.
Thus, in an HTML document, document. getElementsByTagName( "FOO" ) will match <FOO> elements that are not in the HTML namespace, and <foo> elements that are in
@@ -3481,7 +3813,7 @@
- clone = document . importNode(node [, deep = false])
-
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
+ Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
If node is a document or a shadow root, throws a
"NotSupportedError" DOMException.
- node = document .
adoptNode(node)
@@ -3590,7 +3922,7 @@
"devicemotionevent"
DeviceMotionEvent
- [DEVICE-ORIENTATION]
+ [DEVICE-ORIENTATION]
"deviceorientationevent"
DeviceOrientationEvent
@@ -3871,7 +4203,7 @@ In shadow-including tree order is shadow-including preorder, depth-first traversal of a node tree. Shadow-including preorder, depth-first traversal of a node tree tree is preorder, depth-first traversal of tree, with for each shadow host encountered in tree, shadow-including preorder, depth-first traversal of that element’s shadow root’s node tree just after it is encountered.
The shadow-including root of an object is its root’s host’s shadow-including root, if the
object’s root is a shadow root; otherwise its root.
- An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
+ An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
A shadow-including inclusive descendant is an object or one of its shadow-including descendants.
An object A is a shadow-including ancestor of an object B, if and only if B is a shadow-including descendant of A.
A shadow-including inclusive ancestor is an object or one of its shadow-including ancestors.
@@ -4067,7 +4399,7 @@ If result’s attribute list is not empty,
then throw a "NotSupportedError" DOMException.
-
-
If result has children, then throw a
+
If result has children, then throw a
"NotSupportedError" DOMException.
-
If result’s parent is not null, then throw a
@@ -4718,16 +5050,16 @@
data.
To replace data of node node with offset offset, count count, and data data, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- If offset plus count is greater than length, then set count to length minus offset.
-
Queue a mutation record of "characterData" for node with
null, null, node’s data, « », « », null, and null.
- - Insert data into node’s data after offset code units.
+
- Insert data into node’s data after offset code units.
- Let delete offset be offset + data’s length.
-
- Starting from delete offset code units, remove count code units from node’s data.
+
- Starting from delete offset code units, remove count code units from node’s data.
-
For each live range whose start node is node and start offset is greater than offset but less than or equal to offset plus count, set its start offset to offset.
-
@@ -4736,24 +5068,24 @@
For each live range whose start node is node and start offset is greater than offset plus count, increase its start offset by data’s length and decrease it by count.
-
For each live range whose end node is node and end offset is greater than offset plus count, increase its end offset by data’s length and decrease it by count.
- - If node’s parent is non-null, then run the children changed steps for node’s parent.
+
- If node’s parent is non-null, then run the children changed steps for node’s parent.
To substring data with node node, offset offset, and count count, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- If offset plus count is
- greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then
+ greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then
return.
-
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
+
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
- The data getter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.
- The length getter steps are to return this’s length.
+ The data getter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.
+ The length getter steps are to return this’s length.
The substringData(offset, count) method steps are to return the result of running substring data with node this,
offset offset, and count count.
The appendData(data) method steps are
-to replace data with node this, offset this’s length, count 0,
+to replace data with node this, offset this’s length, count 0,
and data data.
The insertData(offset, data) method steps are to replace data with node this, offset offset, count 0,
and data data.
@@ -4782,19 +5114,19 @@ contiguous exclusive Text nodes of a node node are node, node’s previous sibling exclusive Text node,
if any, and its contiguous exclusive Text nodes, and node’s next sibling exclusive Text node, if any, and its contiguous exclusive Text nodes, avoiding any duplicates.
The child text content of a node node is the concatenation of the data of all
-the Text node children of node, in tree order.
- The descendant text content of a node node is the concatenation of the data of all the Text node descendants of node, in tree order.
+the Text node children of node, in tree order.
+ The descendant text content of a node node is the concatenation of the data of all the Text node descendants of node, in tree order.
The new Text(data) constructor steps are to set this’s data to data and this’s node document to current global object’s associated Document.
To split a Text node node with offset offset, run these steps:
- - Let length be node’s length.
+
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError" DOMException.
- Let count be length minus offset.
- Let new data be the result of substringing data with node node, offset offset, and count count.
- Let new node be a new
Text node, with the same node document as node. Set new node’s data to new data.
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
-
If parent is not null, then:
@@ -4878,7 +5210,7 @@ 5.2. Boundary points
A boundary point is a tuple consisting of a node (a node) and an offset (a non-negative integer).
A correct boundary point’s offset will
-be between 0 and the boundary point’s node’s length, inclusive.
+be between 0 and the boundary point’s node’s length, inclusive.
The position of a boundary point (nodeA, offsetA) relative to a boundary point (nodeB, offsetB) is before, equal, or after, as returned by these steps:
-
@@ -4889,12 +5221,12 @@
following nodeB, then if the position of (nodeB, offsetB) relative to
(nodeA, offsetA) is before, return after, and if it is after, return before.
-
-
If nodeA is an ancestor of nodeB:
+ If nodeA is an ancestor of nodeB:
-
Let child be nodeB.
-
-
While child is not a child of nodeA, set child to its parent.
+ While child is not a child of nodeA, set child to its parent.
-
@@ -5003,7 +5335,7 @@ Algorithms that modify a tree (in particular the insert, remove, replace data, and split algorithms) modify live ranges associated with that tree.
The root of a live range is the root of its start node.
A node node is contained in a live range range if node’s root is range’s root, and (node, 0) is after range’s start, and
-(node, node’s length) is before range’s end.
+(node, node’s length) is before range’s end.
A node is partially contained in a live range if it’s an inclusive ancestor of the live range’s start node but not its end node, or vice versa.
Some facts to better understand these definitions:
@@ -5012,27 +5344,27 @@ live range consists of all contained nodes, plus possibly some of the contents of the start node and end node if those are Text, ProcessingInstruction, or Comment nodes.
-
The nodes that are contained in a live range will generally not be
- contiguous, because the parent of a contained node will not always be contained.
+ contiguous, because the parent of a contained node will not always be contained.
-
-
However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
+ However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
-
The start node and end node of a live range are
never contained within it.
-
The first contained node (if there are any) will
- always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
+ always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
-
There exists a partially contained node if and only if
the start node and end node are different.
-
The commonAncestorContainer attribute value is neither contained nor partially contained.
-
-
If the start node is an ancestor of the end node,
+
If the start node is an ancestor of the end node,
the common inclusive ancestor will be the start node. Exactly one
- of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
+ of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
-
If the start node is not an inclusive ancestor of the end node, nor vice versa, the common inclusive ancestor will be
- distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and
+ distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and
only if it lies between those two.
@@ -5048,12 +5380,12 @@
- container = range .
commonAncestorContainer
- Returns the node, furthest away from
- the document, that is an ancestor of both range’s start node and end node.
+ the document, that is an ancestor of both range’s start node and end node.
The commonAncestorContainer getter steps are:
- Let container be start node.
-
- While container is not an inclusive ancestor of end node, let container be container’s parent.
+
- While container is not an inclusive ancestor of end node, let container be container’s parent.
- Return container.
@@ -5062,7 +5394,7 @@ doctype, then throw an
"InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- Let bp be the boundary point (node, offset).
-
@@ -5089,14 +5421,14 @@
set the end of this to boundary point (node, offset).
The setStartBefore(node) method steps are:
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError" DOMException.
- Set the start of this to boundary point (parent, node’s index).
The setStartAfter(node) method steps are:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5104,14 +5436,14 @@
setEndBefore(node) method steps are:
- - Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError" DOMException.
- Set the end of this to boundary point (parent, node’s index).
The setEndAfter(node) method steps are:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5121,7 +5453,7 @@
select a node node within a range range, run these steps:
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, then throw an "InvalidNodeTypeError" DOMException.
-
@@ -5137,7 +5469,7 @@
doctype, throw an
"InvalidNodeTypeError" DOMException.
- - Let length be the length of node.
+
- Let length be the length of node.
- Set start to the boundary point (node, 0).
- Set end to the boundary point (node, length).
@@ -5188,19 +5520,19 @@ this’s start node, start offset, end node, and end offset, respectively.
- If original start node and original end node are the same, and they are a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original end offset minus original start offset, and data the empty string, and then return.
- - Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
+
- Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
- If original start node is an inclusive ancestor of original end node, set new node to original start node and new offset to original start offset.
-
Otherwise:
- Let reference node equal original start node.
-
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
+
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one
+ Set new node to the parent of reference node, and new offset to one
plus the index of reference node.
-
If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
- - If original start node is a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.
+ - If original start node is a
Text, ProcessingInstruction, or Comment node, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.
-
For each node in nodes to remove, in tree order, remove node.
- If original end node is a
Text, ProcessingInstruction, or Comment node, replace data with node original end node, offset 0, count original end offset and data the empty string.
@@ -5225,16 +5557,16 @@ inclusive ancestor of original end node, set common ancestor to
- its own parent.
+ its own parent.
- Let first partially contained child be null.
-
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
+
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
-
- If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
+ If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense.
- For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
- it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
- - Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
+ For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
+ it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
+
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
-
If any member of contained children is a doctype, then throw a
"HierarchyRequestError" DOMException.
@@ -5247,19 +5579,19 @@ parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
+ - While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one plus reference node’s index.
-
If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ Set new node to the parent of reference node, and new offset to one plus reference node’s index.
+ If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
-
If first partially contained child is a
Text, ProcessingInstruction, or Comment node:
In this case, first partially contained child is original start node.
- Let clone be a clone of original start node.
-
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
+
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
-
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
+
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
-
Otherwise, if first partially contained child is not
@@ -5270,7 +5602,7 @@
live range whose start is
(original start node, original start offset) and
whose end is
- (first partially contained child, first partially contained child’s length).
+ (first partially contained child, first partially contained child’s length).
-
Let subfragment be the result of extracting subrange.
- Append subfragment to clone.
@@ -5320,16 +5652,16 @@
inclusive ancestor of original end node, set common ancestor to its own parent.
+ - While common ancestor is not an inclusive ancestor of original end node, set common ancestor to its own parent.
- Let first partially contained child be null.
-
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
+
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
-
- If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
+ If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense.
- For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
- it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
- - Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
+ For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because
+ it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
+
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
-
If any member of contained children is a doctype, then throw a
"HierarchyRequestError" DOMException.
@@ -5342,7 +5674,7 @@ In this case, first partially contained child is original start node.
- Let clone be a clone of original start node.
-
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
+
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
-
@@ -5354,7 +5686,7 @@
live range whose start is
(original start node, original start offset) and
whose end is
- (first partially contained child, first partially contained child’s length).
+ (first partially contained child, first partially contained child’s length).
-
Let subfragment be the result of cloning the contents of subrange.
- Append subfragment to clone.
@@ -5392,23 +5724,23 @@
cloning the contents of this.
To insert a node node into a live range range, run these steps:
- - If range’s start node is a
ProcessingInstruction or Comment node, is a Text node whose parent is null, or is node,
+ - If range’s start node is a
ProcessingInstruction or Comment node, is a Text node whose parent is null, or is node,
then throw a "HierarchyRequestError" DOMException.
- Let referenceNode be null.
- If range’s start node is a
Text node,
set referenceNode to that Text node.
- - Otherwise, set referenceNode to the child of start node whose index is start offset, and null if
- there is no such child.
-
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
+
- Otherwise, set referenceNode to the child of start node whose index is start offset, and null if
+ there is no such child.
+
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
- Ensure pre-insertion validity of node into parent before referenceNode.
- If range’s start node is a
Text node, set referenceNode to the result of splitting it with
offset range’s start offset.
- If node is referenceNode, set referenceNode to its next sibling.
-
-
-
- Let newOffset be parent’s length if referenceNode is null,
+
+
- Let newOffset be parent’s length if referenceNode is null,
and referenceNode’s index otherwise.
-
- Increase newOffset by node’s length if node is a
DocumentFragment node, and one otherwise.
+ - Increase newOffset by node’s length if node is a
DocumentFragment node, and one otherwise.
- Pre-insert node into parent before referenceNode.
-
If range is collapsed, then set range’s end to (parent, newOffset).
@@ -5425,7 +5757,7 @@ extracting this.
-
-
If newParent has children, then replace all with null
+
If newParent has children, then replace all with null
within newParent.
-
@@ -5451,7 +5783,7 @@
root is different from this’s root, return false.
- If node is a doctype, then throw an
"
InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- If (node, offset) is before start or after end, return false.
- Return true.
@@ -5461,7 +5793,7 @@
root is different from this’s root, then throw a "WrongDocumentError" DOMException.
- If node is a doctype, then throw an
"
InvalidNodeTypeError" DOMException.
- - If offset is greater than node’s length, then throw an
+
- If offset is greater than node’s length, then throw an
"
IndexSizeError" DOMException.
- If (node, offset) is before start, return −1.
- If (node, offset) is after end, return 1.
@@ -5471,7 +5803,7 @@
intersectsNode(node) method steps are:
- If node’s root is different from this’s root, return false.
-
- Let parent be node’s parent.
+
- Let parent be node’s parent.
- If parent is null, return true.
- Let offset be node’s index.
- If (parent, offset) is before end and (parent, offset plus 1) is after start, return true.
@@ -5566,7 +5898,7 @@
Steps are not terminated here.
-
-
Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
+ Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
The root getter steps are to return this’s root.
@@ -5649,7 +5981,7 @@ While node is non-null and is not this’s root:
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If node is non-null and filtering node within this returns FILTER_ACCEPT, then set this’s current to node and return node.
@@ -5686,7 +6018,7 @@
If sibling is non-null, then set node to sibling and break.
-
-
Let parent be node’s parent.
+ Let parent be node’s parent.
-
If parent is null, walker’s root, or walker’s current, then return null.
-
@@ -5727,7 +6059,7 @@
node’s previous sibling if type is previous.
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If node is null or walker’s root, then return
null.
@@ -5754,7 +6086,7 @@
Let result be the result of filtering node within this.
-
-
While result is not FILTER_REJECT and node has a child:
+ While result is not FILTER_REJECT and node has a child:
-
Set node to node’s last child.
@@ -5767,9 +6099,9 @@ Set sibling to node’s previous sibling.
-
-
If node is this’s root or node’s parent is null, then return null.
+ If node is this’s root or node’s parent is null, then return null.
-
-
Set node to node’s parent.
+ Set node to node’s parent.
-
If the return value of filtering node within this is FILTER_ACCEPT, then set this’s current to node and return node.
@@ -5786,7 +6118,7 @@ While true:
-
-
While result is not FILTER_REJECT and node has a child:
+ While result is not FILTER_REJECT and node has a child:
-
Set node to its first child.
@@ -5809,7 +6141,7 @@
If sibling is non-null, then set node to sibling and break.
-
-
Set temporary to temporary’s parent.
+ Set temporary to temporary’s parent.
-
Set result to the result of filtering node within this.
@@ -7604,11 +7936,6 @@ upgrade an element
- valid custom element name
-
-
- [I18N-GLOSSARY] defines the following terms:
-
- - code units
-
-
[INFRA] defines the following terms:
@@ -7746,7 +8073,7 @@ N
- [CONSOLE]
- Dominic Farolino; Robert Kowalski; Terin Stock. Console Standard. Living Standard. URL: https://console.spec.whatwg.org/
- [DEVICE-ORIENTATION]
-
- Rich Tibbett; et al. DeviceOrientation Event Specification. URL: https://w3c.github.io/deviceorientation/
+
- Reilly Grant; Raphael Kubo da Costa; Marcos Caceres. Device Orientation and Motion. URL: https://w3c.github.io/deviceorientation/
- [DOM]
- Anne van Kesteren. DOM Standard. Living Standard. URL: https://dom.spec.whatwg.org/
- [ECMASCRIPT]
@@ -7757,8 +8084,6 @@
N
- Yoav Weiss. High Resolution Time. URL: https://w3c.github.io/hr-time/
- [HTML]
- Anne van Kesteren; et al. HTML Standard. Living Standard. URL: https://html.spec.whatwg.org/multipage/
-
- [I18N-GLOSSARY]
-
- Richard Ishida; Addison Phillips. Internationalization Glossary. URL: https://w3c.github.io/i18n-glossary/
- [INFRA]
- Anne van Kesteren; Domenic Denicola. Infra Standard. Living Standard. URL: https://infra.spec.whatwg.org/
- [SELECTORS4]
@@ -8488,25 +8813,25 @@
I
-
+
✔MDN
-
+
In all current engines.
- Firefox88+Safari15+Chrome93+
+ Firefox57+Safari11.1+Chrome66+
- Opera?Edge93+
+ Opera?Edge79+
- Edge (Legacy)?IENone
+ Edge (Legacy)16+IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.12.0+
+ Node.js15.0.0+
-
+
✔MDN
@@ -8524,21 +8849,21 @@ I
-
+
✔MDN
-
+
In all current engines.
- Firefox57+Safari11.1+Chrome66+
+ Firefox88+Safari15+Chrome93+
- Opera?Edge79+
+ Opera?Edge93+
- Edge (Legacy)16+IENone
+ Edge (Legacy)?IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.0.0+
+ Node.js15.12.0+
@@ -9115,7 +9440,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9144,7 +9469,7 @@ I
Element/previousElementSibling
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9714,7 +10039,7 @@ I
- DocumentFragment/childElementCount
+ DocumentFragment/childElementCount
In all current engines.
Firefox25+Safari9+Chrome29+
@@ -9730,7 +10055,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10186,7 +10511,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10199,7 +10524,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -10324,7 +10649,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10395,7 +10720,7 @@ I
DocumentFragment/querySelector
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10424,7 +10749,7 @@ I
DocumentFragment/querySelectorAll
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10534,6 +10859,22 @@ I
+
+ ✔MDN
+
+ DocumentFragment/getElementById
+ In all current engines.
+
+ Firefox28+Safari9+Chrome36+
+
+ Opera?Edge79+
+
+ Edge (Legacy)17+IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
@@ -10550,6 +10891,54 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IE9+
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
✔MDN
@@ -11369,7 +11758,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -11690,10 +12079,154 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+ MutationRecord/attributeNamespace
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+ MutationRecord/previousSibling
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox14+Safari7+Chrome16+
+
+ Opera?Edge79+
+
+ Edge (Legacy)12+IE11
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
-
+
In all current engines.
Firefox14+Safari7+Chrome16+
@@ -11853,7 +12386,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1.1+Chrome1+
@@ -11920,7 +12453,7 @@ I
In all current engines.
- Firefox1+Safari4+Chrome1+
+ Firefox1+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -12013,7 +12546,7 @@ I
✔MDN
-
+
In all current engines.
Firefox49+Safari10+Chrome51+
@@ -12077,7 +12610,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -12285,7 +12818,7 @@ I
✔MDN
-
+
In all current engines.
Firefox1+Safari1.1+Chrome1+
@@ -12333,7 +12866,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12397,7 +12930,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12445,7 +12978,7 @@ I
✔MDN
-
+
In all current engines.
Firefox3.5+Safari3+Chrome1+
@@ -12458,26 +12991,52 @@ I
-
+
✔MDN
-
+
+ In all current engines.
+
+ Firefox50+Safari10+Chrome51+
+
+ Opera?Edge79+
+
+ Edge (Legacy)16+IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+ Reference/Global_Objects/Array/@@iterator
+ In all current engines.
+
+ Firefox36+Safari10+Chrome51+
+
+ Opera?Edge79+
+
+ Edge (Legacy)?IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
+
In all current engines.
Firefox1+Safari1+Chrome1+
- Opera12.1+Edge79+
+ Opera8+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+
-
+
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
@@ -12490,19 +13049,19 @@ I
-
+
✔MDN
-
+
In all current engines.
Firefox1+Safari1+Chrome1+
- Opera8+Edge79+
+ Opera12.1+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
@@ -12969,6 +13528,22 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox92+Safari16.4+Chrome86+
+
+ Opera?Edge86+
+
+ Edge (Legacy)?IENone
+
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
+
+
+
✔MDN
@@ -13055,7 +13630,7 @@ I
In all current engines.
- Firefox3.5+Safari4+Chrome1+
+ Firefox3.5+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -13084,7 +13659,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13116,7 +13691,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13132,7 +13707,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13148,7 +13723,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13164,7 +13739,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13180,7 +13755,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13196,7 +13771,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13212,7 +13787,7 @@ I
✔MDN
-
+
In all current engines.
Firefox4+Safari3+Chrome1+
@@ -13289,6 +13864,22 @@ I
+
+ ✔MDN
+
+
+ In all current engines.
+
+ Firefox1+Safari3+Chrome1+
+
+ Opera12.1+Edge79+
+
+ Edge (Legacy)12+IENone
+
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+
+
+
+
✔MDN
@@ -13788,7 +14379,7 @@ I
"56ad2aed": {"dfnID":"56ad2aed","dfnText":"insert","external":true,"refSections":[{"refs":[{"id":"ref-for-list-insert"}],"title":"4.2.3. Mutation algorithms"}],"url":"https://infra.spec.whatwg.org/#list-insert"},
"5832b143": {"dfnID":"5832b143","dfnText":"name","external":true,"refSections":[{"refs":[{"id":"ref-for-name"}],"title":"4.5. Interface Document"}],"url":"https://encoding.spec.whatwg.org/#name"},
"583654a9": {"dfnID":"583654a9","dfnText":"InvalidCharacterError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidcharactererror"}],"title":"1.4. Namespaces"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460"},{"id":"ref-for-invalidcharactererror\u2461"},{"id":"ref-for-invalidcharactererror\u2462"},{"id":"ref-for-invalidcharactererror\u2463"},{"id":"ref-for-invalidcharactererror\u2464"},{"id":"ref-for-invalidcharactererror\u2465"},{"id":"ref-for-invalidcharactererror\u2466"},{"id":"ref-for-invalidcharactererror\u2467"},{"id":"ref-for-invalidcharactererror\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u24ea"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2460"},{"id":"ref-for-invalidcharactererror\u2460\u2461"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2462"},{"id":"ref-for-invalidcharactererror\u2460\u2463"},{"id":"ref-for-invalidcharactererror\u2460\u2464"},{"id":"ref-for-invalidcharactererror\u2460\u2465"},{"id":"ref-for-invalidcharactererror\u2460\u2466"},{"id":"ref-for-invalidcharactererror\u2460\u2467"},{"id":"ref-for-invalidcharactererror\u2460\u2468"},{"id":"ref-for-invalidcharactererror\u2461\u24ea"}],"title":"7.1. Interface DOMTokenList"}],"url":"https://webidl.spec.whatwg.org/#invalidcharactererror"},
-"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"},
+"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"},{"id":"ref-for-code-unit\u2462"},{"id":"ref-for-code-unit\u2463"},{"id":"ref-for-code-unit\u2464"},{"id":"ref-for-code-unit\u2465"},{"id":"ref-for-code-unit\u2466"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"},
"5991ccfb": {"dfnID":"5991ccfb","dfnText":"relevant realm","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-relevant-realm"}],"title":"2.10. Firing events"}],"url":"https://html.spec.whatwg.org/multipage/webappapis.html#concept-relevant-realm"},
"5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"},{"id":"ref-for-window\u2461"}],"title":"2.3. Legacy extensions to the Window interface"},{"refs":[{"id":"ref-for-window\u2462"},{"id":"ref-for-window\u2463"},{"id":"ref-for-window\u2464"},{"id":"ref-for-window\u2465"}],"title":"2.9. Dispatching events"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"},
"5e0d3b02": {"dfnID":"5e0d3b02","dfnText":"match a selector against an element","external":true,"refSections":[{"refs":[{"id":"ref-for-match-a-selector-against-an-element"},{"id":"ref-for-match-a-selector-against-an-element\u2460"}],"title":"4.9. Interface Element"}],"url":"https://drafts.csswg.org/selectors-4/#match-a-selector-against-an-element"},
@@ -13813,7 +14404,6 @@ I
"797018a7": {"dfnID":"797018a7","dfnText":"InvalidStateError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidstateerror"}],"title":"2.7. Interface EventTarget"},{"refs":[{"id":"ref-for-invalidstateerror\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-invalidstateerror\u2461"}],"title":"6. Traversal"}],"url":"https://webidl.spec.whatwg.org/#invalidstateerror"},
"79e2abd0": {"dfnID":"79e2abd0","dfnText":"look up a custom element definition","external":true,"refSections":[{"refs":[{"id":"ref-for-look-up-a-custom-element-definition"},{"id":"ref-for-look-up-a-custom-element-definition\u2460"}],"title":"4.9. Interface Element"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#look-up-a-custom-element-definition"},
"7b0d918d": {"dfnID":"7b0d918d","dfnText":"break","external":true,"refSections":[{"refs":[{"id":"ref-for-iteration-break"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-iteration-break\u2460"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-iteration-break\u2461"},{"id":"ref-for-iteration-break\u2462"}],"title":"6.2. Interface TreeWalker"}],"url":"https://infra.spec.whatwg.org/#iteration-break"},
-"7cf8cfc4": {"dfnID":"7cf8cfc4","dfnText":"code units","external":true,"refSections":[{"refs":[{"id":"ref-for-def_code_unit"},{"id":"ref-for-def_code_unit\u2460"},{"id":"ref-for-def_code_unit\u2461"},{"id":"ref-for-def_code_unit\u2462"},{"id":"ref-for-def_code_unit\u2463"}],"title":"4.10. Interface CharacterData"}],"url":"https://w3c.github.io/i18n-glossary/#def_code_unit"},
"7f9469b5": {"dfnID":"7f9469b5","dfnText":"ascii case-insensitive","external":true,"refSections":[{"refs":[{"id":"ref-for-ascii-case-insensitive"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2460"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2461"}],"title":"4.9. Interface Element"}],"url":"https://infra.spec.whatwg.org/#ascii-case-insensitive"},
"85a289c7": {"dfnID":"85a289c7","dfnText":"svg namespace","external":true,"refSections":[{"refs":[{"id":"ref-for-svg-namespace"}],"title":"4.5.1. Interface DOMImplementation"}],"url":"https://infra.spec.whatwg.org/#svg-namespace"},
"8611edf0": {"dfnID":"8611edf0","dfnText":"InUseAttributeError","external":true,"refSections":[{"refs":[{"id":"ref-for-inuseattributeerror"}],"title":"4.9. Interface Element"}],"url":"https://webidl.spec.whatwg.org/#inuseattributeerror"},
@@ -13999,7 +14589,7 @@ I
"concept-node-filter": {"dfnID":"concept-node-filter","dfnText":"filter","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-filter"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-node-filter\u2460"},{"id":"ref-for-concept-node-filter\u2461"},{"id":"ref-for-concept-node-filter\u2462"},{"id":"ref-for-concept-node-filter\u2463"},{"id":"ref-for-concept-node-filter\u2464"},{"id":"ref-for-concept-node-filter\u2465"},{"id":"ref-for-concept-node-filter\u2466"},{"id":"ref-for-concept-node-filter\u2467"},{"id":"ref-for-concept-node-filter\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-node-filter"},
"concept-node-insert": {"dfnID":"concept-node-insert","dfnText":"insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert"},{"id":"ref-for-concept-node-insert\u2460"},{"id":"ref-for-concept-node-insert\u2461"},{"id":"ref-for-concept-node-insert\u2462"},{"id":"ref-for-concept-node-insert\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-insert\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-insert\u2465"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-insert\u2466"}],"title":"5.5. Interface Range"}],"url":"#concept-node-insert"},
"concept-node-insert-ext": {"dfnID":"concept-node-insert-ext","dfnText":"insertion steps","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert-ext"}],"title":"4.2.3. Mutation algorithms"}],"url":"#concept-node-insert-ext"},
-"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"},{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2463"},{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2468"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"5.2. Boundary points"}],"url":"#concept-node-length"},
+"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"},{"id":"ref-for-concept-node-length\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"},{"id":"ref-for-concept-node-length\u2468"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2461"},{"id":"ref-for-concept-node-length\u2460\u2462"},{"id":"ref-for-concept-node-length\u2460\u2463"},{"id":"ref-for-concept-node-length\u2460\u2464"},{"id":"ref-for-concept-node-length\u2460\u2465"},{"id":"ref-for-concept-node-length\u2460\u2466"},{"id":"ref-for-concept-node-length\u2460\u2467"},{"id":"ref-for-concept-node-length\u2460\u2468"},{"id":"ref-for-concept-node-length\u2461\u24ea"},{"id":"ref-for-concept-node-length\u2461\u2460"},{"id":"ref-for-concept-node-length\u2461\u2461"},{"id":"ref-for-concept-node-length\u2461\u2462"},{"id":"ref-for-concept-node-length\u2461\u2463"}],"title":"5.5. Interface Range"}],"url":"#concept-node-length"},
"concept-node-pre-insert": {"dfnID":"concept-node-pre-insert","dfnText":"pre-insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-insert"},{"id":"ref-for-concept-node-pre-insert\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2461"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2462"},{"id":"ref-for-concept-node-pre-insert\u2463"},{"id":"ref-for-concept-node-pre-insert\u2464"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2465"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2466"}],"title":"4.7. Interface DocumentFragment"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2467"},{"id":"ref-for-concept-node-pre-insert\u2468"},{"id":"ref-for-concept-node-pre-insert\u2460\u24ea"},{"id":"ref-for-concept-node-pre-insert\u2460\u2460"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2460\u2461"}],"title":"5.5. Interface Range"}],"url":"#concept-node-pre-insert"},
"concept-node-pre-remove": {"dfnID":"concept-node-pre-remove","dfnText":"pre-remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-remove"}],"title":"4.4. Interface Node"}],"url":"#concept-node-pre-remove"},
"concept-node-remove": {"dfnID":"concept-node-remove","dfnText":"remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-remove"},{"id":"ref-for-concept-node-remove\u2460"},{"id":"ref-for-concept-node-remove\u2461"},{"id":"ref-for-concept-node-remove\u2462"},{"id":"ref-for-concept-node-remove\u2463"},{"id":"ref-for-concept-node-remove\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-remove\u2465"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-remove\u2466"},{"id":"ref-for-concept-node-remove\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-remove\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u24ea"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u2460"},{"id":"ref-for-concept-node-remove\u2460\u2461"},{"id":"ref-for-concept-node-remove\u2460\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-node-remove"},
@@ -14050,9 +14640,9 @@ I
"concept-traverse-children": {"dfnID":"concept-traverse-children","dfnText":"traverse children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-children"},{"id":"ref-for-concept-traverse-children\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-children"},
"concept-traverse-siblings": {"dfnID":"concept-traverse-siblings","dfnText":"traverse siblings","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-siblings"},{"id":"ref-for-concept-traverse-siblings\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-siblings"},
"concept-tree": {"dfnID":"concept-tree","dfnText":"tree","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree"},{"id":"ref-for-concept-tree\u2460"},{"id":"ref-for-concept-tree\u2461"},{"id":"ref-for-concept-tree\u2462"},{"id":"ref-for-concept-tree\u2463"},{"id":"ref-for-concept-tree\u2464"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree\u2465"},{"id":"ref-for-concept-tree\u2466"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree\u2467"},{"id":"ref-for-concept-tree\u2468"},{"id":"ref-for-concept-tree\u2460\u24ea"},{"id":"ref-for-concept-tree\u2460\u2460"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2461"},{"id":"ref-for-concept-tree\u2460\u2462"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree\u2460\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2464"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2465"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2466"},{"id":"ref-for-concept-tree\u2460\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2468"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-concept-tree\u2461\u24ea"},{"id":"ref-for-concept-tree\u2461\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree\u2461\u2461"}],"title":"6. Traversal"}],"url":"#concept-tree"},
-"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2461"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2462"},{"id":"ref-for-concept-tree-ancestor\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2465"},{"id":"ref-for-concept-tree-ancestor\u2466"},{"id":"ref-for-concept-tree-ancestor\u2467"},{"id":"ref-for-concept-tree-ancestor\u2468"},{"id":"ref-for-concept-tree-ancestor\u2460\u24ea"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-ancestor"},
-"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"},{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"},{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"},{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"},{"id":"ref-for-concept-tree-child\u2462\u24ea"},{"id":"ref-for-concept-tree-child\u2462\u2460"},{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2463"},{"id":"ref-for-concept-tree-child\u2463\u2464"},{"id":"ref-for-concept-tree-child\u2463\u2465"},{"id":"ref-for-concept-tree-child\u2463\u2466"},{"id":"ref-for-concept-tree-child\u2463\u2467"},{"id":"ref-for-concept-tree-child\u2463\u2468"},{"id":"ref-for-concept-tree-child\u2464\u24ea"},{"id":"ref-for-concept-tree-child\u2464\u2460"},{"id":"ref-for-concept-tree-child\u2464\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2462"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2463"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2465"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2466"},{"id":"ref-for-concept-tree-child\u2464\u2467"},{"id":"ref-for-concept-tree-child\u2464\u2468"},{"id":"ref-for-concept-tree-child\u2465\u24ea"},{"id":"ref-for-concept-tree-child\u2465\u2460"},{"id":"ref-for-concept-tree-child\u2465\u2461"},{"id":"ref-for-concept-tree-child\u2465\u2462"},{"id":"ref-for-concept-tree-child\u2465\u2463"},{"id":"ref-for-concept-tree-child\u2465\u2464"},{"id":"ref-for-concept-tree-child\u2465\u2465"},{"id":"ref-for-concept-tree-child\u2465\u2466"},{"id":"ref-for-concept-tree-child\u2465\u2467"},{"id":"ref-for-concept-tree-child\u2465\u2468"},{"id":"ref-for-concept-tree-child\u2466\u24ea"},{"id":"ref-for-concept-tree-child\u2466\u2460"},{"id":"ref-for-concept-tree-child\u2466\u2461"},{"id":"ref-for-concept-tree-child\u2466\u2462"},{"id":"ref-for-concept-tree-child\u2466\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2466\u2464"},{"id":"ref-for-concept-tree-child\u2466\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"},
-"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"},{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462"},{"id":"ref-for-concept-tree-descendant\u2463"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2464"},{"id":"ref-for-concept-tree-descendant\u2465"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2466"},{"id":"ref-for-concept-tree-descendant\u2467"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u24ea"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u2460"},{"id":"ref-for-concept-tree-descendant\u2460\u2461"},{"id":"ref-for-concept-tree-descendant\u2460\u2462"},{"id":"ref-for-concept-tree-descendant\u2460\u2463"},{"id":"ref-for-concept-tree-descendant\u2460\u2464"},{"id":"ref-for-concept-tree-descendant\u2460\u2465"},{"id":"ref-for-concept-tree-descendant\u2460\u2466"},{"id":"ref-for-concept-tree-descendant\u2460\u2467"},{"id":"ref-for-concept-tree-descendant\u2460\u2468"},{"id":"ref-for-concept-tree-descendant\u2461\u24ea"},{"id":"ref-for-concept-tree-descendant\u2461\u2460"},{"id":"ref-for-concept-tree-descendant\u2461\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461\u2462"},{"id":"ref-for-concept-tree-descendant\u2461\u2463"},{"id":"ref-for-concept-tree-descendant\u2461\u2464"},{"id":"ref-for-concept-tree-descendant\u2461\u2465"},{"id":"ref-for-concept-tree-descendant\u2461\u2466"},{"id":"ref-for-concept-tree-descendant\u2461\u2467"},{"id":"ref-for-concept-tree-descendant\u2461\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u24ea"}],"title":"4.8. Interface ShadowRoot"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2460"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2461"},{"id":"ref-for-concept-tree-descendant\u2462\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-descendant"},
+"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"2.2. Interface Event"}],"url":"#concept-tree-ancestor"},
+"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"},{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"},{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"},{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u24ea"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"},{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"},{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"},{"id":"ref-for-concept-tree-child\u2463\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"},
+"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"4.3. Mutation observers"}],"url":"#concept-tree-descendant"},
"concept-tree-first-child": {"dfnID":"concept-tree-first-child","dfnText":"first child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-first-child"},{"id":"ref-for-concept-tree-first-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2461"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2462"},{"id":"ref-for-concept-tree-first-child\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2464"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2465"},{"id":"ref-for-concept-tree-first-child\u2466"},{"id":"ref-for-concept-tree-first-child\u2467"},{"id":"ref-for-concept-tree-first-child\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-first-child"},
"concept-tree-following": {"dfnID":"concept-tree-following","dfnText":"following","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-following"},{"id":"ref-for-concept-tree-following\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-following\u2461"},{"id":"ref-for-concept-tree-following\u2462"},{"id":"ref-for-concept-tree-following\u2463"},{"id":"ref-for-concept-tree-following\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-following\u2465"},{"id":"ref-for-concept-tree-following\u2466"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2467"},{"id":"ref-for-concept-tree-following\u2468"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2461"},{"id":"ref-for-concept-tree-following\u2460\u2462"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-following"},
"concept-tree-host-including-inclusive-ancestor": {"dfnID":"concept-tree-host-including-inclusive-ancestor","dfnText":"host-including inclusive ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor"},{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2461"}],"title":"4.7. Interface DocumentFragment"}],"url":"#concept-tree-host-including-inclusive-ancestor"},
@@ -14063,7 +14653,7 @@ I
"concept-tree-last-child": {"dfnID":"concept-tree-last-child","dfnText":"last child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-last-child"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2461"},{"id":"ref-for-concept-tree-last-child\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2463"},{"id":"ref-for-concept-tree-last-child\u2464"},{"id":"ref-for-concept-tree-last-child\u2465"},{"id":"ref-for-concept-tree-last-child\u2466"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-last-child"},
"concept-tree-next-sibling": {"dfnID":"concept-tree-next-sibling","dfnText":"next sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-next-sibling"},{"id":"ref-for-concept-tree-next-sibling\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2463"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2464"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2467"},{"id":"ref-for-concept-tree-next-sibling\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2464"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2467"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-next-sibling"},
"concept-tree-order": {"dfnID":"concept-tree-order","dfnText":"tree order","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-order"},{"id":"ref-for-concept-tree-order\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-order\u2461"},{"id":"ref-for-concept-tree-order\u2462"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-order\u2463"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-order\u2464"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-order\u2465"}],"title":"4.2.2.1. Slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2466"},{"id":"ref-for-concept-tree-order\u2467"},{"id":"ref-for-concept-tree-order\u2468"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u24ea"}],"title":"4.2.2.4. Assigning slottables and slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2460"},{"id":"ref-for-concept-tree-order\u2460\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2462"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2463"}],"title":"4.2.10. Old-style collections: NodeList and HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2464"}],"title":"4.2.10.1. Interface NodeList"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2465"},{"id":"ref-for-concept-tree-order\u2460\u2466"}],"title":"4.2.10.2. Interface HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2467"},{"id":"ref-for-concept-tree-order\u2460\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2460"},{"id":"ref-for-concept-tree-order\u2461\u2461"},{"id":"ref-for-concept-tree-order\u2461\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2463"},{"id":"ref-for-concept-tree-order\u2461\u2464"},{"id":"ref-for-concept-tree-order\u2461\u2465"},{"id":"ref-for-concept-tree-order\u2461\u2466"},{"id":"ref-for-concept-tree-order\u2461\u2467"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2468"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-order"},
-"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"},{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2466"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"},{"id":"ref-for-concept-tree-parent\u2464\u2467"},{"id":"ref-for-concept-tree-parent\u2464\u2468"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u24ea"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"},{"id":"ref-for-concept-tree-parent\u2465\u2464"},{"id":"ref-for-concept-tree-parent\u2465\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"},
+"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"},{"id":"ref-for-concept-tree-parent\u2462\u2466"},{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2467"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2468"},{"id":"ref-for-concept-tree-parent\u2465\u24ea"},{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"},
"concept-tree-participate": {"dfnID":"concept-tree-participate","dfnText":"participates","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-participate"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-participate\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-participate\u2461"},{"id":"ref-for-concept-tree-participate\u2462"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-participate\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-participate\u2464"}],"title":"4.4. Interface Node"}],"url":"#concept-tree-participate"},
"concept-tree-preceding": {"dfnID":"concept-tree-preceding","dfnText":"preceding","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-preceding"},{"id":"ref-for-concept-tree-preceding\u2460"},{"id":"ref-for-concept-tree-preceding\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2462"},{"id":"ref-for-concept-tree-preceding\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2464"},{"id":"ref-for-concept-tree-preceding\u2465"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2466"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2467"},{"id":"ref-for-concept-tree-preceding\u2468"},{"id":"ref-for-concept-tree-preceding\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2461"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-preceding"},
"concept-tree-previous-sibling": {"dfnID":"concept-tree-previous-sibling","dfnText":"previous sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-previous-sibling"},{"id":"ref-for-concept-tree-previous-sibling\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2463"},{"id":"ref-for-concept-tree-previous-sibling\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2465"},{"id":"ref-for-concept-tree-previous-sibling\u2466"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2467"},{"id":"ref-for-concept-tree-previous-sibling\u2468"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2460\u24ea"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2462"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-previous-sibling"},
@@ -15204,6 +15794,63 @@ I
}
}
+
-
-
-
+
-
-
-
+
Encoding
Living Standard — Last Updated
@@ -70,7 +402,7 @@ Encoding
- Participate:
-
+
Compatibility
Living Standard — Last Updated
@@ -69,7 +401,7 @@Compatibility
- Participate: -
- GitHub whatwg/compat (new issue, open issues)
+
- GitHub whatwg/compat (new issue, open issues)
- Chat on Matrix
- GitHub whatwg/compat (new issue, open issues)
- Commits:
- GitHub whatwg/compat/commits
@@ -287,7 +619,7 @@
animation-name-webkit-animation-duration-animation-duration+animation-duration-webkit-animation-timing-functionanimation-timing-function@@ -541,7 +873,7 @@-webkit-background-clip property—when its value is text—creates a background clipping region from the outer text stroke of the foreground text (including alpha transparency). -
The
+-webkit-background-clipproperty is a simple alias of the background-clip property for all other <box> values.The
-webkit-background-clipproperty is a simple alias of the background-clip property for all other <box> values.Note that the root element has a different background painting area, and thus the -webkit-background-clip property has no effect when specified on it. See the backgrounds of special elements.- border-box
@@ -985,17 +1317,20 @@
animation
- animation-delay
- animation-direction -
- animation-duration
- animation-fill-mode
- animation-iteration-count
- animation-name
- animation-play-state
- animation-timing-function +
- + [CSS-ANIMATIONS-2] defines the following terms: +
-
+
- animation-duration +
- [CSS-BACKGROUNDS-3] defines the following terms:
-
-
- <box>
- <line-width>
- background-clip
- background-origin
@@ -1007,6 +1342,11 @@
border-top-right-radius
- box-shadow
- + [CSS-BOX-4] defines the following terms: +
-
+
- <box> +
- [CSS-COLOR-4] defines the following terms:
-
@@ -1173,25 +1513,29 @@
- [CSS-ALIGN-3]
- Elika Etemad; Tab Atkins Jr.. CSS Box Alignment Module Level 3. URL: https://drafts.csswg.org/css-align/
- [CSS-ANIMATIONS-1] -
- Dean Jackson; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/
+
- David Baron; et al. CSS Animations Level 1. URL: https://drafts.csswg.org/css-animations/ +
- [CSS-ANIMATIONS-2] +
- David Baron; Brian Birtles. CSS Animations Level 2. URL: https://drafts.csswg.org/css-animations-2/
- [CSS-BACKGROUNDS-3] -
- Bert Bos; Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/
+
- Elika Etemad; Brad Kemper. CSS Backgrounds and Borders Module Level 3. URL: https://drafts.csswg.org/css-backgrounds/ +
- [CSS-BOX-4] +
- Elika Etemad. CSS Box Model Module Level 4. URL: https://drafts.csswg.org/css-box-4/
- [CSS-COLOR-4] -
- Tab Atkins Jr.; Chris Lilley; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color/
+
- Chris Lilley; Tab Atkins Jr.; Lea Verou. CSS Color Module Level 4. URL: https://drafts.csswg.org/css-color-4/
- [CSS-COLOR-5]
- Chris Lilley; et al. CSS Color Module Level 5. URL: https://drafts.csswg.org/css-color-5/
- [CSS-CONDITIONAL-3] -
- David Baron; Elika Etemad; Chris Lilley. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
+
- Chris Lilley; David Baron; Elika Etemad. CSS Conditional Rules Module Level 3. URL: https://drafts.csswg.org/css-conditional-3/
- [CSS-DISPLAY-3] -
- Tab Atkins Jr.; Elika Etemad. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
+
- Elika Etemad; Tab Atkins Jr.. CSS Display Module Level 3. URL: https://drafts.csswg.org/css-display/
- [CSS-DISPLAY-4] -
- CSS Display Module Level 4 URL: https://drafts.csswg.org/css-display-4/
+
- CSS Display Module Level 4. Editor's Draft. URL: https://drafts.csswg.org/css-display-4/
- [CSS-FLEXBOX-1]
- Tab Atkins Jr.; et al. CSS Flexible Box Layout Module Level 1. URL: https://drafts.csswg.org/css-flexbox-1/
- [CSS-MASKING-1]
- Dirk Schulze; Brian Birtles; Tab Atkins Jr.. CSS Masking Module Level 1. URL: https://drafts.fxtf.org/css-masking-1/
- [CSS-SIZE-ADJUST-1] -
- CSS Mobile Text Size Adjustment Module Level 1 URL: https://drafts.csswg.org/css-size-adjust-1/
+
- CSS Mobile Text Size Adjustment Module Level 1. Editor's Draft. URL: https://drafts.csswg.org/css-size-adjust-1/
- [CSS-SIZING-3]
- Tab Atkins Jr.; Elika Etemad. CSS Box Sizing Module Level 3. URL: https://drafts.csswg.org/css-sizing-3/
- [CSS-TRANSFORMS-1]
@@ -1695,6 +2039,7 @@
I "-webkit-repeating-linear-gradient": {"dfnID":"-webkit-repeating-linear-gradient","dfnText":"-webkit-repeating-linear-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-linear-gradient"}, "-webkit-repeating-radial-gradient": {"dfnID":"-webkit-repeating-radial-gradient","dfnText":"-webkit-repeating-radial-gradient()","external":false,"refSections":[],"url":"#-webkit-repeating-radial-gradient"}, "0460a504": {"dfnID":"0460a504","dfnText":"resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"}, +"06a8cc3f": {"dfnID":"06a8cc3f","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-2/#propdef-animation-duration"}, "09f2cf3e": {"dfnID":"09f2cf3e","dfnText":"transform-origin","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform-origin"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform-origin"}, "0bf92d15": {"dfnID":"0bf92d15","dfnText":"mask-composite","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-composite"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-composite"}, "11151628": {"dfnID":"11151628","dfnText":"mask-clip","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-clip"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-clip"}, @@ -1710,7 +2055,6 @@
I "280c9a03": {"dfnID":"280c9a03","dfnText":"border-bottom-right-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-bottom-right-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-bottom-right-radius"}, "2f0492ac": {"dfnID":"2f0492ac","dfnText":"body","external":true,"refSections":[{"refs":[{"id":"ref-for-the-body-element"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-the-body-element\u2460"},{"id":"ref-for-the-body-element\u2461"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/sections.html#the-body-element"}, "3124d393": {"dfnID":"3124d393","dfnText":"linear-gradient","external":true,"refSections":[{"refs":[{"id":"ref-for-ltlinear-gradient"}],"title":"3.3.1. \n -webkit-linear-gradient()\n"}],"url":"https://www.w3.org/TR/2011/WD-css3-images-20110217/#ltlinear-gradient"}, -"342bb58f": {"dfnID":"342bb58f","dfnText":"
","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#typedef-box"}, "35972864": {"dfnID":"35972864","dfnText":"active document","external":true,"refSections":[{"refs":[{"id":"ref-for-nav-document"}],"title":"4.2. window.orientation API"}],"url":"https://html.spec.whatwg.org/multipage/document-sequences.html#nav-document"}, "366fd15a": {"dfnID":"366fd15a","dfnText":"min-resolution","external":true,"refSections":[{"refs":[{"id":"ref-for-descdef-media-resolution"},{"id":"ref-for-descdef-media-resolution\u2460"},{"id":"ref-for-descdef-media-resolution\u2461"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"}],"url":"https://drafts.csswg.org/mediaqueries-4/#descdef-media-resolution"}, "3a74ed0c": {"dfnID":"3a74ed0c","dfnText":"flex-flow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-flow"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-flow"}, @@ -1723,7 +2067,6 @@ I "4d0e596d": {"dfnID":"4d0e596d","dfnText":"mask-border-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-border-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-border-repeat"}, "58a520d5": {"dfnID":"58a520d5","dfnText":"mask-repeat","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-mask-repeat"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.fxtf.org/css-masking-1/#propdef-mask-repeat"}, "5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"}],"title":"4.2. window.orientation API"},{"refs":[{"id":"ref-for-window\u2461"},{"id":"ref-for-window\u2462"}],"title":"4.2.2. Event Handlers on Window objects and body elements"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"}, -"5e8da52b": {"dfnID":"5e8da52b","dfnText":"animation-duration","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation-duration"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation-duration"}, "5f1a81e7": {"dfnID":"5f1a81e7","dfnText":"border-radius","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-border-radius"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-backgrounds-3/#propdef-border-radius"}, "5f1b7f60": {"dfnID":"5f1b7f60","dfnText":"@media","external":true,"refSections":[{"refs":[{"id":"ref-for-at-ruledef-media"}],"title":"3.2.1. \n -webkit-device-pixel-ratio\n"},{"refs":[{"id":"ref-for-at-ruledef-media\u2460"}],"title":"3.2.2. \n -webkit-transform-3d\n"}],"url":"https://drafts.csswg.org/css-conditional-3/#at-ruledef-media"}, "5fd23811": {"dfnID":"5fd23811","dfnText":"fire an event","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-event-fire"}],"title":"4.2. window.orientation API"}],"url":"https://dom.spec.whatwg.org/#concept-event-fire"}, @@ -1790,6 +2133,7 @@
I "e2e08d07": {"dfnID":"e2e08d07","dfnText":"transform","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-transform"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-transforms-1/#propdef-transform"}, "e3d4f907": {"dfnID":"e3d4f907","dfnText":"color","external":true,"refSections":[{"refs":[{"id":"ref-for-animtype-color"}],"title":"3.4.7.1. Foreground Text Color: the \n-webkit-text-fill-color property"},{"refs":[{"id":"ref-for-animtype-color\u2460"}],"title":"3.4.7.2. Text Stroke Color: the \n-webkit-text-stroke-color property"}],"url":"https://drafts.csswg.org/css-transitions/#animtype-color"}, "e6ccf9d2": {"dfnID":"e6ccf9d2","dfnText":"ScreenOrientation","external":true,"refSections":[{"refs":[{"id":"ref-for-screenorientation-interface"}],"title":"4.2.1. window.orientation angle"},{"refs":[{"id":"ref-for-screenorientation-interface\u2460"}],"title":"Acknowledgements"}],"url":"https://w3c.github.io/screen-orientation/#screenorientation-interface"}, +"e7382b89": {"dfnID":"e7382b89","dfnText":"
","external":true,"refSections":[{"refs":[{"id":"ref-for-typedef-box"}],"title":"3.4.6. Foreground Text Clipping: the \n-webkit-background-clip property"}],"url":"https://drafts.csswg.org/css-box-4/#typedef-box"}, "e983d6ca": {"dfnID":"e983d6ca","dfnText":"WebKitCSSMatrix","external":true,"refSections":[{"refs":[{"id":"ref-for-webkitcssmatrix"}],"title":"4.1. The WebKitCSSMatrix interface"}],"url":"https://drafts.fxtf.org/geometry-1/#webkitcssmatrix"}, "eda608e1": {"dfnID":"eda608e1","dfnText":"animation","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-animation"}],"title":"3.4.1. Simple property aliases"}],"url":"https://drafts.csswg.org/css-animations-1/#propdef-animation"}, "edc3a18b": {"dfnID":"edc3a18b","dfnText":"flex-grow","external":true,"refSections":[{"refs":[{"id":"ref-for-propdef-flex-grow"}],"title":"3.4.1. Simple property aliases"},{"refs":[{"id":"ref-for-propdef-flex-grow\u2460"}],"title":"3.4.4. Property mappings"}],"url":"https://drafts.csswg.org/css-flexbox-1/#propdef-flex-grow"}, @@ -2264,9 +2608,9 @@ I "use strict"; { let linkTitleData = { -"https://drafts.csswg.org/css-backgrounds-3/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | svg viewport origin box | view-box", "https://drafts.csswg.org/css-backgrounds-3/#typedef-line-width": "Expands to: medium | thick | thin", -"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to: aliceblue | antiquewhite | aqua | aquamarine | azure | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | cadetblue | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | green | greenyellow | grey | honeydew | hotpink | indianred | indigo | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | magenta | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | seagreen | seashell | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | tomato | transparent | turquoise | violet | wheat | white | whitesmoke | yellow | yellowgreen", +"https://drafts.csswg.org/css-box-4/#typedef-box": "Expands to: border-box | content-box | fill-box | margin-box | padding-box | stroke-box | view-box", +"https://drafts.csswg.org/css-color-5/#typedef-color": "Expands to:
| accentcolor | accentcolortext | activeborder | activecaption | activetext | aliceblue | antiquewhite | appworkspace | aqua | aquamarine | azure | background | beige | bisque | black | blanchedalmond | blue | blueviolet | brown | burlywood | buttonborder | buttonface | buttonhighlight | buttonshadow | buttontext | cadetblue | canvas | canvastext | captiontext | chartreuse | chocolate | coral | cornflowerblue | cornsilk | crimson | currentcolor | cyan | darkblue | darkcyan | darkgoldenrod | darkgray | darkgreen | darkgrey | darkkhaki | darkmagenta | darkolivegreen | darkorange | darkorchid | darkred | darksalmon | darkseagreen | darkslateblue | darkslategray | darkslategrey | darkturquoise | darkviolet | deeppink | deepskyblue | dimgray | dimgrey | dodgerblue | field | fieldtext | firebrick | floralwhite | forestgreen | fuchsia | gainsboro | ghostwhite | gold | goldenrod | gray | graytext | green | greenyellow | grey | highlight | highlighttext | honeydew | hotpink | inactiveborder | inactivecaption | inactivecaptiontext | indianred | indigo | infobackground | infotext | ivory | khaki | lavender | lavenderblush | lawngreen | lemonchiffon | lightblue | lightcoral | lightcyan | lightgoldenrodyellow | lightgray | lightgreen | lightgrey | lightpink | lightsalmon | lightseagreen | lightskyblue | lightslategray | lightslategrey | lightsteelblue | lightyellow | lime | limegreen | linen | linktext | magenta | mark | marktext | maroon | mediumaquamarine | mediumblue | mediumorchid | mediumpurple | mediumseagreen | mediumslateblue | mediumspringgreen | mediumturquoise | mediumvioletred | menu | menutext | midnightblue | mintcream | mistyrose | moccasin | navajowhite | navy | none | oldlace | olive | olivedrab | orange | orangered | orchid | palegoldenrod | palegreen | paleturquoise | palevioletred | papayawhip | peachpuff | peru | pink | plum | powderblue | purple | rebeccapurple | red | rosybrown | royalblue | saddlebrown | salmon | sandybrown | scrollbar | seagreen | seashell | selecteditem | selecteditemtext | sienna | silver | skyblue | slateblue | slategray | slategrey | snow | springgreen | steelblue | tan | teal | thistle | threeddarkshadow | threedface | threedhighlight | threedlightshadow | threedshadow | tomato | transparent | turquoise | violet | visitedtext | wheat | white | whitesmoke | window | windowframe | windowtext | yellow | yellowgreen", }; function setTypeTitles() { @@ -2280,6 +2624,63 @@ I document.addEventListener("DOMContentLoaded", setTypeTitles); } + - - - - -
-
+
Console
Living Standard — Last Updated
@@ -69,7 +401,7 @@Console
- Participate: -
- GitHub whatwg/console (new issue, open issues)
+
- GitHub whatwg/console (new issue, open issues)
- Chat on Matrix
- GitHub whatwg/console (new issue, open issues)
- Commits:
- GitHub whatwg/console/commits
@@ -853,7 +1185,7 @@
I
In all current engines.
- Firefox28+Safari4+Chrome1+ + Firefox28+Safari4+Chrome2+
Opera11+Edge79+
@@ -889,7 +1221,7 @@I
In all current engines.
- Firefox30+Safari4+Chrome1+ + Firefox30+Safari4+Chrome2+
Opera11+Edge79+
@@ -925,7 +1257,7 @@I
In all current engines.
- Firefox5+Safari4+Chrome1+ + Firefox5+Safari4+Chrome2+
Opera11+Edge79+
@@ -943,7 +1275,7 @@I
In all current engines.
- Firefox8+Safari4+Chrome1+ + Firefox8+Safari4+Chrome2+
Opera11+Edge79+
@@ -961,7 +1293,7 @@I
In all current engines.
- Firefox39+Safari4+Chrome1+ + Firefox39+Safari4+Chrome2+
Opera11+Edge79+
@@ -997,7 +1329,7 @@I
In all current engines.
- Firefox9+Safari4+Chrome1+ + Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1033,7 +1365,7 @@I
In all current engines.
- Firefox9+Safari4+Chrome1+ + Firefox9+Safari4+Chrome2+
Opera11+Edge79+
@@ -1105,7 +1437,7 @@I
In all current engines.
- Firefox10+Safari4+Chrome1+ + Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1123,7 +1455,7 @@I
In all current engines.
- Firefox10+Safari4+Chrome1+ + Firefox10+Safari4+Chrome2+
Opera11+Edge79+
@@ -1138,7 +1470,7 @@I
✔MDN
- +In all current engines.
Firefox62+Safari13+Chrome71+ @@ -1159,7 +1491,7 @@I
In all current engines.
- Firefox6+Safari4+Chrome1+ + Firefox6+Safari4+Chrome2+
Opera11+Edge79+
@@ -1874,6 +2206,63 @@I } } + - - - - -
-
+
DOM
Living Standard — Last Updated
@@ -69,7 +401,7 @@DOM
- Participate: -
- GitHub whatwg/dom (new issue, open issues)
+
- GitHub whatwg/dom (new issue, open issues)
- Chat on Matrix
- GitHub whatwg/dom (new issue, open issues)
- Commits:
- GitHub whatwg/dom/commits
@@ -242,12 +574,12 @@
1.1. null or an object, and has children, which is an ordered set of objects. An object A whose parent is object B is a child of B.
The root of an object is itself, if its parent is null, or else it is the root of its parent. The root of a tree is any object participating in that tree whose parent is null.
An object A is called a descendant of an object B, if either A is a child of B or A is a child of an -object C that is a descendant of B.
+object C that is a descendant of B.An inclusive descendant is -an object or one of its descendants.
-An object A is called an ancestor of an object B if and only if B is a descendant of A.
+an object or one of its descendants. +An object A is called an ancestor of an object B if and only if B is a descendant of A.
An inclusive ancestor is -an object or one of its ancestors.
+an object or one of its ancestors.An object A is called a sibling of an object B, if and only if B and A share the same non-null parent.
An inclusive sibling is an object or one of its siblings.
@@ -258,9 +590,9 @@1.1. same tree and A comes after B in tree order.
The first child of an object is its -first child or null if it has no children.
+first child or null if it has no children.The last child of an object is its -last child or null if it has no children.
+last child or null if it has no children.The previous sibling of an object is its first preceding sibling or null if it has no preceding sibling.
The next sibling of an @@ -353,7 +685,7 @@
} - When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s
bubblesis true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in +When an event is dispatched to an object that participates in a tree (e.g., an element), it can reach event listeners on that object’s ancestors too. Effectively, all the object’s inclusive ancestor event listeners whose capture is true are invoked, in tree order. And then, if event’s
bubblesis true, all the object’s inclusive ancestor event listeners whose capture is false are invoked, now in reverse tree order.Let’s look at an example of how events work in a tree:
<!doctype html> @@ -455,7 +787,7 @@event listeners after the current one finishes running and, when dispatched in a tree, also prevents event from reaching any other objects.
event .-bubbles- Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false. +
- Returns true or false depending on how event was initialized. True if event goes through its target’s ancestors in reverse tree order; otherwise false.
event .cancelable- Returns true or false depending on how event was initialized. Its return value does not always carry meaning, but true can indicate that part of the operation @@ -1435,7 +1767,7 @@
-
Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
+Each such document is represented as a node tree. Some of the nodes in a tree can have children, while others are always leaves.
To illustrate, consider this HTML document:
<!DOCTYPE html> < html class = e > @@ -1475,7 +1807,7 @@The most excellent Live DOM Viewer can be used to explore this matter in more detail.
4.2. Node tree
-Document,DocumentType,DocumentFragment,Element,Text,ProcessingInstruction, andCommentobjects (simply called nodes) participate in a tree, simply named the node tree.A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
+A node tree is constrained as follows, expressed as a relationship between the type of node and its allowed children:
Document-
@@ -1515,9 +1847,9 @@
Its data’s length.
- Any other node
- -
Its number of children.
+Its number of children.
A node is considered empty if its length is zero.
+A node is considered empty if its length is zero.
4.2.1. Document tree
A document tree is a node tree whose root is a document.
The document element of a document is the element whose parent is that document, if it exists; otherwise null.
@@ -1604,10 +1936,10 @@mode is not "
open", then return null.If shadow’s slot assignment is "
manual", then - return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise + return the slot in shadow’s descendants whose manually assigned nodes contains slottable, if any; otherwise null.- -
Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
+Return the first slot in tree order in shadow’s descendants whose name is slottable’s name, if any; otherwise null.
To find slottables for a given slot slot, run these steps:
-
@@ -1628,7 +1960,7 @@
For each slottable slottable of slot’s manually assigned nodes, if slottable’s parent is host, append slottable to result.
- -
Otherwise, for each slottable child slottable of host, in tree order:
+Otherwise, for each slottable child slottable of host, in tree order:
-
Let foundSlot be the result of finding a slot given slottable.
@@ -1647,7 +1979,7 @@finding slottables given slot.
-
-
If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
+If slottables is the empty list, then append each slottable child of slot, in tree order, to slottables.
-
For each node in slottables:
-
@@ -1719,17 +2051,17 @@
DocumentFragmentnode-
-
If node has more than one element child or has a
-Textnode child.Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
+If node has more than one element child or has a
+Textnode child.Otherwise, if node has one element child and either parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
- element
-
-
parent has an element child, child is +
parent has an element child, child is a doctype, or child is non-null and a doctype is following child.
- doctype
-
-
parent has a doctype child, child is non-null +
parent has a doctype child, child is non-null and an element is preceding child, or child is null - and parent has an element child.
+ and parent has an element child.
To pre-insert a node into a parent before a child, run these steps:
@@ -1751,7 +2083,7 @@To insert a node into a parent before a child, with an optional suppress observers flag, run these steps:
-
-
Let nodes be node’s children, if node is a
+DocumentFragmentnode; otherwise « node ».Let nodes be node’s children, if node is a
DocumentFragmentnode; otherwise « node ». -
Let count be nodes’s size.
-
@@ -1760,7 +2092,7 @@
If node is a
DocumentFragmentnode, then:- - +
-
Queue a tree mutation record for node with « », nodes, null, and null.
@@ -1784,9 +2116,9 @@Adopt node into parent’s node document.
- - +
- -
Otherwise, insert node into parent’s children before child’s index.
+Otherwise, insert node into parent’s children before child’s index.
If parent is a shadow host whose shadow root’s slot assignment is "
named" and node is a slottable, then assign a slot for node.- @@ -1837,14 +2169,14 @@
DocumentFragmentnode- -
If node has more than one element child or has a
-Textnode child.Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
+If node has more than one element child or has a
+Textnode child.Otherwise, if node has one element child and either parent has an element child that is not child or a doctype is following child.
- element
- -
parent has an element child that is not child or a doctype is following child.
+parent has an element child that is not child or a doctype is following child.
- doctype
- -
parent has a doctype child that is not child, +
parent has a doctype child that is not child, or an element is preceding child.
The above statements differ from the pre-insert algorithm.
@@ -1866,7 +2198,7 @@The above can only be false if child is node.
- -
Let nodes be node’s children if node is a
+DocumentFragmentnode; otherwise « node ».Let nodes be node’s children if node is a
DocumentFragmentnode; otherwise « node ».Insert node into parent before referenceChild with the suppress observers flag set.
- @@ -1877,15 +2209,15 @@
To replace all with a node within a parent, run these steps:
-
-
Let removedNodes be parent’s children.
+Let removedNodes be parent’s children.
-
Let addedNodes be the empty set.
-
-
If node is a
+DocumentFragmentnode, then set addedNodes to node’s children.If node is a
DocumentFragmentnode, then set addedNodes to node’s children. -
Otherwise, if node is non-null, set addedNodes to « node ».
-
-
Remove all parent’s children, in tree order, with the suppress observers flag set.
+Remove all parent’s children, in tree order, with the suppress observers flag set.
-
If node is non-null, then insert node into parent before null with the suppress observers flag set.
-
@@ -1930,7 +2262,7 @@
Let oldNextSibling be node’s next sibling.
- - +
If node is assigned, then run assign slottables for node’s assigned slot.
- @@ -1980,9 +2312,9 @@
node . getElementById(elementId)- -
Returns the first element within node’s descendants whose ID is elementId.
+Returns the first element within node’s descendants whose ID is elementId.
-The
getElementById(elementId)method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if +The
getElementById(elementId)method steps are to return the first element, in tree order, within this’s descendants, whose ID is elementId; otherwise, if there is no such element, null.4.2.5. Mixin
DocumentOrShadowRootinterface mixin DocumentOrShadowRoot collection = node .-children- Returns the child elements.
+
- Returns the child elements.
element = node .-firstElementChild- Returns the first child that is an element; otherwise null.
+
- Returns the first child that is an element; otherwise null.
element = node .-lastElementChild- Returns the last child that is an element; otherwise null.
+
- Returns the last child that is an element; otherwise null.
node . prepend(nodes)-
Inserts nodes before the first child of node, while @@ -2044,24 +2376,24 @@
node tree are violated.
node . replaceChildren(nodes)- -
Replace all children of node with nodes, +
Replace all children of node with nodes, while replacing strings in nodes with equivalent
Textnodes.Throws a "
HierarchyRequestError"DOMExceptionif the constraints of the node tree are violated.node . querySelector(selectors)-- Returns the first element that is a descendant of node that +
- Returns the first element that is a descendant of node that matches selectors.
node . querySelectorAll(selectors)-- Returns all element descendants of node that +
- Returns all element descendants of node that match selectors.
The
+childrengetter steps are to return anHTMLCollectioncollection rooted at this matching only element children.The
childrengetter steps are to return anHTMLCollectioncollection rooted at this matching only element children.The
+the first child that is an element; otherwise null.firstElementChildgetter steps are to return -the first child that is an element; otherwise null.The
+the last child that is an element; otherwise null.lastElementChildgetter steps are to return -the last child that is an element; otherwise null.The
+the number of children of this that are elements.childElementCountgetter steps are to return -the number of children of this that are elements.The
prepend(nodes)method steps are:-
@@ -2345,7 +2677,7 @@
A registered observer consists of an observer (a
MutationObserverobject) and options (aMutationObserverInitdictionary).A transient registered observer is a registered observer that also consists of a source (a registered observer).
Transient registered observers are used to track mutations within -a given node’s descendants after node has been removed so +a given node’s descendants after node has been removed so they do not get lost when
subtreeis set to true on node’s parent.4.3.1. Interface
MutationObserver[
Exposed =Window ] @@ -2391,7 +2723,7 @@< can be used:
childList-- Set to true if mutations to target’s children are to be observed.
+
- Set to true if mutations to target’s children are to be observed.
attributes- Set to true if mutations to target’s attributes are to be observed. Can be omitted if
attributeOldValueorattributeFilteris specified. @@ -2399,7 +2731,7 @@<
- Set to true if mutations to target’s data are to be observed. Can be omitted if
characterDataOldValueis specified.subtree- Set to true if mutations to not just target, but - also target’s descendants are to be + also target’s descendants are to be observed.
attributeOldValue- Set to true if
attributesis true or omitted @@ -2551,7 +2883,7 @@type. For " attributes", it is the element whose attribute changed. For "characterData", it is theCharacterDatanode. For "childList", - it is the node whose children changed. + it is the node whose children changed.record .addedNodesrecord .removedNodes- Return the nodes added and removed @@ -2761,9 +3093,9 @@
parentElement
- Returns the parent element.
node .-hasChildNodes()- Returns whether node has children. +
- Returns whether node has children.
node .-childNodes- Returns the children. +
- Returns the children.
node .firstChild- Returns the first child.
node .@@ -2784,8 +3116,8 @@lastChildparentNodegetter steps are to return this’s parent.The
-parentElementgetter steps are to return this’s parent element.The
-hasChildNodes()method steps are to return true if this has children; otherwise false.The
+childNodesgetter steps are to return aNodeListrooted at this matching only children.The
+hasChildNodes()method steps are to return true if this has children; otherwise false.The
childNodesgetter steps are to return aNodeListrooted at this matching only children.The
firstChildgetter steps are to return this’s first child.The
lastChildgetter steps are to return this’s last child.The
@@ -2815,7 +3147,7 @@previousSiblinggetter steps are to return this’s previous sibling.ProcessingInstruction
Comment- -
Replace data with node this, offset 0, count this’s length, and data new value.
+Replace data with node this, offset 0, count this’s length, and data new value.
- Any other node
Do nothing.
@@ -2858,7 +3190,7 @@ProcessingInstruction
Comment- -
Replace data with node this, offset 0, count this’s length, and data the given value.
+Replace data with node this, offset 0, count this’s length, and data the given value.
- Any other node
Do nothing.
@@ -2869,9 +3201,9 @@empty exclusive
Textnodes and concatenates the data of remaining contiguous exclusiveTextnodes into the first of their nodes. - Set to true if mutations to target’s data are to be observed. Can be omitted if
The
+each descendant exclusivenormalize()method steps are to run these steps for -each descendant exclusiveTextnode node of this:Textnode node of this:-
-
- Let length be node’s length. +
- Let length be node’s length.
- If length is zero, then remove node and continue with the
next exclusive
Textnode, if any. - Let data be the concatenation of the data of node’s contiguous exclusive
Textnodes (excluding itself), in tree order. @@ -2890,7 +3222,7 @@live range whose end node is currentNode’s parent and end offset is currentNode’s index, set its end node to node and its end offset to length.
- -
Add currentNode’s length to length.
+Add currentNode’s length to length.
Set currentNode to its next sibling.
- -
node . cloneNode([deep = false])-- Returns a copy of node. If deep is true, the copy also includes the node’s descendants. +
- Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
node .isEqualNode(otherNode)- Returns whether node and otherNode have the same properties. @@ -2951,7 +3283,7 @@
node document and document to copy, if copy is a document, and set copy’s node document to document otherwise.
- Run any cloning steps defined for node in other applicable specifications and pass copy, node, document and the clone children flag if set, as parameters. -
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set. +
- If the clone children flag is set, clone all the children of node and append them to copy, with document as specified and the clone children flag being set.
- Return copy.
The
@@ -2983,8 +3315,8 @@cloneNode(deep)method steps are:element, each attribute in its attribute list has an attribute that equals an attribute in B’s attribute list. -
- A and B have the same number of children. -
- Each child of A equals the child of B at the identical index. +
- A and B have the same number of children. +
- Each child of A equals the child of B at the identical index.
The
@@ -3005,9 +3337,9 @@isEqualNode(otherNode)method steps are to return true if otherNode is non-null and this equals otherNode; otherwise false.Node .
DOCUMENT_POSITION_FOLLOWING(4)- Set when other is following node.
Node.DOCUMENT_POSITION_CONTAINS- Set when other is an ancestor of node. +
- Set when other is an ancestor of node.
Node.DOCUMENT_POSITION_CONTAINED_BY- Set when other is a descendant of node. +
- Set when other is a descendant of node.
node .contains(other)- Returns true if other is an inclusive descendant of node; @@ -3062,16 +3394,16 @@
Math
. random() value can be used.- -
If node1 is an ancestor of node2 and attr1 is null, +
If node1 is an ancestor of node2 and attr1 is null, or node1 is node2 and attr2 is non-null, then return the result of adding
DOCUMENT_POSITION_CONTAINStoDOCUMENT_POSITION_PRECEDING.- -
If node1 is a descendant of node2 and attr2 is null, +
If node1 is a descendant of node2 and attr2 is null, or node1 is node2 and attr1 is non-null, then return the result of adding
DOCUMENT_POSITION_CONTAINED_BYtoDOCUMENT_POSITION_FOLLOWING.If node1 is preceding node2, then return
-DOCUMENT_POSITION_PRECEDING.Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children, +
Due to the way attributes are handled in this algorithm this results in a node’s attributes counting as preceding that node’s children, despite attributes not participating in a tree.
Return
@@ -3194,10 +3526,10 @@DOCUMENT_POSITION_FOLLOWING.*" (U+002A), return a
HTMLCollectionrooted - at root, whose filter matches only descendant elements. + at root, whose filter matches only descendant elements.Otherwise, if root’s node document is an HTML document, - return a
+ return aHTMLCollectionrooted at root, whose filter matches the following descendant elements:HTMLCollectionrooted at root, whose filter matches the following descendant elements:-
Whose namespace is the HTML namespace and whose qualified name is qualifiedName, in ASCII lowercase.
@@ -3205,18 +3537,18 @@namespace is not the HTML namespace and whose qualified name is qualifiedName.
- -
Otherwise, return a
+HTMLCollectionrooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.Otherwise, return a
HTMLCollectionrooted at root, whose filter matches descendant elements whose qualified name is qualifiedName.
When invoked with the same argument, and as long as root’s node document’s type has not changed, the same
HTMLCollectionobject may be returned as returned by an earlier call.The list of elements with namespace namespace and local name localName for a node root is the
HTMLCollectionreturned by the following algorithm:- If namespace is the empty string, set it to null. -
- If both namespace and localName are "
*" (U+002A), return aHTMLCollectionrooted at root, whose filter matches descendant elements. + - If both namespace and localName are "
*" (U+002A), return aHTMLCollectionrooted at root, whose filter matches descendant elements. - Otherwise, if namespace is "
*" - (U+002A), return aHTMLCollectionrooted at root, whose filter matches descendant elements whose local name is localName. + (U+002A), return aHTMLCollectionrooted at root, whose filter matches descendant elements whose local name is localName. - Otherwise, if localName is "
*" - (U+002A), return aHTMLCollectionrooted at root, whose filter matches descendant elements whose namespace is namespace. - - Otherwise, return a
HTMLCollectionrooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName. + (U+002A), return aHTMLCollectionrooted at root, whose filter matches descendant elements whose namespace is namespace. + - Otherwise, return a
HTMLCollectionrooted at root, whose filter matches descendant elements whose namespace is namespace and local name is localName.
When invoked with the same arguments, the same
HTMLCollectionobject may be returned as returned by an earlier call.The list of elements with class names classNames for a node root is the
@@ -3225,7 +3557,7 @@HTMLCollectionreturned by the following algorithm:HTMLCollection.
Return a
+ whose filter matches descendant elements that have all their classes in classes.HTMLCollectionrooted at root, - whose filter matches descendant elements that have all their classes in classes.The comparisons for the classes must be done in an ASCII case-insensitive manner if root’s node document’s mode is "
quirks"; otherwise in an identical to manner.
When invoked with the same argument, the same
@@ -3333,15 +3665,15 @@HTMLCollectionobject may be returned as returned by an earlier call.Returns the document element.
- collection = document .
getElementsByTagName(qualifiedName)- -
If qualifiedName is "
-*" returns aHTMLCollectionof all descendant elements.Otherwise, returns a
+HTMLCollectionof all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)If qualifiedName is "
+*" returns aHTMLCollectionof all descendant elements.Otherwise, returns a
HTMLCollectionof all descendant elements whose qualified name is qualifiedName. (Matches case-insensitively against elements in the HTML namespace within an HTML document.)- collection = document .
getElementsByTagNameNS(namespace, localName)- If namespace and localName are - "
*" returns aHTMLCollectionof all descendant elements. -If only namespace is "
-*" returns aHTMLCollectionof all descendant elements whose local name is localName.If only localName is "
-*" returns aHTMLCollectionof all descendant elements whose namespace is namespace.Otherwise, returns a
+ "HTMLCollectionof all descendant elements whose namespace is namespace and local name is localName.*" returns aHTMLCollectionof all descendant elements. +If only namespace is "
+*" returns aHTMLCollectionof all descendant elements whose local name is localName.If only localName is "
+*" returns aHTMLCollectionof all descendant elements whose namespace is namespace.Otherwise, returns a
HTMLCollectionof all descendant elements whose namespace is namespace and local name is localName.- collection = document .
getElementsByClassName(classNames)- collection = element .
getElementsByClassName(classNames)- Returns a
HTMLCollectionof the elements in the object on which @@ -3351,7 +3683,7 @@classNames argument is interpreted as a space-separated list of classes. -
The
+doctypegetter steps are to return the child of this that is a doctype; otherwise null.The
doctypegetter steps are to return the child of this that is a doctype; otherwise null.The
documentElementgetter steps are to return this’s document element.The
getElementsByTagName(qualifiedName)method steps are to return the list of elements with qualified name qualifiedName for this.Thus, in an HTML document,
documentwill match. getElementsByTagName( "FOO" ) <FOO>elements that are not in the HTML namespace, and<foo>elements that are in @@ -3481,7 +3813,7 @@- clone = document . importNode(node [, deep = false])
- - Returns a copy of node. If deep is true, the copy also includes the node’s descendants. + Returns a copy of node. If deep is true, the copy also includes the node’s descendants.
If node is a document or a shadow root, throws a "
NotSupportedError"DOMException.- node = document .
adoptNode(node)@@ -3590,7 +3922,7 @@" devicemotionevent"DeviceMotionEvent-[DEVICE-ORIENTATION] + [DEVICE-ORIENTATION] " deviceorientationevent"DeviceOrientationEvent@@ -3871,7 +4203,7 @@In shadow-including tree order is shadow-including preorder, depth-first traversal of a node tree. Shadow-including preorder, depth-first traversal of a node tree tree is preorder, depth-first traversal of tree, with for each shadow host encountered in tree, shadow-including preorder, depth-first traversal of that element’s shadow root’s node tree just after it is encountered.
The shadow-including root of an object is its root’s host’s shadow-including root, if the object’s root is a shadow root; otherwise its root.
-An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
+An object A is a shadow-including descendant of an object B, if A is a descendant of B, or A’s root is a shadow root and A’s root’s host is a shadow-including inclusive descendant of B.
A shadow-including inclusive descendant is an object or one of its shadow-including descendants.
An object A is a shadow-including ancestor of an object B, if and only if B is a shadow-including descendant of A.
A shadow-including inclusive ancestor is an object or one of its shadow-including ancestors.
@@ -4067,7 +4399,7 @@If result’s attribute list is not empty, then throw a "
NotSupportedError"DOMException.- -
If result has children, then throw a +
If result has children, then throw a "
NotSupportedError"DOMException.If result’s parent is not null, then throw a @@ -4718,16 +5050,16 @@
data.
To replace data of node node with offset offset, count count, and data data, run these steps:
-
-
- Let length be node’s length. +
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError"DOMException. - If offset plus count is greater than length, then set count to length minus offset.
-
Queue a mutation record of "
-characterData" for node with null, null, node’s data, « », « », null, and null. - Insert data into node’s data after offset code units. +
- Insert data into node’s data after offset code units.
- Let delete offset be offset + data’s length. -
- Starting from delete offset code units, remove count code units from node’s data. +
- Starting from delete offset code units, remove count code units from node’s data.
-
For each live range whose start node is node and start offset is greater than offset but less than or equal to offset plus count, set its start offset to offset.
-
@@ -4736,24 +5068,24 @@
For each live range whose start node is node and start offset is greater than offset plus count, increase its start offset by data’s length and decrease it by count.
For each live range whose end node is node and end offset is greater than offset plus count, increase its end offset by data’s length and decrease it by count.
-- If node’s parent is non-null, then run the children changed steps for node’s parent. +
- If node’s parent is non-null, then run the children changed steps for node’s parent.
To substring data with node node, offset offset, and count count, run these steps:
-
-
- Let length be node’s length. +
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError"DOMException. - If offset plus count is - greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then + greater than length, return a string whose value is the code units from the offsetth code unit to the end of node’s data, and then return. -
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data. +
- Return a string whose value is the code units from the offsetth code unit to the offset+countth code unit in node’s data.
The
-datagetter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.The
+lengthgetter steps are to return this’s length.The
+datagetter steps are to return this’s data. Its setter must replace data with node this, offset 0, count this’s length, and data new value.The
lengthgetter steps are to return this’s length.The
substringData(offset, count)method steps are to return the result of running substring data with node this, offset offset, and count count.The
appendData(data)method steps are -to replace data with node this, offset this’s length, count 0, +to replace data with node this, offset this’s length, count 0, and data data.The
@@ -4782,19 +5114,19 @@insertData(offset, data)method steps are to replace data with node this, offset offset, count 0, and data data.contiguous exclusive
Textnodes of a node node are node, node’s previous sibling exclusiveTextnode, if any, and its contiguous exclusiveTextnodes, and node’s next sibling exclusiveTextnode, if any, and its contiguous exclusiveTextnodes, avoiding any duplicates.The child text content of a node node is the concatenation of the data of all -the
-Textnode children of node, in tree order.The descendant text content of a node node is the concatenation of the data of all the
+theTextnode descendants of node, in tree order.Textnode children of node, in tree order. +The descendant text content of a node node is the concatenation of the data of all the
Textnode descendants of node, in tree order.
The
new Text(data)constructor steps are to set this’s data to data and this’s node document to current global object’s associatedDocument.To split a
Textnode node with offset offset, run these steps:-
-
- Let length be node’s length. +
- Let length be node’s length.
- If offset is greater than length, then throw an
"
IndexSizeError"DOMException. - Let count be length minus offset.
- Let new data be the result of substringing data with node node, offset offset, and count count.
- Let new node be a new
Textnode, with the same node document as node. Set new node’s data to new data. - - Let parent be node’s parent. +
- Let parent be node’s parent.
-
If parent is not null, then:
-
@@ -4878,7 +5210,7 @@
-
@@ -4889,12 +5221,12 @@
following nodeB, then if the position of (nodeB, offsetB) relative to (nodeA, offsetA) is before, return after, and if it is after, return before.
- -
If nodeA is an ancestor of nodeB:
+If nodeA is an ancestor of nodeB:
-
Let child be nodeB.
-
-
While child is not a child of nodeA, set child to its parent.
+While child is not a child of nodeA, set child to its parent.
Algorithms that modify a tree (in particular the insert, remove, replace data, and split algorithms) modify live ranges associated with that tree.
The root of a live range is the root of its start node.
A node node is contained in a live range range if node’s root is range’s root, and (node, 0) is after range’s start, and -(node, node’s length) is before range’s end.
+(node, node’s length) is before range’s end.A node is partially contained in a live range if it’s an inclusive ancestor of the live range’s start node but not its end node, or vice versa.
@@ -5048,12 +5380,12 @@Some facts to better understand these definitions:
@@ -5012,27 +5344,27 @@live range consists of all contained nodes, plus possibly some of the contents of the start node and end node if those are
Text,ProcessingInstruction, orCommentnodes.The nodes that are contained in a live range will generally not be - contiguous, because the parent of a contained node will not always be contained.
+ contiguous, because the parent of a contained node will not always be contained.- -
However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
+However, the descendants of a contained node are contained, and if two siblings are contained, so are any siblings that lie between them.
The start node and end node of a live range are never contained within it.
The first contained node (if there are any) will - always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.
+ always be after the start node, and the last contained node will always be equal to or before the end node’s last descendant.There exists a partially contained node if and only if the start node and end node are different.
The
commonAncestorContainerattribute value is neither contained nor partially contained.- -
If the start node is an ancestor of the end node, +
If the start node is an ancestor of the end node, the common inclusive ancestor will be the start node. Exactly one - of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.
+ of its children will be partially contained, and a child will be contained if and only if it precedes the partially contained child. If the end node is an ancestor of the start node, the opposite holds.If the start node is not an inclusive ancestor of the end node, nor vice versa, the common inclusive ancestor will be - distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and + distinct from both of them. Exactly two of its children will be partially contained, and a child will be contained if and only if it lies between those two.
- container = range .
commonAncestorContainer- Returns the node, furthest away from - the document, that is an ancestor of both range’s start node and end node. + the document, that is an ancestor of both range’s start node and end node.
The
commonAncestorContainergetter steps are:- Let container be start node. -
- While container is not an inclusive ancestor of end node, let container be container’s parent. +
- While container is not an inclusive ancestor of end node, let container be container’s parent.
- Return container.
@@ -5062,7 +5394,7 @@doctype, then throw an "
InvalidNodeTypeError"DOMException. -- If offset is greater than node’s length, then throw an +
- If offset is greater than node’s length, then throw an "
IndexSizeError"DOMException.- Let bp be the boundary point (node, offset).
- @@ -5089,14 +5421,14 @@
set the end of this to boundary point (node, offset).
The
setStartBefore(node)method steps are:-
-
- Let parent be node’s parent. +
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError"DOMException. - Set the start of this to boundary point (parent, node’s index).
The
setStartAfter(node)method steps are:-
-
Let parent be node’s parent.
+Let parent be node’s parent.
-
If parent is null, then throw an "
InvalidNodeTypeError"DOMException. -
@@ -5104,14 +5436,14 @@
setEndBefore(node)method steps are:-
-
- Let parent be node’s parent. +
- Let parent be node’s parent.
- If parent is null, then throw an "
InvalidNodeTypeError"DOMException. - Set the end of this to boundary point (parent, node’s index).
The
setEndAfter(node)method steps are:-
-
Let parent be node’s parent.
+Let parent be node’s parent.
-
If parent is null, then throw an "
InvalidNodeTypeError"DOMException. -
@@ -5121,7 +5453,7 @@
select a node node within a range range, run these steps:
-
-
Let parent be node’s parent.
+Let parent be node’s parent.
-
If parent is null, then throw an "
InvalidNodeTypeError"DOMException. -
@@ -5137,7 +5469,7 @@
doctype, throw an "
InvalidNodeTypeError"DOMException. -- Let length be the length of node. +
- Let length be the length of node.
- Set start to the boundary point (node, 0).
- Set end to the boundary point (node, length).
this’s start node, start offset, end node, and end offset, respectively.
- If original start node and original end node are the same, and they are a
Text,ProcessingInstruction, orCommentnode, replace data with node original start node, offset original start offset, count original end offset minus original start offset, and data the empty string, and then return. -- Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this. +
- Let nodes to remove be a list of all the nodes that are contained in this, in tree order, omitting any node whose parent is also contained in this.
- If original start node is an inclusive ancestor of original end node, set new node to original start node and new offset to original start offset.
- Otherwise:
- Let reference node equal original start node. -
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent. +
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
-
- Set new node to the parent of reference node, and new offset to one
+ Set new node to the parent of reference node, and new offset to one
plus the index of reference node.
-
If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
+If reference node’s parent were null, it would be the root of this, so would be an inclusive ancestor of original end node, and we could not reach this point.
- If original start node is a
Text,ProcessingInstruction, orCommentnode, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string. +- If original start node is a
Text,ProcessingInstruction, orCommentnode, replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, data the empty string.For each node in nodes to remove, in tree order, remove node.
- If original end node is a
Text,ProcessingInstruction, orCommentnode, replace data with node original end node, offset 0, count original end offset and data the empty string. @@ -5225,16 +5557,16 @@inclusive ancestor of original end node, set common ancestor to - its own parent. + its own parent.
- Let first partially contained child be null. -
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range. +
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
- - If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range. + If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense. - For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because - it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
-- Let contained children be a list of all children of common ancestor that are contained in range, in tree order. + For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because + it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined. +
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
If any member of contained children is a doctype, then throw a "
@@ -5247,19 +5579,19 @@HierarchyRequestError"DOMException.parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent. +
- While reference node’s parent is not null and is not an inclusive ancestor of original end node, set reference node to its parent.
- - Set new node to the parent of reference node, and new offset to one plus reference node’s index. -
If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
+ Set new node to the parent of reference node, and new offset to one plus reference node’s index. +If reference node’s parent is null, it would be the root of range, so would be an inclusive ancestor of original end node, and we could not reach this point.
-
-
- If first partially contained child is a
Text,ProcessingInstruction, orCommentnode:In this case, first partially contained child is original start node.
- Let clone be a clone of original start node. -
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset. +
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment. -
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string. +
- Replace data with node original start node, offset original start offset, count original start node’s length minus original start offset, and data the empty string.
- Otherwise, if first partially contained child is not @@ -5270,7 +5602,7 @@
live range whose start is (original start node, original start offset) and whose end is - (first partially contained child, first partially contained child’s length). + (first partially contained child, first partially contained child’s length).
Let subfragment be the result of extracting subrange.
- Append subfragment to clone. @@ -5320,16 +5652,16 @@
inclusive ancestor of original end node, set common ancestor to its own parent. +
- While common ancestor is not an inclusive ancestor of original end node, set common ancestor to its own parent.
- Let first partially contained child be null. -
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range. +
- If original start node is not an inclusive ancestor of original end node, set first partially contained child to the first child of common ancestor that is partially contained in range.
- Let last partially contained child be null.
- - If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range. + If original end node is not an inclusive ancestor of original start node, set last partially contained child to the last child of common ancestor that is partially contained in range.
These variable assignments do actually always make sense. - For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because - it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined.
-- Let contained children be a list of all children of common ancestor that are contained in range, in tree order. + For instance, if original start node is not an inclusive ancestor of original end node, original start node is itself partially contained in range, and so are all its ancestors up until a child of common ancestor. common ancestor cannot be original start node, because + it has to be an inclusive ancestor of original end node. The other case is similar. Also, notice that the two children will never be equal if both are defined. +
- Let contained children be a list of all children of common ancestor that are contained in range, in tree order.
If any member of contained children is a doctype, then throw a "
@@ -5342,7 +5674,7 @@HierarchyRequestError"DOMException.In this case, first partially contained child is original start node.
- Let clone be a clone of original start node. -
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset. +
- Set the data of clone to the result of substringing data with node original start node, offset original start offset, and count original start node’s length minus original start offset.
- Append clone to fragment.
- @@ -5354,7 +5686,7 @@
live range whose start is (original start node, original start offset) and whose end is - (first partially contained child, first partially contained child’s length). + (first partially contained child, first partially contained child’s length).
Let subfragment be the result of cloning the contents of subrange.
- Append subfragment to clone. @@ -5392,23 +5724,23 @@
cloning the contents of this.
To insert a node node into a live range range, run these steps:
-
-
- If range’s start node is a
ProcessingInstructionorCommentnode, is aTextnode whose parent is null, or is node, + - If range’s start node is a
ProcessingInstructionorCommentnode, is aTextnode whose parent is null, or is node, then throw a "HierarchyRequestError"DOMException. - Let referenceNode be null.
- If range’s start node is a
Textnode, set referenceNode to thatTextnode. - - Otherwise, set referenceNode to the child of start node whose index is start offset, and null if - there is no such child. -
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise. +
- Otherwise, set referenceNode to the child of start node whose index is start offset, and null if + there is no such child. +
- Let parent be range’s start node if referenceNode is null, and referenceNode’s parent otherwise.
- Ensure pre-insertion validity of node into parent before referenceNode.
- If range’s start node is a
Textnode, set referenceNode to the result of splitting it with offset range’s start offset. - If node is referenceNode, set referenceNode to its next sibling.
- - -
- Let newOffset be parent’s length if referenceNode is null, + +
- Let newOffset be parent’s length if referenceNode is null, and referenceNode’s index otherwise. -
- Increase newOffset by node’s length if node is a
DocumentFragmentnode, and one otherwise. + - Increase newOffset by node’s length if node is a
DocumentFragmentnode, and one otherwise. - Pre-insert node into parent before referenceNode.
-
If range is collapsed, then set range’s end to (parent, newOffset).
@@ -5425,7 +5757,7 @@extracting this.
- -
If newParent has children, then replace all with null +
If newParent has children, then replace all with null within newParent.
- @@ -5451,7 +5783,7 @@
root is different from this’s root, return false.
- If node is a doctype, then throw an "
InvalidNodeTypeError"DOMException. -- If offset is greater than node’s length, then throw an +
- If offset is greater than node’s length, then throw an "
IndexSizeError"DOMException.- If (node, offset) is before start or after end, return false.
- Return true. @@ -5461,7 +5793,7 @@
root is different from this’s root, then throw a "
WrongDocumentError"DOMException.- If node is a doctype, then throw an "
InvalidNodeTypeError"DOMException. -- If offset is greater than node’s length, then throw an +
- If offset is greater than node’s length, then throw an "
IndexSizeError"DOMException.- If (node, offset) is before start, return −1.
- If (node, offset) is after end, return 1. @@ -5471,7 +5803,7 @@
intersectsNode(node)method steps are:- If node’s root is different from this’s root, return false. -
- Let parent be node’s parent. +
- Let parent be node’s parent.
- If parent is null, return true.
- Let offset be node’s index.
- If (parent, offset) is before end and (parent, offset plus 1) is after start, return true.
@@ -5566,7 +5898,7 @@
Steps are not terminated here.
- -
Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
+Set nodeIterator’s reference to toBeRemovedNode’s parent, if toBeRemovedNode’s previous sibling is null, and to the inclusive descendant of toBeRemovedNode’s previous sibling that appears last in tree order otherwise.
- -
The
@@ -5649,7 +5981,7 @@rootgetter steps are to return this’s root.While node is non-null and is not this’s root:
-
-
Set node to node’s parent.
+Set node to node’s parent.
-
If node is non-null and filtering node within this returns
FILTER_ACCEPT, then set this’s current to node and return node.
If sibling is non-null, then set node to sibling and break.
- -
Let parent be node’s parent.
+Let parent be node’s parent.
If parent is null, walker’s root, or walker’s current, then return null.
- @@ -5727,7 +6059,7 @@
node’s previous sibling if type is previous.
- -
Set node to node’s parent.
+Set node to node’s parent.
If node is null or walker’s root, then return null.
@@ -5754,7 +6086,7 @@Let result be the result of filtering node within this.
- -
While result is not
+FILTER_REJECTand node has a child:While result is not
FILTER_REJECTand node has a child:-
Set node to node’s last child.
@@ -5767,9 +6099,9 @@Set sibling to node’s previous sibling.
- -
If node is this’s root or node’s parent is null, then return null.
+If node is this’s root or node’s parent is null, then return null.
- -
Set node to node’s parent.
+Set node to node’s parent.
If the return value of filtering node within this is
FILTER_ACCEPT, then set this’s current to node and return node. - -
-
-
While result is not
+FILTER_REJECTand node has a child:While result is not
FILTER_REJECTand node has a child:-
Set node to its first child.
@@ -5809,7 +6141,7 @@If sibling is non-null, then set node to sibling and break.
- -
Set temporary to temporary’s parent.
+Set temporary to temporary’s parent.
- -
-
-
Set result to the result of filtering node within this.
@@ -7604,11 +7936,6 @@upgrade an element
- valid custom element name -
- - [I18N-GLOSSARY] defines the following terms: -
-
-
- code units -
- [INFRA] defines the following terms:
-
@@ -7746,7 +8073,7 @@
- [CONSOLE]
- Dominic Farolino; Robert Kowalski; Terin Stock. Console Standard. Living Standard. URL: https://console.spec.whatwg.org/
- [DEVICE-ORIENTATION] -
- Rich Tibbett; et al. DeviceOrientation Event Specification. URL: https://w3c.github.io/deviceorientation/
+
- Reilly Grant; Raphael Kubo da Costa; Marcos Caceres. Device Orientation and Motion. URL: https://w3c.github.io/deviceorientation/
- [DOM]
- Anne van Kesteren. DOM Standard. Living Standard. URL: https://dom.spec.whatwg.org/
- [ECMASCRIPT]
@@ -7757,8 +8084,6 @@
N
- Yoav Weiss. High Resolution Time. URL: https://w3c.github.io/hr-time/
- [HTML]
- Anne van Kesteren; et al. HTML Standard. Living Standard. URL: https://html.spec.whatwg.org/multipage/ -
- [I18N-GLOSSARY] -
- Richard Ishida; Addison Phillips. Internationalization Glossary. URL: https://w3c.github.io/i18n-glossary/
- [INFRA]
- Anne van Kesteren; Domenic Denicola. Infra Standard. Living Standard. URL: https://infra.spec.whatwg.org/
- [SELECTORS4] @@ -8488,25 +8813,25 @@
I -
+-✔MDN
- +In all current engines.
- Firefox88+Safari15+Chrome93+ + Firefox57+Safari11.1+Chrome66+
- Opera?Edge93+ + Opera?Edge79+
- Edge (Legacy)?IENone + Edge (Legacy)16+IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.12.0+ + Node.js15.0.0++-✔MDN
@@ -8524,21 +8849,21 @@I
+@@ -9115,7 +9440,7 @@✔MDN
- +In all current engines.
- Firefox57+Safari11.1+Chrome66+ + Firefox88+Safari15+Chrome93+
- Opera?Edge79+ + Opera?Edge93+
- Edge (Legacy)16+IENone + Edge (Legacy)?IENone
Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile?
- Node.js15.0.0+ + Node.js15.12.0+I
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9144,7 +9469,7 @@I
Element/previousElementSibling
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -9714,7 +10039,7 @@I
-DocumentFragment/childElementCount
+DocumentFragment/childElementCount
In all current engines.
Firefox25+Safari9+Chrome29+ @@ -9730,7 +10055,7 @@I
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10186,7 +10511,7 @@I
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10199,7 +10524,7 @@I
✔MDN
- +In all current engines.
Firefox1+Safari1+Chrome1+ @@ -10324,7 +10649,7 @@I
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2++
Opera10+Edge79+
@@ -10395,7 +10720,7 @@I
DocumentFragment/querySelector
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2++
Opera10+Edge79+
@@ -10424,7 +10749,7 @@I
DocumentFragment/querySelectorAll
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2+
Opera10+Edge79+
@@ -10534,6 +10859,22 @@I
+✔MDN
+++DocumentFragment/getElementById
+In all current engines.
++ Firefox28+Safari9+Chrome36+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)17+IENone +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +✔MDN
@@ -10550,6 +10891,54 @@I
++✔MDN
++ ++In all current engines.
++ Firefox1+Safari3+Chrome1+ ++
+ Opera12.1+Edge79+ +
+ Edge (Legacy)12+IE9+ +
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+ +++✔MDN
++ ++In all current engines.
++ Firefox1+Safari3+Chrome1+ ++
+ Opera12.1+Edge79+ +
+ Edge (Legacy)12+IE9+ +
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+ ++✔MDN
++ ++In all current engines.
++ Firefox1+Safari3+Chrome1+ ++
+ Opera12.1+Edge79+ +
+ Edge (Legacy)12+IE9+ +
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+ +✔MDN
@@ -11369,7 +11758,7 @@I
+✔MDN
- +In all current engines.
Firefox1+Safari1+Chrome1+ @@ -11690,10 +12079,154 @@I
++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
+++MutationRecord/attributeNamespace
+In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
+++MutationRecord/previousSibling
+In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? ++✔MDN
++ ++In all current engines.
++ Firefox14+Safari7+Chrome16+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)12+IE11 +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +✔MDN
- +In all current engines.
Firefox14+Safari7+Chrome16+ @@ -11853,7 +12386,7 @@I
✔MDN
- +In all current engines.
Firefox1+Safari1.1+Chrome1+ @@ -11920,7 +12453,7 @@I
In all current engines.
- Firefox1+Safari4+Chrome1+ + Firefox1+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -12013,7 +12546,7 @@I
✔MDN
- +In all current engines.
Firefox49+Safari10+Chrome51+ @@ -12077,7 +12610,7 @@I
✔MDN
- +In all current engines.
Firefox1+Safari1+Chrome1+ @@ -12285,7 +12818,7 @@I
✔MDN
- +In all current engines.
Firefox1+Safari1.1+Chrome1+ @@ -12333,7 +12866,7 @@I
✔MDN
- +In all current engines.
Firefox3.5+Safari3+Chrome1+ @@ -12397,7 +12930,7 @@I
+✔MDN
- +In all current engines.
Firefox3.5+Safari3+Chrome1+ @@ -12445,7 +12978,7 @@I
-✔MDN
- +In all current engines.
Firefox3.5+Safari3+Chrome1+ @@ -12458,26 +12991,52 @@I
+-✔MDN
- + ++In all current engines.
++ Firefox50+Safari10+Chrome51+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)16+IENone +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +++Reference/Global_Objects/Array/@@iterator
+In all current engines.
++ Firefox36+Safari10+Chrome51+ ++
+ Opera?Edge79+ +
+ Edge (Legacy)?IENone +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? ++In all current engines.
Firefox1+Safari1+Chrome1+
- Opera12.1+Edge79+ + Opera8+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+ + Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1++-✔MDN
- +In all current engines.
Firefox1+Safari1+Chrome1+ @@ -12490,19 +13049,19 @@I
+@@ -12969,6 +13528,22 @@✔MDN
- +In all current engines.
Firefox1+Safari1+Chrome1+
- Opera8+Edge79+ + Opera12.1+Edge79+
Edge (Legacy)12+IE5+
- Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile10.1+ + Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+I
+✔MDN
++ ++In all current engines.
++ Firefox92+Safari16.4+Chrome86+ ++
+ Opera?Edge86+ +
+ Edge (Legacy)?IENone +
+ Firefox for Android?iOS Safari?Chrome for Android?Android WebView?Samsung Internet?Opera Mobile? +✔MDN
@@ -13055,7 +13630,7 @@I
In all current engines.
- Firefox3.5+Safari4+Chrome1+ + Firefox3.5+Safari4+Chrome2+
Opera12.1+Edge79+
@@ -13084,7 +13659,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13116,7 +13691,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13132,7 +13707,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13148,7 +13723,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13164,7 +13739,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13180,7 +13755,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13196,7 +13771,7 @@I
✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13212,7 +13787,7 @@I
+✔MDN
- +In all current engines.
Firefox4+Safari3+Chrome1+ @@ -13289,6 +13864,22 @@I
+✔MDN
++ ++In all current engines.
++ Firefox1+Safari3+Chrome1+ ++
+ Opera12.1+Edge79+ +
+ Edge (Legacy)12+IENone +
+ Firefox for Android?iOS Safari1+Chrome for Android?Android WebView?Samsung Internet?Opera Mobile12.1+ +✔MDN
@@ -13788,7 +14379,7 @@I "56ad2aed": {"dfnID":"56ad2aed","dfnText":"insert","external":true,"refSections":[{"refs":[{"id":"ref-for-list-insert"}],"title":"4.2.3. Mutation algorithms"}],"url":"https://infra.spec.whatwg.org/#list-insert"}, "5832b143": {"dfnID":"5832b143","dfnText":"name","external":true,"refSections":[{"refs":[{"id":"ref-for-name"}],"title":"4.5. Interface Document"}],"url":"https://encoding.spec.whatwg.org/#name"}, "583654a9": {"dfnID":"583654a9","dfnText":"InvalidCharacterError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidcharactererror"}],"title":"1.4. Namespaces"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460"},{"id":"ref-for-invalidcharactererror\u2461"},{"id":"ref-for-invalidcharactererror\u2462"},{"id":"ref-for-invalidcharactererror\u2463"},{"id":"ref-for-invalidcharactererror\u2464"},{"id":"ref-for-invalidcharactererror\u2465"},{"id":"ref-for-invalidcharactererror\u2466"},{"id":"ref-for-invalidcharactererror\u2467"},{"id":"ref-for-invalidcharactererror\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u24ea"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2460"},{"id":"ref-for-invalidcharactererror\u2460\u2461"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-invalidcharactererror\u2460\u2462"},{"id":"ref-for-invalidcharactererror\u2460\u2463"},{"id":"ref-for-invalidcharactererror\u2460\u2464"},{"id":"ref-for-invalidcharactererror\u2460\u2465"},{"id":"ref-for-invalidcharactererror\u2460\u2466"},{"id":"ref-for-invalidcharactererror\u2460\u2467"},{"id":"ref-for-invalidcharactererror\u2460\u2468"},{"id":"ref-for-invalidcharactererror\u2461\u24ea"}],"title":"7.1. Interface DOMTokenList"}],"url":"https://webidl.spec.whatwg.org/#invalidcharactererror"}, -"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"}, +"59912c93": {"dfnID":"59912c93","dfnText":"code unit","external":true,"refSections":[{"refs":[{"id":"ref-for-code-unit"},{"id":"ref-for-code-unit\u2460"},{"id":"ref-for-code-unit\u2461"},{"id":"ref-for-code-unit\u2462"},{"id":"ref-for-code-unit\u2463"},{"id":"ref-for-code-unit\u2464"},{"id":"ref-for-code-unit\u2465"},{"id":"ref-for-code-unit\u2466"}],"title":"4.10. Interface CharacterData"}],"url":"https://infra.spec.whatwg.org/#code-unit"}, "5991ccfb": {"dfnID":"5991ccfb","dfnText":"relevant realm","external":true,"refSections":[{"refs":[{"id":"ref-for-concept-relevant-realm"}],"title":"2.10. Firing events"}],"url":"https://html.spec.whatwg.org/multipage/webappapis.html#concept-relevant-realm"}, "5d7209e9": {"dfnID":"5d7209e9","dfnText":"Window","external":true,"refSections":[{"refs":[{"id":"ref-for-window"},{"id":"ref-for-window\u2460"},{"id":"ref-for-window\u2461"}],"title":"2.3. Legacy extensions to the Window interface"},{"refs":[{"id":"ref-for-window\u2462"},{"id":"ref-for-window\u2463"},{"id":"ref-for-window\u2464"},{"id":"ref-for-window\u2465"}],"title":"2.9. Dispatching events"}],"url":"https://html.spec.whatwg.org/multipage/nav-history-apis.html#window"}, "5e0d3b02": {"dfnID":"5e0d3b02","dfnText":"match a selector against an element","external":true,"refSections":[{"refs":[{"id":"ref-for-match-a-selector-against-an-element"},{"id":"ref-for-match-a-selector-against-an-element\u2460"}],"title":"4.9. Interface Element"}],"url":"https://drafts.csswg.org/selectors-4/#match-a-selector-against-an-element"}, @@ -13813,7 +14404,6 @@
I "797018a7": {"dfnID":"797018a7","dfnText":"InvalidStateError","external":true,"refSections":[{"refs":[{"id":"ref-for-invalidstateerror"}],"title":"2.7. Interface EventTarget"},{"refs":[{"id":"ref-for-invalidstateerror\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-invalidstateerror\u2461"}],"title":"6. Traversal"}],"url":"https://webidl.spec.whatwg.org/#invalidstateerror"}, "79e2abd0": {"dfnID":"79e2abd0","dfnText":"look up a custom element definition","external":true,"refSections":[{"refs":[{"id":"ref-for-look-up-a-custom-element-definition"},{"id":"ref-for-look-up-a-custom-element-definition\u2460"}],"title":"4.9. Interface Element"}],"url":"https://html.spec.whatwg.org/multipage/custom-elements.html#look-up-a-custom-element-definition"}, "7b0d918d": {"dfnID":"7b0d918d","dfnText":"break","external":true,"refSections":[{"refs":[{"id":"ref-for-iteration-break"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-iteration-break\u2460"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-iteration-break\u2461"},{"id":"ref-for-iteration-break\u2462"}],"title":"6.2. Interface TreeWalker"}],"url":"https://infra.spec.whatwg.org/#iteration-break"}, -"7cf8cfc4": {"dfnID":"7cf8cfc4","dfnText":"code units","external":true,"refSections":[{"refs":[{"id":"ref-for-def_code_unit"},{"id":"ref-for-def_code_unit\u2460"},{"id":"ref-for-def_code_unit\u2461"},{"id":"ref-for-def_code_unit\u2462"},{"id":"ref-for-def_code_unit\u2463"}],"title":"4.10. Interface CharacterData"}],"url":"https://w3c.github.io/i18n-glossary/#def_code_unit"}, "7f9469b5": {"dfnID":"7f9469b5","dfnText":"ascii case-insensitive","external":true,"refSections":[{"refs":[{"id":"ref-for-ascii-case-insensitive"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2460"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-ascii-case-insensitive\u2461"}],"title":"4.9. Interface Element"}],"url":"https://infra.spec.whatwg.org/#ascii-case-insensitive"}, "85a289c7": {"dfnID":"85a289c7","dfnText":"svg namespace","external":true,"refSections":[{"refs":[{"id":"ref-for-svg-namespace"}],"title":"4.5.1. Interface DOMImplementation"}],"url":"https://infra.spec.whatwg.org/#svg-namespace"}, "8611edf0": {"dfnID":"8611edf0","dfnText":"InUseAttributeError","external":true,"refSections":[{"refs":[{"id":"ref-for-inuseattributeerror"}],"title":"4.9. Interface Element"}],"url":"https://webidl.spec.whatwg.org/#inuseattributeerror"}, @@ -13999,7 +14589,7 @@
I "concept-node-filter": {"dfnID":"concept-node-filter","dfnText":"filter","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-filter"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-node-filter\u2460"},{"id":"ref-for-concept-node-filter\u2461"},{"id":"ref-for-concept-node-filter\u2462"},{"id":"ref-for-concept-node-filter\u2463"},{"id":"ref-for-concept-node-filter\u2464"},{"id":"ref-for-concept-node-filter\u2465"},{"id":"ref-for-concept-node-filter\u2466"},{"id":"ref-for-concept-node-filter\u2467"},{"id":"ref-for-concept-node-filter\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-node-filter"}, "concept-node-insert": {"dfnID":"concept-node-insert","dfnText":"insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert"},{"id":"ref-for-concept-node-insert\u2460"},{"id":"ref-for-concept-node-insert\u2461"},{"id":"ref-for-concept-node-insert\u2462"},{"id":"ref-for-concept-node-insert\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-insert\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-insert\u2465"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-insert\u2466"}],"title":"5.5. Interface Range"}],"url":"#concept-node-insert"}, "concept-node-insert-ext": {"dfnID":"concept-node-insert-ext","dfnText":"insertion steps","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-insert-ext"}],"title":"4.2.3. Mutation algorithms"}],"url":"#concept-node-insert-ext"}, -"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"},{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2463"},{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2468"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"5.2. Boundary points"}],"url":"#concept-node-length"}, +"concept-node-length": {"dfnID":"concept-node-length","dfnText":"length","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-length"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-node-length\u2460"},{"id":"ref-for-concept-node-length\u2461"},{"id":"ref-for-concept-node-length\u2462"},{"id":"ref-for-concept-node-length\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-length\u2464"},{"id":"ref-for-concept-node-length\u2465"},{"id":"ref-for-concept-node-length\u2466"},{"id":"ref-for-concept-node-length\u2467"},{"id":"ref-for-concept-node-length\u2468"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u24ea"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-node-length\u2460\u2461"},{"id":"ref-for-concept-node-length\u2460\u2462"},{"id":"ref-for-concept-node-length\u2460\u2463"},{"id":"ref-for-concept-node-length\u2460\u2464"},{"id":"ref-for-concept-node-length\u2460\u2465"},{"id":"ref-for-concept-node-length\u2460\u2466"},{"id":"ref-for-concept-node-length\u2460\u2467"},{"id":"ref-for-concept-node-length\u2460\u2468"},{"id":"ref-for-concept-node-length\u2461\u24ea"},{"id":"ref-for-concept-node-length\u2461\u2460"},{"id":"ref-for-concept-node-length\u2461\u2461"},{"id":"ref-for-concept-node-length\u2461\u2462"},{"id":"ref-for-concept-node-length\u2461\u2463"}],"title":"5.5. Interface Range"}],"url":"#concept-node-length"}, "concept-node-pre-insert": {"dfnID":"concept-node-pre-insert","dfnText":"pre-insert","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-insert"},{"id":"ref-for-concept-node-pre-insert\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2461"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2462"},{"id":"ref-for-concept-node-pre-insert\u2463"},{"id":"ref-for-concept-node-pre-insert\u2464"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2465"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2466"}],"title":"4.7. Interface DocumentFragment"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2467"},{"id":"ref-for-concept-node-pre-insert\u2468"},{"id":"ref-for-concept-node-pre-insert\u2460\u24ea"},{"id":"ref-for-concept-node-pre-insert\u2460\u2460"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-node-pre-insert\u2460\u2461"}],"title":"5.5. Interface Range"}],"url":"#concept-node-pre-insert"}, "concept-node-pre-remove": {"dfnID":"concept-node-pre-remove","dfnText":"pre-remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-pre-remove"}],"title":"4.4. Interface Node"}],"url":"#concept-node-pre-remove"}, "concept-node-remove": {"dfnID":"concept-node-remove","dfnText":"remove","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-node-remove"},{"id":"ref-for-concept-node-remove\u2460"},{"id":"ref-for-concept-node-remove\u2461"},{"id":"ref-for-concept-node-remove\u2462"},{"id":"ref-for-concept-node-remove\u2463"},{"id":"ref-for-concept-node-remove\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-node-remove\u2465"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-node-remove\u2466"},{"id":"ref-for-concept-node-remove\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-node-remove\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u24ea"}],"title":"5.1. Introduction to \"DOM Ranges\""},{"refs":[{"id":"ref-for-concept-node-remove\u2460\u2460"},{"id":"ref-for-concept-node-remove\u2460\u2461"},{"id":"ref-for-concept-node-remove\u2460\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-node-remove"}, @@ -14050,9 +14640,9 @@
I "concept-traverse-children": {"dfnID":"concept-traverse-children","dfnText":"traverse children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-children"},{"id":"ref-for-concept-traverse-children\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-children"}, "concept-traverse-siblings": {"dfnID":"concept-traverse-siblings","dfnText":"traverse siblings","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-traverse-siblings"},{"id":"ref-for-concept-traverse-siblings\u2460"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-traverse-siblings"}, "concept-tree": {"dfnID":"concept-tree","dfnText":"tree","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree"},{"id":"ref-for-concept-tree\u2460"},{"id":"ref-for-concept-tree\u2461"},{"id":"ref-for-concept-tree\u2462"},{"id":"ref-for-concept-tree\u2463"},{"id":"ref-for-concept-tree\u2464"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree\u2465"},{"id":"ref-for-concept-tree\u2466"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree\u2467"},{"id":"ref-for-concept-tree\u2468"},{"id":"ref-for-concept-tree\u2460\u24ea"},{"id":"ref-for-concept-tree\u2460\u2460"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2461"},{"id":"ref-for-concept-tree\u2460\u2462"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree\u2460\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2464"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2465"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2466"},{"id":"ref-for-concept-tree\u2460\u2467"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree\u2460\u2468"}],"title":"4.5.1. Interface DOMImplementation"},{"refs":[{"id":"ref-for-concept-tree\u2461\u24ea"},{"id":"ref-for-concept-tree\u2461\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree\u2461\u2461"}],"title":"6. Traversal"}],"url":"#concept-tree"}, -"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2461"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2462"},{"id":"ref-for-concept-tree-ancestor\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-ancestor\u2465"},{"id":"ref-for-concept-tree-ancestor\u2466"},{"id":"ref-for-concept-tree-ancestor\u2467"},{"id":"ref-for-concept-tree-ancestor\u2468"},{"id":"ref-for-concept-tree-ancestor\u2460\u24ea"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-ancestor"}, -"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"},{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"}],"title":"4.1. Introduction to \"The DOM\""},{"refs":[{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"},{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"},{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"},{"id":"ref-for-concept-tree-child\u2462\u24ea"},{"id":"ref-for-concept-tree-child\u2462\u2460"},{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2463"},{"id":"ref-for-concept-tree-child\u2463\u2464"},{"id":"ref-for-concept-tree-child\u2463\u2465"},{"id":"ref-for-concept-tree-child\u2463\u2466"},{"id":"ref-for-concept-tree-child\u2463\u2467"},{"id":"ref-for-concept-tree-child\u2463\u2468"},{"id":"ref-for-concept-tree-child\u2464\u24ea"},{"id":"ref-for-concept-tree-child\u2464\u2460"},{"id":"ref-for-concept-tree-child\u2464\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2462"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2463"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2464"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2465"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2464\u2466"},{"id":"ref-for-concept-tree-child\u2464\u2467"},{"id":"ref-for-concept-tree-child\u2464\u2468"},{"id":"ref-for-concept-tree-child\u2465\u24ea"},{"id":"ref-for-concept-tree-child\u2465\u2460"},{"id":"ref-for-concept-tree-child\u2465\u2461"},{"id":"ref-for-concept-tree-child\u2465\u2462"},{"id":"ref-for-concept-tree-child\u2465\u2463"},{"id":"ref-for-concept-tree-child\u2465\u2464"},{"id":"ref-for-concept-tree-child\u2465\u2465"},{"id":"ref-for-concept-tree-child\u2465\u2466"},{"id":"ref-for-concept-tree-child\u2465\u2467"},{"id":"ref-for-concept-tree-child\u2465\u2468"},{"id":"ref-for-concept-tree-child\u2466\u24ea"},{"id":"ref-for-concept-tree-child\u2466\u2460"},{"id":"ref-for-concept-tree-child\u2466\u2461"},{"id":"ref-for-concept-tree-child\u2466\u2462"},{"id":"ref-for-concept-tree-child\u2466\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2466\u2464"},{"id":"ref-for-concept-tree-child\u2466\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"}, -"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"},{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462"},{"id":"ref-for-concept-tree-descendant\u2463"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2464"},{"id":"ref-for-concept-tree-descendant\u2465"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2466"},{"id":"ref-for-concept-tree-descendant\u2467"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u24ea"}],"title":"4.3.1. Interface MutationObserver"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2460\u2460"},{"id":"ref-for-concept-tree-descendant\u2460\u2461"},{"id":"ref-for-concept-tree-descendant\u2460\u2462"},{"id":"ref-for-concept-tree-descendant\u2460\u2463"},{"id":"ref-for-concept-tree-descendant\u2460\u2464"},{"id":"ref-for-concept-tree-descendant\u2460\u2465"},{"id":"ref-for-concept-tree-descendant\u2460\u2466"},{"id":"ref-for-concept-tree-descendant\u2460\u2467"},{"id":"ref-for-concept-tree-descendant\u2460\u2468"},{"id":"ref-for-concept-tree-descendant\u2461\u24ea"},{"id":"ref-for-concept-tree-descendant\u2461\u2460"},{"id":"ref-for-concept-tree-descendant\u2461\u2461"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461\u2462"},{"id":"ref-for-concept-tree-descendant\u2461\u2463"},{"id":"ref-for-concept-tree-descendant\u2461\u2464"},{"id":"ref-for-concept-tree-descendant\u2461\u2465"},{"id":"ref-for-concept-tree-descendant\u2461\u2466"},{"id":"ref-for-concept-tree-descendant\u2461\u2467"},{"id":"ref-for-concept-tree-descendant\u2461\u2468"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u24ea"}],"title":"4.8. Interface ShadowRoot"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2460"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2462\u2461"},{"id":"ref-for-concept-tree-descendant\u2462\u2462"}],"title":"5.5. Interface Range"}],"url":"#concept-tree-descendant"}, +"concept-tree-ancestor": {"dfnID":"concept-tree-ancestor","dfnText":"ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-ancestor"}],"title":"2.2. Interface Event"}],"url":"#concept-tree-ancestor"}, +"concept-tree-child": {"dfnID":"concept-tree-child","dfnText":"children","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-child"},{"id":"ref-for-concept-tree-child\u2460"},{"id":"ref-for-concept-tree-child\u2461"},{"id":"ref-for-concept-tree-child\u2462"},{"id":"ref-for-concept-tree-child\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-child\u2464"},{"id":"ref-for-concept-tree-child\u2465"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-child\u2466"},{"id":"ref-for-concept-tree-child\u2467"},{"id":"ref-for-concept-tree-child\u2468"},{"id":"ref-for-concept-tree-child\u2460\u24ea"},{"id":"ref-for-concept-tree-child\u2460\u2460"},{"id":"ref-for-concept-tree-child\u2460\u2461"},{"id":"ref-for-concept-tree-child\u2460\u2462"},{"id":"ref-for-concept-tree-child\u2460\u2463"},{"id":"ref-for-concept-tree-child\u2460\u2464"},{"id":"ref-for-concept-tree-child\u2460\u2465"},{"id":"ref-for-concept-tree-child\u2460\u2466"},{"id":"ref-for-concept-tree-child\u2460\u2467"},{"id":"ref-for-concept-tree-child\u2460\u2468"},{"id":"ref-for-concept-tree-child\u2461\u24ea"},{"id":"ref-for-concept-tree-child\u2461\u2460"},{"id":"ref-for-concept-tree-child\u2461\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2462"},{"id":"ref-for-concept-tree-child\u2461\u2463"},{"id":"ref-for-concept-tree-child\u2461\u2464"},{"id":"ref-for-concept-tree-child\u2461\u2465"},{"id":"ref-for-concept-tree-child\u2461\u2466"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-child\u2461\u2467"},{"id":"ref-for-concept-tree-child\u2461\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u24ea"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-child\u2462\u2461"},{"id":"ref-for-concept-tree-child\u2462\u2462"},{"id":"ref-for-concept-tree-child\u2462\u2463"},{"id":"ref-for-concept-tree-child\u2462\u2464"},{"id":"ref-for-concept-tree-child\u2462\u2465"},{"id":"ref-for-concept-tree-child\u2462\u2466"},{"id":"ref-for-concept-tree-child\u2462\u2467"},{"id":"ref-for-concept-tree-child\u2462\u2468"},{"id":"ref-for-concept-tree-child\u2463\u24ea"},{"id":"ref-for-concept-tree-child\u2463\u2460"},{"id":"ref-for-concept-tree-child\u2463\u2461"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-child\u2463\u2462"},{"id":"ref-for-concept-tree-child\u2463\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-child"}, +"concept-tree-descendant": {"dfnID":"concept-tree-descendant","dfnText":"descendant","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-descendant"},{"id":"ref-for-concept-tree-descendant\u2460"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-descendant\u2461"}],"title":"4.3. Mutation observers"}],"url":"#concept-tree-descendant"}, "concept-tree-first-child": {"dfnID":"concept-tree-first-child","dfnText":"first child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-first-child"},{"id":"ref-for-concept-tree-first-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2461"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2462"},{"id":"ref-for-concept-tree-first-child\u2463"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2464"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-first-child\u2465"},{"id":"ref-for-concept-tree-first-child\u2466"},{"id":"ref-for-concept-tree-first-child\u2467"},{"id":"ref-for-concept-tree-first-child\u2468"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-first-child"}, "concept-tree-following": {"dfnID":"concept-tree-following","dfnText":"following","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-following"},{"id":"ref-for-concept-tree-following\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-following\u2461"},{"id":"ref-for-concept-tree-following\u2462"},{"id":"ref-for-concept-tree-following\u2463"},{"id":"ref-for-concept-tree-following\u2464"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-following\u2465"},{"id":"ref-for-concept-tree-following\u2466"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2467"},{"id":"ref-for-concept-tree-following\u2468"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2460"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-following\u2460\u2461"},{"id":"ref-for-concept-tree-following\u2460\u2462"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-following"}, "concept-tree-host-including-inclusive-ancestor": {"dfnID":"concept-tree-host-including-inclusive-ancestor","dfnText":"host-including inclusive ancestor","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor"},{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2460"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-host-including-inclusive-ancestor\u2461"}],"title":"4.7. Interface DocumentFragment"}],"url":"#concept-tree-host-including-inclusive-ancestor"}, @@ -14063,7 +14653,7 @@
I "concept-tree-last-child": {"dfnID":"concept-tree-last-child","dfnText":"last child","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-last-child"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2460"}],"title":"4.2.6. Mixin ParentNode"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2461"},{"id":"ref-for-concept-tree-last-child\u2462"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-last-child\u2463"},{"id":"ref-for-concept-tree-last-child\u2464"},{"id":"ref-for-concept-tree-last-child\u2465"},{"id":"ref-for-concept-tree-last-child\u2466"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-last-child"}, "concept-tree-next-sibling": {"dfnID":"concept-tree-next-sibling","dfnText":"next sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-next-sibling"},{"id":"ref-for-concept-tree-next-sibling\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2463"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2464"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2467"},{"id":"ref-for-concept-tree-next-sibling\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2463"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-next-sibling\u2460\u2464"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2465"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2466"},{"id":"ref-for-concept-tree-next-sibling\u2460\u2467"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-next-sibling"}, "concept-tree-order": {"dfnID":"concept-tree-order","dfnText":"tree order","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-order"},{"id":"ref-for-concept-tree-order\u2460"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-order\u2461"},{"id":"ref-for-concept-tree-order\u2462"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-order\u2463"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-order\u2464"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-order\u2465"}],"title":"4.2.2.1. Slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2466"},{"id":"ref-for-concept-tree-order\u2467"},{"id":"ref-for-concept-tree-order\u2468"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u24ea"}],"title":"4.2.2.4. Assigning slottables and slots"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2460"},{"id":"ref-for-concept-tree-order\u2460\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2462"}],"title":"4.2.4. Mixin NonElementParentNode"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2463"}],"title":"4.2.10. Old-style collections: NodeList and HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2464"}],"title":"4.2.10.1. Interface NodeList"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2465"},{"id":"ref-for-concept-tree-order\u2460\u2466"}],"title":"4.2.10.2. Interface HTMLCollection"},{"refs":[{"id":"ref-for-concept-tree-order\u2460\u2467"},{"id":"ref-for-concept-tree-order\u2460\u2468"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u24ea"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2460"},{"id":"ref-for-concept-tree-order\u2461\u2461"},{"id":"ref-for-concept-tree-order\u2461\u2462"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2463"},{"id":"ref-for-concept-tree-order\u2461\u2464"},{"id":"ref-for-concept-tree-order\u2461\u2465"},{"id":"ref-for-concept-tree-order\u2461\u2466"},{"id":"ref-for-concept-tree-order\u2461\u2467"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-order\u2461\u2468"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-order"}, -"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"},{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"4.10. Interface CharacterData"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2466"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"},{"id":"ref-for-concept-tree-parent\u2464\u2467"},{"id":"ref-for-concept-tree-parent\u2464\u2468"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u24ea"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"},{"id":"ref-for-concept-tree-parent\u2465\u2464"},{"id":"ref-for-concept-tree-parent\u2465\u2465"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"}, +"concept-tree-parent": {"dfnID":"concept-tree-parent","dfnText":"parent","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-parent"},{"id":"ref-for-concept-tree-parent\u2460"},{"id":"ref-for-concept-tree-parent\u2461"},{"id":"ref-for-concept-tree-parent\u2462"},{"id":"ref-for-concept-tree-parent\u2463"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464"}],"title":"4.2.1. Document tree"},{"refs":[{"id":"ref-for-concept-tree-parent\u2465"},{"id":"ref-for-concept-tree-parent\u2466"},{"id":"ref-for-concept-tree-parent\u2467"}],"title":"4.2.2.3. Finding slots and slottables"},{"refs":[{"id":"ref-for-concept-tree-parent\u2468"},{"id":"ref-for-concept-tree-parent\u2460\u24ea"},{"id":"ref-for-concept-tree-parent\u2460\u2460"},{"id":"ref-for-concept-tree-parent\u2460\u2461"},{"id":"ref-for-concept-tree-parent\u2460\u2462"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2463"},{"id":"ref-for-concept-tree-parent\u2460\u2464"},{"id":"ref-for-concept-tree-parent\u2460\u2465"},{"id":"ref-for-concept-tree-parent\u2460\u2466"},{"id":"ref-for-concept-tree-parent\u2460\u2467"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-parent\u2460\u2468"}],"title":"4.3. Mutation observers"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u24ea"},{"id":"ref-for-concept-tree-parent\u2461\u2460"},{"id":"ref-for-concept-tree-parent\u2461\u2461"},{"id":"ref-for-concept-tree-parent\u2461\u2462"},{"id":"ref-for-concept-tree-parent\u2461\u2463"},{"id":"ref-for-concept-tree-parent\u2461\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2465"}],"title":"4.5. Interface Document"},{"refs":[{"id":"ref-for-concept-tree-parent\u2461\u2466"},{"id":"ref-for-concept-tree-parent\u2461\u2467"},{"id":"ref-for-concept-tree-parent\u2461\u2468"},{"id":"ref-for-concept-tree-parent\u2462\u24ea"},{"id":"ref-for-concept-tree-parent\u2462\u2460"},{"id":"ref-for-concept-tree-parent\u2462\u2461"},{"id":"ref-for-concept-tree-parent\u2462\u2462"}],"title":"4.9. Interface Element"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2463"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2464"}],"title":"5.2. Boundary points"},{"refs":[{"id":"ref-for-concept-tree-parent\u2462\u2465"},{"id":"ref-for-concept-tree-parent\u2462\u2466"},{"id":"ref-for-concept-tree-parent\u2462\u2467"},{"id":"ref-for-concept-tree-parent\u2462\u2468"},{"id":"ref-for-concept-tree-parent\u2463\u24ea"},{"id":"ref-for-concept-tree-parent\u2463\u2460"},{"id":"ref-for-concept-tree-parent\u2463\u2461"},{"id":"ref-for-concept-tree-parent\u2463\u2462"},{"id":"ref-for-concept-tree-parent\u2463\u2463"},{"id":"ref-for-concept-tree-parent\u2463\u2464"},{"id":"ref-for-concept-tree-parent\u2463\u2465"},{"id":"ref-for-concept-tree-parent\u2463\u2466"},{"id":"ref-for-concept-tree-parent\u2463\u2467"},{"id":"ref-for-concept-tree-parent\u2463\u2468"},{"id":"ref-for-concept-tree-parent\u2464\u24ea"},{"id":"ref-for-concept-tree-parent\u2464\u2460"},{"id":"ref-for-concept-tree-parent\u2464\u2461"},{"id":"ref-for-concept-tree-parent\u2464\u2462"},{"id":"ref-for-concept-tree-parent\u2464\u2463"},{"id":"ref-for-concept-tree-parent\u2464\u2464"},{"id":"ref-for-concept-tree-parent\u2464\u2465"},{"id":"ref-for-concept-tree-parent\u2464\u2466"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2467"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-parent\u2464\u2468"},{"id":"ref-for-concept-tree-parent\u2465\u24ea"},{"id":"ref-for-concept-tree-parent\u2465\u2460"},{"id":"ref-for-concept-tree-parent\u2465\u2461"},{"id":"ref-for-concept-tree-parent\u2465\u2462"},{"id":"ref-for-concept-tree-parent\u2465\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-parent"}, "concept-tree-participate": {"dfnID":"concept-tree-participate","dfnText":"participates","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-participate"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-participate\u2460"}],"title":"2.1. Introduction to \"DOM Events\""},{"refs":[{"id":"ref-for-concept-tree-participate\u2461"},{"id":"ref-for-concept-tree-participate\u2462"}],"title":"2.2. Interface Event"},{"refs":[{"id":"ref-for-concept-tree-participate\u2463"}],"title":"4.2. Node tree"},{"refs":[{"id":"ref-for-concept-tree-participate\u2464"}],"title":"4.4. Interface Node"}],"url":"#concept-tree-participate"}, "concept-tree-preceding": {"dfnID":"concept-tree-preceding","dfnText":"preceding","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-preceding"},{"id":"ref-for-concept-tree-preceding\u2460"},{"id":"ref-for-concept-tree-preceding\u2461"}],"title":"1.1. Trees"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2462"},{"id":"ref-for-concept-tree-preceding\u2463"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2464"},{"id":"ref-for-concept-tree-preceding\u2465"}],"title":"4.2.7. Mixin NonDocumentTypeChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2466"}],"title":"4.2.8. Mixin ChildNode"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2467"},{"id":"ref-for-concept-tree-preceding\u2468"},{"id":"ref-for-concept-tree-preceding\u2460\u24ea"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2460"}],"title":"5.5. Interface Range"},{"refs":[{"id":"ref-for-concept-tree-preceding\u2460\u2461"}],"title":"6.1. Interface NodeIterator"}],"url":"#concept-tree-preceding"}, "concept-tree-previous-sibling": {"dfnID":"concept-tree-previous-sibling","dfnText":"previous sibling","external":false,"refSections":[{"refs":[{"id":"ref-for-concept-tree-previous-sibling"},{"id":"ref-for-concept-tree-previous-sibling\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2461"}],"title":"4.2.3. Mutation algorithms"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2462"}],"title":"4.3.3. Interface MutationRecord"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2463"},{"id":"ref-for-concept-tree-previous-sibling\u2464"}],"title":"4.4. Interface Node"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2465"},{"id":"ref-for-concept-tree-previous-sibling\u2466"}],"title":"4.11. Interface Text"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2467"},{"id":"ref-for-concept-tree-previous-sibling\u2468"}],"title":"6.1. Interface NodeIterator"},{"refs":[{"id":"ref-for-concept-tree-previous-sibling\u2460\u24ea"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2460"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2461"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2462"},{"id":"ref-for-concept-tree-previous-sibling\u2460\u2463"}],"title":"6.2. Interface TreeWalker"}],"url":"#concept-tree-previous-sibling"}, @@ -15204,6 +15794,63 @@
I } } + - - - + - -
-
+
Encoding
Living Standard — Last Updated
@@ -70,7 +402,7 @@Encoding
- Participate: -
N
5.2. Boundary points A boundary point is a tuple consisting of a node (a node) and an offset (a non-negative integer).
A correct boundary point’s offset will -be between 0 and the boundary point’s node’s length, inclusive.
+be between 0 and the boundary point’s node’s length, inclusive.The position of a boundary point (nodeA, offsetA) relative to a boundary point (nodeB, offsetB) is before, equal, or after, as returned by these steps:
While true:
-
@@ -4889,12 +5221,12 @@
N
- border-box
@@ -985,17 +1317,20 @@