Simple DOM traversal method with some tolerance for modification of the element tree during traversal. Intended to be more performant than NodeIterator (due to lack of setup cost), but less full-featured.
Installing traverse-dom via npm
$ npm install --save traverse-dom
Installing traverse-dom via yarn
$ yarn add traverse-dom
import { traverse } from 'traverse-dom';
traverse(myElement, (child) => { mutateElement(child) });
import { traverseMap } from 'traverse-dom';
const allNodeNames = traverseMap(myElement, (child) => child.nodeName);
Goes through all the child elements of the provided element and calls the callback with the current child.
If shouldRecurse
is true
does a deep traversal.
If shouldRecurse
is a function it will be called on each element to provide fine control
over what element's children to traverse.
usage example: moving elements outside of another element.
Arguments
element: Element
- Element to traverse children of.callback: (child: Element) => void
- Callback to pass each child element.shouldRecurse: boolean | (child: Element) => boolean = false
- Set to traverse deeper than immediate children ofelement
.
Returns
Element
- Returns the same element the function was called with.
Same as traverse but traverses nodes not just elements.
Arguments
node: Node
- Node to traverse children of.callback: (child: Node) => void
- Callback to pass each child node.shouldRecurse: boolean | (child: Node) => boolean = false
- Set to traverse deeper than immediate children ofnode
.
Returns
Node
- Returns the same node the function was called with.
Creates an array of values by running each children of the passed node through the callback. Callback is invoked with the child node.
usage example: Collecting all the node names recursively.
Arguments
node: Node
- Node to traverse children of.callback: (child: Node) => T
- The function invoked per iteration.shouldRecurse: boolean | (child: Node) => boolean = false
- Set to traverse deeper than immediate children ofnode
.
Returns
Array<T>
- Returns the new mapped array.
Reduces the node's children to a value which is the accumulated result of running each node thru
callback
where each successive invocation is supplied the return value of the previous.
usage example: collecting all the node names recursively while filtering the result.
Arguments
node: Node
- Node to traverse children of.callback: (child: Node) => T
- The function invoked per iteration.acc: T
- The initial value.shouldRecurse: boolean | (child: Node) => boolean = false
- Set to traverse deeper than immediate children ofnode
.
Returns
T
- Returns the accumulated value.
See the Contribution guide
Based on shmuga's npm module boilerplate