8extern node Nodes[TOTAL_NODES];
9typedef unsigned int uint;
14 int *m_pExpression[MAX_TREES], *m_pEdited;
15 uint m_iExprSize, m_iEditSize;
16 double m_pTermValues[TERMINALS+OFFSET];
17 double m_dTermValuesArray[TERMINALS+OFFSET][MAX_JOBS];
19 double m_pNodeFreq[TOTAL_NODES];
21 uint m_iOffset, m_iEnd;
23 int m_iPosition, m_iEditedPos;
28 void evaluate_array(
double dResult[]);
36 {
for(
int i=0; i<MAX_TREES; i++)
37 m_pExpression[i] = NULL;
39 m_pTermValues[NUL] = 0;
40 m_pTermValues[ONE] = 1;
41 for(
int i=0; i<MAX_JOBS; i++)
42 { m_dTermValuesArray[NUL][i] = 0;
43 m_dTermValuesArray[ONE][i] = 1;
45 m_iTermNum = TERMINALS+OFFSET;
50 {
for(
int i=0; i<MAX_TREES; i++)
51 if(m_pExpression[i] != NULL)
delete [] m_pExpression[i];
52 if(m_pEdited != NULL)
delete [] m_pEdited;
54 void SetExprSize(uint _size)
55 {
for(
int i=0; i<MAX_TREES; i++)
56 {
if(m_pExpression[i] != NULL)
delete [] m_pExpression[i];
57 m_pExpression[i] =
new int[_size];
59 if(m_pEdited != NULL)
delete [] m_pEdited;
60 m_pEdited =
new int[_size];
63 void SetTermArraySize(uint _size)
70 m_iArraySize = m_iEnd = _size;