blob: 4b080f2b0948a705a26d5f34b4ebfbe3e28903ca (
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
|
/*************************************************************************
*
* 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: cross_refs.hxx,v $
* $Revision: 1.3 $
*
* 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 ARY_CROSS_REFS_HXX
#define ARY_CROSS_REFS_HXX
// USED SERVICES
// BASE CLASSES
// COMPONENTS
// PARAMETERS
#include "sorted_idset.hxx"
template <class VALUE_LIST, class TYPES>
class CrossReferences
{
public:
typedef TYPES::element_type element;
/// Checks for double occurences
void Add(
VALUE_LIST::index_type
i_nPosition
const element & i_rElem );
void Get_List(
Dyn_StdConstIterator<element> &
o_rResult ) const;
private:
SortedIdSet<TYPES> aData[VALUE_LIST::max];
};
namespace ary
{
template <class TYPES>
class SortedIdSet
{
public:
typedef typename TYPES::element_type element;
typedef typename TYPES::sort_type sorter;
typedef typename TYPES::find_type finder;
SortedIdSet(
const finder & i_rFinder )
: aSorter(i_rFinder),
aData(aSorter) {}
~SortedIdSet() {}
void Get_Begin(
Dyn_StdConstIterator<element> &
o_rResult )
{ o_rResult = new SCI_Set<FINDER>(aData); }
void Add(
const element & i_rElement )
{ aData.insert(i_rElement); }
private:
typedef std::set<element, sorter> Set;
// DATA
sorter aSorter;
Set aData;
};
} // namespace ary
#endif
|
