GitHub - KGardevoir/StructureLib: C based Functional data structures.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 75 Commits
examples		examples
.gitignore		.gitignore
Makefile		Makefile
README		README
aLong.c		aLong.c
aLong.h		aLong.h
btree.c		btree.c
btree.h		btree.h
city-test.c		city-test.c
city.c		city.c
city.h		city.h
citycrc.h		citycrc.h
dlist.c		dlist.c
dlist.h		dlist.h
graph.c		graph.c
graph.h		graph.h
graph_tree.c		graph_tree.c
graph_tree.h		graph_tree.h
htable.c		htable.c
htable.h		htable.h
linked_base.h		linked_base.h
linked_structures.h		linked_structures.h
linked_structures.hpp		linked_structures.hpp
main.c		main.c
main.h		main.h
main_btree.c		main_btree.c
main_dlist.c		main_dlist.c
main_graph.c		main_graph.c
main_graph_tree.c		main_graph_tree.c
main_htable.c		main_htable.c
main_scapegoat.c		main_scapegoat.c
main_slist.c		main_slist.c
main_splay.c		main_splay.c
main_udlist.c		main_udlist.c
scapegoat.c		scapegoat.c
scapegoat.h		scapegoat.h
slist.c		slist.c
slist.h		slist.h
splaytree.c		splaytree.c
splaytree.h		splaytree.h
transform.c		transform.c
transform.h		transform.h
udlist.c		udlist.c
udlist.h		udlist.h

Repository files navigation

StructureLib
------------

A library for linked structures, implemented in C, for C, with plans for C++ bindings.

This project aims to do nothing more than provide some structures to be used in C. They range from Hash Tables to Linked
Lists. Generally a structure is written in a manner to have its implementation decoupled from its usage, as such a
system of inheritance is used for structures which are markedly similar.

The library now implements the following features (most of which have been tested in at least a preliminary manner:

	* Linked Lists (single linear and doubly circular)
	* Binary Trees with some self balancing ones (scapegoat and splay)
	* Graphs (just the fundamentals currently, they are represented by adjacency lists)
	* DAG Graphs (same as graphs currently)
	* Hash Tables (using city-hash and linked processing using either scapegoat or splay trees)
	* Unrolled linked lists, basically a generalization of doubly circular lists which pack more data into each node

Future Work:

	* Red-black, AVL
	* Bloom filter for Hash Tables.