RSS 19 projects tagged "Algorithms"

No download Website Updated 29 Jun 2009 Validate Saudi ID

Screenshot
Pop 20.20
Vit 42.05

Validate Saudi ID is a PHP class that can be used to validate Saudi resident identifier numbers. It takes a resident identifier number and calculates a checksum to verify whether it may be a valid number. It returns either 1 (for Saudis), 2 (for non-Saudis), or FALSE (for invalid numbers).

No download Website Updated 30 Sep 2009 Asterisk Config PHP-Parser

Screenshot
Pop 30.66
Vit 40.83

The Asterisk Config PHP-Parser is a simple but effective PHP function that is able to parse any standard Asterisk configuration file and output the data into a multi-dimensional array.

No download No website Updated 26 Sep 2010 bin-packing

Screenshot
Pop 24.04
Vit 36.13

bin-packing is an implementation of the 1-dimensional bin packing algorithms in PHP: next fit, first fit, best fit, and worst fit.

No download No website Updated 11 Nov 2011 ExternalSort

Screenshot
Pop 15.52
Vit 29.92

ExternalSort is a class that can sort large files similar to the Unix sort command. It can read the file to be sorted in small buckets associated with temporary files to not exceed the configured PHP memory limits. The buckets are sorted individually and then merged to produce the final sorted output. The class provides command line interface options so it can be executed as a command from a shell.

No download Website Updated 16 Jul 2013 PHP Clarke and Wright Algorithm

Screenshot
Pop 32.86
Vit 16.78

PHP Clarke and Wright Algorithm is a class that can solve a truck routing problem with the Clarke and Wright algorithm. It attempts to solve the problem of determining the routes by which a given number of trucks with different weight and volume capacity will be dispatching deliveries to a certain number of clients distributed geographically within certain time windows. The class takes as parameters the nodes of positions of each client, the demands of each client, a matrix of distance between nodes, and the capacity of each truck. It computes the route for each truck, as well the time and distance to drive to each customer and the volume and weight to transport.

No download Website Updated 22 Feb 2014 C Almost Generic Library

Screenshot
Pop 83.45
Vit 7.79

C Almost Generic Library (CAGL) is a set of C macros which generates typed arrays, lists (singly or doubly-linked), hash tables, and balanced binary trees, as well as many useful functions to manipulate them. The containers grow automatically, and their memory is managed by the library. The container data, or elements, may also be managed by the library, depending on the options specified by the programmer. The aim is to free C programmers from the drudgery of implementing common data structures and algorithms. CAGL also provides some safety by making the containers typed instead of void pointers. Although, at most, two macros are invoked to declare and define a container type, manipulation of the containers is done using functions generated by the macros. A simple naming convention is used to get around the limitation that C doesn't support function overloading.

Download No website Updated 02 Feb 2014 libefgy

Screenshot
Pop 200.92
Vit 3.90

libefgy is a set of C++ headers containing lots of templates loosely related to maths. The headers include templates for fractional arithmetic, big integers (and thus "big fractions"), calculating π, e, and some calculations with those (for trigonometrics), matrix manipulations, tuples, polar and Euclidian spaces in arbitrary dimensions, (perspective) projections, colour space manipulations in RGB and HSL, and assorted other things.

No download Website Updated 25 Sep 2013 llrb.h

Screenshot
Pop 54.54
Vit 3.61

llrb.h is an iterative implementation of Robert Sedgewick's 2-3 variant left-leaning red-black tree algorithm. It's written to be a drop-in replacement for Niels Provos' <sys/tree.h> C preprocessor red-black tree library.

Download Website Updated 29 Dec 2009 Classless.Hasher

Screenshot
Pop 58.22
Vit 3.01

Classless.Hasher is a collection of standard hashing and checksum algorithms implemented within the .NET framework (Microsoft, Mono, etc.). It provides a uniform interface to easily use any of the algorithms contained within this library in other programs.

Download No website Updated 10 Jul 2012 nedtries

Screenshot
Pop 73.23
Vit 2.54

nedtries is a portable in-place bitwise binary Fredkin trie algorithm that allows for near constant time insertions, deletions, finds, closest fit finds, and iteration. It is approximately 50-100% faster than red-black trees and up to 20% faster than O(1) hash tables. It provides implementations as C macros, C++ templates, and as a C++ STL compatible associative container.

Screenshot

Project Spotlight

llpp

A PDF pager.

Screenshot

Project Spotlight

Smooth Build

A powerful build tool with a simple language.