Data Structures

For platforms where STL is unavailable or undesirable, Rudiments provides a set of commonly used data structures.

- String Storage

- Using the stringbuffer class

- Binary Data Storage

- Using the bytebuffer class
- Using the memorypool class

- Containers

- Using the dynamicarray class
- Using the staticcarray class
- Using the linkedlist class
- Using the singlylinkedlist class
- Using the dictionary class

The Rudiments data structures arguably have some advantages over their STL counterparts too.

- Assignments to staticarray and dynamicarray are more intuitive than std::array and std::vector assignments.
- Unlike std::forward_list, the singlylinkedlist class doesn't require C++11.
- bytebuffer is far less clumsy than using std::string or std::vector<unsigned char> to store binary data.
- The dictionary class uses keys and values directly rather than requiring the std::pair intermediary.