@siteimprove/alfa-dom 0.113.0 → 0.114.1

package/CHANGELOG.md

@@ -1,5 +1,17 @@
 # @siteimprove/alfa-dom
 
+## 0.114.1
+
+### Patch Changes
+
+- **Fixed:** `fullTree` as default traversal in getNodesBetween has been restored after being changed to `Traversal.empty` in #2040. ([#2050](https://github.com/Siteimprove/alfa/pull/2050))
+
+## 0.114.0
+
+### Minor Changes
+
+- **Breaking:** Functions no longer accept injected default traversal. Defaults are set in the function signatures. ([#2049](https://github.com/Siteimprove/alfa/pull/2049))
+
 ## 0.113.0
 
 ### Minor Changes

package/dist/node/element/predicate/is-content.d.ts

@@ -1,12 +1,13 @@
 import { Predicate } from "@siteimprove/alfa-predicate";
 import { Refinement } from "@siteimprove/alfa-refinement";
 import type { Element } from "../../slotable/element.js";
-import type { BaseNode } from "../../node.js";
+import type { Node } from "../../index.js";
+import { BaseNode } from "../../node.js";
 /**
  * A node is actual content (not just a container) if it has no children,
  * or if it is a replaced element (assumed to be replaced by actual content).
  *
  * @public
  */
-export declare function isContent(isElement: Refinement<unknown, Element>, defaultTraversal: BaseNode.Traversal): (options?: BaseNode.Traversal) => Predicate<BaseNode>;
+export declare function isContent(isElement: Refinement<unknown, Element>): (options: Node.Traversal) => Predicate<BaseNode>;
 //# sourceMappingURL=is-content.d.ts.map

package/dist/node/element/predicate/is-content.js

@@ -1,5 +1,6 @@
 import { Predicate } from "@siteimprove/alfa-predicate";
 import { Refinement } from "@siteimprove/alfa-refinement";
+import { BaseNode } from "../../node.js";
 import { isReplaced } from "./is-replaced.js";
 const { or } = Predicate;
 const { and } = Refinement;
@@ -9,7 +10,7 @@ const { and } = Refinement;
  *
  * @public
  */
-export function isContent(isElement, defaultTraversal) {
-    return (options = defaultTraversal) => or((node) => node.children(options).isEmpty(), and(isElement, isReplaced));
+export function isContent(isElement) {
+    return (options = BaseNode.Traversal.empty) => or((node) => node.children(options).isEmpty(), and(isElement, isReplaced));
 }
 //# sourceMappingURL=is-content.js.map

package/dist/node/index.d.ts

@@ -10,6 +10,7 @@ import { Element, Text } from "./slotable/index.js";
 import { Fragment } from "./fragment.js";
 import { Type } from "./type.js";
 import * as predicate from "./predicate/index.js";
+import * as traversal from "./traversal/index.js";
 export * from "./attribute.js";
 export * from "./comment.js";
 export * from "./document.js";
@@ -43,14 +44,11 @@ export declare namespace Node {
      * @internal
      */
     function fromNode(json: JSON, device?: Device): Trampoline<Node>;
-    const getNodesBetween: (node1: Node, node2: Node, includeOptions?: {
-        includeFirst: boolean;
-        includeSecond: boolean;
-    }) => import("@siteimprove/alfa-sequence").Sequence<Node>;
+    const getNodesBetween: typeof traversal.getNodesBetween;
     const hasBox: typeof predicate.hasBox, isRoot: typeof predicate.isRoot;
-    const hasChild: (predicate: import("@siteimprove/alfa-predicate").Predicate<Node>, options?: Node.Traversal) => import("@siteimprove/alfa-predicate").Predicate<Node>;
-    const hasDescendant: (predicate: import("@siteimprove/alfa-predicate").Predicate<Node>, options?: Node.Traversal) => import("@siteimprove/alfa-predicate").Predicate<Node>;
-    const hasInclusiveDescendant: (predicate: import("@siteimprove/alfa-predicate").Predicate<Node>, options?: Node.Traversal) => import("@siteimprove/alfa-predicate").Predicate<Node>;
-    const hasTextContent: (predicate?: import("@siteimprove/alfa-predicate").Predicate<string>, options?: Node.Traversal) => import("@siteimprove/alfa-predicate").Predicate<Node>;
+    const hasChild: typeof predicate.hasChild;
+    const hasDescendant: typeof predicate.hasDescendant;
+    const hasInclusiveDescendant: typeof predicate.hasInclusiveDescendant;
+    const hasTextContent: typeof predicate.hasTextContent;
 }
 //# sourceMappingURL=index.d.ts.map

package/dist/node/index.js

@@ -64,11 +64,11 @@ export var Node;
         }
     }
     Node.fromNode = fromNode;
-    Node.getNodesBetween = traversal.getNodesBetween(Node.Traversal.empty);
+    Node.getNodesBetween = traversal.getNodesBetween;
     Node.hasBox = predicate.hasBox, Node.isRoot = predicate.isRoot;
-    Node.hasChild = predicate.hasChild(Node.Traversal.empty);
-    Node.hasDescendant = predicate.hasDescendant(Node.Traversal.empty);
-    Node.hasInclusiveDescendant = predicate.hasInclusiveDescendant(Node.Traversal.empty);
-    Node.hasTextContent = predicate.hasTextContent(Node.Traversal.empty);
+    Node.hasChild = predicate.hasChild;
+    Node.hasDescendant = predicate.hasDescendant;
+    Node.hasInclusiveDescendant = predicate.hasInclusiveDescendant;
+    Node.hasTextContent = predicate.hasTextContent;
 })(Node || (Node = {}));
 //# sourceMappingURL=index.js.map

