[wxWidgets.git] / src / generic / treelay.cpp

///////////////////////////////////////////////////////////////////////////////
// Name:        treelay.h
// Purpose:     wxTreeLayout class
// Author:      Julian Smart
// Modified by:
// Created:     7/4/98
// RCS-ID:      $Id$
// Copyright:   (c) 1998 Julian Smart
// Licence:     wxWindows licence
///////////////////////////////////////////////////////////////////////////////

#ifdef __GNUG__
#pragma implementation "wxtree.h"
#endif

// For compilers that support precompilation, includes "wx.h".
#include "wx/wxprec.h"

#ifdef __BORLANDC__
#pragma hdrstop
#endif

#ifndef WX_PRECOMP
#include "wx/dc.h"
#include "wx/event.h"
#endif

#if wxUSE_TREELAYOUT

#include "wx/treelay.h"

/*
 * Abstract tree
 *
 */

IMPLEMENT_ABSTRACT_CLASS(wxTreeLayout, wxObject)

wxTreeLayout::wxTreeLayout()
{
    m_xSpacing = 16;
    m_ySpacing = 20;
    m_topMargin = 5;
    m_leftMargin = 5;
    m_orientation = FALSE;
    m_parentNode = 0;
}

void wxTreeLayout::DoLayout(wxDC& dc, long topId)
{
    if (topId != -1)
        SetTopNode(topId);

    long actualTopId = GetTopNode();
    long id = actualTopId;
    while (id != -1)
    {
        SetNodeX(id, 0);
        SetNodeY(id, 0);
        ActivateNode(id, FALSE);
        id = GetNextNode(id);
    }
    m_lastY = m_topMargin;
    m_lastX = m_leftMargin;
    CalcLayout(actualTopId, 0, dc);
}

void wxTreeLayout::Draw(wxDC& dc)
{
    dc.Clear();
    DrawBranches(dc);
    DrawNodes(dc);
}

void wxTreeLayout::DrawNodes(wxDC& dc)
{
    long id = GetTopNode();
    while (id != -1)
    {
        if (NodeActive(id))
            DrawNode(id, dc);
        id = GetNextNode(id);
    }
}

void wxTreeLayout::DrawBranches(wxDC& dc)
{
    long id = GetTopNode();
    while (id != -1)
    {
        if (GetNodeParent(id) > -1)
        {
            long parent = GetNodeParent(id);
            if (NodeActive(parent))
                DrawBranch(parent, id, dc);
        }
        id = GetNextNode(id);
    }
}

void wxTreeLayout::DrawNode(long id, wxDC& dc)
{
    wxChar buf[80];
    wxString name(GetNodeName(id));
    if (name != wxT(""))
        wxSprintf(buf, wxT("%s"), (const wxChar*) name);
    else
        wxSprintf(buf, wxT("<unnamed>"));

    long x = 80;
    long y = 20;
    dc.GetTextExtent(buf, &x, &y);
    dc.DrawText(buf, GetNodeX(id), (long)(GetNodeY(id) - (y/2.0)));
}

void wxTreeLayout::DrawBranch(long from, long to, wxDC& dc)
{
    long w, h;
    GetNodeSize(from, &w, &h, dc);
    dc.DrawLine(GetNodeX(from)+w, GetNodeY(from),
        GetNodeX(to), GetNodeY(to));
}

void wxTreeLayout::Initialize(void)
{
}

void wxTreeLayout::GetNodeSize(long id, long *x, long *y, wxDC& dc)
{
    wxString name(GetNodeName(id));
    if (name != wxT(""))
        dc.GetTextExtent(name, x, y);
    else
    {
        *x = 70; *y = 20;
    }
}

