blob: 983cbc8656f977d4e4c7c5147717e53b8061d094 (
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
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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: openBossa - INdT (renato.chencarek@openbossa.org)
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** the openBossa stream from INdT (renato.chencarek@openbossa.org).
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef __CARROUSSEL_H__
#define __CARROUSSEL_H__
#include <QList>
#include <QDebug>
template<class T> class Carroussel
{
public:
Carroussel() : m_pos(0) {}
~Carroussel() {}
int count() const { return m_list.count(); }
int pos() const { return m_pos; }
void move(int offset) { m_pos = getIndex(m_pos + offset); }
int add(const T &item);
void remove(int idx);
T &operator[](int aIdx) { return m_list[getIndex(aIdx + m_pos)]; }
const T &operator[](int aIdx) const { return m_list[getIndex(aIdx + m_pos)]; }
void reset(const QList<T> &list, int newPos);
private:
int m_pos;
QList<T> m_list;
int getIndex(int idx) const;
int getCarrousselIndex(int idx);
};
class CarrousselGroup
{
public:
inline ~CarrousselGroup();
template<class T> void add(T *carroussel);
inline void remove(void *carroussel);
inline void move(int offset);
private:
class BasicCarrosselHandler
{
public:
virtual ~BasicCarrosselHandler() {}
virtual void move(int offset) = 0;
virtual bool isEqual(void *value) = 0;
};
template<class T> class CarrousselHandler : public BasicCarrosselHandler
{
public:
CarrousselHandler(T *carroussel) : m_carroussel(carroussel) {}
void move(int offset) { m_carroussel->move(offset); }
bool isEqual(void *value) { return m_carroussel == value; }
private:
T *m_carroussel;
};
QList<BasicCarrosselHandler*> m_items;
inline int find(void *value);
};
// Carroussel
template<class T> int Carroussel<T>::add(const T &item)
{
int idx = m_list.count() - m_pos;
m_list.append(item);
return idx <= m_list.count() / 2 ? idx : idx - m_list.count();
}
template<class T> void Carroussel<T>::remove(int idx)
{
idx = getIndex(m_pos + idx);
m_list.removeAt(idx);
m_pos = getIndex(idx < m_pos ? m_pos - 1 : m_pos);
}
template<class T> void Carroussel<T>::reset(const QList<T> &list, int newPos)
{
m_list = list;
m_pos = getIndex(newPos);
}
template<class T> int Carroussel<T>::getIndex(int idx) const
{
if (m_list.count() == 0)
return 0;
idx %= m_list.count();
return idx >= 0 ? idx : m_list.count() + idx;
}
// CarrousselGroup
CarrousselGroup::~CarrousselGroup()
{
qDeleteAll(m_items);
}
template<class T> void CarrousselGroup::add(T *carroussel)
{
if (find(carroussel) == -1)
m_items.append(new CarrousselHandler<T>(carroussel));
}
void CarrousselGroup::remove(void *carroussel)
{
int idx = find(carroussel);
if (idx >= 0)
delete m_items.takeAt(idx);
}
int CarrousselGroup::find(void *value)
{
for (int i = 0; i < m_items.count(); ++i)
if (m_items[i]->isEqual(value))
return i;
return -1;
}
void CarrousselGroup::move(int offset)
{
foreach (BasicCarrosselHandler *handler, m_items)
handler->move(offset);
}
#endif /* __CARROUSSEL_H__ */
|
