An efficient C vector implementation, good for embedded C development.
It has the following features,
- It provides the same functions as the standard vector data structure in C.
- It uses lazy deletion and conditonal memory compaction, so it is efficient for element deletion.
- It uses a bitmap internally to track free and used slots, so it is efficient for element searching.
- It compacts memory when fragment is large so it saves memory space.