Open Source C Algorithms for Mac - Page 2

A library for fixed point calculation in s15.16, s7.24 and s7.8 format, entirely written in ANSI C for embedded software (with main focus on the Atmel AVR platforms).

Provide implemented algorithms and functions with demo programs to test.keeped portable as possible at OS level and programming language(understanding)level.provide third party archives if available for ralvent algorithm.links for YouTube videos on availability by us and third party.

The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).

Aim is to develop a library of utility functions to efficiently simulate division, multiplication, mod, finding first 1/0 bit etc. (using shift and add/subtract) for software development on low cost dsp systems lacking these.

A C++ library for Bayesian computation, including a collection of more generally-applicable utilities.

Portable, optimised implementation of Bruce Schneier's 64-bit symmetric block cipher, Blowfish. Includes support for ECB, CBC, CFB, OFB and CTR block cipher modes, weak key detection and parallelisation using OpenMP.

The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc

The C Algorithms library has moved to GitHub. Please go to the new project page: https://github.com/fragglet/c-algorithms

That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.

Simple and Fast Exception Handling for C.

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of the new tree sub-category, there can be others. In any case, read the PDF: “Capsule Trees - A Primer”, before delving into the code.

A C++ library for clipping polygons.

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.

Crazy Turtle puzzle game solver utility. Other names: CRAZY TURTLE / LE JEU FOU DE LA TORTUE / NAUGHTY TURTLES / ŠAŠAVE KORNJAČE / NAGAJIVE ŽELVICE / SASAVE KORNJACE

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.

This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.

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.

This is a python implementation that handles floating points correctly,there are still some bugs but I'm working on it . The point was to work around some stuff that made no sense for floats,like 0.1+0.2 == 0.3 is false.

Cell Broadband Engine Processor optimized libraries and software from Georgia Tech, for a number of libraries for FFT, MPEG, compression, and encryption. This project also includes patches to accelerate R on the Cell Broadband Engine processor.

in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] }

This project provides some hyperheuristics, implemented as C libraries. A hyperheuristic can be used to handle any optimization problem, as long as you implement some simple specific code to interact with it. Some examples/applications are also provided.

I is a cross-platform programming language designed towards efficiency during development and at runtime.

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

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

A public domain C data structure library, with an emphasis on collections. Currently includes dynamic arrays and lists.