Tree is a recursive directory listing command that produces a depth indented listing of files, which is colorized ala dircolors if the LS_COLORS environment variable is set and output is to tty.

This package provides procedures to work with classification and regression trees.

The treecc program is designed to assist in the development of compilers and other language-based tools. It manages the generation of code to handle abstract syntax trees and operations upon the trees.

This package provides software for phylogenomic inference.

This application provides a way to unify the formatting process of the codebase. It is nice for large code trees where using multiple formatters are common. treefmt comes with the following features.

• Unified CLI and output.

• Runs formatters in parallel.

• Cache changed files for performance.

The application does have some design decisions to keep in mind.

• The source code is kept under version control, making it possible to revert and check changes.

• Only one formatter per file, making outputs idempotent.

This package implements binary trees of various kinds, presenting a uniform interface to them all.

This is an R package to make it easier to import and store phylogenetic trees with associated data; and to link external data from different sources to phylogeny. It also supports exporting phylogenetic trees with heterogeneous associated data to a single tree file and can be served as a platform for merging tree with associated data and converting file formats.

This package implements binary trees of various kinds, presenting a uniform interface to them all.

A treemap is a space-filling visualization of hierarchical structures. This package offers great flexibility to draw treemaps.

This package implements binary trees of various kinds, presenting a uniform interface to them all.

This package provides tools to create a measure of inter-point dissimilarity useful for clustering mixed data, and, optionally, perform the clustering.

Create tree structures from hierarchical data, and traverse the tree in various orders. Aggregate, cumulate, print, plot, convert to and from data.frame and more. This is useful for decision trees, machine learning, finance, conversion from and to JSON, and many other applications.

Tree-sitter is a parser generator tool and an incremental parsing library. It can build a concrete syntax tree for a source file and efficiently update the syntax tree as the source file is edited.

Tree-sitter aims to be:

• General enough to parse any programming language

• Fast enough to parse on every keystroke in a text editor

• Robust enough to provide useful results even in the presence of syntax errors

• Dependency-free so that the runtime library (which is written in pure C) can be embedded in any application

This package includes the libtree-sitter runtime library.

Generic tools for recursive and iterative tree traversal based on clojure.walk and clojure.zip respectively.

This package provides a Ruby-based Parsing Expression Grammar (PEG) parser generator Domain Specific Language (DSL).

Find the difference between arbitrary data structures

Ego Tree provides a vec-backed ID-tree.

This package provides a library for visualizing tree structured data.

This package provides a R grammar for the Tree-sitter library.

This package provides a C grammar for the Tree-sitter library.

This Haskell library provides a function for computing the difference between (expression) trees. It also provides a way to compute the difference between arbitrary abstract datatypes (ADTs) using Generics-derivable helpers.

ASM is an all purpose Java bytecode manipulation and analysis framework. It can be used to modify existing classes or dynamically generate classes, directly in binary form. The provided common transformations and analysis algorithms allow easily assembling custom complex transformations and code analysis tools.

ASM is an all purpose Java bytecode manipulation and analysis framework. It can be used to modify existing classes or dynamically generate classes, directly in binary form. The provided common transformations and analysis algorithms allow easily assembling custom complex transformations and code analysis tools.

This package provides an implementation of AA trees, a self-balancing binary tree data structure, for Guile. It ensure O(log n) worst case performance for core operations. The module provides non-mutating insert, delete, and search operations, with support for convenient nested tree operations.