This assumes your implementation of a linked-list uses pointers and structs and isn't just backed by a contiguous array But that would be me nit-picking, I agree with you on the face of it.

They are used in servers, or at least could be used in servers. They are good for multiple instances.

For example, in my server I have a similar game lobby system to Diablo II's. On the server side, there is a max of 100 lobbies

so for the total items on the ground for each server for example (let's say you had a 200 item max)
you could have something like

ITEM [MAXSERVERLOBBIES][200];

(implied that ITEM is a struct for whatever your info for your item would contain)

This post was edited by Pindrought on Jan 31 2014 09:26pm

Off topic, but why would you do it that way? Why not just have an array of Lobbys that contain a list of ground items?

It can't be, the standard requires constant-time insertion and deletion.

This confuses me. How would you have constant time insertion on a linked list? In order to insert you need a pointer at the insertion point node. It is worst case O(n) to find this node. How do you achieve a O(1) insertion time with a linked list?

You need an iterator pointing to where you want to insert/remove, of course. If you need to traverse the list to insert/remove elements, you need to rethink your design

Enlighten me.

Wiki entry: http://en.cppreference.com/w/cpp/container/list/erase
The important part if tl;dr:


What does The Bible say:


Usage example: http://ideone.com/YvWGeU

Do you feel enlightened?

No I do not feel enlightened. Because you are neglecting the indexing part. Yes, the actual removal of the node is constant, but that requires the iterator to be pointing at the correct node. That indexing is a linear search. The actual time for erasing an arbitrary element of a Linked List is O(n) + O(1).

I believe your original comment was that list could be implemented as contiguous array. I cited the reason why it cannot.

List traversal is not part of the removal, and that's what we're talking about. As I said before, if you need to traverse the list just to remove some of its elements, you need to rethink your design, because list isn't the container you want.