blob: c52defab23eb9486016dbbc8b1b9f567ebcbfa9a (
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
|
/* -*- 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_COMPHELPER_WEAKBAG_HXX
#define INCLUDED_COMPHELPER_WEAKBAG_HXX
#include <sal/config.h>
#include <vector>
#include <com/sun/star/uno/Reference.h>
#include <cppuhelper/weakref.hxx>
#include <osl/diagnose.h>
namespace comphelper {
/**
A bag of UNO weak references.
*/
template< typename T > class WeakBag {
public:
/**
Add a new weak reference.
The implementation keeps the amount of memory consumed linear in the
number of living references added, not linear in the number of total
references added.
@param e
a non-null reference.
*/
void add(css::uno::Reference< T > const & e) {
OSL_ASSERT(e.is());
for (auto i = m_list.begin(); i != m_list.end();) {
if (css::uno::Reference< T >(*i).is()) {
++i;
} else {
i = m_list.erase(i);
}
}
m_list.push_back(css::uno::WeakReference< T >(e));
}
/**
Remove a living reference.
@return
a living reference, or null if there are none.
*/
css::uno::Reference< T > remove() {
while (!m_list.empty()) {
css::uno::Reference< T > r(m_list.back());
m_list.pop_back();
if (r.is()) {
return r;
}
}
return css::uno::Reference< T >();
}
private:
std::vector< css::uno::WeakReference< T > > m_list;
};
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
