Initial commits on new graphs branch
Initial usage of tlsf for memory allocation

	* This removes the requirement of type->adalloc, and hence its removal
	* Rename adfree to destroy
	* Fix massive memory leak (dlist_dequeue wasn't freeing any memory)
	* Allow list_tspec to be NULL whenever referenced (suitable default is not
	  available by default), this remove the requirement that list_tspec be
	  populated.
Add various enhancements and bug fixes

	* NOTE: After some tests, I have determined that the stock memory allocator performs much better than tlsf. A first fit
	  allocator may peform better due to the congruency of every block (consistent size, basically constant amoung all
	  data structures) when used as a block allocator for the various data structures.
	* ENHANCEMENT: Added more tests.
	* ENHANCEMENT: Binary Trees now have all 4 traversal strategies (for mapping)
	* FIX: removed "keys" as they seem to be more trouble than they are worth.
	* ENHANCEMENT: Compartmentalize bstree traversal into a single function.
	* TODO: Still no graph implementation.
Completed graph find algorithms, A* and others can be implemented

	* graph_path is the utterly most complex, in depth, rediculous thing ever,
	  heaps are necessary (yay...) for many such as A*, B* Beam, D*, etc.
Completed graph find algorithms, A* and others can be implemented

	* graph_path is the utterly most complex, in depth, rediculous thing ever,
	  heaps are necessary (yay...) for many such as A*, B* Beam, D*, etc.
Merge branch 'graphs' of sunovershadow.com:~/devel/StructureLib into graphs

Conflicts:
	linked_structures.h
Implement graph_size

	* I seem to have been mistaken, Dijkstra's algorithm (more specifically
	  a modified breadth-first search algorithm) should suffice
Added graph_path function, dlist_transform and dlist_map_internal
Add graph_path_key_match
Removed some functions, add "depth" parameter to lMapFunc

	* Mostly internal changes which allow "depth" to be recoreded and reported
	* Remove splay_findmin and splay_findmax as their functionality is redunant
Working on fixing graph_map then onto adding depth argument (when applicable).

	* Remove "depth" parameter and move to adding an argument to "map" functions
	  to instruct to add several peices of data if requested, as the compiler borks
	  the function arguments to death.
Truely fix graph traversal, remove graph path for now. Add more tests
Improvements to the library

	* Added: htables (hash tables) is based on CityHash, which is based on murmur hash.
	* Added: tests to verify structure of graphs and bstrees
	* Fixed: graphs traversal (for really real)
	* TODO: Make dlist tests more like graph and bstree tests
	* TODO: Test bstree deletion
	* TODO: Test htables
Hash Tables and initial test stubs.