blob: 4893ad3fd292ba427e67f54b60771836ff87d597 (
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
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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: rsctree.hxx,v $
* $Revision: 1.6 $
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _RSCTREE_HXX
#define _RSCTREE_HXX
#include <tools/link.hxx>
#include <rsctools.hxx>
/****************** C L A S S E S ****************************************/
class BiNode
{
protected:
BiNode* pLeft; // left subtree
BiNode* pRight; // right subtree
public:
// Wandelt eine doppelt verkettete Liste in
// einen binaeren Baum um
BiNode * ChangeDLListBTree( BiNode * pList );
BiNode();
virtual ~BiNode();
// Wandelt einen binaeren Baum in eine doppelt
// verkettete Liste um
BiNode* ChangeBTreeDLList();
BiNode * Left() const { return pLeft ; };
BiNode * Right() const{ return pRight ; };
void EnumNodes( Link aLink ) const;
};
/*************************************************************************/
class NameNode : public BiNode
{
void SubOrderTree( NameNode * pOrderNode );
protected:
// pCmp ist Zeiger auf Namen
NameNode* Search( const void * pCmp ) const;
public:
NameNode* Left() const { return (NameNode *)pLeft ; };
NameNode* Right() const{ return (NameNode *)pRight ; };
NameNode* Search( const NameNode * pName ) const;
// insert a new node in the b-tree
BOOL Insert( NameNode * pTN, sal_uInt32 * nDepth );
BOOL Insert( NameNode* pTN );
virtual COMPARE Compare( const NameNode * ) const;
virtual COMPARE Compare( const void * ) const;
NameNode* SearchParent( const NameNode * ) const;
// return ist neue Root
NameNode* Remove( NameNode * );
void OrderTree();
BOOL IsOrderTree() const;
};
/*************************************************************************/
class IdNode : public NameNode
{
virtual COMPARE Compare( const NameNode * ) const;
virtual COMPARE Compare( const void * ) const;
protected:
using NameNode::Search;
public:
IdNode* Search( sal_uInt32 nTypName ) const;
virtual sal_uInt32 GetId() const;
};
/*************************************************************************/
class StringNode : public NameNode
{
virtual COMPARE Compare( const NameNode * ) const;
virtual COMPARE Compare( const void * ) const;
protected:
using NameNode::Search;
ByteString aName;
public:
StringNode(){};
StringNode( const ByteString & rStr ) { aName = rStr; }
StringNode* Search( const char * ) const;
ByteString GetName() const { return aName; }
};
#endif // _RSCTREE_HXX
|
