creates an object listing all elements in a document with NAME or ID attributes
ES2015 module for type checking DOM NodeLists
A doubly (bidirectional) linked list. Acts as a safe, value focused wrapper for a linked-node-list.
An unprotected bi-directional linked list. Useful for implementing other collections.
An alternative to NodeList which keeps collections up to date when changes to the DOM occur
Helper functions for arrays on NodeJS
A very fast HTML parser, generating a simplified DOM, with basic element query support.
Match human-quality input to potential matches by edit distance.
Cross platform child_process#spawn and child_process#spawnSync
This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.
Parse CSS media query lists.
React Virtual List Component
Get running processes
Base class for node which OpenTelemetry instrumentation modules extend
PostgreSQL client - pure javascript & libpq with the same API
Runtime agnostic JS utils
Node.js native addon build tool
AWS credential provider that sources credentials from a Node.JS environment.
TypeScript definitions for webpack-sources
A small tool for counting SLOC.
A very fast HTML parser, generating a simplified DOM, with basic element query support.
Check license info for a package
Module to help building SARIF log files
Convert node list to non-cyclic node list.
A linked node list implementation.
NodeExtension gem for ScratchPad
Knife plugin for listing nodes that have not checked in
Gem and cli for get tor exit nodes IP list with geoip enrichment.
gets list of nodes and pings from each to each storing results
Lists possible node matches based on operation
Redis-migrator takes a list of nodes for your old cluster and list of nodes for your new cluster and determines for which keys routes were changed. Then it moves those keys to new nodes.
appending elements to a linked list generates successive list nodes
given snmp community and one node crawls through the network to produce list/dot file
Native implementation of Dijkstra algorithm for finding the shortest path between two vertices in a large, sparse graphs. Underlying algorithm is implemented in C using a priority queue. Edges are represented using linked lists rather than an adjacency matrix to reduce memory footprint when operating on very large graphs where the average number of edges between nodes is relatively small (e.g. < 1/10 the number of nodes). See https://en.wikipedia.org/wiki/Dijkstra's_algorithm for additional information.
Diggr is a ruby wrapper for the Digg API. Diggr strives to remain consistent with the Digg API endpoints listed here: http://apidoc.digg.com/CompleteList. Endpoints are created in Diggr with method calls. Each node in an endpoint becomes a method call and each node which is an argument becomes an argument to the previous method. As an example, the following endpoint /user/{user name} in which the user name is "johndoe" would be created with this Diggr call: diggr.user("johndoe") To send the request to the Digg API and retrieve the results of the call, Diggr requests are terminated in one of two ways. 1. Using the fetch method. By ending your request with the fetch method, your result will be returned to you. If the request is singular, you will receive a single object as a response. If the request is plural, you will receive a collection of objects stored in an array. 2. Using any Enumerable method. In this case, it is unnecessary to use the fetch method. See the synopsis for examples of each of these types of calls. Options such as count or offset can be set using the options method and providing a hash of arguments. See synopsis for more information. Note: In an effort to remain consistent with the Digg API, some method names do not follow the ruby idiom of underscores. Although somewhat ugly, this allows a user to read the Digg API and understand the exact methods to call in Diggr to achieve their desired results.
Diggr is a ruby wrapper for the Digg API. Diggr strives to remain consistent with the Digg API endpoints listed here: http://apidoc.digg.com/CompleteList. Endpoints are created in Diggr with method calls. Each node in an endpoint becomes a method call and each node which is an argument becomes an argument to the previous method. As an example, the following endpoint /user/{user name} in which the user name is "johndoe" would be created with this Diggr call: diggr.user("johndoe") To send the request to the Digg API and retrieve the results of the call, Diggr requests are terminated in one of two ways. 1. Using the fetch method. By ending your request with the fetch method, your result will be returned to you. If the request is singular, you will receive a single object as a response. If the request is plural, you will receive a collection of objects stored in an array. 2. Using any Enumerable method. This works only on plural requests. In this case, it is unnecessary to use the fetch method. See the synopsis for examples of each of these types of calls. Options such as count or offset can be set using the options method and providing a hash of arguments. See synopsis for more information. Note: In an effort to remain consistent with the Digg API, some method names do not follow the ruby idiom of underscores. Although somewhat ugly, this allows a user to read the Digg API and understand the exact methods to call in Diggr to achieve their desired results.
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.
No description provided.
No description provided.
No description provided.