Open Source C Algorithms

Library and command line tools for XZ and LZMA compressed files

LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core (>0.15 Bytes/cycle). It features an extremely fast decoder, with speed in multiple GB/s per core (~1 Byte/cycle). A high compression derivative, called LZ4_HC, is available, trading customizable CPU time for compression ratio. LZ4 library is provided as open-source software using a BSD license. This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's static assets (text/images/tables/scripts/etc) which loading from Flash Memory / HDD / SSD. In this case, compression time is completely ignored. Because only content developers compress the data at once and usually they don't care about its computational cost. But they always care end user's experience a.k.a. "loading time" and bandwidth. Please pay attention to "LZ4HC -9" which is quite faster than other methods.

RHash (Recursive Hasher) is a console utility for computing and verifying hash sums of files. It supports CRC32, CRC32C, MD4, MD5, SHA1, SHA256, SHA512, SHA3, AICH, ED2K, DC++ TTH, BTIH, Tiger, GOST R 34.11-2012, RIPEMD-160, HAS-160, EDON-R, and Whirlpool.

Zstandard is a fast compression algorithm, providing high compression ratios. It also offers a special mode for small data, called dictionary compression. The reference library offers a very wide range of speed / compression trade-off, and is backed by an extremely fast decoder (see benchmarks below). Zstandard library is provided as open source software using a BSD license. Its format is stable and published as IETF RFC 8478. The negative compression levels, specified with --fast=#, offer faster compression and decompression speed in exchange for some loss in compression ratio compared to level 1, as seen in the table above. Zstd can trade compression speed for stronger compression ratios. It is configurable by small increment. Decompression speed is preserved and remain roughly the same at all settings, a property shared by most LZ compression algorithms, such as zlib or lzma.

JDIFF is a program that outputs the differences between two binary files, either in binary format or in human readable format (detailed or summarized) and then allows to reconstruct the second file from the first one and the diff-file.

ArpON (ARP handler inspection) is a Host-based solution that make the ARP standardized protocol secure in order to avoid the Man In The Middle (MITM) attack through the ARP spoofing, ARP cache poisoning or ARP poison routing attack.

minidjvu is a DjVu encoder for black-and-white images.

CloudI is an open-source private cloud computing framework for efficient, secure, and internal data processing. CloudI provides scaling for previously unscalable source code with efficient fault-tolerant execution of ATS, C/C++, Erlang/Elixir, Go, Haskell, Java, JavaScript/node.js, OCaml, Perl, PHP, Python, Ruby, or Rust services. The bare essentials for efficient fault-tolerant processing on a cloud!

Random Thoughts On Distributed Algorithms: a collection of tools and ideas for the development of distributed applications. The first released part is an RxRPC security model based on OpenSSL and elliptic curve criptography. Please check docs for info...

Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.

Aggressive Rectangle Truncation (ART) with Location Verfication Mechanism is a localization algorithm in wireless sensor networks written in nesC.

Creates an index to DBF files using a B+ Tree; Cria um indice para um arquivo DBF usando uma arvore B+; Implementação em C; Baseada em Arquivo;

Project provides a set of concurrent building blocks (Java & C/C++) that can be used to develop parallel/multi-threaded applications. Components are grouped into 4 categories: 1.Data Structures 2. Parallel Patterns 3.Parallel functions 4.Atomics and STM

From the early 1970s up to nowadays the system date routines of computers usually mix up date with time calculations. Not only that they will expire sooner or later due to number overflow. Not only that this will make calendarian calculations extremely complicated. Fact is, that this will combine two things together which don't have anything to do with each other: The rotation of the earth around itself and the rotation of the earth around the sun, which in addition will both vary during the chiliads. So how will you be able to do date calculations if you then even try to consider time gimmicks like summer/winter time changes, leap-seconds and so on? Just forget it! This project gives you very short pure date routines that are the fastest ones that you can get, because they don't need any looping for doing their calculations, and they do their calculations from 1/1/0 up to 12/31/9999. Of course they precisely consider the transition from Julian to Gregorian calendar. ;-)

DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. The results of this project were published in the Revista de Sistemas de Informação da FSMA and is available in http://www.fsma.edu.br/si/edicao11/FSMA_SI_2013_1_Principal_1.html

This is meant to be a powerful, but easy to use math software. It's by the user and for the users.

FastFlow is a C/C++ programming framework supporting the development of pattern-based parallel programs on multi/many-core, GPUs and distributed platforms. FastFlow run-time is built upon non-blocking threads and lock-free queues. Thanks to its very efficient CAS-free communication/synchronization support (e.g. few clock cycles core-to-core latency), FastFlow effectively supports the exploitation of fine grain parallelism, e.g. parallel codes managing very high frequency streams on commodity multi-core. FastFlow works on x86, x86_64, PPC, ARM, and Linux, Mac and Win XP/7. From Jan 1, 2018 code development migrated on GitHub at https://github.com/fastflow/fastflow

LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.

GuidLib is a library with functions for GUIDs (also known as UUIDs, as defined by RFC 4122).

Library provides a function of 'human-like mouse movements', ie mouse movements as human. The library will be useful for those who are developing all kinds of bots for games or online casino \ poker. Written in C + +, has a small size of 13 kilobytes.

JPortForwarder Project JPortForwarder is a multithreaded TCP Port Forwarder application. The following feature have been developed: - Generic TCP Port Forwarging. Listen for a port and forward to an ip:port. - Multihoming TCP Port Forwarding.

This Project implements the mergesort algorithm in a MPICH2 (parallel programming -) environment.

Klib is a small fast lightweighted library that provides a generic hash table, a generic B-tree and generic sorting algorithms for C programmers.

Open Macro Library is a library of highly reusable C macros providing a set of well-designed commonly needed functionality to C developers, like logging and debugging helpers, containers, sorting and other 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 sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?