void wxTreeLayout::CalcLayout(long nodeId, int level, wxDC& dc)
{
    wxList children;
    GetChildren(nodeId, children);
    int n = children.Number();

    if (m_orientation == FALSE)
    {
        // Left to right
        // X Calculations
        if (level == 0)
            SetNodeX(nodeId, m_leftMargin);
        else
        {
            long x = 0;
            long y = 0;
            long parentId = GetNodeParent(nodeId);
            if (parentId != -1)
                GetNodeSize(parentId, &x, &y, dc);
            SetNodeX(nodeId, (long)(GetNodeX(parentId) + m_xSpacing + x));
        }

        wxNode *node = children.First();
        while (node)
        {
            CalcLayout((long)node->Data(), level+1, dc);
            node = node->Next();
        }

        // Y Calculations
        long averageY;
        ActivateNode(nodeId, TRUE);

        if (n > 0)
        {
            averageY = 0;
            node = children.First();
            while (node)
            {
                averageY += GetNodeY((long)node->Data());
                node = node->Next();
            }
            averageY = averageY / n;
            SetNodeY(nodeId, averageY);
        }
        else
        {
            SetNodeY(nodeId, m_lastY);
            long x, y;
            GetNodeSize(nodeId, &x, &y, dc);

            m_lastY = m_lastY + y + m_ySpacing;
        }
    }
    else
    {
        // Top to bottom

        // Y Calculations
        if (level == 0)
            SetNodeY(nodeId, m_topMargin);
        else
        {
            long x = 0;
            long y = 0;
            long parentId = GetNodeParent(nodeId);
            if (parentId != -1)
                GetNodeSize(parentId, &x, &y, dc);
            SetNodeY(nodeId, (long)(GetNodeY(parentId) + m_ySpacing + y));
        }

        wxNode *node = children.First();
        while (node)
        {
            CalcLayout((long)node->Data(), level+1, dc);
            node = node->Next();
        }

        // X Calculations
        long averageX;
        ActivateNode(nodeId, TRUE);

        if (n > 0)
        {
            averageX = 0;
            node = children.First();
            while (node)
            {
                averageX += GetNodeX((long)node->Data());
                node = node->Next();
            }
            averageX = averageX / n;
            SetNodeX(nodeId, averageX);
        }
        else
        {
            SetNodeX(nodeId, m_lastX);
            long x, y;
            GetNodeSize(nodeId, &x, &y, dc);

            m_lastX = m_lastX + x + m_xSpacing;
        }
    }
}

/*
 * Tree with storage
 *
 */

IMPLEMENT_DYNAMIC_CLASS(wxTreeLayoutStored, wxTreeLayout)

wxTreeLayoutStored::wxTreeLayoutStored(int n):wxTreeLayout()
{
    m_nodes = NULL;
    m_maxNodes = 0;
    Initialize(n);
}

wxTreeLayoutStored::~wxTreeLayoutStored(void)
{
    if (m_nodes)
        delete[] m_nodes;
}

void wxTreeLayoutStored::Initialize(int n)
{
    m_maxNodes = n;
    wxTreeLayout::Initialize();
    if (m_nodes) delete[] m_nodes;
    m_nodes = new wxStoredNode[m_maxNodes];
    int i;
    for (i = 0; i < n; i++)
    {
        m_nodes[i].m_name = "";
        m_nodes[i].m_active = FALSE;
        m_nodes[i].m_parentId = -1;
        m_nodes[i].m_x = 0;
        m_nodes[i].m_y = 0;
    }
    m_num = 0;
}

