goakley / collec

Provides a number of collections and algorithms in native C

• 👋 Hi, I’m @goakley
• 👀 I’m interested in infrastructure management, puzzles, and games
• 🌱 I’m currently learning better time management skills and the (post-)release side of software development
• 💞️ I’m looking to collaborate on little tools and projects that inspire fun and creativity in their users
• 📫 How to reach me: https://www.glenoakley.com/

collec's Issues

Testing / Test Harnesses

The current methods of testing only apply trivial/predictable operations on the code on a small scale. ColleC needs a set of test harnesses for each of the data structures and algorithms in order to ensure proper functionality and to better simulate real-world usage.

Bivector Manipulation Efficiency

The Bivector manipulations and queries are inefficient. Each memory location may be accessed and operated on CHAR_BIT times, causing unnecessary delay. As an example, here is the algorithm for setting bits:

for (index = min; index <= max; index++)
  (biv->array)[index/CHAR_BIT] |= (1 << (index%CHAR_BIT));

It should be possible to consolidate to only one access+write per memory location (for most cases at least), by taking advantage of tricks to set a memory location to all/partly 0s or 1s.