summaryrefslogtreecommitdiffstats
path: root/chalk/sdk/kis_shared_ptr_vector.h
blob: ee7961aee3821b3c2de80d0b1744a4af60fac687 (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
/*
 *  Copyright (c) 2004 Adrian Page <adrian@pagenet.plus.com>
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program 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 General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
 */

#ifndef KIS_SHARED_PTR_VECTOR_H
#define KIS_SHARED_PTR_VECTOR_H

#include <tqvaluevector.h>

#include <ksharedptr.h>

/**
 * TQValueVector does not always destroy an element when it is erased.
 * If the items it is holding are KSharedPtr, this can result in hidden
 * references to objects that cannot be accounted for. This class
 * sets the KSharedPtr to 0 on erase, which dereferences the object as
 * expected.
 */
template <class T>
class KisSharedPtrVector : public TQValueVector< KSharedPtr<T> >
{
    typedef TQValueVector< KSharedPtr<T> > super;
public:
    KisSharedPtrVector() {}

    void pop_back()
    {
            if (!super::empty()) {
            super::back() = 0;
            super::pop_back();
        }
    }

    typename super::iterator erase(typename super::iterator it)
    {
        *it = 0;
        return super::erase(it);
    }

    typename super::iterator erase(typename super::iterator first, typename super::iterator last)
    {
        tqFill(first, last, 0);
        return super::erase(first, last);
    }

    bool contains(KSharedPtr<T> ptr) const
    {
        for (int i = 0, n = super::count(); i < n; ++i)
            if (super::at(i) == ptr)
                return true;
        return false;
    }
};

#endif // KIS_SHARED_PTR_VECTOR_H