Почему не там оператор [] для станд.:: список?

Question

Почему не там оператор [] для станд.:: список?

Система. Windows. Формы. Таймер (или Система. Таймеры. Таймер)

, но так как теперь Вы говорите Вас, не хотят использовать Таймеры, можно работать, легкий процесс ожидания на другом потоке (проверьте время, спите несколько секунд, проверьте время снова...), или сделайте компонент, который генерирует событие (использующий легкий процесс ожидания) на определенных запланированных временах или интервалах

32

c++ list stl

задан Gab Royer 11 July 2009 в 01:56

3 ответа

It would not be too hard (for the implementer) but it would be too hard at runtime, since the performance will be terrible in most cases. Forcing the user to go through each link will make it more obvious what is going on in there than 'myList[102452]' would.

3

ответ дан 27 November 2019 в 20:16

I think I found the answer in another SO post Extending std::list

"your operator[] is O(N) time" - this is exactly why it is not included in the standard's std::list<>. – Michael Burr Dec 14 at 17:29

Still, is that the only reason?

EDIT : It seems though as people mentioned it is more a matter of consistency regarding performance then strictly performance.

1

ответ дан 27 November 2019 в 20:16

Другие вопросы по тегам:

c++ list stl

Похожие вопросы:

score 72 · Accepted Answer

Retrieving an element by index is an O(n) operation for linked list, which is what std::list is. So it was decided that providing operator[] would be deceptive, since people would be tempted to actively use it, and then you'd see code like:

 std::list<int> xs;
 for (int i = 0; i < xs.size(); ++i) {
     int x = xs[i];
     ...
 }

which is O(n^2) - very nasty. So ISO C++ standard specifically mentions that all STL sequences that support operator[] should do it in amortized constant time (23.1.1[lib.sequence.reqmts]/12), which is achievable for vector and deque, but not list.

For cases where you actually need that sort of thing, you can use std::advance algorithm:

int iter = xs.begin();
std::advance(iter, i);
int x = *iter;