3 May
2009
3 May
'09
3:50 p.m.
gtener:
Hi
I'm looking for a data structure with following characteristics: 1. O(1) lookup 2. O(1) modification 3. amortized O(1) append 4. O(1) size query
This roughly characterizes C++ vector<> class. I'm ready to implement it myself, but first I would like to ask if anyone knows package with similar data structure. If there are many, which one would you choose and why?
A number of the array packages behave like this. The trie packages are O(log(wordsize)), so another option (they tend to have better append complexity as well). -- Don