Batch module loader, require() for directories
require tree list
inject a global variable into a module require() tree
get require tree for spm@3x
Walk a require tree for a cached module
walk your project's import/require tree and print all the relationships
kill trees of processes
Node.js bindings to the Tree-sitter parsing library
A per-spec XML serializer implementation
TypeScript and TSX grammars for tree-sitter
Get all children of a pid
Turn any collection of objects into its own efficient tree or linked list using Symbol
Lodash modular utilities.
Get the dependency tree of a module
Ace (Ajax.org Cloud9 Editor)
A fully persistent balanced binary search tree
Convert a directory tree to a JS object.
Tree-sitter bindings for the web
Finds all JavaScript CommmonJS require() dependencies from a filename.
OpenTelemetry instrumentation for `undici` http client and Node.js fetch()
returns a recap of the dependencies of a package.json file by executing npm audit / npm outdated / PackagePhobia / api.npmjs.org / analysing require tree / jsinspect
Structured logging via heimdalljs
1D interval tree data structure
OpenTelemetry Tracing
require all files in given relative path!
Require all files in a directory tree
FreeBSD ports commits history viewer that doesn't require neither local ports tree nor CVS checkouts.
Extracts skills, strains, profession, and requirement trees into JSON
The Simple Declarative Language provides an easy way to describe lists, maps, and trees of typed data in a compact, easy to read representation. For property files, configuration files, logs, and simple serialization requirements, SDL provides a compelling alternative to XML and Properties files.
map.rb is a string/symbol indifferent ordered hash that works in all rubies. out of the over 200 ruby gems i have written, this is the one i use every day, in all my projects. some may be accustomed to using ActiveSupport::HashWithIndiffentAccess and, although there are some similarities, map.rb is more complete, works without requiring a mountain of code, and has been in production usage for over 15 years. it has no dependencies, and suports a myriad of other, 'tree-ish' operators that will allow you to slice and dice data like a giraffee with a giant weed whacker.
A simple TreeView Rails 8+ gem based on Stimulus (no jQuery is required). A server side handling of the tree is included. The client side display of the usual legend can be adapted to the user's requirements to include links.
CAST parses C code into an abstract syntax tree (AST), lets you break it, then vomit it out as code. The parser does C99. This fork supports Ruby 1.9.3, gemspec, and requires Hoe. The Rubyforge page above is documentation for the original version, but most things should be the same.
Bdoc is a simple replacement for the gem or yard server. All it does is look at all of the Gems you have installed locally and creates a nice iframe based browser that makes it easy to navigate between gem docs. IT DOES NOT REQUIRE A SERVER FOR VIEWING... not like gem server does! If you use this, I highly suggest also using Hanna[http://github.com/mislav/hanna/tree/master] (a beautiful rdoc theme). Check out the demo http://manalang.github.com/bdoc/bdoc.html
VebTree is a production-quality Van Emde Boas tree implementation providing O(log log U) time complexity for insert, delete, search, successor, and predecessor operations on integer sets. The core algorithm is implemented in C++17 for maximum performance with an idiomatic Ruby API. Perfect for applications requiring fast integer set operations, range queries, and successor/predecessor lookups within a bounded universe.
ignis-collective brings NCCL-style collective communication to Ruby: ring/tree all-reduce, and P2P / IPC (VMM) / host-staged / TCP transports, on the Ignis foundation. EXPERIMENTAL — the transports require multiple GPUs / nodes and cannot be exercised on a single GPU, so this is shipped separately from the verified single-GPU stack.
EncodeM v3.0 brings complete M language (MUMPS) subscript encoding to Ruby, supporting numbers, strings, and composite keys with perfect sort order. Build hierarchical database keys like M("users", 42, "email") that sort correctly as raw bytes. This 40-year production-tested algorithm from YottaDB/GT.M powers Epic (70% of US hospitals) and VistA. Perfect for B-tree indexes, key-value stores, and any system requiring sortable hierarchical keys. All types maintain correct ordering when compared as byte strings - no decoding needed.
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.