Projects

c-generic-library

The generic data structure library is a bunch of data structures that are designed and created in as generic a fashion as possible. Each data structure will contain its own basic memory management, be able to handle any object type, and hopefully constraint to strict algorithmic constraints. When ... [More] the library hits version 1.0, it will contain the following data structures:       * Doubly Linked List - Done     * List-based Queue - Done     * List-based Deque - Done     * List-based Stack - Done     * Vector - Done     * Vector-based Queue - Done     * Vector-based Deque - Done     * Vector-based Stack -Done     * Binary Tree - Done     * Hash Table - Done     * Priority Queue - Done     * Heap - Done     * Memory Manager     * Object Cache w/ Garbage Collection     * AB Tree     * Split Lists     * RB Tree     * AVL Tree [Less]

essential-c

IntroductionI began writing what would become this library back in 2004. At the time, I was developing a semi-structured database called Spinneret, which was to be a sensical merging of the relational database concepts that I had utilized throughout my life and the native XML concept which I ... [More] helped to pioneer. It would have featured dynamic storage and flexible data representation (JSON, XML, YAML, etc). Unfortunately, Spinneret was never to be, so this code sat around for quite some time before I decided that it should be released to the public. So What Is It?Well, it's a library that does 'stuff' for you. When I stay 'stuff,' I mean that it performs a variety of tasks including collection management thread and signal abstraction, and specialized memory management. Presently, Essential-C includes the following C routines: Collection Management Lists - I've taken a slightly different approach in my List management code. While many toolkit developers choose to implement List collections using singly or doubly linked lists, I've instead decided to implement something I call a Clustered List, where a doubly-linked set of nodes are managed, each node pointing to a cluster of many items. This improves random seek time because less walking has to occur, and it also means less calls to memory allocation routines when a lot of activity is occurring. There may be a formal name for this method, but I'm too lazy to look it up. Tables - Again, while some toolkit developers would opt to implement a very basic hash table where the entire set grows by a particular ratio every time its storage threshold is reached, I've decided to implement my Tables as in-memory Linear Hash tables. The benefit here is that the table will grow linearly rather than geometrically, thus avoiding the kind of memory consumption for which hash-tables have historically been notorious. Stacks and Queues - These are simple Stack and Queue set implementations based on the Clustered List routines. Memory Management Memory Chains - Because it was originally written to serve as the foundation for a database server, the memory management routines were written with transactions in mind, and in particular the ability for a developer to create a chain of memory that, upon completion of a particular transaction, can be removed in its entirety with a single API call. Reference Counting - The memory management routines also support Objective-C style retain and release reference counting, if one so desires to utilize it. Signal Abstraction - A simple way to register potentially many signal handlers for any particular signal. Thread Abstraction - Wraps the host operating system's threading APIs so that a developer can perform simple threading and synchronization without having to be familiar with any particular native API. And Much, MUCH More! Not really much more than that, but it's a starting point for bigger and better things. So long as those things remain focused and simple. [Less]

pointer

MATLAB Pointer Library provides an implemetation of pointers and data structures in MATLAB The idea of the library is taken from DSATX - The Data Structures & Algorithms Toolbox (Yaron Keren). Unfortunately, DSTAX supplies certain mex-functions as dll-files and does not contain the source C ... [More] code. The mentioned dll-files are supplied only for early versions of MATLAB (not for MATLAB 7.0). We implement pointer objects that support all possibilities of DSTAX pointers and some other possibilities. Almost all functions are written in C. Source code is included. On the other hand, DSATX also supplies a lot of m-files that implement some algorithms on data structures (lists, stacks, queues, binary trees, avl, and red-black trees) whith using DSATX pointers. You can use these m-files jointly with our implementaions of pointers. You can review and rate this library on Matlab Central. Thanks! Users of Pointer LibraryMATLAB Pointer Library is used in The Source-Model Techique Package by Amit Hochman MATLAB Pointer Library is used by Jason Miller, Henry de Plinval, Kaijen Hsiao in the project Mapping Contoured Terrain: A Comparison of SLAM Algorithms for Radio-Controlled Helicopters MATLAB Pointer Library is used by Vamsikrishna Gopikrishna in Temporal Potential Function based Path Planner for Dynamic Environments AcknowledgementsWe wish to acknowledge the following individuals for suggestions: Michel Beaulieu, Joe Groner, Christoph Henninger, Andrew Hutchinson, Omar Kofahi, Jani Lahtinen, Ralph Peters, Jose Suarez, Belinda Thom. Special thanks to Gang Liang. [Less]

lclibs

Some data structure implementation and the wrappers of something.

usb-adt-java

Collection of classes and interfaces that implements ADTs like lists, queues, stacks, etc, for teaching/learning propouses

icub3d-adt

A C library of commonly used abstract data types and utilities. It includes ADTs like lists, queues, sets, maps, and useful utilities like configuration file readers.

datastructuresalgorithms

Data Structures & Algorithms in pure Assembly by FASM (www.flatassembler.net) eg. Splay Trees, Red-Black Trees, B-Trees, Skip List include simple Stack, Queue, Linked List etc.