mirror of
https://github.com/bendtherules/react-fiber-traverse.git
synced 2026-08-18 13:52:36 +00:00
Doc - Add doc for traverseGenerator with example
This commit is contained in:
+57
-1
@@ -4,7 +4,7 @@ import { FiberNode } from "./mocked-types";
|
||||
/**
|
||||
* Traverse nodes recursively in depth-first manner, starting from a start node.
|
||||
*
|
||||
* This is the default and basic traversal method, which covers basic use cases.
|
||||
* This is the default and basic traversal function, which covers basic use cases.
|
||||
* You can't do advanced things like change the order of traversal, skip or cancel traversal after any node, etc.
|
||||
* For more advanced usecases, see {@link traverseGenerator}
|
||||
*
|
||||
@@ -26,6 +26,62 @@ function traverse(node: FiberNode, fn: (node: FiberNode) => any) {
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Traverse nodes recursively using generators.
|
||||
*
|
||||
* This is the advanced traverse function, which can be used used
|
||||
* to write other variants of traversal and find.
|
||||
*
|
||||
* Type signature for generator.next first argument is `{ skipChild?: boolean; skipSibling?: boolean } | void `
|
||||
* Throw any error into the generator to finish the generator and let it cleanup its internals.
|
||||
*
|
||||
* It allows inversion of control -
|
||||
* so, application code can decide to
|
||||
* 1. change order of traversal,
|
||||
* 2. skip some elements,
|
||||
* 3. cancel traversal mid-way.
|
||||
*
|
||||
* @example
|
||||
* ```js
|
||||
* // Basic use (for-of)
|
||||
*
|
||||
* const nodeIterator = traverseGenerator(rootNode);
|
||||
* for (const node of nodeIterator) {
|
||||
* // do something with each node here
|
||||
* }
|
||||
* ```
|
||||
*
|
||||
* @example
|
||||
* ```js
|
||||
* // Breadth-first
|
||||
*
|
||||
* // note the order below
|
||||
* const nodeIterator = traverseGenerator(rootNode, ["self", "sibling", "child"]);
|
||||
* // rest - same as above
|
||||
* ```
|
||||
*
|
||||
* @example
|
||||
* ```js
|
||||
* // Get first 3 nodes and then stop the generator
|
||||
*
|
||||
* const nodeIterator = traverseGenerator(rootNode);
|
||||
*
|
||||
* var count = 0;
|
||||
* var next;
|
||||
* while (
|
||||
* count < 3 &&
|
||||
* !(next = nodeIterator.next()).done
|
||||
* ) {
|
||||
* count++;
|
||||
* const node = next.value;
|
||||
* // do something with each node here
|
||||
* }
|
||||
*
|
||||
* // Finish generator, to prevent memory leak
|
||||
* nodeIterator.throw(new Error());
|
||||
* ```
|
||||
*
|
||||
*/
|
||||
function* traverseGenerator(
|
||||
node: FiberNode,
|
||||
{
|
||||
|
||||
Reference in New Issue
Block a user