12 projects tagged "Algorithms"
Updated 10 Jul 2012
nedtries
| Pop | 77.59 |
|---|---|
| Vit | 3.18 |
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.
Updated 29 Dec 2009
Classless.Hasher
| Pop | 59.75 |
|---|---|
| Vit | 3.23 |
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.
Updated 12 Apr 2009
Algorithm Study
| Pop | 51.90 |
|---|---|
| Vit | 1.00 |
Algorithm Study provides tools and resources to augment the traditional study of algorithms. It includes implementations of common and less-common algorithms in a variety of languages and visualization tools to help in gaining a deeper understanding of the algorithms. The algorithm implementations are each accompanied by a discussion of the asymptotic ("big O") run time and memory limits of the algorithm. Some implementations include discussion of how the algorithm or data structure is commonly used and comparisons with similar algorithms or data structures. All implementations have test cases that exercise their functionality. The visualization tool, Algorithm Visualizer, displays what happens as various algorithms do their work.
Updated 23 Jun 2010
php mudnames
| Pop | 42.61 |
|---|---|
| Vit | 1.51 |
php mudnames is a PHP class that can generate random names for characters used in role playing games such as multi-user dungeon (MUD) games. Although the names do not mean anything, they sound very much like typical names of characters that you often see in this kind of game. It can retrieve text data from one of several dictionary files. The dictionary data is used to generate random names based on selected capabilities and used particles.
Updated 17 Mar 2012
llrb.h
| Pop | 41.09 |
|---|---|
| Vit | 1.64 |
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.
Updated 30 Sep 2009
Asterisk Config PHP-Parser
| Pop | 33.02 |
|---|---|
| Vit | 36.50 |
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.
Updated 25 Aug 2010
hilbert-curve
| Pop | 31.53 |
|---|---|
| Vit | 1.44 |
hilbert-curve is a fast Hilbert curve implementation in PHP. It uses a table-based approach. It includes the Moore curve and the Z-curve.
Updated 26 Sep 2010
bin-packing
| Pop | 26.87 |
|---|---|
| Vit | 31.15 |
bin-packing is an implementation of the 1-dimensional bin packing algorithms in PHP: next fit, first fit, best fit, and worst fit.
Updated 15 Jan 2012
BS
| Pop | 24.17 |
|---|---|
| Vit | 1.00 |
BS is a data structures library. It features fixed size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). The sequences are three to five times faster over random access BST-based sequences, while having better memory usage characteristics.
Updated 20 Jun 2011
Zebra_Mptt
| Pop | 24.12 |
|---|---|
| Vit | 1.01 |
Zebra_MPTT is a PHP class that provides an implementation of the modified preorder tree traversal algorithm. It provides methods for adding nodes anywhere in the tree, deleting nodes, moving and copying nodes around the tree, and for retrieving information about the nodes. It uses table locks to ensure that database integrity is always preserved and that concurrent MySQL sessions don’t compromise data integrity. A caching mechanism ensures that regardless of the type or the number of retrieval operations, the database is read only once per script execution.
