[ 原始碼： node-deep-for-each ]
套件： node-deep-for-each (1.0.6+dfsg-2)
node-deep-for-each 的相關超連結
Trisquel 的資源：
下載原始碼套件 node-deep-for-each：
- [node-deep-for-each_1.0.6+dfsg-2.dsc]
- [node-deep-for-each_1.0.6+dfsg.orig.tar.xz]
- [node-deep-for-each_1.0.6+dfsg-2.debian.tar.xz]
維護者：
Original Maintainers:
- Debian Javascript Maintainers (郵件存檔)
- Pirate Praveen
外部的資源：
- 主頁 [github.com]
相似套件：
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.
其他與 node-deep-for-each 有關的套件
|
|
|
-
- dep: node-is-plain-object
- Returns true if object was created by `Object` constructor
-
- dep: nodejs
- evented I/O for V8 javascript - runtime executable
同時作為一個虛擬套件由這些套件提供： node-pegjs