RSS 6 projects tagged "data structures"

Download Website Updated 23 Aug 2012 RubyTree

Screenshot
Pop 83.25
Vit 7.42

RubyTree is a simple to use general purpose tree data structure implementation in Ruby. It provides easy access methods for navigating the hierarchy, as well as for accessing the nodes. It also provides ability to marshal the entire tree structure. The library provides a generic tree as well as a binary tree implementation. It is available as a RubyGem or standard Tar/ZIP packages.

Download Website Updated 21 Mar 2009 PBL

Screenshot
Pop 26.53
Vit 43.07

PBL (The Program Base Library) is a C library of array/linked list, hash/tree set, and key file functions that can be used in a C or C++ project. It is highly portable and compiles warning-free on Linux gcc, Windows Cygwin gcc, Mac OS X, and Windows Microsoft Visual C++ 2008 Express Edition.

No download Website Updated 26 Feb 2013 liblfds

Screenshot
Pop 61.04
Vit 3.65

liblfds is a portable, lock-free data structure library. Out-of-the-box ports are provided for Linux (user-mode) and Windows (user-mode and kernel-mode) on ARM, x86, and x64, under a variety of toolchains. Currently, the library contains a freelist, queue, ringbuffer, singly-linked list (logical delete only), and a stack. The homepage contains a blog, bugzilla, forum, and mediawiki. The mediawiki contains comprehensive documentation for development, building, testing, and porting. There is no license. You are free to use this code in any way.

Download Website Updated 15 Jan 2012 BS

Screenshot
Pop 26.53
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.

No download Website Updated 24 Jun 2013 Capsule Tree

Screenshot
Pop 26.00
Vit 17.29

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.

No download No website Updated 21 Mar 2014 fcmm

Screenshot
Pop 131.00
Vit 5.20

Fast Concurrent Memoization Map (fcmm) is an almost-lock-free concurrent hashmap to be used for memoization in concurrent environments.

Screenshot

Project Spotlight

PyCraft

A Minecraft world editor.

Screenshot

Project Spotlight

MatrixSSL

An embedded SSL/TLS implementation for small footprint devices.