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.

Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations. This is used as the core data structure underlying the diagrams framework, but potentially has other applications as well.

Technology for Resting Email Encrypted Storage (TREES) is a NaCL-based Dovecot encryption plugin. This plugin adds individually encrypted mail storage to the Dovecot IMAP server. It is inspired by Posteo's scrambler which uses OpenSSL and RSA key pairs. TREES works in a similar way, but uses the Sodium crypto library (based on NaCL).

How it works:

1. On IMAP log in, the user's cleartext password is passed to the plugin.

2. The plugin creates an argon2 digest from the password.

3. This password digest is used as a symmetric secret to decrypt a libsodium secretbox.

4. Inside the secretbox is stored a Curve25519 private key.

5. The Curve25519 private key is used to decrypt each individual message, using libsodium sealed boxes.

6. New mail is encrypted as it arrives using the Curve25519 public key.

The aim of the R package treebalance is to provide functions for the computation of a large variety of (im)balance indices for rooted trees. The package accompanies the book Tree balance indices: a comprehensive survey by M. Fischer, L. Herbst, S. Kersting, L. Kuehn and K. Wicke (2023) <ISBN: 978-3-031-39799-8>, <doi:10.1007/978-3-031-39800-1>, which gives a precise definition for the terms balance index and imbalance index (Chapter 4) and provides an overview of the terminology in this manual (Chapter 2). For further information on (im)balance indices, see also Fischer et al. (2021) <https://treebalance.wordpress.com>. Considering both established and new (im)balance indices, treebalance provides (among others) functions for calculating the following 18 established indices and index families: the average leaf depth, the B1 and B2 index, the Colijn-Plazzotta rank, the normal, corrected, quadratic and equal weights Colless index, the family of Colless-like indices, the family of I-based indices, the Rogers J index, the Furnas rank, the rooted quartet index, the s-shape statistic, the Sackin index, the symmetry nodes index, the total cophenetic index and the variance of leaf depths. Additionally, we include 9 tree shape statistics that satisfy the definition of an (im)balance index but have not been thoroughly analyzed in terms of tree balance in the literature yet. These are: the total internal path length, the total path length, the average vertex depth, the maximum width, the modified maximum difference in widths, the maximum depth, the maximum width over maximum depth, the stairs1 and the stairs2 index. As input, most functions of treebalance require a rooted (phylogenetic) tree in phylo format (as introduced in ape 1.9 in November 2006). phylo is used to store (phylogenetic) trees with no vertices of out-degree one. For further information on the format we kindly refer the reader to E. Paradis (2012) <http://ape-package.ird.fr/misc/FormatTreeR_24Oct2012.pdf>.

This package provides a Python implementation of a tree structure.

This package provides An SVG tree representation used by usvg.

This package provides an abstract Emacs Lisp framework for tree navigation.

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

This crate is a framework for writing D-Bus method handlers (legacy).

This distribution contains a suite of modules for representing, creating, and extracting information from HTML syntax trees.

Tree is a python library for working with nested data structures. In a way, tree generalizes the builtin map function which only supports flat sequences, and allows you to apply a function to each leaf preserving the overall structure.

This package provides bindings to an R grammar for Tree-sitter', to be used alongside the treesitter package. Tree-sitter builds concrete syntax trees for source files of any language, and can efficiently update those syntax trees as the source file is edited.

Treemacs is a file and project explorer similar to NeoTree or Vim's NerdTree, but largely inspired by the Project Explorer in Eclipse. It shows the file system outlines of your projects in a simple tree layout allowing quick navigation and exploration, while also possessing basic file management utilities.

Treemacs is a file and project explorer similar to NeoTree or Vim's NerdTree, but largely inspired by the Project Explorer in Eclipse. It shows the file system outlines of your projects in a simple tree layout allowing quick navigation and exploration, while also possessing basic file management utilities.

The German national forest inventory uses angle count sampling, a sampling method first published as `Bitterlich, W.: Die Winkelzählmessung. Allgemeine Forst- und Holzwirtschaftliche Zeitung, 58. Jahrg., Folge 11/12 vom Juni 1947` and extended by Grosenbaugh (<https://academic.oup.com/jof/article-abstract/50/1/32/4684174>) as probability proportional to size sampling. When plots are located near stand boundaries, their sizes and hence their probabilities need to be corrected.

Aimed at applying the Harvest classification tree algorithm, modified algorithm of classic classification tree.The harvested tree has advantage of deleting redundant rules in trees, leading to a simplify and more efficient tree model.It was firstly used in drug discovery field, but it also performs well in other kinds of data, especially when the region of a class is disconnected. This package also improves the basic harvest classification tree algorithm by extending the field of data of algorithm to both continuous and categorical variables. To learn more about the harvest classification tree algorithm, you can go to http://www.stat.ubc.ca/Research/TechReports/techreports/220.pdf for more information.

The main goal of the R package treeDbalance is to provide functions for the computation of several measurements of 3D node imbalance and their respective 3D tree imbalance indices, as well as to introduce the new phylo3D format for rooted 3D tree objects. Moreover, it encompasses an example dataset of 3D models of 63 beans in phylo3D format. Please note that this R package was developed alongside the project described in the manuscript Measuring 3D tree imbalance of plant models using graph-theoretical approaches by M. Fischer, S. Kersting, and L. Kühn (2023) <arXiv:2307.14537>, which provides precise mathematical definitions of the measurements. Furthermore, the package contains several helpful functions, for example, some auxiliary functions for computing the ancestors, descendants, and depths of the nodes, which ensures that the computations can be done in linear time. Most functions of treeDbalance require as input a rooted tree in the phylo3D format, an extended phylo format (as introduced in the R package ape 1.9 in November 2006). Such a phylo3D object must have at least two new attributes next to those required by the phylo format: node.coord', the coordinates of the nodes, as well as edge.weight', the literal weight or volume of the edges. Optional attributes are edge.diam', the diameter of the edges, and edge.length', the length of the edges. For visualization purposes one can also specify edge.type', which ranges from normal cylinder to bud to leaf, as well as edge.color to change the color of the edge depiction. This project was supported by the joint research project DIG-IT! funded by the European Social Fund (ESF), reference: ESF/14-BM-A55-0017/19, and the Ministry of Education, Science and Culture of Mecklenburg-Western Pomerania, Germany, as well as by the the project ArtIGROW, which is a part of the WIR!-Alliance ArtIFARM â Artificial Intelligence in Farming funded by the German Federal Ministry of Education and Research (FKZ: 03WIR4805).

This package provides an Emacs library to manage tree widgets.

This package provides macros to draw trees, within TeX or LaTeX.

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

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