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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2008 by Eran Ifrah
// file name : tag_tree.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 "precompiled_header.h"
#include "tag_tree.h"
#include "tokenizer.h"
#ifdef __VISUALC__
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
#endif
TagTree::TagTree(const wxString& key, const TagEntry& data)
: Tree<wxString, TagEntry>(key, data)
{
}
TagTree::~TagTree()
{
}
/// Util function to help us to build a tree from tags
TagNode* TagTree::AddEntry(TagEntry& tag)
{
// If a node with thig tag already exist, we simply updating the
// data
wxString key(tag.Key());
TagNode* newNode = Find(key);
if( newNode )
{
if( tag.IsOk() )
newNode->SetData(tag);
return newNode;
}
// To add an entry to the tree, we first must make sure
// that all path to it exist
wxString name = tag.GetPath();
StringTokenizer tok(name, wxT("::"));
wxString parentPath;
TagNode* node = GetRoot();
TagNode* lastFoundNode = GetRoot();
for(int i=0; i<tok.Count()-1; i++)
{
parentPath += tok[i];
// Try to find this node in the tree
node = Find(parentPath);
if( !node )
{
// Node does not exist add it, we copy key values
// from 'tag'
TagEntry ee;
ee.SetPath(parentPath);
ee.SetName(tok[i]);
node = AddChild(parentPath, ee, lastFoundNode);
}
lastFoundNode = node;
if(i < tok.Count()-2)
parentPath += _T("::");
}
return AddChild(key, tag, node);
}
|
