Tree Structure

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

An example of how the sodatest-junit artefact can be used to create a hierarchical structure of test sub-trees.

VFS is a virtual file system wich features mounting of other filesystems inside. This could be anything which is iterable in a tree-like structure.

This API allows to fill multi-children tree data structure based on a coherent input (text) or from relational database (unary relationship).

A tree data structure for Java

Simple implementation to store object in tree structure.

scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure for knowledge representation and reasoning. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, parser are available for: - THF (TH0/TH1): Monomorphic and polymorphic higher-order logic, - TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, including extended TFF (TFX), - FOF: Untyped first-order logic, - TCF: Typed clause-normal form, - CNF: (Untyped) clause-normal form, and - TPI: TPTP Process Instruction language. The parser was initially based on v7.4.0.3 of the TPTP syntax BNF (http://tptp.org/TPTP/SyntaxBNF.html), but is continuously updated to keep track of TPTP language updates.

Simple implementation to store object in tree structure.

Simple implementation to store object in tree structure.

Simple implementation to store object in tree structure.

Persistent data structures in the form of immutable copy-on-write lists, maps and sets for Java. Based on balanced trees.

Java Object Model API to handle Java Objects in a tree structure. Be able to transform a linear structure of objects with a tree behavior into a real tree structure and handle them as if it were nodes in a tree.

modelcheck is a Java library that allows you to check whether a given transition system (described as a Kripke structure) satisfies a given computation tree logic (CTL) formula.

Decision Trees and related structures

Library providing observables arranged in tree structure with propagating events

A Java implementation of an Interval tree structure with generic Number support

A Java implementations of different Tries (prefix trees). These are ordered tree data structures commonly used for efficient string searches.

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

Binary Search Tree Data Structure Implementation

Tree Data Structure Java Library

A Maven plugin that creates launchers for Windows (using Janel), Mac OS X (creating a .app structure, or tree with shell script) or Linux (using a shell script). (Apache License v2) 2008-2013 Matt Gumbley, DevZendo.org

HotSpot learns a set of rules (displayed in a tree-like structure) that maximize/minimize a target variable/value of interest. With a nominal target, one might want to look for segments of the data where there is a high probability of a minority value occuring (given the constraint of a minimum support). For a numeric target, one might be interested in finding segments where this is higher on average than in the whole data set. For example, in a health insurance scenario, find which health insurance groups are at the highest risk (have the highest claim ratio), or, which groups have the highest average insurance payout.

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

Knowledge Flow visualization component for displaying tree and graph structures from those schemes that can output them. This component is an alternative to the Knowledge Flow's built-in GraphViewer and uses the PrefuseTree and PrefuseGraph packages which, in turn, use the prefuse visualization library.

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 Maven plugin that creates launchers for Windows (using Janel), Mac OS X (creating a .app structure, or tree with shell script) or Linux (using a shell script). (Apache License v2) 2008-2024 Matt Gumbley, DevZendo.org Note that the Universal Application Stub and Janel have separate licenses as described in their included license files.

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

JSONXML project is library used to parse/format tree-like object structures in most popular text formats: XML and JSON. For parsing it accepts "java.io.Reader" and return java object. For formatting it accepts java object and "java.io.Writer". Object is generally structure that contains Map and/or List elements. Map is ordered set of named items. List is set of unnamed items. Reflection may be used to convert objects into set of maps/lists and vice versa. JSON parser is implemented explicitly. XML parser is based on SAX parser and applies only certain rules for result. Library is designed to allow various entry points for variable decisions depending on end use needs. 1. Formats - formats are used to enable locale-specific parsing/formatting of numbers and dates. 2. ReflectiveBuilder - enables reflection. Default implementation uses getters/setters only. 3. ObjectsRegistry - used to keep track of parsed or formatted objects and allow resolvable references in formatted (text) form.

Tree Data Structure Java Library

Basic tree data structure and algorithms for Java

This module provides two packages, 'trees' and 'forests', which provide algorithms to compute edit distances on trees and forests (that is, unordered or ordered lists of trees) respectively. The edit distance is computed according to the tree edit distance algorithm of Zhang and Shasha (1989). The basic tree data structure is defined by the Tree interface in the trees module. Please refer to the javadoc for more detailed information.

TreeEditor is a tree structure data editor.

A data structure mapping ranges to values based on a TreeMap

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

Developer-friendly serialisation of RDF into a structurally-stable JSON-LD representation.

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

Java library for iteration over tree structures

`jdbc-json-extension` is to fetch data from RDBMS in JSON format. The data is structured the in the same relation structure of the Tables relationships in the database. The fetch is pre-planned using a `FetchPlan` configuration. The execution is multithreaded tree pattern where it starts from the `root` table with supplied filter parameters. The subsequent nodes (tables) are fetched as the `One-to-*` relationship defined from the root tables.

A Transactional Key-Value store based on Log-Structured-Merge-Trees in Kotlin