blob: 209c4225d80cebd0a40c65282e0e58286ed6f607 (
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
|
/* -*- 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_RSCTREE_HXX
#define INCLUDED_RSC_INC_RSCTREE_HXX
#include <tools/link.hxx>
#include <rsctools.hxx>
class NameNode
{
void SubOrderTree( NameNode * pOrderNode );
protected:
NameNode* pLeft; // left subtree
NameNode* pRight; // right subtree
// pCmp ist Zeiger auf Namen
NameNode* Search( const void * pCmp ) const;
// convert a double linked list into a binary tree
NameNode* ChangeDLListBTree( NameNode * pList );
NameNode();
virtual ~NameNode();
// convert a binary tree in a double linked list
NameNode* ChangeBTreeDLList();
public:
void EnumNodes( Link<const NameNode&,void> aLink ) const;
NameNode* Left() const { return pLeft; }
NameNode* Right() const{ return 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;
// returns the new root
NameNode* Remove( NameNode * );
void OrderTree();
};
class IdNode : public NameNode
{
virtual COMPARE Compare( const NameNode * ) const SAL_OVERRIDE;
virtual COMPARE Compare( const void * ) const SAL_OVERRIDE;
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 SAL_OVERRIDE;
virtual COMPARE Compare( const void * ) const SAL_OVERRIDE;
protected:
using NameNode::Search;
OString m_aName;
public:
StringNode() {}
StringNode(const OString& rStr) { m_aName = rStr; }
StringNode* Search( const char * ) const;
OString GetName() const { return m_aName; }
};
#endif // INCLUDED_RSC_INC_RSCTREE_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
