Approximation of GNU find as an asynchronous iterator.
Walk a directory tree in node.js. Use just the name to find the folder(s) you want, rather than through given path(s).
A Node Module for finding files by attributes. Originally developed to find files modified since a particular date.
Require nodejs modules by having node find them for you
unist utility to find a node after another node
find process info by port/pid/name etc.
Return an array of all parent node_modules directories
Crazy fast http radix based router
Standalone CSS Selector Finder and Parser.
Determines if an object can be used as an array
Detect Node.JS (as opposite to browser environment). ESM modification
A base TSConfig for working with Node 10.
unist utility to find nodes after another node
Load node modules according to tsconfig paths, in run-time or via API.
GitHub API token authentication for browsers and Node.js
Algorithm for finding the root of a yarn workspace, extracted from yarnpkg.com
A base TSConfig for working with Node 14.
A base TSConfig for working with Node 16.
A base TSConfig for working with Node 12.
A replacement for process.exit that ensures stdio are fully drained before exiting.
Recursively search files in multiple dirs filtered by RegExp, file mask or custom filter function
Core libraries that every NodeJS toolchain project should use
Find JAVA_HOME on any system
ECMAScript JS AST traversal functions
DeepTree simplifies fetching deeply nested nodes in Ruby hashes.
tool to find the heavy DOM nodes
Additional finders for capybara that for some reason cannot use only xpath for finding nodes but needs to execute js for some calculations. \ Ex: I you want to find a table cell that is under or next to other cell the easiest way to do it is to check their position on page and compare them. This way you do not need to wory about calculating the effects of using colspan and rowspan attributes. The downside is that you need to use capybara driver that runs a browser like selenium.
A generic tree data structure supporting depth-first and breadth-first traversal, node search, path finding, and hash serialization. Each node tracks its parent, children, depth, height, and size.
You'll be able to find all the existing exit nodes, retrieving the nodes from https://check.torproject.org/exit-addresses.
Application for running stuff with same purpose on several nodes It find "best matching job" (based on setup time) for particular node and setup node Then it run job on this node Originally it was desined for CI.
Finds the shortest paths between all pairs of nodes of a graph
The core module to process the map data. It provides the the interface to find the shortest route in terms of stoppage between two nodes.
Nmunch is a passive network discovery tool that finds live network nodes by analyzing ARP and broadcast packets.
Machete is a simple tool for matching Rubinius AST nodes against patterns. You can use it if you are writing any kind of tool that processes Ruby code and needs to do some work on specific types of nodes, needs to find patterns in the code, etc.
Finds the public IP of a random node on a CodeOS cluster running in AWS, and sets the FLEETCTL_TUNNEL variable to allow dev-ops engineers a simple workflow of controlling CoreOS cluster without delving into the AWS console each time
Easy to use DSL that helps scraping data from websites. Thanks to it, writing web crawlers would be very fast and intuitive. Traversing through html nodes and fetching all of the HTML attributes, would be possible. Just like in jQuery - you will find methods like parent, children, first, find, siblings etc. Furthermore, you are able to download images, web pages, and store all content in the database. Please visit my Github account for more details.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.