Tree Structure

core tree menu structure

The Statistics project contains a CRXModule, which writes arbitrary statistical information into a tree structure.

MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported.

A bottom-up rewrite machine is a compiler construction tool that is often used in the compiler's back end to convert a tree-structured representation of a program into machine code -- or, in Java's case, bytecode. JBurg can also be used as a general-purpose dynamic programming engine. JBurg is descended from iburg-class BURGs, described in Fraser, Hanson, and Proebsting's paper, "Engineering a Simple, Efficient Code Generator Generator." JBurg brings similar O(N) minimum-cost tree rewriting capabilities to Java, and also allows the programmer to specify transitions between non-terminal states, that are significantly more powerful than iburg's transitive closures: JBurg transformation rules allow the transformation to inject additional program logic, which makes a JBurg specification more like a grammar than like a list of pattern-matching rules.

Immutable, structure sharing collections, including hash array mapped tries, finger tries, B-trees, and S-trees (sequence trees)

core tree menu structure

Example code for creating JTables with an embedded tree structure in Swing.

core tree menu structure

A visualization component for displaying tree structures from those schemes that can output graphs (e.g. bayes nets). This component is available from the popup menu in the Explorer's classify. The component uses the prefuse visualization library.

A visualization component for displaying tree structures from those schemes that can output trees (e.g. decision tree learners, Cobweb clusterer etc.). This component is available from the popup menu in the Explorer's classify and cluster panels. The component uses the prefuse visualization library.

Log-structured merge-tree table with fields representing aggregate functions, designed for OLAP workload.

Tree Data Structure Java Library

Lock-free document store—optimized for high rate atomic state changes—that concurrently commits and compacts on-disk log-structured storage files without blocking parallel in-memory updates to associative B-tree maps, spatial Q-tree maps, sequential S-tree lists, and singleton U-tree values

Data Structure for CoNLL-X Dependency Tree

core tree menu structure

Provides an api for operating with tree structures

ELKI is an open source (AGPLv3) data mining software written in Java. The focus of ELKI is research in algorithms, with an emphasis on unsupervised methods in cluster analysis and outlier detection. In order to achieve high performance and scalability, ELKI offers many data index structures such as the R*-tree that can provide major performance gains. ELKI is designed to be easy to extend for researchers and students in this domain, and welcomes contributions in particular of new methods. ELKI aims at providing a large collection of highly parameterizable algorithms, in order to allow easy and fair evaluation and benchmarking of algorithms.

Log-structured merge-tree table with fields representing aggregate functions, designed for OLAP workload.

ELKI is an open source (AGPLv3) data mining software written in Java. The focus of ELKI is research in algorithms, with an emphasis on unsupervised methods in cluster analysis and outlier detection. In order to achieve high performance and scalability, ELKI offers many data index structures such as the R*-tree that can provide major performance gains. ELKI is designed to be easy to extend for researchers and students in this domain, and welcomes contributions in particular of new methods. ELKI aims at providing a large collection of highly parameterizable algorithms, in order to allow easy and fair evaluation and benchmarking of algorithms.

Java 1.8+ Library with tree structures

Sirix is a temporal storage system effectively and efficiently storing snapshots of time varying (currently semi-structured) data taking full advantage of flash based drives as for instance SSDs. We not only provide several ways of navigating the tree-structure of a single revision, we also support navigation in time. Furthermore we provide a novel storage technique called sliding snapshot to circumvent intermitant full dump snapshots to fast track their in-memory reconstruction and thus we avoiding write peaks and having to read long chains of page fragments/increments/deltas. Sirix uses copy-on-write (COW) as well as an append-only storage making it an ideal candidate for flash based drives while not dropping support for erstwhile disks.

Java 1.8+ Library with tree structures

core tree menu structure

Multidimensional OLAP database with predefined set of dimensions, measures, and log-structured merge-tree tables containing pre-aggregated data.

JFace is a UI toolkit with classes for handling many common UI programming tasks. JFace is window-system-independent in both its API and implementation, and is designed to work with SWT without hiding it. JFace includes the usual UI toolkit components of image and font registries, text, dialog, preference and wizard frameworks, and progress reporting for long running operations. Two of its more interesting features are actions and viewers. The action mechanism allows user commands to be defined independently from their exact whereabouts in the UI. Viewers are model based adapters for certain SWT widgets, simplifying the presentation of application data structured as lists, tables or trees.

Multidimensional OLAP database with predefined set of dimensions, measures, and log-structured merge-tree tables containing pre-aggregated data.

Simple Java library for visualizing tree structures in the command line

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

Collection of handy data structures and algos for C#/Java specially designed for GC-free programming. ObjectPools, MutableBlobs, MutableStrings, BinaryHeaps, Linked Lists, Trees, fast memory copy, fast hash calculators and others..

Tree-structured ListAadapter for Android

A testing DSL to specify the structure of a tree in a concise and readable way.

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures

A kotlin multiplatform experiment for representing app navigation with tree like data structures