Closed QuinnDamerell closed 9 years ago
Current the HastList class will consume 2x the memory since the strings are stored in the dictionary and the list. If we only keep track of the last element and a pointer to the next to last element we can reduce that overhead.
Current the HastList class will consume 2x the memory since the strings are stored in the dictionary and the list. If we only keep track of the last element and a pointer to the next to last element we can reduce that overhead.