diff --git a/tests/abstract001.console.txt b/tests/abstract001.console.txt index e69de29bb2..5c5461595c 100644 --- a/tests/abstract001.console.txt +++ b/tests/abstract001.console.txt @@ -0,0 +1 @@ +LINE 12:47 of header.include: Found unmatched text macro [W3C-STATUS-URL] in href='...'. Correct the macro, or escape it by replacing the opening [ with [. diff --git a/tests/abstract001.html b/tests/abstract001.html index 9403875d6b..833eb4527a 100644 --- a/tests/abstract001.html +++ b/tests/abstract001.html @@ -407,7 +407,7 @@
Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Living Standard,
+Support:Android Browser2.3+Baidu Browser13.18+Blackberry Browser7+Chrome4+Chrome for Android109+Edge12+Firefox48+Firefox for Android107+IE6+IE Mobile10+KaiOS Browser2.5+Opera9.5+Opera MiniAllOpera Mobile10+QQ Browser13.1+Safari3.1+Safari on iOS3.2+Samsung Internet4+UC Browser for Android13.4+
-Source: caniuse.com as of 2023-01-27
+Support:Android Browser2.3+Baidu Browser13.52+Blackberry Browser7+Chrome4+Chrome for Android127+Edge12+Firefox48+Firefox for Android127+IE6+IE Mobile10+KaiOS Browser2.5+Opera9.5+Opera MiniAllOpera Mobile10+QQ Browser14.9+Safari3.1+Safari on iOS3.2+Samsung Internet4+UC Browser for Android15.5+
+Source: caniuse.com as of 2024-08-25
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.
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 @@
Note, this is an informative note.
-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.
Living Standard — Last Updated
@@ -69,7 +401,7 @@animation-name
-webkit-animation-duration
- animation-duration
+ animation-duration
-webkit-animation-timing-function
animation-timing-function
@@ -541,7 +873,7 @@ 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.
Living Standard — Last Updated
@@ -69,7 +401,7 @@In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
Living Standard — Last Updated
@@ -69,7 +401,7 @@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 @@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
, andComment
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 @@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.
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.
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.
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.
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.
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.
Let oldNextSibling be node’s next sibling.
If node is assigned, then run assign slottables for node’s assigned slot.
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.
DocumentOrShadowRoot
interface mixin { @@ -2025,11 +2357,11 @@
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 anHTMLCollection
collection rooted at this matching only element children.The
children
getter steps are to return anHTMLCollection
collection rooted at this matching only element children.The
+the first child that is an element; otherwise null.firstElementChild
getter steps are to return -the first child that is an element; otherwise null.The
+the last child that is an element; otherwise null.lastElementChild
getter steps are to return -the last child that is an element; otherwise null.The
+the number of children of this that are elements.childElementCount
getter 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
MutationObserver
object) and options (aMutationObserverInit
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
orattributeFilter
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 theCharacterData
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 .
@@ -2784,8 +3116,8 @@lastChild
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 aNodeList
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 aNodeList
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
@@ -2815,7 +3147,7 @@previousSibling
getter 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
Text
nodes and concatenates the data of remaining contiguous exclusiveText
nodes into the first of their nodes.The
+each descendant exclusivenormalize()
method steps are to run these steps for -each descendant exclusiveText
node node of this:Text
node node of this:-
@@ -2899,7 +3231,7 @@- 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.
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.
(8) -
Node
.DOCUMENT_POSITION_CONTAINS
- Set when other is an ancestor of node. +
- Set when other is an ancestor of node.
(16, 10 in hexadecimal) -
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
toDOCUMENT_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
toDOCUMENT_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
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
+ return aHTMLCollection
rooted at root, whose filter matches the following descendant elements: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:
*
" (U+002A), return a HTMLCollection
rooted at root, whose filter matches descendant elements.
+ *
" (U+002A), return a HTMLCollection
rooted at root, whose filter matches descendant elements.
*
"
- (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.
*
"
- (U+002A), return a HTMLCollection
rooted at root, whose filter matches descendant elements whose namespace is namespace.
- 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.
+ 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:
Return a HTMLCollection
rooted 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 HTMLCollection
object may be returned as returned by an earlier call.
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.)
getElementsByTagNameNS(namespace, 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.
*
" 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.
getElementsByClassName(classNames)
getElementsByClassName(classNames)
HTMLCollection
of the elements in the object on which
@@ -3351,7 +3683,7 @@ 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
will match <FOO>
elements that are not in the HTML namespace, and <foo>
elements that are in
@@ -3481,7 +3813,7 @@
If node is a document or a shadow root, throws a
"NotSupportedError
" DOMException
.
adoptNode(node)
@@ -3590,7 +3922,7 @@ devicemotionevent
"
DeviceMotionEvent
- deviceorientationevent
"
DeviceOrientationEvent
@@ -3871,7 +4203,7 @@ 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 @@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 @@
To replace data of node node with offset offset, count count, and data data, run these steps:
IndexSizeError
" DOMException
.
Queue a mutation record of "characterData
" for node with
null, null, node’s data, « », « », null, and null.
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.
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.
-To substring data with node node, offset offset, and count count, run these steps:
IndexSizeError
" DOMException
.
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.
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.
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:
IndexSizeError
" DOMException
.
Text
node, with the same node document as node. Set new node’s data to new data.
- If parent is not null, then:
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:
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.
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 @@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.
commonAncestorContainer
The commonAncestorContainer
getter steps are:
InvalidNodeTypeError
" DOMException
.
- IndexSizeError
" DOMException
.
The setStartBefore(node)
method steps are:
InvalidNodeTypeError
" DOMException
.
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
.
setEndBefore(node)
method steps are:
InvalidNodeTypeError
" DOMException
.
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
.
Let parent be node’s parent.
+Let parent be node’s parent.
If parent is null, then throw an "InvalidNodeTypeError
" DOMException
.
InvalidNodeTypeError
" DOMException
.
- 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.
- 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.
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.
+ 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.
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 @@ 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.
-If any member of contained children is a doctype, then throw a
"HierarchyRequestError
" DOMException
.
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.
Text
, ProcessingInstruction
, or Comment
node:
In this case, first partially contained child is original start node.
Let subfragment be the result of extracting subrange.
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.
-If any member of contained children is a doctype, then throw a
"HierarchyRequestError
" DOMException
.
Let subfragment be the result of cloning the contents of subrange.
To insert a node node into a live range range, run these steps:
ProcessingInstruction
or Comment
node, is a Text
node whose parent is null, or is node,
+ ProcessingInstruction
or Comment
node, is a Text
node whose parent is null, or is node,
then throw a "HierarchyRequestError
" DOMException
.
Text
node,
set referenceNode to that Text
node.
- Text
node, set referenceNode to the result of splitting it with
offset range’s start offset.
DocumentFragment
node, and one otherwise.
+ DocumentFragment
node, and one otherwise.
If range is collapsed, then set range’s end to (parent, newOffset).
@@ -5425,7 +5757,7 @@If newParent has children, then replace all with null +
If newParent has children, then replace all with null within newParent.
InvalidNodeTypeError
" DOMException
.
- IndexSizeError
" DOMException
.
WrongDocumentError
" DOMException
.
InvalidNodeTypeError
" DOMException
.
- IndexSizeError
" DOMException
.
intersectsNode(node)
method steps are:
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.
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.
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 @@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_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 @@In all current engines.
In all current engines.
In all current engines.
Element/previousElementSibling
In all current engines.
DocumentFragment/childElementCount
+DocumentFragment/childElementCount
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
DocumentFragment/querySelector
In all current engines.
DocumentFragment/querySelectorAll
In all current engines.
DocumentFragment/getElementById
+In all current engines.
+In all current engines.
+In all current engines.
+In all current engines.
+In all current engines.
In all current engines.
+In all current engines.
+MutationRecord/attributeNamespace
+In all current engines.
+In all current engines.
+In all current engines.
+MutationRecord/previousSibling
+In all current engines.
+In all current engines.
+In all current engines.
+In all current engines.
+In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
In all current engines.
+Reference/Global_Objects/Array/@@iterator
+In all current engines.
+In all current engines.
In all current engines.
In all current engines.
In all current engines.
+In all current engines.
In all current engines.