Open Source Windows Algorithms - Page 24

The JAccumulator package brings the convenient type conversion and ad hoc composition capabilities of Javascript to Java programming structures. JAccumulator is dependent upon the Jupperware (http://jupperware.sf.net) to provide Javascript-like associative list capabilities and the convenience of easy hierarchical construction.

A library to build and manipulate finite state automata, I/O automata, transducers and rational langagues in Java.

The Java Boolean Expression Library (JBEL) enhances the Java Collections API by implementing on-the-fly sorting, filtering and reasoning capabilities including, select(), collect(), reject(), detect(), doForEach() using functional programming techniques.

Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.

A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial]

JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.

Fastest string utility is java library (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.

JGAL is a Java Genetic Algorithms Library.

Java KellyCriterion Calculator

A 100% Pure Java(tm) Polygon Triangulation Library

A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.

JaQLib is a compact Java library that supports programmers in querying all sorts of collections, DBs and XML files in a compact and intuitive manner. Example: List<MyItem> result = Jaqlib.List.selectFrom(myCollection) .where(myCondition).asList()

Very lightweight and easy to use library that allows you to generate truly random numbers by means of Random.Org service. Library offers optimized algorithms for obtaining single random number or more random numbers at once, sequences of numbers, random strings etc. Also allows you to check quota. It provides algorithm to generate unspecified number of random numbers of certain total value. This algorithm still keeps server load low by sending as large requests as possible, yet all integers are truly random. ******************************************* Current version 1.5 is considered as STABLE version. All methods and whole class are documented via Javadoc. Credit goes to http://www.random.org

This program benchmarks the following sorting algorithms implemented in Java: Quick Sort, Heap Sort, Merge Sort, Selection Sort, and Bubble Sort. A command line GUI was created to facilitate all your benchmark needs.

Java implementation of the most commonly used algorithms for exact string matching, where the pattern is given first.

A Thread and Task Manager. Execute Tasks in a Thread Pool.

Sorting algorithm performance testing using a generic test interface

JavaFrameApplet is a generic base in Java for Applet in JFrame games!

JavaGO is an Open Source Java library for the Game of GO (weiqi, baduk) analysis. Implements: base game classes, montecarlo simulations, SGF reader/writer, game variants, GTP, etc. Elegant interfaces/class design. Speed efficient w/small footprint. TDD.

A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage.

A graph library, developed in Java.

JavaStates is a Java library designed to statically describe and animate the states of Java objects, while ensuring that the integrity of states is retained at all times. JavaStates brings OO Programming style to interface spec, design and coding.

This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. The library exposes API functions for computing cells, retrieving neighbors, and drawing results into canvas or SVG. Because it is pure JavaScript and self-contained, it integrates easily with browser or Node.js applications without heavy dependencies. For developers exploring spatial algorithms, generative UI, or interactive diagrams, this codebase is a practical reference and tool to build upon.

An optimized java library for genetic algorithms. The library is designed to be fast and memory light, but still very easy to use.

The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In contrast to other GA implementations, the library uses the concept of an evolution stream (EvolutionStream) for executing the evolution steps. Since the EvolutionStream implements the Java Stream interface, it works smoothly with the rest of the Java Stream API. Other repositories: - https://github.com/jenetics/jenetics Maven: - https://mvnrepository.com/artifact/io.jenetics