Download JAR files tagged by than with all dependencies

How many classes does it take to make a cache? 60? 80? You might think so if you look at the other caches on the market. Ashkay is a streamlined, simple cache that in many ways is more powerful than the other mainstream caches. Ashkay is a strategy based caching tool. In most cases, you might be using a configuration file to tell the cache what rules it should obey. Or, you might just be setting properties on the cache. I have never liked this model as it limits me, the user of the cache to strategies the developer decided were important. Instead, Ashkay lets you choose the strategy(ies) to use when caching certain objects. Of course, a few of the most handy strategies are pre-packaged, but implementing a new one is a simple as can be. Ashkay is a fork of <a href="http://xot.sf.net">xot</a> caching code. Made more sense on its own.

Advanced Library to Remove Object Relational Impedance. DBvolution translates all database concepts into Object Oriented concepts, allowing you to spend all your time writing Java rather than fixing broken and awkward SQL. DBvolution transforms your schema into classes, reduces the database configuration to sparse annotations on the classes, and allows querying directly from the classes. Queries are created inside your java code and takes as little as one line for a multi-table outer join. Retrieving the rows from the query is only one more method call. Dozens of SQL functions are available without leaving your Java code and use chaining to build complex expressions easily. Transactions are encapsulated into a thread-like API, allowing you to write complex database interactions in complete safety. The queries performed by DBvolution are always available for debugging and checking by DBAs before release. There are examples in nz.co.gregs.dbvolution.examples, and documentation at http://dbvolution.gregs.co.nz.

R can use RJava or jsr223 to communicate with java. R also has a class system called R6. If you want to use a java library with native rJava or jsr223 in R there is potentially a lot of glue code needed, and R library specific packaging configuration required. However if you don't mind writing an R-centric API in Java you can generate all of this glue code using a few java annotations and the normal javadoc annotations. This plugin aims to provide an annotation processor that writes that glue code and creates a fairly transparent connection between Java code and R code, with a minimum of hard work. The focus of this is streamlining the creation of R libraries by Java developers, rather than allowing access to arbitrary Java code from R. The ultimate aim of this plugin to allow java developers to provide simple APIs for their libraries, package their library using Maven, push it to github and for that to become seamlessly available as an R library, with a minimal amount of fuss. A focus is on trying to produce CI ready libraries tested with Github workflows and ready for CRAN submission.

MyDtt-Plus is a starter of spring-boot, It is an object-oriented Java framework that helps developers increase productivity, "Domain Driven Table" is the concept of DTT, It makes you focus more on domain objects rather than tables. Aims to make it easy to automatically create DB tables based on your Java model with annotation driven. It's also support the ability of create table automatically for MyBatis what Hibernate can do and optionally export SQL to local file，Each table can be added database name concat with table name and fully comments, It can work with ORM frameworks such as MyBatis-Plus and MyBatis with little learning and usage costs. It's worth mentioning that DTT can be MyBatis-Plus is integrated in a 0-code way, just like JPA. However, MyDtt-Plus and MyBatis-Plus may be easier to expand and use than JPA. In addition to supporting the functions of JPA, DDT provides multi-table associated SQL DDL based on MyBatis operation, DTT support databases server for MYSQL, ORACLE, DB2, SQLSERVER, MARIADB, POSTGRESQL and embedded database for H2, HSQL, DERBY.

A NSGA-II implementation using Java. This implementation of NSGA-II algorithm is in pure reference to the original published paper. This is not an effort to convert the originally implemented C code in Java. The original C code by the authors has not be referred to while writing this implementation. This is a fully customizable implementation of the NSGA-II algorithm, made as generic as possible. This documentation assumes you have basic understanding of the NSGA-II algorithm. Apart from the core concepts of the algorithm, everything else in this package can be implemented as per the user's choice and plugged into the algorithm dynamically. Since NSGA-II is more like a set of protocols to follow as an algorithm rather than a concrete implementation of every aspect, this package has been re-written from scratch keeping complete customizability in mind. Apart from the core concepts of the algorithm, everything is considered to be a plugin external to the algorithm that can be implemented by the user and dynamically plugged into the algorithm during runtime as needed. This opens up the possibility of the package to be used simply as a PoC or be converted into something much more complex according to the users needs.

HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more. This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers. The version number of this package is a composite of the HermiT version and a value representing the OWLAPI release it is compatible with. Note that the group id for the upstream HermiT is com.hermit-reasoner, while this fork is released under net.sourceforge.owlapi. This fork exists to allow HermiT users to use newer OWLAPI versions than the ones supported by the original HermiT codebase. This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.

Advanced Library to Remove Object Relational Impedance. DBvolution translates all database concepts into Object Oriented concepts, allowing you to spend all your time writing Java rather than fixing broken and awkward SQL. DBvolution transforms your schema into classes, reduces the database configuration to sparse annotations on the classes, and allows querying directly from the classes. Queries are created inside your java code and takes as little as one line for a multi-table outer join. Retrieving the rows from the query is only one more method call. Dozens of SQL functions are available without leaving your Java code and use chaining to build complex expressions easily. Transactions are encapsulated into a thread-like API, allowing you to write complex database interactions in complete safety. The queries performed by DBvolution are always available for debugging and checking by DBAs before release. There are examples in nz.co.gregs.dbvolution.examples, and documentation at http://dbvolution.gregs.co.nz.

Advanced Library to Remove Object Relational Impedance

Janet Sudoku is a powerful Sudoku Generator and Sudoku Solver library for Java (since jdk 1.5) Android .NET (since 2.0) MONO CLS compliant. Additionally library delivers Janet Sudoku Demo App implementation in a simple form of command line tool, yet highly functional. 1. Sudoku Generator - generate Sudoku puzzles using variety of different methods. 2. Sudoku Solver - Solve any Sudoku puzzle, get the path leading to the correct solution. Check whether unique solution exists. Find all solutions if more than one present. Analyse many built-in examples of Sudoku puzzles or load any other. 3. Manipulate the board by applying transformations not affecting solution existence (i.e. rotation, reflection, permutation, swapping segments, and others). Interact with the library via consisted and well documented API. 4. Janet Sudoku Demo App - use simple, yet highly functional, command line tool to generate, solve evaluate different puzzles.

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.