anadon Goto Github PK

antlr4

ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files.

archon4

Copy of the Archon suffix sorting algorithm. See https://code.google.com/p/adark/ for details and history.

bitmagic

BitMagic Library

bpr2

The BPR2 suffix sorting algorithm. It's not a top performer anymore and I have NO IDEA how it works but I need it for testing completeness.

cath-tools

Protein structure comparison tools such as SSAP and SNAP

clblas

a software library containing BLAS functions written in OpenCL

code-of-conduct

NewHaven.IO's Code of Conduct

cpm03

Another suffix array sorting algorithm I don't know enough about yet and need for testing completeness.

david-musser-sort-tests

This is an update to David Musser's original tests used in his 1997 paper "Introspective Sorting and Selection Algorithms" which introduced and proved introsort.

django

The Web framework for perfectionists with deadlines.

django_table_renderers

Django renderers to present returned data as an excel spreadsheet or a tarball of CSVs.

docs

dummysuffixsort

In the testing methodology to be implemented, a null case needs to be included for more accurate memory and time usage.

function

Boost.org function module

gpur

R interface to use GPU's

grammars-v4

Grammars written for ANTLR v4; expectation that the grammars are free of actions.

graph

Boost.org graph module

hmmer

hmmer2

Alternate name for Hmmer, needed for debian-med patch review

how-fast-can-i-find-primes-less-than-1000

In response to Dave's Garage's video, comparing the speed of different languages in finding the first 1000 primes. I thought I could make a program that finds them even faster, both by a better algorithm and by better use of C++.

jls

Java Logic Simulator

karkkainen-sanders

Another suffix sorting algorithm I don't know enough about yet but need for testing completeness.

ldap3

a strictly RFC 4510 conforming LDAP V3 pure Python client. The same codebase works with Python 2. Python 3, PyPy and PyPy3

libdivsufsort

A lightweight suffix-sorting library

libsuffixarray

An effcient C suffix array implementation.

longest-common-subsequence

A reference implementation of a reasonablely optimised and multithreaded tool to find the longest common subsequence between the contents of 2 files.

madlib

Marshall's Algorithms and Datastructures Library -- algorithms and datastructures which I've found I've needed but no where else seems to adequitely provide.

magic_enum

Static reflection for enums (to string, from string, iteration) for modern C++, work with any enum type without any macro or boilerplate code

md5_crack

A basic md5 cracking example program.

meson

The Meson Build System