Gherkin utils for doing things such as walking a Gherkin tree or pretty printing Gherkin files.
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
TSL2 Framework Specification (Pools of descripted and runnable Actions and Rules, Generic Tree)
An ensemble learning method inspired by bagging and random sub-spaces. Trains an ensemble of decision trees on random subspaces of the data, where each subspace has been transformed using principal components analysis.
Immutable, structure sharing collections, including hash array mapped tries, finger tries, B-trees, and S-trees (sequence trees)
Scala implementation of - parser - abstract syntax tree (AST) - semantic analysis - typing - scoping for openCypher queries, resulting in a normalised AST representation of the query string. See https://www.opencypher.org for more information on the openCypher project and query language.
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
core tree menu structure
API for trees library.
WebJar for regexp-tree
A flexible configuration tree abstraction. Supports multiple configuration sources.
The Java Query library enables language-level code expressions to be represented as objects in the form of expression trees at runtime, for example, a method call or a binary operation such as x < y. This enables dynamic analysis of lambda's code, usually for building fluent interfaces.
Abstract Syntax Tree and semantic analysis for the Cypher query language
Serpent serializes an object tree into a Python ast.literal_eval() compatible literal expression. It is safe to send serpent data to other machines over the network for instance (because only 'safe' literals are encoded). There is also a deserializer or parse provided that turns such a literal expression back into the appropriate Java object tree. It is an alternative to JSON to provide easy data integration between Java and Python. Serpent is more expressive as JSON (it supports more data types).
Data- and utility classes for Prefix-Tree-Acceptors
The Enunciate top is simply a top-level project descriptor that creates a dependency tree to a default set of Enunciate modules.
Tree rewriting support, and AST rewriters for the Cypher query language
Abstract Syntax Tree and semantic analysis for the Cypher query language
The Deephaven Query Syntax Tree POJOs
ELKI - R-Tree Variants – Open-Source Data-Mining Framework with Index Acceleration
ELKI - M-Tree Variants – Open-Source Data-Mining Framework with Index Acceleration
WebJar for ng-js-tree
Plumtree - Push-Lazy-pUsh Multicast TREE, an implementation of Epidemic Broadcast Tree
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Scalameta abstract syntax trees
Scalameta abstract syntax trees
Scalameta abstract syntax trees
brushfire-tree
WebJar for broccoli-merge-trees
Tree Data Structure Java Library
PMD is an extensible multilanguage static code analyzer. It finds common programming flaws like unused variables, empty catch blocks, unnecessary object creation, and so forth. It's mainly concerned with Java and Apex, but supports 16 other languages. It comes with 400+ built-in rules. It can be extended with custom rules. It uses JavaCC and Antlr to parse source files into abstract syntax trees (AST) and runs rules against them to find violations. Rules can be written in Java or using a XPath query. Currently, PMD supports Java, JavaScript, Salesforce.com Apex and Visualforce, Kotlin, Swift, Modelica, PLSQL, Apache Velocity, JSP, WSDL, Maven POM, HTML, XML and XSL. Scala is supported, but there are currently no Scala rules available. Additionally, it includes CPD, the copy-paste-detector. CPD finds duplicated code in Coco, C/C++, C#, Dart, Fortran, Gherkin, Go, Groovy, HTML, Java, JavaScript, JSP, Julia, Kotlin, Lua, Matlab, Modelica, Objective-C, Perl, PHP, PLSQL, Python, Ruby, Salesforce.com Apex and Visualforce, Scala, Swift, T-SQL, Typescript, Apache Velocity, WSDL, XML and XSL.
PMD is an extensible multilanguage static code analyzer. It finds common programming flaws like unused variables, empty catch blocks, unnecessary object creation, and so forth. It's mainly concerned with Java and Apex, but supports 16 other languages. It comes with 400+ built-in rules. It can be extended with custom rules. It uses JavaCC and Antlr to parse source files into abstract syntax trees (AST) and runs rules against them to find violations. Rules can be written in Java or using a XPath query. Currently, PMD supports Java, JavaScript, Salesforce.com Apex and Visualforce, Kotlin, Swift, Modelica, PLSQL, Apache Velocity, JSP, WSDL, Maven POM, HTML, XML and XSL. Scala is supported, but there are currently no Scala rules available. Additionally, it includes CPD, the copy-paste-detector. CPD finds duplicated code in Coco, C/C++, C#, Dart, Fortran, Gherkin, Go, Groovy, HTML, Java, JavaScript, JSP, Julia, Kotlin, Lua, Matlab, Modelica, Objective-C, Perl, PHP, PLSQL, Python, Ruby, Salesforce.com Apex and Visualforce, Scala, Swift, T-SQL, Typescript, Apache Velocity, WSDL, XML and XSL.
PMD is an extensible multilanguage static code analyzer. It finds common programming flaws like unused variables, empty catch blocks, unnecessary object creation, and so forth. It's mainly concerned with Java and Apex, but supports 16 other languages. It comes with 400+ built-in rules. It can be extended with custom rules. It uses JavaCC and Antlr to parse source files into abstract syntax trees (AST) and runs rules against them to find violations. Rules can be written in Java or using a XPath query. Currently, PMD supports Java, JavaScript, Salesforce.com Apex and Visualforce, Kotlin, Swift, Modelica, PLSQL, Apache Velocity, JSP, WSDL, Maven POM, HTML, XML and XSL. Scala is supported, but there are currently no Scala rules available. Additionally, it includes CPD, the copy-paste-detector. CPD finds duplicated code in Coco, C/C++, C#, Dart, Fortran, Gherkin, Go, Groovy, HTML, Java, JavaScript, JSP, Julia, Kotlin, Lua, Matlab, Modelica, Objective-C, Perl, PHP, PLSQL, Python, Ruby, Salesforce.com Apex and Visualforce, Scala, Swift, T-SQL, Typescript, Apache Velocity, WSDL, XML and XSL.
PMD is a source code analyzer. It finds common programming flaws like unused variables, empty catch blocks, unnecessary object creation, and so forth. It supports many languages. It can be extended with custom rules. It uses JavaCC and Antlr to parse source files into abstract syntax trees (AST) and runs rules against them to find violations. Rules can be written in Java or using a XPath query. It supports Java, JavaScript, Salesforce.com Apex and Visualforce, Modelica, PLSQL, Apache Velocity, HTML, XML and XSL. Scala is supported, but there are currently no Scala rules available. Additionally, it includes CPD, the copy-paste-detector. CPD finds duplicated code in C/C++, C#, Dart, Fortran, Gherkin, Go, Groovy, HTML, Java, JavaScript, JSP, Kotlin, Lua, Matlab, Modelica, Objective-C, Perl, PHP, PLSQL, Python, Ruby, Salesforce.com Apex and Visualforce, Scala, Swift, T-SQL and XML.
Multiplatform tree management
Multiplatform tree management
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
Tree composition support for code generated by the Compose compiler plugin and corresponding public API
A collection of multi-instance learning classifiers. Includes the Citation KNN method, several variants of the diverse density method, support vector machines for multi-instance learning, simple wrappers for applying standard propositional learners to multi-instance data, decision tree and rule learners, and some other methods.
Scala.meta's tree query language (basic and extended APIs)
Scalameta abstract syntax trees