class/program design

I have class where I have settings stored.
Theres also another class session that reads data from previous class (it reads settings).

Class settings contains a list of available servers, which is needed by session class. Im unsure how should I store information in session class that needs to know which the previous server in a list was (so it can move to the next in a list when its needed).

Should I store current_server variable with an iterator? Im unsure if they are suitable for this kind of purposes. Should it be better to store the server with an integer (the number in the list)?



Next thing is that server list in settings class can be updated. I guess the best approach would be to inform session class that server list was updated, so that current_server is set to the first in the list.

Does anyone have a better idea how to implement this?

Thanks for help

a standalone class called settings sounds like a bad design choice. Settings for what..?

You shouldn't store iterators as class members, since any modification of the list may invalidate the iterator. Aside from which, details like this should be hidden away from the outside world (storing pointers or iterators to implementation details of other classes is quite a breach of encapsulation)

Are all the settings applicable to a session? if so, how about storing a settings member inside your session class?

if you have certain settings which aren't relevent to a session, then you should consider seperating out those settings to a different class, otherwise the interaction between objects is likely to get messy.

In case I decide to store settings needed by session class inside this class, I still have to store current_server variable in the class (different functions need this data)..

Still I wonder what would be the best way to know the position of current server in the list?

Quote:

---

Still I wonder what would be the best way to know the position of current server in the list?

---

How do you decide which server to use? Perhaps you can just use std::stack or std::queue.

Quote:

---

Originally Posted by laserlight

How do you decide which server to use?

---

By order.. It starts with the first one, when the work is done it moves to the next one and so on.. When it comes to the end of the list should go back to the first one..

Quote:

---

Originally Posted by laserlight

Perhaps you can just use std::stack or std::queue.

---

Is there any container in which data will remain after calling function pop()? Queue and stack destroy element/item after pop();

That's the whole point of pop().

What you want is a list rotate, right?

Quote:

---

Originally Posted by CornedBee

What you want is a list rotate, right?

---

Yes.

Basically you want a list of data the rotates around, once it hits the end it goes back to the begining? If thats the case a circular linked list might do the trick.

Or just a pop_front followed by a push_back, and always using the front element of the list.

You could use a queue for that. Just push every element you pop back into the queue.

Quote:

---

Originally Posted by CornedBee

Or just a pop_front followed by a push_back, and always using the front element of the list.

You could use a queue for that. Just push every element you pop back into the queue.

---

That sounds like a good solution. However, I thought there should be a std container for this purpose.