jeremyone/subsetsbenchmarks

A set of benchmarks for methods provided in the subsets package

A utility for benchmarking various subset algorithms.

Utility will load text files, convert them to arrays, then check if they are subsets of each other using methods provided in the subsets package

Also provided are small set of books for sample comparisons

Example set:

go run subsetsBenchmarks bible.txt shakespeare.txt

This benchmark depends on these supporting libraries:

[JeremyOne/runeTree] (https://github.com/JeremyOne/runeTree) A simple library for compiling a search tree of runes. Similar to a binary search tree, but each branch contains a leaf for each indexed rune.

[JeremyOne/subsets] (https://github.com/JeremyOne/subsets) A library for testing if a slice of strings are contained within another slice of stings. Three competing methods are provided.