SetClientObject(tree->GetItemData(item));
}
+wxTreeEvent::wxTreeEvent(wxEventType commandType, int id)
+ : wxNotifyEvent(commandType, id)
+{
+ m_itemOld = 0l;
+ m_editCancelled = false;
+}
+
wxTreeEvent::wxTreeEvent(const wxTreeEvent & event)
: wxNotifyEvent(event)
{
delete m_imageListState;
}
-static void wxGetBestTreeSize(const wxTreeCtrlBase* treeCtrl, const wxTreeItemId& id, wxSize& size)
+static void
+wxGetBestTreeSize(const wxTreeCtrlBase* treeCtrl, wxTreeItemId id, wxSize& size)
{
wxRect rect;
-
- if ( treeCtrl->GetBoundingRect(id, rect, true) )
+
+ if ( treeCtrl->GetBoundingRect(id, rect, true /* just the item */) )
{
- if ( size.x < rect.x + rect.width )
- size.x = rect.x + rect.width;
- if ( size.y < rect.y + rect.height )
- size.y = rect.y + rect.height;
+ // Translate to logical position so we get the full extent
+#if defined(__WXMSW__) && !defined(__WXUNIVERSAL__)
+ rect.x += treeCtrl->GetScrollPos(wxHORIZONTAL);
+ rect.y += treeCtrl->GetScrollPos(wxVERTICAL);
+#endif
+
+ size.IncTo(wxSize(rect.GetRight(), rect.GetBottom()));
}
wxTreeItemIdValue cookie;
for ( wxTreeItemId item = treeCtrl->GetFirstChild(id, cookie);
item.IsOk();
- item = treeCtrl->GetNextChild(item, cookie) )
+ item = treeCtrl->GetNextChild(id, cookie) )
{
wxGetBestTreeSize(treeCtrl, item, size);
}
// this doesn't really compute the total bounding rectangle of all items
// but a not too bad guess of it which has the advantage of not having to
// examine all (potentially hundreds or thousands) items in the control
-
+
if (GetQuickBestSize())
{
for ( wxTreeItemId item = GetRootItem();
}
}
}
- else
- wxGetBestTreeSize(this, GetRootItem(), size);
+ else // use precise, if potentially slow, size computation method
+ {
+ // iterate over all items recursively
+ wxTreeItemId idRoot = GetRootItem();
+ if ( idRoot.IsOk() )
+ wxGetBestTreeSize(this, idRoot, size);
+ }
// need some minimal size even for empty tree
if ( !size.x || !size.y )
size = wxControl::DoGetBestSize();
else
+ {
+ // Add border size
+ size += GetWindowBorderSize();
+
CacheBestSize(size);
+ }
return size;
}
+void wxTreeCtrlBase::ExpandAll()
+{
+ if ( IsEmpty() )
+ return;
+
+ ExpandAllChildren(GetRootItem());
+}
+
+void wxTreeCtrlBase::ExpandAllChildren(const wxTreeItemId& item)
+{
+ // expand this item first, this might result in its children being added on
+ // the fly
+ if ( item != GetRootItem() || !HasFlag(wxTR_HIDE_ROOT) )
+ Expand(item);
+ //else: expanding hidden root item is unsupported and unnecessary
+
+ // then (recursively) expand all the children
+ wxTreeItemIdValue cookie;
+ for ( wxTreeItemId idCurr = GetFirstChild(item, cookie);
+ idCurr.IsOk();
+ idCurr = GetNextChild(item, cookie) )
+ {
+ ExpandAllChildren(idCurr);
+ }
+}
+
+void wxTreeCtrlBase::CollapseAll()
+{
+ if ( IsEmpty() )
+ return;
+
+ CollapseAllChildren(GetRootItem());
+}
+
+void wxTreeCtrlBase::CollapseAllChildren(const wxTreeItemId& item)
+{
+ // first (recursively) collapse all the children
+ wxTreeItemIdValue cookie;
+ for ( wxTreeItemId idCurr = GetFirstChild(item, cookie);
+ idCurr.IsOk();
+ idCurr = GetNextChild(item, cookie) )
+ {
+ CollapseAllChildren(idCurr);
+ }
+
+ // then collapse this element too
+ Collapse(item);
+}
+
+bool wxTreeCtrlBase::IsEmpty() const
+{
+ return !GetRootItem().IsOk();
+}
+
#endif // wxUSE_TREECTRL