Re: Data Structure for a Menu Tree
On 5 Jun., 20:26, Travis <travis.bow...@gmail.com> wrote:
On Jun 5, 10:35 am, kwikius <a...@servocomm.freeserve.co.uk> wrote:
On 5 Jun, 16:58, Travis <travis.bow...@gmail.com> wrote:
Is there a community accepted best way to store a menu tree for an
interface in a data structure. Ideally I would like something that
searches fast so given a menu structure like this
File
/ | \
/ | \
Print Exit Edit
/ \
Copy Paste
as an example, I could easily get a pointer to the "Edit" node.
Its basically a directory tree e.g like a disc file system. Use a path
string to identify/return the required node etc ( and can add similar
complexities e.g absolute relative) but there is no standard library
way. AFAIK speed is not critical even for large menus though.
regards
Andy Little
Could you elaborate a litlte more on the string path setup? I assume
you mean something like "File\Edit\Paste". Which sounds good but how
do I store these all together? And how does "File\Edit" know that "File
\Edit\Paste" and "..\Copy" are its children?
What he meant is using the path string to access the elements in an
easy way.
You'll still have to use an internal tree structure.
Here is a very basic example of how you could implement the tree (Many
stuff like destructors, getters, setters, ... missing):
class MenuEntry {
public:
vector<MenuEntry*> childs;
string name;
MenuEntry(string name) {
this->name = name;
}
};
To create a menu tree:
MenuEntry* root = new MenuEntry("<root>");
MenuEntry* file = new MenuEntry("File");
MenuEntry* edit = new MenuEntry("Edit");
file->childs.push_back(new MenuEntry("Print");
file->childs.push_back(new MenuEntry("Exit");
edit->childs.push_back(new MenuEntry("Copy");
edit->childs.push_back(new MenuEntry("Paste");
root.childs.push_back(file);
root.childs.push_back(edit);