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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <rscclobj.hxx>
#include <rsctop.hxx>
RefNode::RefNode( Atom nTyp ){
pObjBiTree = 0;
nTypNameId = nTyp;
}
sal_uInt32 RefNode::GetId() const
{
return( nTypNameId );
}
sal_Bool RefNode::PutObjNode( ObjNode * pPutObject ){
// insert a node in the b-tree pObjBiTree
// if the node with the same name is in pObjBiTree,
// return sal_False and no insert,
if( pObjBiTree )
return( pObjBiTree->Insert( pPutObject ) );
pObjBiTree = pPutObject;
return( sal_True );
}
ObjNode * RefNode :: GetObjNode( const RscId & rRscId ){
// insert a node in the b-tree pObjBiTree
// if the node with the same name is in pObjBiTree,
// return NULL and no insert,
// if not return the pointer to the Object
if( pObjBiTree )
return( pObjBiTree->Search( rRscId ) );
return( NULL );
}
ObjNode::ObjNode( const RscId & rId, CLASS_DATA pData, sal_uLong lKey ){
pRscObj = pData;
aRscId = rId;
lFileKey = lKey;
}
ObjNode * ObjNode::DelObjNode( RscTop * pClass, sal_uLong nFileKey ){
ObjNode * pRetNode = this;
if( Right() )
pRight = ((ObjNode *)Right())->DelObjNode( pClass, nFileKey );
if( Left() )
pLeft = ((ObjNode *)Left())->DelObjNode( pClass, nFileKey );
if( GetFileKey() == nFileKey ){
if( GetRscObj() ){
pClass->Destroy( RSCINST( pClass, GetRscObj() ) );
rtl_freeMemory( GetRscObj() );
}
pRetNode = (ObjNode *)Right();
if( pRetNode ){
if( Left() )
pRetNode->Insert( (ObjNode *)Left() );
}
else
pRetNode = (ObjNode *)Left();
delete this;
}
return pRetNode;
}
sal_uInt32 ObjNode::GetId() const
{
return( (sal_uInt32)(long)aRscId );
}
sal_Bool ObjNode::IsConsistent()
{
sal_Bool bRet = sal_True;
if( (long)aRscId > 0x7FFF || (long)aRscId < 1 )
{
bRet = sal_False;
}
else
{
if( Left() )
{
if( !((ObjNode *)Left())->IsConsistent() )
bRet = sal_False;
if( ((ObjNode *)Left())->aRscId >= aRscId )
{
bRet = sal_False;
}
};
if( Right() )
{
if( ((ObjNode *)Right())->aRscId <= aRscId )
{
bRet = sal_False;
}
if( !((ObjNode *)Right())->IsConsistent() )
bRet = sal_False;
};
};
return( bRet );
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