long wxTreeLayoutStored::AddChild(const wxString& name, const wxString& parent)
{
    if (m_num < (m_maxNodes -1 ))
    {
        long i = -1;
        if (parent != wxT(""))
            i = NameToId(parent);
        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
        return -1;
}

long wxTreeLayoutStored::NameToId(const wxString& name)
{
    long i;
    for (i = 0; i < m_num; i++)
        if (name == m_nodes[i].m_name)
            return i;
        return -1;
}

void wxTreeLayoutStored::GetChildren(long id, wxList& list)
{
    long currentId = GetTopNode();
    while (currentId != -1)
    {
        if (id == GetNodeParent(currentId))
            list.Append((wxObject *)currentId);
        currentId = GetNextNode(currentId);
    }
}

wxStoredNode* wxTreeLayoutStored::GetNode(long idx) const
{
    wxASSERT(idx < m_num);

    return &m_nodes[idx];
};

long wxTreeLayoutStored::GetNodeX(long id)
{
    wxASSERT(id < m_num);

    return (long)m_nodes[id].m_x;
}

long wxTreeLayoutStored::GetNodeY(long id)
{
    wxASSERT(id < m_num);

    return (long)m_nodes[id].m_y;
}

void wxTreeLayoutStored::SetNodeX(long id, long x)
{
    wxASSERT(id < m_num);

    m_nodes[id].m_x = (int)x;
}

void wxTreeLayoutStored::SetNodeY(long id, long y)
{
    wxASSERT(id < m_num);

    m_nodes[id].m_y = (int)y;
}

void wxTreeLayoutStored::SetNodeName(long id, const wxString& name)
{
    wxASSERT(id < m_num);

    m_nodes[id].m_name = name;
}

wxString wxTreeLayoutStored::GetNodeName(long id)
{
    wxASSERT(id < m_num);

    return m_nodes[id].m_name;
}

long wxTreeLayoutStored::GetNodeParent(long id)
{
    if (id != -1)
    {
        wxASSERT(id < m_num);

        return m_nodes[id].m_parentId;
    }
    else
        return -1;
}

long wxTreeLayoutStored::GetNextNode(long id)
{
    wxASSERT(id < m_num);

    if ((id != -1) && (id < (m_num - 1)))
        return id + 1;
    else
        return -1;
}

void wxTreeLayoutStored::SetClientData(long id, long clientData)
{
    wxASSERT(id < m_num);

    m_nodes[id].m_clientData = clientData;
}

long wxTreeLayoutStored::GetClientData(long id) const
{
    wxASSERT(id < m_num);

    return m_nodes[id].m_clientData;
}

void wxTreeLayoutStored::ActivateNode(long id, bool active)
{
    wxASSERT(id < m_num);

    m_nodes[id].m_active = active;
}

bool wxTreeLayoutStored::NodeActive(long id)
{
    wxASSERT(id < m_num);

    return m_nodes[id].m_active;
}

wxString wxTreeLayoutStored::HitTest(wxMouseEvent& event, wxDC& dc)
{
    wxPoint pt = event.GetPosition();
    wxCoord x = pt.x;
    wxCoord y = pt.y;

    int i;
    for (i = 0; i < m_maxNodes; i++)
    {
        long width, height;
        dc.GetTextExtent(m_nodes[i].m_name, &width, &height);

        if ( (x >= (m_nodes[i].m_x-10)) && (x < (m_nodes[i].m_x + width+10)) &&
            (y >= m_nodes[i].m_y-10) && (y < (m_nodes[i].m_y + height+10)) )
        {
            return m_nodes[i].m_name;
        }
    }

    return wxString("");
}

#endif
    // wxUSE_TREELAYOUT
Commit	Line	Data
babc9758 JS	1	///////////////////////////////////////////////////////////////////////////////
	2	// Name: treelay.h
	3	// Purpose: wxTreeLayout class
	4	// Author: Julian Smart
44845072	5	// Modified by:
babc9758 JS	6	// Created: 7/4/98
	7	// RCS-ID: $Id$
	8	// Copyright: (c) 1998 Julian Smart
	9	// Licence: wxWindows licence
	10	///////////////////////////////////////////////////////////////////////////////
	11
	12	#ifdef __GNUG__
	13	#pragma implementation "wxtree.h"
	14	#endif
	15
	16	// For compilers that support precompilation, includes "wx.h".
44845072	17	#include "wx/wxprec.h"
babc9758 JS	18
	19	#ifdef __BORLANDC__
	20	#pragma hdrstop
	21	#endif
	22
	23	#ifndef WX_PRECOMP
5438a566 VZ	24	#include "wx/dc.h"
5438a566 VZ	25	#include "wx/event.h"
babc9758 JS	26	#endif
	27
	28	#if wxUSE_TREELAYOUT
	29
44845072	30	#include "wx/treelay.h"
babc9758 JS	31
	32	/*
	33	* Abstract tree
	34	*
	35	*/
	36
	37	IMPLEMENT_ABSTRACT_CLASS(wxTreeLayout, wxObject)
	38
	39	wxTreeLayout::wxTreeLayout()
	40	{
	41	m_xSpacing = 16;
	42	m_ySpacing = 20;
	43	m_topMargin = 5;
	44	m_leftMargin = 5;
	45	m_orientation = FALSE;
	46	m_parentNode = 0;
	47	}
	48
	49	void wxTreeLayout::DoLayout(wxDC& dc, long topId)
	50	{
	51	if (topId != -1)
	52	SetTopNode(topId);
44845072	53
babc9758 JS	54	long actualTopId = GetTopNode();
	55	long id = actualTopId;
	56	while (id != -1)
	57	{
	58	SetNodeX(id, 0);
	59	SetNodeY(id, 0);
	60	ActivateNode(id, FALSE);
	61	id = GetNextNode(id);
	62	}
	63	m_lastY = m_topMargin;
	64	m_lastX = m_leftMargin;
	65	CalcLayout(actualTopId, 0, dc);
	66	}
	67
	68	void wxTreeLayout::Draw(wxDC& dc)
	69	{
	70	dc.Clear();
	71	DrawBranches(dc);
	72	DrawNodes(dc);
	73	}
	74
	75	void wxTreeLayout::DrawNodes(wxDC& dc)
44845072	76	{
babc9758 JS	77	long id = GetTopNode();
	78	while (id != -1)
	79	{
	80	if (NodeActive(id))
	81	DrawNode(id, dc);
	82	id = GetNextNode(id);
	83	}
	84	}
	85
	86	void wxTreeLayout::DrawBranches(wxDC& dc)
44845072	87	{
babc9758 JS	88	long id = GetTopNode();
	89	while (id != -1)
	90	{
	91	if (GetNodeParent(id) > -1)
	92	{
	93	long parent = GetNodeParent(id);
	94	if (NodeActive(parent))
	95	DrawBranch(parent, id, dc);
	96	}
	97	id = GetNextNode(id);
	98	}
	99	}
	100
	101	void wxTreeLayout::DrawNode(long id, wxDC& dc)
	102	{
f6bcfd97	103	wxChar buf[80];
babc9758	104	wxString name(GetNodeName(id));
f6bcfd97 BP	105	if (name != wxT(""))
f6bcfd97 BP	106	wxSprintf(buf, wxT("%s"), (const wxChar*) name);
babc9758	107	else
f6bcfd97	108	wxSprintf(buf, wxT("<unnamed>"));
44845072	109
babc9758 JS	110	long x = 80;
	111	long y = 20;
	112	dc.GetTextExtent(buf, &x, &y);
	113	dc.DrawText(buf, GetNodeX(id), (long)(GetNodeY(id) - (y/2.0)));
	114	}
	115
	116	void wxTreeLayout::DrawBranch(long from, long to, wxDC& dc)
	117	{
	118	long w, h;
	119	GetNodeSize(from, &w, &h, dc);
	120	dc.DrawLine(GetNodeX(from)+w, GetNodeY(from),
	121	GetNodeX(to), GetNodeY(to));
	122	}
	123
	124	void wxTreeLayout::Initialize(void)
	125	{
	126	}
	127
	128	void wxTreeLayout::GetNodeSize(long id, long x, long y, wxDC& dc)
	129	{
	130	wxString name(GetNodeName(id));
f6bcfd97	131	if (name != wxT(""))
babc9758 JS	132	dc.GetTextExtent(name, x, y);
	133	else
	134	{
	135	x = 70; y = 20;
	136	}
	137	}
	138
	139	void wxTreeLayout::CalcLayout(long nodeId, int level, wxDC& dc)
	140	{
	141	wxList children;
	142	GetChildren(nodeId, children);
	143	int n = children.Number();
44845072	144
babc9758 JS	145	if (m_orientation == FALSE)
	146	{
	147	// Left to right
	148	// X Calculations
	149	if (level == 0)
	150	SetNodeX(nodeId, m_leftMargin);
	151	else
	152	{
	153	long x = 0;
	154	long y = 0;
	155	long parentId = GetNodeParent(nodeId);
	156	if (parentId != -1)
	157	GetNodeSize(parentId, &x, &y, dc);
	158	SetNodeX(nodeId, (long)(GetNodeX(parentId) + m_xSpacing + x));
	159	}
44845072	160
babc9758 JS	161	wxNode *node = children.First();
	162	while (node)
	163	{
	164	CalcLayout((long)node->Data(), level+1, dc);
	165	node = node->Next();
	166	}
44845072	167
babc9758 JS	168	// Y Calculations
	169	long averageY;
	170	ActivateNode(nodeId, TRUE);
44845072	171
babc9758 JS	172	if (n > 0)
	173	{
	174	averageY = 0;
	175	node = children.First();
	176	while (node)
	177	{
	178	averageY += GetNodeY((long)node->Data());
	179	node = node->Next();
	180	}
	181	averageY = averageY / n;
	182	SetNodeY(nodeId, averageY);
	183	}
	184	else
	185	{
	186	SetNodeY(nodeId, m_lastY);
	187	long x, y;
	188	GetNodeSize(nodeId, &x, &y, dc);
44845072	189
babc9758 JS	190	m_lastY = m_lastY + y + m_ySpacing;
	191	}
	192	}
	193	else
	194	{
	195	// Top to bottom
44845072	196
babc9758 JS	197	// Y Calculations
	198	if (level == 0)
	199	SetNodeY(nodeId, m_topMargin);
	200	else
	201	{
	202	long x = 0;
	203	long y = 0;
	204	long parentId = GetNodeParent(nodeId);
	205	if (parentId != -1)
	206	GetNodeSize(parentId, &x, &y, dc);
	207	SetNodeY(nodeId, (long)(GetNodeY(parentId) + m_ySpacing + y));
	208	}
44845072	209
babc9758 JS	210	wxNode *node = children.First();
	211	while (node)
	212	{
	213	CalcLayout((long)node->Data(), level+1, dc);
	214	node = node->Next();
	215	}
44845072	216
babc9758 JS	217	// X Calculations
	218	long averageX;
	219	ActivateNode(nodeId, TRUE);
44845072	220
babc9758 JS	221	if (n > 0)
	222	{
	223	averageX = 0;
	224	node = children.First();
	225	while (node)
	226	{
	227	averageX += GetNodeX((long)node->Data());
	228	node = node->Next();
	229	}
	230	averageX = averageX / n;
	231	SetNodeX(nodeId, averageX);
	232	}
	233	else
	234	{
	235	SetNodeX(nodeId, m_lastX);
	236	long x, y;
	237	GetNodeSize(nodeId, &x, &y, dc);
44845072	238
babc9758 JS	239	m_lastX = m_lastX + x + m_xSpacing;
	240	}
	241	}
	242	}
	243
	244	/*
	245	* Tree with storage
	246	*
	247	*/
	248
94799627	249	IMPLEMENT_DYNAMIC_CLASS(wxTreeLayoutStored, wxTreeLayout)
babc9758	250
94799627	251	wxTreeLayoutStored::wxTreeLayoutStored(int n):wxTreeLayout()
babc9758 JS	252	{
	253	m_nodes = NULL;
	254	m_maxNodes = 0;
	255	Initialize(n);
	256	}
	257
94799627	258	wxTreeLayoutStored::~wxTreeLayoutStored(void)
babc9758 JS	259	{
	260	if (m_nodes)
	261	delete[] m_nodes;
	262	}
	263
94799627	264	void wxTreeLayoutStored::Initialize(int n)
babc9758 JS	265	{
	266	m_maxNodes = n;
	267	wxTreeLayout::Initialize();
	268	if (m_nodes) delete[] m_nodes;
	269	m_nodes = new wxStoredNode[m_maxNodes];
	270	int i;
	271	for (i = 0; i < n; i++)
	272	{
	273	m_nodes[i].m_name = "";
	274	m_nodes[i].m_active = FALSE;
	275	m_nodes[i].m_parentId = -1;
	276	m_nodes[i].m_x = 0;
	277	m_nodes[i].m_y = 0;
	278	}
	279	m_num = 0;
	280	}
	281
94799627	282	long wxTreeLayoutStored::AddChild(const wxString& name, const wxString& parent)
babc9758 JS	283	{
	284	if (m_num < (m_maxNodes -1 ))
	285	{
	286	long i = -1;
f6bcfd97	287	if (parent != wxT(""))
babc9758 JS	288	i = NameToId(parent);
babc9758 JS	289	else m_parentNode = m_num;
44845072	290
babc9758 JS	291	m_nodes[m_num].m_parentId = i;
	292	m_nodes[m_num].m_name = name;
	293	m_nodes[m_num].m_x = m_nodes[m_num].m_y = 0;
	294	m_nodes[m_num].m_clientData = 0;
	295	m_num ++;
44845072	296
babc9758 JS	297	return (m_num - 1);
	298	}
	299	else
	300	return -1;
	301	}
	302
94799627	303	long wxTreeLayoutStored::NameToId(const wxString& name)
babc9758 JS	304	{
	305	long i;
	306	for (i = 0; i < m_num; i++)
	307	if (name == m_nodes[i].m_name)
	308	return i;
	309	return -1;
	310	}
	311
94799627	312	void wxTreeLayoutStored::GetChildren(long id, wxList& list)
babc9758 JS	313	{
	314	long currentId = GetTopNode();
	315	while (currentId != -1)
	316	{
	317	if (id == GetNodeParent(currentId))
	318	list.Append((wxObject *)currentId);
	319	currentId = GetNextNode(currentId);
	320	}
	321	}
	322
94799627	323	wxStoredNode* wxTreeLayoutStored::GetNode(long idx) const
babc9758 JS	324	{
babc9758 JS	325	wxASSERT(idx < m_num);
44845072	326
babc9758 JS	327	return &m_nodes[idx];
	328	};
	329
94799627	330	long wxTreeLayoutStored::GetNodeX(long id)
babc9758 JS	331	{
babc9758 JS	332	wxASSERT(id < m_num);
44845072	333
babc9758 JS	334	return (long)m_nodes[id].m_x;
	335	}
	336
94799627	337	long wxTreeLayoutStored::GetNodeY(long id)
babc9758 JS	338	{
babc9758 JS	339	wxASSERT(id < m_num);
44845072	340
babc9758 JS	341	return (long)m_nodes[id].m_y;
	342	}
	343
94799627	344	void wxTreeLayoutStored::SetNodeX(long id, long x)
babc9758 JS	345	{
babc9758 JS	346	wxASSERT(id < m_num);
44845072	347
babc9758 JS	348	m_nodes[id].m_x = (int)x;
	349	}
	350
94799627	351	void wxTreeLayoutStored::SetNodeY(long id, long y)
babc9758 JS	352	{
babc9758 JS	353	wxASSERT(id < m_num);
44845072	354
babc9758 JS	355	m_nodes[id].m_y = (int)y;
	356	}
	357
94799627	358	void wxTreeLayoutStored::SetNodeName(long id, const wxString& name)
babc9758 JS	359	{
babc9758 JS	360	wxASSERT(id < m_num);
44845072	361
babc9758 JS	362	m_nodes[id].m_name = name;
	363	}
	364
94799627	365	wxString wxTreeLayoutStored::GetNodeName(long id)
babc9758 JS	366	{
babc9758 JS	367	wxASSERT(id < m_num);
44845072	368
babc9758 JS	369	return m_nodes[id].m_name;
	370	}
	371
94799627	372	long wxTreeLayoutStored::GetNodeParent(long id)
babc9758 JS	373	{
	374	if (id != -1)
	375	{
	376	wxASSERT(id < m_num);
44845072	377
babc9758 JS	378	return m_nodes[id].m_parentId;
	379	}
	380	else
	381	return -1;
	382	}
	383
94799627	384	long wxTreeLayoutStored::GetNextNode(long id)
babc9758 JS	385	{
babc9758 JS	386	wxASSERT(id < m_num);
44845072	387
babc9758 JS	388	if ((id != -1) && (id < (m_num - 1)))
	389	return id + 1;
	390	else
	391	return -1;
	392	}
	393
94799627	394	void wxTreeLayoutStored::SetClientData(long id, long clientData)
babc9758 JS	395	{
babc9758 JS	396	wxASSERT(id < m_num);
44845072	397
babc9758 JS	398	m_nodes[id].m_clientData = clientData;
	399	}
	400
94799627	401	long wxTreeLayoutStored::GetClientData(long id) const
babc9758 JS	402	{
babc9758 JS	403	wxASSERT(id < m_num);
44845072	404
babc9758 JS	405	return m_nodes[id].m_clientData;
	406	}
	407
94799627	408	void wxTreeLayoutStored::ActivateNode(long id, bool active)
babc9758 JS	409	{
babc9758 JS	410	wxASSERT(id < m_num);
44845072	411
babc9758 JS	412	m_nodes[id].m_active = active;
	413	}
	414
94799627	415	bool wxTreeLayoutStored::NodeActive(long id)
babc9758 JS	416	{
babc9758 JS	417	wxASSERT(id < m_num);
44845072	418
babc9758 JS	419	return m_nodes[id].m_active;
	420	}
	421
94799627	422	wxString wxTreeLayoutStored::HitTest(wxMouseEvent& event, wxDC& dc)
babc9758 JS	423	{
	424	wxPoint pt = event.GetPosition();
	425	wxCoord x = pt.x;
	426	wxCoord y = pt.y;
44845072	427
babc9758 JS	428	int i;
	429	for (i = 0; i < m_maxNodes; i++)
	430	{
babc9758 JS	431	long width, height;
babc9758 JS	432	dc.GetTextExtent(m_nodes[i].m_name, &width, &height);
44845072	433
babc9758 JS	434	if ( (x >= (m_nodes[i].m_x-10)) && (x < (m_nodes[i].m_x + width+10)) &&
	435	(y >= m_nodes[i].m_y-10) && (y < (m_nodes[i].m_y + height+10)) )
	436	{
	437	return m_nodes[i].m_name;
	438	}
	439	}
44845072	440
babc9758 JS	441	return wxString("");
	442	}
	443
	444	#endif
	445	// wxUSE_TREELAYOUT