News for hackers. Stuff that matters.

A comment on Show HN: Array with Constant Time Access and Fast Insertion and Deletion.

Re:Show HN: Array with Constant Time Access and Fast Inserti... by Thorrez on Tuesday September 03, 2019 @11:02PM (#20873627)
The Push Front time could be improved to O(1)* by making it circular. Assuming "*" means amortized. But as-is it does provide a better comparison to an array. A circular IgushArray would be better compared to a circular array (which an std::vector isn't).
[ Parent | on HN ]
Re:Show HN: Array with Constant Time Access and Fast Inserti... by igushev on Wednesday September 04, 2019 @01:34AM (#20874296)
That's a good point. That would make computation of indexes much more complicated though
[ Parent | on HN ]