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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* 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_IDL_NNFINDER_HXX
#define ARY_IDL_NNFINDER_HXX
// USED SERVICES
#include "is_ce.hxx"
namespace ary
{
namespace idl
{
/** Gives context info for tree search functions.
@collab ->ary::Search_SubTree<>()
@collab ->ary::Search_SubTree_UpTillRoot<>()
*/
class Find_ModuleNode
{
public:
typedef Ce_id id_type;
typedef StringVector::const_iterator name_iterator;
// LIFECYCLE
Find_ModuleNode(
const Ce_Storage & i_rStorage,
name_iterator it_begin,
name_iterator it_end,
const String & i_sName )
: rStorage(i_rStorage),
itBegin(it_begin),
itEnd(it_end),
sName2Search(i_sName) { if (itBegin != itEnd ? (*itBegin).empty() : false) ++itBegin; }
// OPERATIONS
const Module * operator()(
id_type i_id ) const
{ return i_id.IsValid()
? & ary_cast<Module>(rStorage[i_id])
: 0; }
name_iterator Begin() const { return itBegin; }
name_iterator End() const { return itEnd; }
const String & Name2Search() const { return sName2Search; }
private:
// DATA
const Ce_Storage & rStorage;
name_iterator itBegin;
name_iterator itEnd;
String sName2Search;
};
class Types_forSetCe_Id
{
public:
typedef Ce_id element_type;
typedef Ce_Storage find_type;
// KORR_FUTURE: Check, if this sorting is right or the ary standard
// sorting should be used.
struct sort_type
{
sort_type(
const find_type & i_rFinder )
: rFinder(i_rFinder) {}
bool operator()(
const element_type &
i_r1,
const element_type &
i_r2 ) const
{
return rFinder[i_r1].LocalName()
< rFinder[i_r2].LocalName();
}
private:
const find_type & rFinder;
};
};
} // namespace idl
} // namespace ary
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
