1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2014 The CodeLite Team
// file name : wx_tree_traverser.cpp
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
#include "wx_tree_traverser.h"
wxTreeTraverser::wxTreeTraverser(wxTreeCtrl* tree)
: m_tree(tree)
{
}
wxTreeTraverser::~wxTreeTraverser()
{
}
void wxTreeTraverser::DoTraverse(const wxTreeItemId& item)
{
if(item.IsOk() == false)
return;
// Call the user callback
OnItem(item);
// Recurse the children
if(m_tree->ItemHasChildren(item)) {
wxTreeItemIdValue cookie;
wxTreeItemId child = m_tree->GetFirstChild(item, cookie);
while ( child.IsOk() ) {
DoTraverse(child);
child = m_tree->GetNextChild(item, cookie);
}
}
}
void wxTreeTraverser::OnItem(const wxTreeItemId& item)
{
}
void wxTreeTraverser::Traverse(const wxTreeItemId& item)
{
DoTraverse(item.IsOk() ? item : m_tree->GetRootItem());
}
|
