visitHast()
Recorre y transforma un árbol HAST usando una función visitor.
import { visitHast } from "@unifast/core";Firma
function visitHast(node: HastNode, visitor: (node: HastNode) => HastNode | void): HastNodeParámetros
node
| Propiedad | Tipo | Por defecto | Descripción |
|---|---|---|---|
type | string | — | El tipo de nodo ("root", "element", "text", etc.) |
children | HastNode[] | — | Nodos hijos (para los tipos "root" y "element") |
visitor
| Propiedad | Tipo | Por defecto | Descripción |
|---|---|---|---|
visitor | (node: HastNode) => HastNode | void | — | Una función invocada para cada nodo; devuelve un nodo para reemplazar el original, o void para conservarlo |
Retorna
HastNode — Un nuevo árbol con las transformaciones aplicadas por la función visitor.
Uso
import { visitHast } from "@unifast/core";
import type { HastNode, HastRoot } from "@unifast/core";
const tree: HastRoot = {
type: "root",
children: [
{
type: "element",
tagName: "p",
properties: {},
children: [{ type: "text", value: "Hello world" }],
},
],
};
const result = visitHast(tree, (node) => {
if (node.type === "text") {
return { type: "text", value: node.value.toUpperCase() };
}
});
console.log(result);
// Tree with text "HELLO WORLD"Ejemplos
Añadir una clase a todos los párrafos
import { visitHast } from "@unifast/core";
import type { HastRoot } from "@unifast/core";
const tree: HastRoot = {
type: "root",
children: [
{
type: "element",
tagName: "p",
properties: {},
children: [{ type: "text", value: "First paragraph." }],
},
{
type: "element",
tagName: "p",
properties: {},
children: [{ type: "text", value: "Second paragraph." }],
},
],
};
const result = visitHast(tree, (node) => {
if (node.type === "element" && node.tagName === "p") {
return {
...node,
properties: { ...node.properties, className: ["prose"] },
};
}
});
// Both <p> elements now have className: ["prose"]Eliminar todas las imágenes
import { visitHast } from "@unifast/core";
import type { HastRoot } from "@unifast/core";
const tree: HastRoot = {
type: "root",
children: [
{
type: "element",
tagName: "p",
properties: {},
children: [
{ type: "text", value: "See the photo: " },
{
type: "element",
tagName: "img",
properties: { src: "photo.jpg", alt: "A photo" },
children: [],
},
],
},
],
};
const result = visitHast(tree, (node) => {
if (node.type === "element" && (node.tagName === "p" || node.tagName === "div")) {
return {
...node,
children: node.children.filter(
(child) => !(child.type === "element" && child.tagName === "img"),
),
};
}
});
// The <img> element has been removed from the treeRecolectar todos los enlaces
import { visitHast } from "@unifast/core";
import type { HastRoot } from "@unifast/core";
const tree: HastRoot = {
type: "root",
children: [
{
type: "element",
tagName: "p",
properties: {},
children: [
{ type: "text", value: "Visit " },
{
type: "element",
tagName: "a",
properties: { href: "https://example.com" },
children: [{ type: "text", value: "Example" }],
},
{ type: "text", value: " and " },
{
type: "element",
tagName: "a",
properties: { href: "https://docs.example.com" },
children: [{ type: "text", value: "Docs" }],
},
],
},
],
};
const links: string[] = [];
visitHast(tree, (node) => {
if (node.type === "element" && node.tagName === "a") {
const href = node.properties.href;
if (typeof href === "string") {
links.push(href);
}
}
});
console.log(links);
// ["https://example.com", "https://docs.example.com"]Envolver bloques de código en un contenedor
import { visitHast } from "@unifast/core";
import type { HastNode, HastRoot } from "@unifast/core";
const tree: HastRoot = {
type: "root",
children: [
{
type: "element",
tagName: "pre",
properties: {},
children: [
{
type: "element",
tagName: "code",
properties: { className: ["language-js"] },
children: [{ type: "text", value: "const x = 1;" }],
},
],
},
],
};
const result = visitHast(tree, (node) => {
if (node.type === "element" && node.tagName === "pre") {
return {
type: "element",
tagName: "div",
properties: { className: ["code-block"] },
children: [node],
} as HastNode;
}
});
// <pre> is now wrapped inside <div class="code-block">Comportamiento
Inmutable: retorna un nuevo árbol; el árbol original no se modifica
Recorrido top-down: el visitor se invoca sobre el nodo padre antes de visitar a sus hijos
Reemplazo: si el visitor retorna un nodo, reemplaza al nodo actual antes de recorrer los hijos
Sin efecto: si el visitor retorna
void(oundefined), se conserva el nodo originalRecursivo: los hijos de los nodos
"root"y"element"se visitan recursivamente