libcollections

a library that provides collections implementations for your C code

Brought to you by: ponchy

Add a Review

Downloads: 0 This Week

Last Update: 2014-04-09

Browse Code

Get an email when there's a new version of libcollections

libcollections is a library that provides a reutilisable and comprehensive set of collections to your C code.

Implemented so far:
- linked list,
- queue
- stack

To be implemented:
- vector (arraylist)
- red black tree
- set
- map

Project Activity

See All Activity >

Follow libcollections

libcollections Web Site

User Reviews

Be the first to post a review of libcollections!

Additional Project Details

Registered

2014-01-11

Report inappropriate content

Recommended Projects

FreeBasic containers(map , vector ....)
Dynamic data types for the FreeBasic language. MAP - dictionary (associative array), created on the basis of a balanced tree VECTOR - dynamic array, with the ability to insert and delete any number of cells LIST - doubly linked list QUEUE - queue STACK - stack
Fortress-of-Solitude
The repository have a library to each common data structures algorithms like Doubly linked list, Generic trees, Queue, Stack... Each lib have a option to carry your custom data in elements, other cool resources.
Generic Data Structures Library (in C)
A Generic Data Structures Library. A collection of data structures you're most likely to need. Written in ANSI C. Interface is basic, but powerful, and intuitive. Has AVL tree, binary heap, queue/linked list, and more. All platforms.
GoDS
GoDS, which means "Go Data Structures", is an implementation of various data structures and algorithms in Go. It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks...
Simple Generic Library for C
Sglib is a C library freely inspired by Standard Template Library (STL). It defines generic macros and functions for sorting arrays, manipulating lists, sorted lists, double linked lists, hashed containers, and red-black trees.