Search Results for "source testing unit testing"

Use this class to create combinations of sub-arrays of arrays and ArrayLists. A handy utility for creating and testing purposes..

Programmer's library for random numbers. Also random number generator testing code. Intended for simulation, games and "Monte-Carlo" algorithms.

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

This library is a common implementation of both the Open Grid Forum GridRPC API _and_ GridRPC API Data Management standards. It is completely modular and already supports middleware modules for DIET and Ninf, as well as data manager modules for iRods, OwnCloud, rsync, scp. The installation is made easy with cmake and testing examples can be launched in a one line command.

XSWAG (Extended SourceWare Archive Group) is a revival project for the famous SWAG code archives for the Pascal programming language. This project is open to every Pascal/Delphi programmer who wishes to contribute to the global Pascal knowledge base. Current version (testing 0.9) features : - a reader program : allows users to browse through the code archives, organizes them by type and operating system and updates the archives from multiple XSWAG servers. - a...

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

Some tools for discussion about algorithms. 1) an evaluating tool for complexity

ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.

Libface is a cross platform framework for developing face recognition algorithms and testing its performance.

Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.

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

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

The IEEE 1619 Committee open-source reference implementations of encryption algorithms, plus testing and certification suites, for each encryption algorithm included in the standard.

Sinalgo is a simulation framework for testing and validating network algorithms. It allows for quick prototyping and verification in freely customizable network settings. It is mainly suited for packet-oriented wireless networks.

An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..

OCaml-Reins is a data structure library for O'Caml that includes cursor based iterators, a collection of functors to minimize client-side boilerplate, a powerful on-line benchmarking system and Quickcheck style testing infrastructure.

ChIPOTle 2.0 is a user friendly tool for performing peak detection in ChIP-chip signal. The tool also has functions for probe sorting, signal normalization, replication merging, and multiple correction testing in a windows interface or *nix command line.

Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.

Data Structure Tester is an OCaml application for multiple testing of various data structures (also written in other lanages, like C or C++).It proviedes many examples to test, easily configurable tester and signatures for all data structers to be tested.

YABI93 is an Interpreter for the esoteric programming language Befunge, version "Befunge93". It is written in Java 1.5 and uses Swing for its graphical interface. YABI supports a multilanguage GUI.

A Pascal unit providing functions to format Brazilian Real (R$) currency.

A whole lot of source code related to programming Linux systems with C