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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
// DasherNode.cpp
//
// Copyright (c) 2007 David Ward
//
// This file is part of Dasher.
//
// Dasher 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.
//
// Dasher is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with Dasher; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
#include "../Common/Common.h"
// #include "AlphabetManager.h" - doesnt seem to be required - pconlon
#include "DasherInterfaceBase.h"
using namespace Dasher;
using namespace Opts;
using namespace std;
// Track memory leaks on Windows to the line that new'd the memory
#ifdef _WIN32
#ifdef _DEBUG
#define DEBUG_NEW new( _NORMAL_BLOCK, THIS_FILE, __LINE__ )
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
#endif
static int iNumNodes = 0;
int Dasher::currentNumNodeObjects() {return iNumNodes;}
//TODO this used to be inline - should we make it so again?
CDasherNode::CDasherNode(int iOffset, int iColour, CDasherScreen::Label *pLabel)
: m_pParent(NULL), m_iFlags(DEFAULT_FLAGS), onlyChildRendered(NULL), m_iLbnd(0), m_iHbnd(CDasherModel::NORMALIZATION), m_iOffset(iOffset), m_iColour(iColour), m_pLabel(pLabel) {
iNumNodes++;
}
// TODO: put this back to being inlined
CDasherNode::~CDasherNode() {
// std::cout << "Deleting node: " << this << std::endl;
// Release any storage that the node manager has allocated,
// unreference ref counted stuff etc.
Delete_children();
// std::cout << "done." << std::endl;
iNumNodes--;
}
void CDasherNode::Trace() const {
/* TODO sort out
dchar out[256];
if (m_Symbol)
wsprintf(out,TEXT("%7x %3c %7x %5d %7x %5d %8x %8x \n"),this,m_Symbol,m_iGroup,m_context,m_Children,m_Cscheme,m_iLbnd,m_iHbnd);
else
wsprintf(out,TEXT("%7x %7x %5d %7x %5d %8x %8x \n"),this,m_iGroup,m_context,m_Children,m_Cscheme,m_iLbnd,m_iHbnd);
OutputDebugString(out);
if (m_Children) {
unsigned int i;
for (i=1;i<m_iChars;i++)
m_Children[i]->Dump_node();
}
*/
}
void CDasherNode::GetContext(CDasherInterfaceBase *pInterface, const CAlphabetMap *pAlphabet, vector<symbol> &vContextSymbols, int iOffset, int iLength) {
if (!GetFlag(NF_SEEN)) {
DASHER_ASSERT(m_pParent);
if (m_pParent) m_pParent->GetContext(pInterface, pAlphabet, vContextSymbols, iOffset,iLength);
} else {
std::string strContext = pInterface->GetContext(iOffset, iLength);
pAlphabet->GetSymbols(vContextSymbols, strContext);
}
}
// kill ourselves and all other children except for the specified
// child
// FIXME this probably shouldn't be called after history stuff is working
void CDasherNode::OrphanChild(CDasherNode *pChild) {
DASHER_ASSERT(ChildCount() > 0);
ChildMap::const_iterator i;
for(i = GetChildren().begin(); i != GetChildren().end(); i++) {
if((*i) != pChild) {
(*i)->Delete_children();
delete (*i);
}
}
pChild->m_pParent=NULL;
Children().clear();
SetFlag(NF_ALLCHILDREN, false);
}
// Delete nephews of the child which has the specified symbol
// TODO: Need to allow for subnode
void CDasherNode::DeleteNephews(CDasherNode *pChild) {
DASHER_ASSERT(Children().size() > 0);
ChildMap::iterator i;
for(i = Children().begin(); i != Children().end(); i++) {
if(*i != pChild) {
(*i)->Delete_children();
}
}
}
// TODO: Need to allow for subnodes
// TODO: Incorporate into above routine
void CDasherNode::Delete_children() {
// std::cout << "Start: " << this << std::endl;
ChildMap::iterator i;
for(i = Children().begin(); i != Children().end(); i++) {
// std::cout << "CNM: " << (*i)->MgrID() << (*i) << " " << (*i)->Parent() << std::endl;
delete (*i);
}
Children().clear();
// std::cout << "NM: " << MgrID() << std::endl;
SetFlag(NF_ALLCHILDREN, false);
onlyChildRendered = NULL;
}
void CDasherNode::SetFlag(int iFlag, bool bValue) {
if(bValue)
m_iFlags = m_iFlags | iFlag;
else
m_iFlags = m_iFlags & (~iFlag);
}
void CDasherNode::Reparent(CDasherNode *pNewParent, unsigned int iLbnd, unsigned int iHbnd) {
DASHER_ASSERT(!m_pParent);
DASHER_ASSERT(pNewParent);
DASHER_ASSERT(!pNewParent->GetFlag(NF_ALLCHILDREN));
DASHER_ASSERT(iLbnd == (pNewParent->GetChildren().empty() ? 0 : pNewParent->GetChildren().back()->m_iHbnd));
m_pParent = pNewParent;
pNewParent->Children().push_back(this);
m_iLbnd = iLbnd;
m_iHbnd = iHbnd;
}
int CDasherNode::MostProbableChild() {
int iMax(0);
int iCurrent;
for(ChildMap::iterator it(m_mChildren.begin()); it != m_mChildren.end(); ++it) {
iCurrent = (*it)->Range();
if(iCurrent > iMax)
iMax = iCurrent;
}
return iMax;
}
bool CDasherNode::GameSearchChildren(symbol sym) {
for (ChildMap::iterator i = Children().begin(); i != Children().end(); i++) {
if ((*i)->GameSearchNode(sym)) return true;
}
return false;
}
|
