Finish the final optimizations for the LinkedArray class and improve it's usage. Finished implementation will be able to add/remove clients extremely quickly no matter the current number, will be near immune to fragmentation, and will be able to iterate over those clients at near array speeds. As a general design layout, the class uses blocks of dynamically allocated memory to house contiguous linked lists (at least for empty space management) of data which are occasionally defragmented into available blocks.
Finish the final optimizations for the LinkedArray class and improve it's usage. Finished implementation will be able to add/remove clients extremely quickly no matter the current number, will be near immune to fragmentation, and will be able to iterate over those clients at near array speeds. As a general design layout, the class uses blocks of dynamically allocated memory to house contiguous linked lists (at least for empty space management) of data which are occasionally defragmented into available blocks.