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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
/* -*- 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 CHART2_COMMONFUNCTORS_HXX
#define CHART2_COMMONFUNCTORS_HXX
#include <algorithm>
#include <functional>
#include <o3tl/compat_functional.hxx>
#include <rtl/math.hxx>
#include <com/sun/star/uno/Any.hxx>
#include <rtl/ustring.hxx>
#include <com/sun/star/uno/Sequence.hxx>
#include "charttoolsdllapi.hxx"
namespace chart
{
namespace CommonFunctors
{
/** unary function to convert any type T into a ::com::sun::star::uno::Any.
<p>uno::makeAny is an inline function. Thus is cannot be taken directly
(via mem_fun_ptr)</p>
*/
template< typename T >
struct makeAny : public ::std::unary_function< T, ::com::sun::star::uno::Any >
{
::com::sun::star::uno::Any operator() ( const T & aVal )
{
return ::com::sun::star::uno::makeAny( aVal );
}
};
/** unary function to convert ::com::sun::star::uno::Any into a double number.
<p>In case no number can be generated from the Any, NaN (see
rtl::math::SetNAN()) is returned.</p>
*/
struct OOO_DLLPUBLIC_CHARTTOOLS AnyToDouble : public ::std::unary_function< ::com::sun::star::uno::Any, double >
{
double operator() ( const ::com::sun::star::uno::Any & rAny )
{
double fResult;
::rtl::math::setNan( & fResult );
::com::sun::star::uno::TypeClass eClass( rAny.getValueType().getTypeClass() );
if( eClass == ::com::sun::star::uno::TypeClass_DOUBLE )
{
fResult = * reinterpret_cast< const double * >( rAny.getValue() );
}
return fResult;
}
};
/** unary function to convert ::com::sun::star::uno::Any into an
::rtl::OUString.
*/
struct OOO_DLLPUBLIC_CHARTTOOLS AnyToString : public ::std::unary_function< ::com::sun::star::uno::Any, ::rtl::OUString >
{
::rtl::OUString operator() ( const ::com::sun::star::uno::Any & rAny )
{
::com::sun::star::uno::TypeClass eClass( rAny.getValueType().getTypeClass() );
if( eClass == ::com::sun::star::uno::TypeClass_DOUBLE )
{
const double* pDouble = reinterpret_cast< const double * >( rAny.getValue() );
if( ::rtl::math::isNan(*pDouble) )
return ::rtl::OUString();
return ::rtl::math::doubleToUString(
* pDouble,
rtl_math_StringFormat_Automatic,
-1, // use maximum decimal places available
sal_Char( '.' ), // decimal separator
false // do not erase trailing zeros
);
}
else if( eClass == ::com::sun::star::uno::TypeClass_STRING )
{
return * reinterpret_cast< const ::rtl::OUString * >( rAny.getValue() );
}
return ::rtl::OUString();
}
};
/** unary function to convert an ::rtl::OUString into a double number.
<p>For conversion rtl::math::StringToDouble is used.</p>
*/
struct OOO_DLLPUBLIC_CHARTTOOLS OUStringToDouble : public ::std::unary_function< ::rtl::OUString, double >
{
double operator() ( const ::rtl::OUString & rStr )
{
rtl_math_ConversionStatus eConversionStatus;
double fResult = ::rtl::math::stringToDouble( rStr, '.', ',', & eConversionStatus, NULL );
if( eConversionStatus != rtl_math_ConversionStatus_Ok )
::rtl::math::setNan( & fResult );
return fResult;
}
};
/** unary function to convert a double number into an ::rtl::OUString.
<p>For conversion rtl::math::DoubleToOUString is used.</p>
*/
struct OOO_DLLPUBLIC_CHARTTOOLS DoubleToOUString : public ::std::unary_function< double, ::rtl::OUString >
{
::rtl::OUString operator() ( double fNumber )
{
return ::rtl::math::doubleToUString(
fNumber,
rtl_math_StringFormat_Automatic,
-1, // use maximum number of decimal places
static_cast< sal_Char >( '.' ),
false // do not erase trailing zeros
);
}
};
// ================================================================================
/** can be used to find an element with a specific first element in e.g. a
vector of pairs (for searching keys in maps you will of course use map::find)
*/
template< typename First, typename Second >
class FirstOfPairEquals : public ::std::unary_function< ::std::pair< First, Second >, bool >
{
public:
FirstOfPairEquals( const First & aVal )
: m_aValueToCompareWith( aVal )
{}
bool operator() ( const ::std::pair< First, Second > & rElem )
{
return rElem.first == m_aValueToCompareWith;
}
private:
First m_aValueToCompareWith;
};
/** can be used to find a certain value in a map
::std::find_if( aMap.begin(), aMap.end(),
SecondOfPairEquals< string, int >( 42 ));
*/
template< typename Key, typename Value >
class SecondOfPairEquals : public ::std::unary_function< ::std::pair< Key, Value >, bool >
{
public:
SecondOfPairEquals( const Value & aVal )
: m_aValueToCompareWith( aVal )
{}
bool operator() ( const ::std::pair< Key, Value > & rMapElem )
{
return rMapElem.second == m_aValueToCompareWith;
}
private:
Value m_aValueToCompareWith;
};
/** Searches for data in a given map, i.e. not for the key but for the data
pointed to by the keys.
To find a key (value) you can use rMap.find( rValue )
*/
template< class MapType >
inline typename MapType::const_iterator
findValueInMap( const MapType & rMap, const typename MapType::mapped_type & rData )
{
return ::std::find_if( rMap.begin(), rMap.end(),
::o3tl::compose1( ::std::bind2nd(
::std::equal_to< typename MapType::mapped_type >(),
rData ),
::o3tl::select2nd< typename MapType::value_type >()));
}
/** Functor that deletes the object behind the given pointer by calling the
delete operator
*/
template< typename T >
struct DeletePtr : public ::std::unary_function< T *, void >
{
void operator() ( T * pObj )
{ delete pObj; }
};
} // namespace CommonFunctors
} // namespace chart
// CHART2_COMMONFUNCTORS_HXX
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
