// Licence: wxWindows licence
///////////////////////////////////////////////////////////////////////////////
-#ifdef __GNUG__
-#pragma implementation "wxtree.h"
-#endif
-
// For compilers that support precompilation, includes "wx.h".
#include "wx/wxprec.h"
m_ySpacing = 20;
m_topMargin = 5;
m_leftMargin = 5;
- m_orientation = FALSE;
+ m_orientation = false;
m_parentNode = 0;
}
void wxTreeLayout::DoLayout(wxDC& dc, long topId)
{
- if (topId != -1)
+ if (topId != wxID_ANY)
SetTopNode(topId);
long actualTopId = GetTopNode();
long id = actualTopId;
- while (id != -1)
+ while (id != wxID_ANY)
{
SetNodeX(id, 0);
SetNodeY(id, 0);
- ActivateNode(id, FALSE);
+ ActivateNode(id, false);
id = GetNextNode(id);
}
m_lastY = m_topMargin;
void wxTreeLayout::DrawNodes(wxDC& dc)
{
long id = GetTopNode();
- while (id != -1)
+ while (id != wxID_ANY)
{
if (NodeActive(id))
DrawNode(id, dc);
void wxTreeLayout::DrawBranches(wxDC& dc)
{
long id = GetTopNode();
- while (id != -1)
+ while (id != wxID_ANY)
{
- if (GetNodeParent(id) > -1)
+ if (GetNodeParent(id) != wxID_ANY)
{
long parent = GetNodeParent(id);
if (NodeActive(parent))
GetChildren(nodeId, children);
int n = children.GetCount();
- if (m_orientation == FALSE)
+ if (m_orientation == false)
{
// Left to right
// X Calculations
long x = 0;
long y = 0;
long parentId = GetNodeParent(nodeId);
- if (parentId != -1)
+ if (parentId != wxID_ANY)
GetNodeSize(parentId, &x, &y, dc);
SetNodeX(nodeId, (long)(GetNodeX(parentId) + m_xSpacing + x));
}
- wxNode *node = children.GetFirst();
+ wxList::compatibility_iterator node = children.GetFirst();
while (node)
{
CalcLayout((long)node->GetData(), level+1, dc);
// Y Calculations
long averageY;
- ActivateNode(nodeId, TRUE);
+ ActivateNode(nodeId, true);
if (n > 0)
{
long x = 0;
long y = 0;
long parentId = GetNodeParent(nodeId);
- if (parentId != -1)
+ if (parentId != wxID_ANY)
GetNodeSize(parentId, &x, &y, dc);
SetNodeY(nodeId, (long)(GetNodeY(parentId) + m_ySpacing + y));
}
- wxNode *node = children.GetFirst();
+ wxList::compatibility_iterator node = children.GetFirst();
while (node)
{
CalcLayout((long)node->GetData(), level+1, dc);
// X Calculations
long averageX;
- ActivateNode(nodeId, TRUE);
+ ActivateNode(nodeId, true);
if (n > 0)
{
for (i = 0; i < n; i++)
{
m_nodes[i].m_name = wxT("");
- m_nodes[i].m_active = FALSE;
- m_nodes[i].m_parentId = -1;
+ m_nodes[i].m_active = false;
+ m_nodes[i].m_parentId = wxID_ANY;
m_nodes[i].m_x = 0;
m_nodes[i].m_y = 0;
}
{
i = parent;
}
- else
+ else
{
m_parentNode = m_num;
}
-
+
m_nodes[m_num].m_parentId = i;
m_nodes[m_num].m_name = name;
m_nodes[m_num].m_x = m_nodes[m_num].m_y = 0;
m_nodes[m_num].m_clientData = 0;
m_num ++;
-
+
return (m_num - 1);
}
else
void wxTreeLayoutStored::GetChildren(long id, wxList& list)
{
long currentId = GetTopNode();
- while (currentId != -1)
+ while (currentId != wxID_ANY)
{
if (id == GetNodeParent(currentId))
list.Append((wxObject *)currentId);
long wxTreeLayoutStored::GetNodeParent(long id)
{
- if (id != -1)
+ if (id != wxID_ANY)
{
wxASSERT(id < m_num);
return m_nodes[id].m_parentId;
}
else
- return -1;
+ return wxNOT_FOUND;
}
long wxTreeLayoutStored::GetNextNode(long id)
{
wxASSERT(id < m_num);
- if ((id != -1) && (id < (m_num - 1)))
+ if ((id != wxID_ANY) && (id < (m_num - 1)))
return id + 1;
else
- return -1;
+ return wxNOT_FOUND;
}
void wxTreeLayoutStored::SetClientData(long id, long clientData)