Internal management of DataChunk
Status: Planning
Brought to you by:
giuppe3d
Appending data to a DataChunk can be very expensive, due to the complete copy of existent m_data to a new expanded memory area.
This can be avoided implementing a system of internal pointers to real data (similar to a linked list): in this way, appending an object is simple as appending its pointer to a list.