BETA: Ultimate solution for JavaScript Trees.
Out-tree-type structure types
Interval tree data structure implementation.
Create tree type in Highcharts
simple tree type --ts
Turn any collection of objects into its own efficient tree or linked list using Symbol
Unique tag for use in the type-fest Tagged type
TypeScript definitions for @babel/generator
TypeScript definitions for @babel/traverse
TypeScript definitions for unist
TypeScript definitions for hast
TypeScript definitions for mdast
React tree to create tree-type structures like rubricator, navigation and etc.
TypeScript definitions for @babel/template
TypeScript definitions for estree
TypeScript definitions for range-parser
TypeScript definitions for @babel/core
TypeScript definitions for istanbul-lib-coverage
kill trees of processes
A fully persistent balanced binary search tree
TypeScript definitions for json-schema
Get all children of a pid
TypeScript definitions for retry
TypeScript definitions for d3-timer
Rust macros for creating type-safe filesystem tree structures
This package implements a basic version of the PQ-Grams tree-edit-distance approximation algorithm, as generically as possible. It defines traits that you can define for your label-types and tree-types, to use custom types with the algorithm. It also defines a basic generic Tree type for string or integer leaf types that is easy to build with, and compatible with the algorithm.
Procedural macros for tree-type crate
trunk-based development manager
A Ruby GEDCOM text file parser and producer, that produces a tree of objects from each of the GEDCOM file types and subtypes. Understands the full GEDCOM 5.5 grammar, and will handle unknown tags hierarchies as a Note class.
JSON parser that understands cross-references and casts to typed Ruby objects. Implements JSONQuery against JSON trees and Ruby object graphs.
Wood is a library for creating, manipulating and rewriting trees, in particular Abstract Syntax Trees (ASTs). It provides an easy to use DSL for searching and rewriting whole sub-trees in place, which can be used for things like translating a parse tree into a target language tree, doing type analysis, writing compiler optimization passes and more.
Generate all parts of a compiler, including the lexer, parser, syntax tree, symbol table, type checker, code generator, and optimizer.
Trie-like, prefix-tree data structures. First, a prefix-tree based on Arrays, which differs from a traditional trie, which maps strings to values. Second, a more general prefix-tree data structure that works for any type of keys, provided those keys can be transformed to and from an array. Both of these data structures are implemented in terms of hashes.
Yadriggy builds the abstract syntax tree (AST) of a method, checks its syntax and types, and runs it. When checking the syntax and types, it is treated as the code written in a domain specific language (DSL). It also provide simple DSLs for computation offloading from Ruby to C, Python, etc.
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.
A modular scale is a list of values that share the same relationship. These values are often used to size type and create a sense of harmony in a design. Proportions within modular scales are all around us from the spacing of the joints on our fingers to branches on trees. These natural proportions have been used since the time of the ancient Greeks in architecture and design and can be a tremendously helpful tool to leverage for web designers.
Create simple estree-type abstract syntax trees (ASTs) from Ruby. You could use it in the code generation part of a Ruby-based transpiler, if you're so inclined.
Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.
treestore stores two different types of data: 1) values, which are stored according to their SHA-1 hashcode 2) trees, which are sets of values and/or other trees, stored via a SHA-1 hashcode In addition, there are references that allow you to 'bookmark' a SHA-1 hashcode for easier lookup. If you think of the core git, but on any key-value backend store (like the included Redis one), you've got the right idea.
Scryglass is a ruby console tool for visualizing and actively exploring objects (large, nested, interrelated, or unfamiliar). You can navigate nested arrays, hashes, instance variables, ActiveRecord relations, and unknown Enumerable types like an expandable/collapsable file tree in an intuitive UI. Objects and child objects can also be inspected through a variety of display lenses, returned directly to the console, and more!
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.