[ Källkod: node-deep-for-each ]
Paket: node-deep-for-each (1.0.6+dfsg-1)
Länkar för node-deep-for-each
Debianresurser:
Hämta källkodspaketet node-deep-for-each:
- [node-deep-for-each_1.0.6+dfsg-1.dsc]
- [node-deep-for-each_1.0.6+dfsg.orig.tar.xz]
- [node-deep-for-each_1.0.6+dfsg-1.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [github.com]
Liknande paket:
Recursively iterates collection values (arrays and objects)
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.
Andra paket besläktade med node-deep-for-each
|
|
|
|
-
- dep: node-is-plain-object (>= 2.0.1)
- Returns true if object was created by `Object` constructor
-
- dep: nodejs
- evented I/O for V8 javascript - runtime executable
Hämta node-deep-for-each
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| all | 4,5 kbyte | 20,0 kbyte | [filförteckning] |