CE Algorithms Package
This library aims to provide reusable and efficient data-structures and algorithms for C programmers on the TI-84+CE platform. To make life easier, these libraries also compile on PC platforms to make it easier to prototype your program on a platform with more advanced debugging tools.

This library is licensed under the terms of the LGPL v3 (or newer), with an added no-endorsement clause.

What's inside?
Currently provides implementations of singly-linked lists and red-black trees. A generic merge-sort implementation is provided for the linked-lists, and helper functions to use red-black trees as the backing structure for both ordered sets and ordered maps are provided.

Additionally, a SafeMalloc implementation is provided, in util.h which will display an error message and terminate that program if insufficient memory is available for a requested allocation. This is great for prototyping programs. We also package the standard cleanUp() routine from the CE Toolchain Examples.

Finally, debugConfig.h provides a dPrintf macro that disables debug printing in release builds, and cooperates with CEmu's debug console on 84+CE debug builds, as well as SZF and PDF string macros for portable formatting of size_t and ptrdiff_t variables.
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.

» Go to Registration page
Page 1 of 1
» All times are UTC - 5 Hours
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum