what stl data structure to use

Hello,

I'm having diffculties to find the right data structure for me

I have a structure with 5 fields

lets say

struct myStruct
{

int iField1;
int iField2;
int iField3;
int iField4;
string sField5;
};

I need some kind of data structure that will hold unknown numbers of elements of myStruct

and I need to have each fields as a key field

If I have only 1 field as the key
I would have used hash_map

for example if the key is iField1

then I would have used hash_map with int as key and with myStruct as the data

I need to be able to have 5 keys (and return the correct element according to 1 of them, meaning the key is not combination of them, but each one of them should be able to retrive the correct element)

Thanks
avi

Use vector<const myStruct> to store the data.
Use map<int,const myStruct&> to store an index that points to the correct value of myStruct for each value of iField1.
Use another map for each additional index.

Adding and deleting myStructs will be some work. Updateing even more, so I recommend implementing it as delete+insert (thus the const).

thanks for the advice!

And, if you can, wrap the vector and maps up in another class to make the whole thing easier to use. E.g.

Code:

---

class my_container
{
public:
    void add(const myStruct& s)
    {
        // push_back to the vector, update the maps, etc.
    }

    // other functions for getting at the data

private:
    std::vector<myStruct> structs_;
    std::map<int, myStruct*> map1_;
    // etc for the other maps
};

---

why would this be better than building a linked list with pointers to the next index by each field ie:

Code:

---

class LInkList
{
  public:
  //blah blah
  int add();
  int field1next();
  int filed1index(int i);
  ...

  private:
  int iField1;
  int iField2;
  int iField3;
  int iField4;
  string sField5;
 
  LInkList * myfield1next;
  ...
};

---