wxtreectrl overview

the tree control displays its items in a tree like structure. each item has its own (optional) icon and a label. an item may be either collapsed (meaning that its children are not visible) or expanded (meaning that its children are shown). each item in the tree is identified by its itemid which is of opaque data type wxtreeitemid. you can test whether an item is valid by calling wxtreeitemid::isok.

the items text and image may be retrieved and changed with getitemtext/setitemtext and getitemimage/setitemimage. in fact, an item may even have two images associated with it: the normal one and another one for selected state which is set/retrieved with setitemselectedimage/getitemselectedimage functions, but this functionality might be unavailable on some platforms.

tree items have several attributes: an item may be selected or not, visible or not, bold or not. it may also be expanded or collapsed. all these attributes may be retrieved with the corresponding functions: isselected, isvisible, isbold and isexpanded. only one item at a time may be selected, selecting another one (with selectitem) automatically unselects the previously selected one.

in addition to its icon and label, a user-specific data structure may be associated with all tree items. if you wish to do it, you should derive a class from wxtreeitemdata which is a very simple class having only one function getid() which returns the id of the item this data is associated with. this data will be freed by the control itself when the associated item is deleted (all items are deleted when the control is destroyed), so you shouldn't delete it yourself (if you do it, you should call setitemdata(null) to prevent the tree from deleting the pointer second time). the associated data may be retrieved with getitemdata() function.

working with trees is relatively straightforward if all the items are added to the tree at the moment of its creation. however, for large trees it may be very inefficient. to improve the performance you may want to delay adding the items to the tree until the branch containing the items is expanded: so, in the beginning, only the root item is created (with addroot). other items are added when evt_tree_item_expanding event is received: then all items lying immediately under the item being expanded should be added, but, of course, only when this event is received for the first time for this item - otherwise, the items would be added twice if the user expands/collapses/re-expands the branch.

the tree control provides functions for enumerating its items. there are 3 groups of enumeration functions: for the children of a given item, for the sibling of the given item and for the visible items (those which are currently shown to the user: an item may be invisible either because its branch is collapsed or because it is scrolled out of view). child enumeration functions require the caller to give them a cookie parameter: it is a number which is opaque to the caller but is used by the tree control itself to allow multiple enumerations to run simultaneously (this is explicitly allowed). the only thing to remember is that the cookie passed to getfirstchild and to getnextchild should be the same variable (and that nothing should be done with it by the user code).

among other features of the tree control are: item sorting with sortchildren which uses the user-defined comparison function oncompareitems (by default the comparison is the alphabetic comparison of tree labels), hit testing (determining to which portion of the control the given point belongs, useful for implementing drag-and-drop in the tree) with hittest and editing of the tree item labels in place (see editlabel).

finally, the tree control has a keyboard interface: the cursor navigation (arrow) keys may be used to change the current selection. <home> and <end> are used to go to the first/last sibling of the current item. '+', '-' and '*' expand, collapse and toggle the current branch. note, however, that <del> and <ins> keys do nothing by default, but it is common to associate them with deleting an item from a tree and inserting a new one into it.