WyBench | Benchmark Suite for Whiley

WyBench is a Java library. WyBench has no bugs, it has no vulnerabilities and it has low support. However WyBench build file is not available. You can download it from GitHub.

wybench is a suite of benchmark programs used for testing and demonstrating the whiley language. here are some details about the benchmarks:. 001_average --- computes the average of a list of integers. 002_fib* --- computes the first 41 numbers in the fibonacci sequence. 003_gcd --- implements euclid’s algorithm for finding the greatest common divisor of two numbers. 004_matrix --- implements the classical matrix multiplication algorithm. 005_paths --- implements dijkstra’s algorithm for computing the single-source shortest paths of a directed graph [broken]. 006_queens* --- implements a solution for the n-queens problem. 007_regex* --- implements a simple regular expression matcher. 008_scc --- implements a variant of tarjan’s algorithm for finding strongly connected components. 009_lz77 --- implements lz77 compression and decompression. 010_sort --- implements a simple merge sort. 011_codejam --- a solution to test a of the google code jam qualificition round in may 2011. 012_cyclic --- a simple implementation of a fixed-size cyclic buffer. 013_btree --- a simple implementation of a binary search tree. 014_lights --- a simple implementation of the (british) traffic lights sequence. 015_cashtill --- a simple example implementing a cash till which computes the change to given to a customer after a purchase. 016_date --- a simple gregorian calendar