node-deep-for-each

Recursively iterates collection values (arrays and objects)

Description

The iteration is made using a deep-first algorithm.

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.

Node.js is an event-based server-side JavaScript engine.

Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.

Upload a screenshot

Hint: upload an image here from your clipboard with Ctrl-V


Homepage

https://github.com/IndigoUnited/js-deep-for-each#readme


Install this software package

If the package is available for the distribution you are currently using on your computer then install the software by clicking on…

Install node-deep-for-each

Cookies help us deliver our services. By using our services, you agree to our use of cookies. Learn more