chase-san / songbird Goto Github PK

We need unit tests for everything. While I have tested things locally before submitted everything here. Unit tests make everything better.

We need a single linked list.

We need a decent implementation of a doubly linked list. With some method for removing or adding in the middle of the range without indexing.

We need a vector array. It should expand automatically as needed. It should have get, set, insert, remove, and add.

We need a fast deque for the library. Something that can act as both a queue and a stack. It should allow insertion at both ends, as well as viewing and removing those elements. The stuff in the middle, not as important (there is a vector for that).

We need an associative map container. It needs to map a key to a value. Each key should be unique, but the values needn't be.

The keys will be weak associative, as we cannot possibly know how to compare them, so we will just use memory addresses for the key equivalency.

We need a static array container. It should have get and set functions.

We need an associative set. This will act like a list, but the values must be unique.

The values will be weak associative, as we cannot possibly know how to compare them, so we will just use memory addresses for the value equivalency.