blob: 3d22c36018872bdf462f1e4f66646645ba502e46 (
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
|
/****************************************************************************
**
** Copyright (C) 2010 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$
** 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 "organizeritemprioritytransform.h"
#include "qorganizeritempriority.h"
#define MINIMUM_PRIORITY 0
#define MAXIMUM_PRIORITY 255
#define PRIORITY_RESOLUTION 25
void OrganizerItemPriorityTransform::transformToDetailL(const CCalEntry& entry, QOrganizerItem *item)
{
QOrganizerItemPriority priority;
// Item has range from 0-9 and entry has range from 0 - 255.
// NOTE: Zero means unknown priority. So just leave the detail out.
int entryPriority = entry.PriorityL();
if (entryPriority > 0) {
entryPriority = entryPriority / PRIORITY_RESOLUTION;
entryPriority = (entryPriority > QOrganizerItemPriority::LowestPriority) ?
QOrganizerItemPriority::LowestPriority : entryPriority;
priority.setPriority((QOrganizerItemPriority::Priority) entryPriority);
item->saveDetail(&priority);
}
}
void OrganizerItemPriorityTransform::transformToEntryL(const QOrganizerItem& item, CCalEntry* entry)
{
QOrganizerItemPriority itemPriority = item.detail<QOrganizerItemPriority>();
if (!itemPriority.isEmpty()) {
int priority = itemPriority.priority();
priority *= PRIORITY_RESOLUTION;
entry->SetPriorityL(priority);
}
}
QString OrganizerItemPriorityTransform::detailDefinitionName()
{
return QOrganizerItemPriority::DefinitionName;
}
|
