blob: 2509e579d671ed0537a652b71b2fa6a1d2a229cd (
plain)
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
|
/* -*- 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 .
*/
#ifndef INCLUDED_RSC_INC_RSCCLOBJ_HXX
#define INCLUDED_RSC_INC_RSCCLOBJ_HXX
#include <rsctree.hxx>
#include <rscdef.hxx>
#include <rscall.h>
/******************* O b j N o d e ***************************************/
class ObjNode : public IdNode
{
RscId aRscId; // Id der Resource
CLASS_DATA pRscObj;// pointer to a resourceobject
sal_uLong lFileKey;// Dateischluessel
protected:
using NameNode::Search;
public:
using NameNode::Insert;
ObjNode( const RscId & rId, CLASS_DATA pData, sal_uLong lKey );
ObjNode * DelObjNode( RscTop * pClass, sal_uLong lFileKey );
sal_uInt32 GetId() const SAL_OVERRIDE;
RscId GetRscId() const { return aRscId; }
sal_uLong GetFileKey() const { return lFileKey; };
ObjNode* Search( const RscId &rName ) const //< search the index in the b-tree
{
return static_cast<ObjNode *>(IdNode::Search( rName ));
}
bool Insert( ObjNode* pTN ) //< insert a new node in the b-tree
{
return IdNode::Insert( static_cast<IdNode *>(pTN) );
}
CLASS_DATA GetRscObj() const//< get the Object from this Node
{
return pRscObj;
}
bool IsConsistent();
};
/******************* R e f N o d e ***************************************/
class RefNode : public IdNode
{
Atom nTypNameId; // index of a Name in a hashtabel
protected:
using NameNode::Search;
public:
using NameNode::Insert;
ObjNode* pObjBiTree; // Zeiger auf Objektbaum
RefNode( Atom nTyp );
sal_uInt32 GetId() const SAL_OVERRIDE;
bool Insert( RefNode* pTN ) //< insert a new node in the b-tree
{
return IdNode::Insert( static_cast<IdNode *>(pTN) );
}
bool PutObjNode( ObjNode * pPutObject );
// insert new node in b-tree pObjBiTree
ObjNode * GetObjNode( const RscId &rRscId );
ObjNode * GetObjNode() const
{
// hole pObjBiTree
return pObjBiTree;
}
};
#endif // INCLUDED_RSC_INC_RSCCLOBJ_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
