blob: 7abb42be6bac9539ec72e0394af5f6c704f9ff8b (
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
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
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the Qt Mobility Components.
**
** $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
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qlandmarksortorder.h"
#include "qlandmarksortorder_p.h"
#include "qlandmarkid.h"
#if !defined(Q_CC_MWERKS)
template<> QTM_PREPEND_NAMESPACE(QLandmarkSortOrderPrivate) *QSharedDataPointer<QTM_PREPEND_NAMESPACE(QLandmarkSortOrderPrivate)>::clone()
{
return d->clone();
}
#endif
QTM_BEGIN_NAMESPACE
/*!
\class QLandmarkSortOrder
\brief The QLandmarkSortOrder class serves as a base class
for the different sort order types and by itself represents
no sorting.
\inmodule QtLocation
\ingroup landmarks-sort
The sort orders define how a list of landmarks should be ordered
when they searched using a QLandmarkManager or one of the
landmark request classes. (For sorting by distance
see the QLandmarkProximityFilter).
*/
/*!
\enum QLandmarkSortOrder::SortType
Defines the type of sort order.
\value NoSort No sorting is applied
\value NameSort Sorts landmarks by name.
*/
/*!
Constructs a landmark sort order.
The type of the sort order is NoSort.
*/
QLandmarkSortOrder::QLandmarkSortOrder()
: d_ptr(new QLandmarkSortOrderPrivate())
{
}
/*!
\internal
*/
QLandmarkSortOrder::QLandmarkSortOrder(QLandmarkSortOrderPrivate *d_ptr)
: d_ptr(d_ptr)
{
}
/*!
Constructs a copy of \a other.
*/
QLandmarkSortOrder::QLandmarkSortOrder(const QLandmarkSortOrder &other)
: d_ptr(other.d_ptr)
{
}
/*!
Assigns \a other to this sort order and returns a reference to this
sort order.
*/
QLandmarkSortOrder &QLandmarkSortOrder::operator=(const QLandmarkSortOrder & other)
{
d_ptr = other.d_ptr;
return *this;
}
/*!
Destroys the sort order
*/
QLandmarkSortOrder::~QLandmarkSortOrder()
{
}
/*!
Returns the type of sort.
*/
QLandmarkSortOrder::SortType QLandmarkSortOrder::type() const
{
return d_ptr->type;
}
/*!
Returns the direction of the sort order.
*/
Qt::SortOrder QLandmarkSortOrder::direction() const
{
return d_ptr->order;
}
/*!
Sets the \a direction of the sort order.
*/
void QLandmarkSortOrder::setDirection(Qt::SortOrder direction)
{
d_ptr->order = direction;
}
/*!
\fn QLandmarkSortOrder::operator==(const QLandmarkSortOrder& other) const
Returns true if this sort order is identical to \a other.
\sa operator!=()
*/
bool QLandmarkSortOrder::operator==(const QLandmarkSortOrder& other) const
{
if(!d_ptr->QLandmarkSortOrderPrivate::compare(other.d_ptr))
return false;
/* Different types can't be equal */
if (other.type() != type())
return false;
/* Otherwise, use the virtual op == */
return d_ptr->compare(other.d_ptr);
}
/*!
\fn QLandmarkSortOrder::operator!=(const QLandmarkSortOrder &other) const
Returns true if this sort order is not identical to \a other.
\sa operator==()
*/
/*******************************************************************************
*******************************************************************************/
QLandmarkSortOrderPrivate::QLandmarkSortOrderPrivate()
: QSharedData(),
type(QLandmarkSortOrder::NoSort),
order(Qt::AscendingOrder)
{
}
QLandmarkSortOrderPrivate::QLandmarkSortOrderPrivate(const QLandmarkSortOrderPrivate &other)
: QSharedData(),
type(other.type),
order(other.order)
{
}
QLandmarkSortOrderPrivate::~QLandmarkSortOrderPrivate()
{
}
QTM_END_NAMESPACE
|
