blob: 386a43dea8e08074b2c377f3675fb2401ef05e28 (
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
|
/****************************************************************************
**
** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt Mobility Components.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** 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.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qmessageaccountsortorder.h"
#include "qmessageaccountsortorder_p.h"
QTM_BEGIN_NAMESPACE
QMessageAccountSortOrderPrivate::QMessageAccountSortOrderPrivate(QMessageAccountSortOrder *sortOrder)
: q_ptr(sortOrder)
{
}
bool QMessageAccountSortOrderPrivate::lessThan(const QMessageAccountSortOrder &sortOrder,
const QMessageAccount &account1, const QMessageAccount &account2)
{
QMessageAccountSortOrderPrivate *d(sortOrder.d_ptr);
if (d && d->_order == Qt::AscendingOrder) { // Hack preventing null ointer
return (account1.name().compare(account2.name(), Qt::CaseInsensitive) < 0);
}
return (account1.name().compare(account2.name(), Qt::CaseInsensitive) > 0);
}
QMessageAccountSortOrder::QMessageAccountSortOrder()
: d_ptr(0)
{
}
QMessageAccountSortOrder::QMessageAccountSortOrder(const QMessageAccountSortOrder &other)
: d_ptr(new QMessageAccountSortOrderPrivate(this))
{
this->operator=(other);
}
QMessageAccountSortOrder::~QMessageAccountSortOrder()
{
delete d_ptr;
d_ptr = 0;
}
bool QMessageAccountSortOrder::isEmpty() const
{
return (d_ptr == 0);
}
bool QMessageAccountSortOrder::isSupported() const
{
return true;
}
bool QMessageAccountSortOrder::operator==(const QMessageAccountSortOrder& other) const
{
if (!d_ptr && !other.d_ptr) {
return true;
}
if (!d_ptr || !other.d_ptr) {
return false;
}
return (d_ptr->_order == other.d_ptr->_order);
}
QMessageAccountSortOrder& QMessageAccountSortOrder::operator=(const QMessageAccountSortOrder& other)
{
if (&other != this) {
if (!other.d_ptr) {
delete d_ptr;
d_ptr = 0;
} else {
if (!d_ptr) {
d_ptr = new QMessageAccountSortOrderPrivate(this);
}
d_ptr->_order = other.d_ptr->_order;
}
}
return *this;
}
QMessageAccountSortOrder QMessageAccountSortOrder::byName(Qt::SortOrder order)
{
QMessageAccountSortOrder sortOrder;
sortOrder.d_ptr = new QMessageAccountSortOrderPrivate(&sortOrder);
sortOrder.d_ptr->_order = order;
return sortOrder;
}
QTM_END_NAMESPACE
|
