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
222
223
224
225
226
227
|
/* -*- 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 INCLUDED_SLIDESHOW_LISTENERCONTAINERIMPL_HXX
#define INCLUDED_SLIDESHOW_LISTENERCONTAINERIMPL_HXX
#include <sal/config.h>
#include <boost/weak_ptr.hpp>
namespace slideshow {
namespace internal {
////////////////////////////////////////////////////////////////////////////
struct EmptyBase
{
struct EmptyGuard{ explicit EmptyGuard(EmptyBase) {} };
struct EmptyClearableGuard
{
explicit EmptyClearableGuard(EmptyBase) {}
void clear() {}
void reset() {}
};
typedef EmptyGuard Guard;
typedef EmptyClearableGuard ClearableGuard;
};
class MutexBase
{
public:
struct Guard : public osl::MutexGuard
{
explicit Guard(MutexBase const& rBase) :
osl::MutexGuard(rBase.maMutex)
{}
};
struct ClearableGuard : public osl::ClearableMutexGuard
{
explicit ClearableGuard(MutexBase const& rBase) :
osl::ClearableMutexGuard(rBase.maMutex)
{}
};
mutable osl::Mutex maMutex;
};
////////////////////////////////////////////////////////////////////////////
template< typename result_type, typename ListenerTargetT > struct FunctionApply
{
template<typename FuncT> static bool apply(
FuncT func,
ListenerTargetT const& rArg )
{
return func(rArg);
}
};
template<typename ListenerTargetT> struct FunctionApply<void,ListenerTargetT>
{
template<typename FuncT> static bool apply(
FuncT func,
ListenerTargetT const& rArg )
{
func(rArg);
return true;
}
};
////////////////////////////////////////////////////////////////////////////
template< typename ListenerT > struct ListenerOperations
{
/// Notify a single one of the listeners
template< typename ContainerT,
typename FuncT >
static bool notifySingleListener( ContainerT& rContainer,
FuncT func )
{
const typename ContainerT::const_iterator aEnd( rContainer.end() );
// true: a handler in this queue processed the event
// false: no handler in this queue finally processed the event
return (std::find_if( rContainer.begin(),
aEnd,
func ) != aEnd);
}
/// Notify all listeners
template< typename ContainerT,
typename FuncT >
static bool notifyAllListeners( ContainerT& rContainer,
FuncT func )
{
bool bRet(false);
typename ContainerT::const_iterator aCurr( rContainer.begin() );
typename ContainerT::const_iterator const aEnd ( rContainer.end() );
while( aCurr != aEnd )
{
if( FunctionApply< typename FuncT::result_type,
typename ContainerT::value_type >::apply(
func,
*aCurr) )
{
bRet = true;
}
++aCurr;
}
// true: at least one handler returned true
// false: not a single handler returned true
return bRet;
}
/// Prune container from deceased listeners
template< typename ContainerT >
static void pruneListeners( ContainerT&, size_t )
{
}
};
// specializations for weak_ptr
// ----------------------------
template< typename ListenerTargetT >
struct ListenerOperations< boost::weak_ptr<ListenerTargetT> >
{
template< typename ContainerT,
typename FuncT >
static bool notifySingleListener( ContainerT& rContainer,
FuncT func )
{
typename ContainerT::const_iterator aCurr( rContainer.begin() );
typename ContainerT::const_iterator const aEnd ( rContainer.end() );
while( aCurr != aEnd )
{
boost::shared_ptr<ListenerTargetT> pListener( aCurr->lock() );
if( pListener && func(pListener) )
return true;
++aCurr;
}
return false;
}
template< typename ContainerT,
typename FuncT >
static bool notifyAllListeners( ContainerT& rContainer,
FuncT func )
{
bool bRet(false);
typename ContainerT::const_iterator aCurr( rContainer.begin() );
typename ContainerT::const_iterator const aEnd ( rContainer.end() );
while( aCurr != aEnd )
{
boost::shared_ptr<ListenerTargetT> pListener( aCurr->lock() );
if( pListener.get() &&
FunctionApply< typename FuncT::result_type,
boost::shared_ptr<ListenerTargetT> >::apply(func,pListener) )
{
bRet = true;
}
++aCurr;
}
return bRet;
}
template< typename ContainerT >
static void pruneListeners( ContainerT& rContainer,
size_t nSizeThreshold )
{
if( rContainer.size() <= nSizeThreshold )
return;
ContainerT aAliveListeners;
aAliveListeners.reserve(rContainer.size());
typename ContainerT::const_iterator aCurr( rContainer.begin() );
typename ContainerT::const_iterator const aEnd ( rContainer.end() );
while( aCurr != aEnd )
{
if( !aCurr->expired() )
aAliveListeners.push_back( *aCurr );
++aCurr;
}
std::swap( rContainer, aAliveListeners );
}
};
} // namespace internal
} // namespace Presentation
#endif /* INCLUDED_SLIDESHOW_LISTENERCONTAINERIMPL_HXX */
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