package/dist/node/predicate/has-child.d.ts

@@ -3,5 +3,5 @@ import type { Node } from "../index.js";
 /**
  * @public
  */
-export declare function hasChild(defaultTraversal: Node.Traversal): (predicate: Predicate<Node>, options?: Node.Traversal) => Predicate<Node>;
+export declare function hasChild(predicate: Predicate<Node>, options?: Node.Traversal): Predicate<Node>;
 //# sourceMappingURL=has-child.d.ts.map

package/dist/node/predicate/has-child.js

@@ -1,7 +1,8 @@
+import { BaseNode } from "../node.js";
 /**
  * @public
  */
-export function hasChild(defaultTraversal) {
-    return (predicate, options = defaultTraversal) => (node) => node.children(options).some(predicate);
+export function hasChild(predicate, options = BaseNode.Traversal.empty) {
+    return (node) => node.children(options).some(predicate);
 }
 //# sourceMappingURL=has-child.js.map

package/dist/node/predicate/has-descendant.d.ts

@@ -3,5 +3,5 @@ import type { Node } from "../index.js";
 /**
  * @public
  */
-export declare function hasDescendant(defaultTraversal: Node.Traversal): (predicate: Predicate<Node>, options?: Node.Traversal) => Predicate<Node>;
+export declare function hasDescendant(predicate: Predicate<Node>, options?: Node.Traversal): Predicate<Node>;
 //# sourceMappingURL=has-descendant.d.ts.map

package/dist/node/predicate/has-descendant.js

@@ -1,7 +1,8 @@
+import { BaseNode } from "../node.js";
 /**
  * @public
  */
-export function hasDescendant(defaultTraversal) {
-    return (predicate, options = defaultTraversal) => (node) => node.descendants(options).some(predicate);
+export function hasDescendant(predicate, options = BaseNode.Traversal.empty) {
+    return (node) => node.descendants(options).some(predicate);
 }
 //# sourceMappingURL=has-descendant.js.map

package/dist/node/predicate/has-inclusive-descendant.d.ts

@@ -3,5 +3,5 @@ import type { Node } from "../index.js";
 /**
  * @public
  */
-export declare function hasInclusiveDescendant(defaultTraversal: Node.Traversal): (predicate: Predicate<Node>, options?: Node.Traversal) => Predicate<Node>;
+export declare function hasInclusiveDescendant(predicate: Predicate<Node>, options?: Node.Traversal): Predicate<Node>;
 //# sourceMappingURL=has-inclusive-descendant.d.ts.map

package/dist/node/predicate/has-inclusive-descendant.js

@@ -1,7 +1,8 @@
+import { BaseNode } from "../node.js";
 /**
  * @public
  */
-export function hasInclusiveDescendant(defaultTraversal) {
-    return (predicate, options = defaultTraversal) => (node) => node.inclusiveDescendants(options).some(predicate);
+export function hasInclusiveDescendant(predicate, options = BaseNode.Traversal.empty) {
+    return (node) => node.inclusiveDescendants(options).some(predicate);
 }
 //# sourceMappingURL=has-inclusive-descendant.js.map

package/dist/node/predicate/has-text-content.d.ts

@@ -3,5 +3,5 @@ import type { Node } from "../index.js";
 /**
  * @public
  */
-export declare function hasTextContent(defaultTraversal: Node.Traversal): (predicate?: Predicate<string>, options?: Node.Traversal) => Predicate<Node>;
+export declare function hasTextContent(predicate?: Predicate<string>, options?: Node.Traversal): Predicate<Node>;
 //# sourceMappingURL=has-text-content.d.ts.map

package/dist/node/predicate/has-text-content.js

@@ -1,11 +1,12 @@
 import { Iterable } from "@siteimprove/alfa-iterable";
 import { Predicate } from "@siteimprove/alfa-predicate";
+import { BaseNode } from "../node.js";
 const { isEmpty } = Iterable;
 const { not } = Predicate;
 /**
  * @public
  */
-export function hasTextContent(defaultTraversal) {
-    return (predicate = not(isEmpty), options = defaultTraversal) => (node) => predicate(node.textContent(options));
+export function hasTextContent(predicate = not(isEmpty), options = BaseNode.Traversal.empty) {
+    return (node) => predicate(node.textContent(options));
 }
 //# sourceMappingURL=has-text-content.js.map

package/dist/node/query/descendants.d.ts

@@ -1,7 +1,7 @@
 import type { Predicate } from "@siteimprove/alfa-predicate";
 import type { Refinement } from "@siteimprove/alfa-refinement";
 import { Sequence } from "@siteimprove/alfa-sequence";
-import { BaseNode } from "../node.js";
+import type { Node } from "../index.js";
 import { Element, Text } from "../slotable/index.js";
 /**
  * Get all descendants of a node that satisfy a given refinement.
@@ -12,7 +12,7 @@ import { Element, Text } from "../slotable/index.js";
  *
  * @public
  */
-export declare function getDescendants<T extends BaseNode>(refinement: Refinement<BaseNode, T>): (node: BaseNode, options?: BaseNode.Traversal) => Sequence<T>;
+export declare function getDescendants<T extends Node>(refinement: Refinement<Node, T>): (node: Node, options?: Node.Traversal) => Sequence<T>;
 /**
  * Get all descendants of a node that satisfy a given predicate.
  *
@@ -22,22 +22,22 @@ export declare function getDescendants<T extends BaseNode>(refinement: Refinemen
  *
  * @public
  */
-export declare function getDescendants(predicate: Predicate<BaseNode>): (node: BaseNode, options?: BaseNode.Traversal) => Sequence<BaseNode>;
+export declare function getDescendants(predicate: Predicate<Node>): (node: Node, options?: Node.Traversal) => Sequence<Node>;
 /**
  * @public
  */
-export declare const getElementDescendants: (node: BaseNode, options?: BaseNode.Traversal) => Sequence<Element<string>>;
+export declare const getElementDescendants: (node: Node, options?: Node.Traversal) => Sequence<Element<string>>;
 /**
  * @public
  */
-export declare function getInclusiveElementDescendants(node: Element, options?: BaseNode.Traversal): Sequence<Element>;
+export declare function getInclusiveElementDescendants(node: Element, options?: Node.Traversal): Sequence<Element>;
 /**
  * A group of text nodes with an associated label.
  *
  * @public
  */
 export interface TextGroup {
-    node: BaseNode;
+    node: Node;
     label: string;
     text: Sequence<Text>;
 }
@@ -46,8 +46,8 @@ export interface TextGroup {
  *
  * @public
  */
-export interface TextGroupOptions<N extends BaseNode = BaseNode> {
-    startsGroup: Refinement<BaseNode, N>;
+export interface TextGroupOptions<N extends Node = Node> {
+    startsGroup: Refinement<Node, N>;
     getLabel: (node: N) => string;
 }
 /**
@@ -63,5 +63,5 @@ export interface TextGroupOptions<N extends BaseNode = BaseNode> {
  *
  * @public
  */
-export declare function getTextDescendants<N extends BaseNode = BaseNode>(textOptions?: TextGroupOptions<N>): (node: BaseNode, options?: BaseNode.Traversal) => Sequence<Text | TextGroup>;
+export declare function getTextDescendants<N extends Node = Node>(textOptions?: TextGroupOptions<N>): (node: Node, options?: Node.Traversal) => Sequence<Text | TextGroup>;
 //# sourceMappingURL=descendants.d.ts.map

package/dist/node/query/element-id-map.d.ts

@@ -1,5 +1,5 @@
 import { Map } from "@siteimprove/alfa-map";
-import type { BaseNode } from "../node.js";
+import type { Node } from "../index.js";
 import type { Element } from "../slotable/element.js";
 /**
  * Returns a map from id to elements, in the subtree rooted at a given node.
@@ -10,5 +10,5 @@ import type { Element } from "../slotable/element.js";
  *
  * @public
  */
-export declare function getElementIdMap(node: BaseNode): Map<string, Element>;
+export declare function getElementIdMap(node: Node): Map<string, Element>;
 //# sourceMappingURL=element-id-map.d.ts.map

package/dist/node/query/index.d.ts

@@ -1,16 +1,16 @@
 import * as descendants from "./descendants.js";
 import * as elementIdMap from "./element-id-map.js";
-import type { BaseNode } from "../node.js";
+import type { Node } from "../index.js";
 /**
  * @public
  */
 export declare namespace Query {
     const getDescendants: typeof descendants.getDescendants;
-    const getElementDescendants: (node: BaseNode, options?: BaseNode.Traversal) => import("@siteimprove/alfa-sequence").Sequence<import("../index.js").Element<string>>;
+    const getElementDescendants: (node: Node, options?: Node.Traversal) => import("@siteimprove/alfa-sequence").Sequence<import("../index.js").Element<string>>;
     const getInclusiveElementDescendants: typeof descendants.getInclusiveElementDescendants;
     const getTextDescendants: typeof descendants.getTextDescendants;
     const getElementIdMap: typeof elementIdMap.getElementIdMap;
     type TextGroup = descendants.TextGroup;
-    type TextGroupOptions<N extends BaseNode = BaseNode> = descendants.TextGroupOptions<N>;
+    type TextGroupOptions<N extends Node = Node> = descendants.TextGroupOptions<N>;
 }
 //# sourceMappingURL=index.d.ts.map

package/dist/node/slotable/element.d.ts

@@ -128,7 +128,7 @@ export declare namespace Element {
     const hasAttribute: typeof predicate.hasAttribute, hasDisplaySize: typeof predicate.hasDisplaySize, hasId: typeof predicate.hasId, hasInputType: typeof predicate.hasInputType, hasName: typeof predicate.hasName, hasNamespace: typeof predicate.hasNamespace, hasTabIndex: typeof predicate.hasTabIndex, isBrowsingContextContainer: typeof predicate.isBrowsingContextContainer, isDraggable: typeof predicate.isDraggable, isEditingHost: typeof predicate.isEditingHost, isSuggestedFocusable: typeof predicate.isSuggestedFocusable, isReplaced: typeof predicate.isReplaced;
     const hasUniqueId: Predicate<Element<string>>;
     const isActuallyDisabled: Predicate<Element<string>>;
-    const isContent: (options?: BaseNode.Traversal) => Predicate<BaseNode>;
+    const isContent: (options: Node.Traversal) => Predicate<BaseNode>;
     const isDocumentElement: import("@siteimprove/alfa-refinement").Refinement<unknown, Element<"html">>;
     const isFallback: Predicate<BaseNode<string>>;
     const isScopedTo: (name: string, ...rest: Array<string>) => Predicate<Element>;

package/dist/node/slotable/element.js

@@ -345,7 +345,7 @@ export class Element extends Slotable {
     Element.hasAttribute = predicate.hasAttribute, Element.hasDisplaySize = predicate.hasDisplaySize, Element.hasId = predicate.hasId, Element.hasInputType = predicate.hasInputType, Element.hasName = predicate.hasName, Element.hasNamespace = predicate.hasNamespace, Element.hasTabIndex = predicate.hasTabIndex, Element.isBrowsingContextContainer = predicate.isBrowsingContextContainer, Element.isDraggable = predicate.isDraggable, Element.isEditingHost = predicate.isEditingHost, Element.isSuggestedFocusable = predicate.isSuggestedFocusable, Element.isReplaced = predicate.isReplaced;
     Element.hasUniqueId = predicate.hasUniqueId(isElement);
     Element.isActuallyDisabled = predicate.isActuallyDisabled(isElement);
-    Element.isContent = predicate.isContent(isElement, BaseNode.Traversal.empty);
+    Element.isContent = predicate.isContent(isElement);
     Element.isDocumentElement = predicate.isDocumentElement(isElement);
     Element.isFallback = predicate.isFallback(isElement);
     Element.isScopedTo = predicate.isScopedTo(isElement);

package/dist/node/traversal/get-nodes-between.d.ts

@@ -15,7 +15,7 @@ import type { Node } from "../index.js";
  *
  * @public
  */
-export declare function getNodesBetween(defaultTreeOptions: Node.Traversal): (node1: Node, node2: Node, includeOptions?: Options) => Sequence<Node>;
+export declare function getNodesBetween(node1: Node, node2: Node, includeOptions?: Options, treeOptions?: Node.Traversal): Sequence<Node>;
 type Options = {
     includeFirst: boolean;
     includeSecond: boolean;

package/dist/node/traversal/get-nodes-between.js

@@ -1,5 +1,6 @@
 import { Predicate } from "@siteimprove/alfa-predicate";
 import { Sequence } from "@siteimprove/alfa-sequence";
+import { BaseNode } from "../node.js";
 import { lowestCommonAncestor } from "./lowest-common-ancestor.js";
 const { equals, or } = Predicate;
 /**
@@ -17,43 +18,41 @@ const { equals, or } = Predicate;
  *
  * @public
  */
-export function getNodesBetween(defaultTreeOptions) {
-    return function getNodes(node1, node2, includeOptions = { includeFirst: false, includeSecond: false }, treeOptions = defaultTreeOptions) {
-        let between = getNodesInclusivelyBetween(node1, node2, treeOptions);
-        // If somehow there is nothing between them, escape now
-        if (between.isEmpty()) {
-            return between;
-        }
-        // Do we keep the first node or skip its subtree?
-        if (!includeOptions.includeFirst) {
-            // By previous test, between is not empty
-            const first = between.first().getUnsafe();
-            // The 'first node after the subtree rooted at first' is the next sibling
-            // of the closest ancestor having one.
-            between = first
-                // Closest ancestor with a next sibling.
-                .closest((ancestor) => ancestor.next(treeOptions).isSome(), treeOptions)
-                // Get that sibling.
-                .flatMap((node) => node.next(treeOptions))
-                // Skip everything until next.
-                .map((next) => between.skipUntil((node) => node.equals(next)))
-                // If nothing after the subtree at first, just escape.
-                .getOrElse(Sequence.empty);
-        }
-        // Do we keep the second node or remove it?
-        between =
-            includeOptions.includeSecond || between.isEmpty()
-                ? between
-                : between.skipLast(1);
+export function getNodesBetween(node1, node2, includeOptions = { includeFirst: false, includeSecond: false }, treeOptions = BaseNode.fullTree) {
+    let between = getNodesInclusivelyBetween(node1, node2, treeOptions);
+    // If somehow there is nothing between them, escape now
+    if (between.isEmpty()) {
         return between;
-    };
+    }
+    // Do we keep the first node or skip its subtree?
+    if (!includeOptions.includeFirst) {
+        // By previous test, between is not empty
+        const first = between.first().getUnsafe();
+        // The 'first node after the subtree rooted at first' is the next sibling
+        // of the closest ancestor having one.
+        between = first
+            // Closest ancestor with a next sibling.
+            .closest((ancestor) => ancestor.next(treeOptions).isSome(), treeOptions)
+            // Get that sibling.
+            .flatMap((node) => node.next(treeOptions))
+            // Skip everything until next.
+            .map((next) => between.skipUntil((node) => node.equals(next)))
+            // If nothing after the subtree at first, just escape.
+            .getOrElse(Sequence.empty);
+    }
+    // Do we keep the second node or remove it?
+    between =
+        includeOptions.includeSecond || between.isEmpty()
+            ? between
+            : between.skipLast(1);
+    return between;
 }
 /**
  * Get all nodes between node1 and node2, included.
  */
 function getNodesInclusivelyBetween(node1, node2, treeOptions) {
     const isFrontier = or(equals(node1), equals(node2));
-    return lowestCommonAncestor(treeOptions)(node1, node2)
+    return lowestCommonAncestor(node1, node2)
         .map((context) => context
         .inclusiveDescendants(treeOptions)
         .skipUntil(isFrontier)

package/dist/node/traversal/lowest-common-ancestor.d.ts

@@ -1,5 +1,5 @@
 import { Option } from "@siteimprove/alfa-option";
-import type { BaseNode } from "../node.js";
+import type { Node } from "../../index.js";
 /**
  * Find the lowest common ancestor of two nodes:
  * * get the ancestors chain of both
@@ -9,5 +9,5 @@ import type { BaseNode } from "../node.js";
  *
  * @internal
  */
-export declare function lowestCommonAncestor(defaultTraversal: BaseNode.Traversal): (node1: BaseNode, node2: BaseNode, options?: BaseNode.Traversal) => Option<BaseNode>;
+export declare function lowestCommonAncestor(node1: Node, node2: Node, options?: Node.Traversal): Option<Node>;
 //# sourceMappingURL=lowest-common-ancestor.d.ts.map

package/dist/node/traversal/lowest-common-ancestor.js

@@ -1,4 +1,5 @@
 import { None, Option } from "@siteimprove/alfa-option";
+import { BaseNode } from "../node.js";
 /**
  * Find the lowest common ancestor of two nodes:
  * * get the ancestors chain of both
@@ -8,8 +9,8 @@ import { None, Option } from "@siteimprove/alfa-option";
  *
  * @internal
  */
-export function lowestCommonAncestor(defaultTraversal) {
-    return (node1, node2, options = defaultTraversal) => node1
+export function lowestCommonAncestor(node1, node2, options = BaseNode.Traversal.empty) {
+    return node1
         .inclusiveAncestors(options)
         .reverse()
         .zip(node2.inclusiveAncestors(options).reverse())

package/package.json

@@ -2,7 +2,7 @@
   "$schema": "http://json.schemastore.org/package",
   "name": "@siteimprove/alfa-dom",
   "homepage": "https://alfa.siteimprove.com",
-  "version": "0.113.0",
+  "version": "0.114.1",
   "license": "MIT",
   "description": "Implementations of the core DOM and CSSOM node types",
   "repository": {
@@ -35,36 +35,36 @@
     "dist/**/*.d.ts"
   ],
   "dependencies": {
-    "@siteimprove/alfa-array": "^0.113.0",
-    "@siteimprove/alfa-cache": "^0.113.0",
-    "@siteimprove/alfa-comparable": "^0.113.0",
-    "@siteimprove/alfa-css": "^0.113.0",
-    "@siteimprove/alfa-css-feature": "^0.113.0",
-    "@siteimprove/alfa-device": "^0.113.0",
-    "@siteimprove/alfa-earl": "^0.113.0",
-    "@siteimprove/alfa-equatable": "^0.113.0",
-    "@siteimprove/alfa-flags": "^0.113.0",
-    "@siteimprove/alfa-iterable": "^0.113.0",
-    "@siteimprove/alfa-json": "^0.113.0",
-    "@siteimprove/alfa-lazy": "^0.113.0",
-    "@siteimprove/alfa-map": "^0.113.0",
-    "@siteimprove/alfa-option": "^0.113.0",
-    "@siteimprove/alfa-parser": "^0.113.0",
-    "@siteimprove/alfa-predicate": "^0.113.0",
-    "@siteimprove/alfa-rectangle": "^0.113.0",
-    "@siteimprove/alfa-refinement": "^0.113.0",
-    "@siteimprove/alfa-result": "^0.113.0",
-    "@siteimprove/alfa-sarif": "^0.113.0",
-    "@siteimprove/alfa-sequence": "^0.113.0",
-    "@siteimprove/alfa-slice": "^0.113.0",
-    "@siteimprove/alfa-string": "^0.113.0",
-    "@siteimprove/alfa-trampoline": "^0.113.0",
-    "@siteimprove/alfa-tree": "^0.113.0"
+    "@siteimprove/alfa-array": "^0.114.1",
+    "@siteimprove/alfa-cache": "^0.114.1",
+    "@siteimprove/alfa-comparable": "^0.114.1",
+    "@siteimprove/alfa-css": "^0.114.1",
+    "@siteimprove/alfa-css-feature": "^0.114.1",
+    "@siteimprove/alfa-device": "^0.114.1",
+    "@siteimprove/alfa-earl": "^0.114.1",
+    "@siteimprove/alfa-equatable": "^0.114.1",
+    "@siteimprove/alfa-flags": "^0.114.1",
+    "@siteimprove/alfa-iterable": "^0.114.1",
+    "@siteimprove/alfa-json": "^0.114.1",
+    "@siteimprove/alfa-lazy": "^0.114.1",
+    "@siteimprove/alfa-map": "^0.114.1",
+    "@siteimprove/alfa-option": "^0.114.1",
+    "@siteimprove/alfa-parser": "^0.114.1",
+    "@siteimprove/alfa-predicate": "^0.114.1",
+    "@siteimprove/alfa-rectangle": "^0.114.1",
+    "@siteimprove/alfa-refinement": "^0.114.1",
+    "@siteimprove/alfa-result": "^0.114.1",
+    "@siteimprove/alfa-sarif": "^0.114.1",
+    "@siteimprove/alfa-sequence": "^0.114.1",
+    "@siteimprove/alfa-slice": "^0.114.1",
+    "@siteimprove/alfa-string": "^0.114.1",
+    "@siteimprove/alfa-trampoline": "^0.114.1",
+    "@siteimprove/alfa-tree": "^0.114.1"
   },
   "devDependencies": {
-    "@siteimprove/alfa-test": "^0.113.0",
+    "@siteimprove/alfa-test": "^0.114.1",
     "@types/jsdom": "^28.0.1",
-    "jsdom": "^29.0.1"
+    "jsdom": "^29.0.2"
   },
   "publishConfig": {
     "access": "public",