RTree for leveldb
a level tree component based on vue
> An extremely customizable multi level accordion. It's receives a high level tree structure in json format.
mutiple level tree selector
To find multiple nodes(objects) from nth level tree
Tree indexer for leveldb
Angular 17 Multi level Tree Grid. Simple, Light Weight and dependency free. Basically it groups data by a field or multiple fields. For hierarchical data (where there is a Parent-Child relationship), check out this <a href="https://github.com/debabratapat
Mark top-level React method calls as pure for tree shaking
The same useRef, but with callback
A vue plugin show the level tree
A tool set for CSS: fast detailed parser (CSS → AST), walker (AST traversal), generator (AST → CSS) and lexer (validation and matching) based on specs and browser implementations
filter in array tree
In-memory abstract-level database for Node.js and browsers
Angular 7 Multi level Tree Grid. Simple, Light Weight and dependency free. Basically it groups data by a field or multiple fields..
Solidity compiler
hast utility to serialize to HTML
Allow parsing of top-level await in modules
PostCSS plugin to transform :not() W3C CSS level 4 pseudo class to :not() CSS level 3 selectors
Low level library facilitating protocol buffers based communication with Trezor devices
TypeScript definitions for console-log-level
Layout algorithms for visualizing hierarchical data.
TypeScript definitions for graceful-fs
hast utility to get the rank (or depth, level) of headings
Lower level utilities for compiling Vue single file components
A high-level Ruby wrapper for the Tree-sitter bindings
Abstract Ruby Syntax Tree (ARST) is a high-level language syntax denoting the object domain of a Ruby project.
A simple binary tree gem with level order, postorder tree traversal
Hierarchical logger for Ruby. The loggers are arranged in a tree. Output can be controlled using Levels, Appenders and Formatters.
Rodish parses an argv array using a routing tree approach. It is designed to make it easy to implement command line applications that support multiple levels of subcommands, with options at each level.
Parses gene ontology .obo files, links terms through `is_a` and provides methods to find levels and traverse the tree.
Mix and match HTML and Markdown syntax. Generate nested DOM trees from a single top level element. Extract content from custom elements.
A GeoTree is a variant of a k-d tree, and stores data points that have a latitude and longitude, a unique integer identifier, and an optional 'weight' (e.g., the size of a city). GeoTrees are disk-based data structures and can store a very large number of points efficiently. If desired, for smaller data sets, memory-only trees can be constructed instead. The gem includes MultiTree, a GeoTree variant that supports queries at multiple levels of detail. For example, when focusing on a small region it can return points that would be omitted when querying a much larger region.
Features Designed to work seamlessly with the nested set model (have a look at the toArray method) Items can be sorted in their own list, moved across the tree, or nested under other items. Sublists are created and deleted on the fly All jQuery Sortable options, events and methods are available It is possible to define elements that will not accept a new nested item/list and a maximum depth for nested items The root level can be protected
The `blockify` gem solves some of the problems associated with complex hierarchical nested arrays and hashes. It is possible to represent an HTML file as a series of Arrays and Hashes with very deep levels of Hashes within Arrays within Hashes. Traversing such a tree is tricky at best. The methods of the `blockify` gem are included in Array, and Hash using a naming convention that should not compete with anything. We don't need to concern ourselves with the complexity of the structure and can instead focus on the base elements wherever they may be.
This library performs diffs of CSV data, or any table-like source. Unlike a standard diff that compares line by line, and is sensitive to the ordering of records, CSV-Diff identifies common lines by key field(s), and then compares the contents of the fields in each line. Data may be supplied in the form of CSV files, or as an array of arrays. The diff process provides a fine level of control over what to diff, and can optionally ignore certain types of changes (e.g. changes in position). CSV-Diff is particularly well suited to data in parent-child format. Parent- child data does not lend itself well to standard text diffs, as small changes in the organisation of the tree at an upper level can lead to big movements in the position of descendant records. By instead matching records by key, CSV-Diff avoids this issue, while still being able to detect changes in sibling order. This gem implements the core diff algorithm, and handles the loading and diffing of CSV files (or Arrays of Arrays). It also supports converting data in XML format into tabular form, so that it can then be processed like any other CSV or table-like source. It returns a CSVDiff object containing the details of differences in object form. This is useful for projects that need diff capability, but want to handle the reporting or actioning of differences themselves. For a pre-built diff reporting capability, see the csv-diff-report gem, which provides a command-line tool for generating diff reports in HTML, Excel, or text formats.
Kaitai Struct is a declarative language used for describe various binary data structures, laid out in files or in memory: i.e. binary file formats, network stream packet formats, etc. The main idea is that a particular format is described in Kaitai Struct language (.ksy file) and then can be compiled with ksc into source files in one of the supported programming languages. These modules will include a generated code for a parser that can read described data structure from a file / stream and give access to it in a nice, easy-to-comprehend API. This package is a visualizer tool for .ksy files. Given a particular binary file and .ksy file(s) that describe its format, it can visualize internal data structures in a tree form and a multi-level highlight hex viewer.
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.