Projects

M2Collections

Modula-2 collections library. The library provides an API for collection ADTs, in particular: stacks, queues, double ended queues, priority queues, balanced binary search trees, patricia tries, dynamic arrays and hash tables to store arbitrary data. The hash table ADT allows data to be stored and ... [More] retrieved by reference or by copy, with built-in reference counting. All other ADTs allow data to be stored and retrieved by reference only. The library follows PIM4, it has no dependencies and it is platform independent. The library is tested with GM2 using option 'fpim4'. Under development. BSD style license. [Less]

CuttingEdge.ServiceLayerHelpers

CuttingEdge.ServiceLayerHelpers library contains useful helper classes for Service Layer that are build on top of .NET 3.5 or higher.

django-treebeard

django-treebeard is a library that implements efficient tree implementations for the Django Web Framework 1.0+, written by Gustavo Picón and licensed under the Apache License 2.0. django-treebeard is: - Flexible: Includes 3 different tree implementations - with the same API: 1. ... [More] Adjacency List 2. Materialized Path 3. Nested Sets - Fast: Optimized non-naive tree operations (see Benchmarks). - Easy: Uses Django Model Inheritance with abstract classes to define your own models. - Clean: Testable and well tested code base. Code/branch test coverage is above 96% [Less]

BSTlib

C library for balanced binary search tree storage. The library provides an API to create and use dynamic balanced binary search trees for arbitrary data. Data may be stored and retrieved by reference only. At present, AA trees and Splay trees are implemented. An implementation of Scapegoat trees is ... [More] planned. Requires C99, no dependencies, platform independent. BSD style license. [Less]

Qtilities

Qtilities is a set of Qt C++ libraries which provides building blocks for Qt applications, allowing rapid application development.

vdfparser

An AmxModx module that allows to easily control vdf trees in pawn. The vdf handling has been coded in independent classes; so this can be re-used as a library for any project willing to support the vdf syntax.

jclib

Manual implementation of common data structures and algorithms.

phylo-puma

PuMA: A program for the Bayesian analysis of partitioned (and unpartitioned) model adequacyThe accuracy of Bayesian phylogenetic inference using molecular data has been shown to depend on the use of proper models of sequence evolution. While choosing the best model available from a pool of ... [More] alternatives has become standard practice in statistical phylogenetics, assessment of the adequacy of the chosen model is rare. Programs for Bayesian phylogenetic inference have recently begun to implement models of sequence evolution that account for heterogeneity in process across sites, yet no program exists to assess the adequacy of these models. PuMA implements a posterior predictive simulation approach to assessing the adequacy of partitioned, unpartitioned, and mixture models of DNA sequence evolution in a Bayesian context. Assessment of model adequacy allows empirical phylogeneticists to have appropriate confidence in their results and guides the efforts of theoretical phylogeneticists in improving models of sequence evolution. When using PuMA, please cite: Brown, J. M. and R. ElDabaje. 2008. PuMA: A program for the Bayesian analysis of partitioned (and unpartitioned) model adequacy. Bioinformatics. 25: 537-538. See also, RelevantCitations. Supported Bayesian Analysis Programs (7.10.08)MrBayes (unpartitioned and a priori partitioned) BayesPhylogenies (mixture models) Implemented Test StatisticsMultinomial (Unconstrained) Likelihood Compositional Homogeneity X2 (Coming Soon) Supported PlatformsUnix* Mac OS X* *with GUI capabilities [Less]

jalds

JALDS ( J ava AL gorthms and D ata S tructures) pronounced JAL-DOES is an open source repository that contains a variety of algorithms and data structures that you can use in your own code, including graphs , trees , sorting- algorithms and much more. Motivation : Have you ever wondered ... [More] , "What is the best sorting algorithm I should use with this data?" , Well the only person who can answer that question is .... YOU. You know your data better than anyone else! And this project can help you experiment and choose the best one. Graphs, graphs are everywhere eg: Social Networks, Web Pages ... JALDS contains graph algorithms and data structures that you can reuse in your own projects. Should you use a Binary Tree for sorting ever thing ? not necessarily a regular binary tree will be fast only if you insert elements in a random order, can you guarantee that you will be inserting elements in random order ? Your other option is to use a RedBlack tree, that will guarantee that the tree is balanced but you pay an overhead for that. Bubble Sort is the worst sort but easiest to implement, did you know there is a Comb Sort that is a very slight variation of Bubble Sort (hence easy to implement) but rivals complex sorts such as Quick Sort and Merge Sort in speed ? Some of these Sorting algorithms are Stable (keeps the original order of keys, if two key have the same value), online (all keys need not be provided at the beginning) and off-line. If you wanted to compare a variety of algorithms and pick the best one, (and not just rely on the stuff that comes in the JDK) then this project is for you. Having many options is a good thing. This project aims to put all of these algorithms and its implementations in one easy spot for everyone to access, read and re-use. Api CodeCoverage Source News Aug 27th 2008 Added implementations for Prim's Minimum Spanning Tree and Dijkstra Single Source Shortest Path [Less]

libeds

libeds is an extensible data structures library for C language. it contains:  lists:   - unary-linked lists   - double-linked lists   - multi-linked lists  trees:   binary:    - ... [More] red-black    - randomized    - splay    - avl   other:    - b tree(... in progress)  - hash table  - vector  - stack  - queues  graphs:   ... in progress btw: you can hold data of any type in each data structure Each data structure may be converted to other one. main feature of this library is quite common API for all data structures, which contains in the same family(for example all list have identical API, all binary trees have identical API and so on...). everyone can easily add his implementation of needed data structure, using data structure family API. if you want to add new kind of list or just replace implementation of some list function, it's really quite simple. you just use common list API. Moreover, you can easily to add your own data structure family and implement some kinds of it. join and enjoy. [Less]