author | zautrix <zautrix> | 2004-10-09 16:58:08 (UTC) |
---|---|---|
committer | zautrix <zautrix> | 2004-10-09 16:58:08 (UTC) |
commit | 59ed933d6c43ecb0ddd3dec53cc289ee8aa68482 (patch) (unidiff) | |
tree | 8b1cbcf9c420e7dffd1e1293bcfa69e8e821f3fa /kabc/addressee.cpp | |
parent | b80a099d9432bdc3d4eea778b1813b82b2680ecf (diff) | |
download | kdepimpi-59ed933d6c43ecb0ddd3dec53cc289ee8aa68482.zip kdepimpi-59ed933d6c43ecb0ddd3dec53cc289ee8aa68482.tar.gz kdepimpi-59ed933d6c43ecb0ddd3dec53cc289ee8aa68482.tar.bz2 |
fixed sync bug
-rw-r--r-- | kabc/addressee.cpp | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/kabc/addressee.cpp b/kabc/addressee.cpp index 3f3d5c0..607ae26 100644 --- a/kabc/addressee.cpp +++ b/kabc/addressee.cpp | |||
@@ -1,218 +1,219 @@ | |||
1 | /*** Warning! This file has been generated by the script makeaddressee ***/ | 1 | /*** Warning! This file has been generated by the script makeaddressee ***/ |
2 | /* | 2 | /* |
3 | This file is part of libkabc. | 3 | This file is part of libkabc. |
4 | Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org> | 4 | Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org> |
5 | 5 | ||
6 | This library is free software; you can redistribute it and/or | 6 | This library is free software; you can redistribute it and/or |
7 | modify it under the terms of the GNU Library General Public | 7 | modify it under the terms of the GNU Library General Public |
8 | License as published by the Free Software Foundation; either | 8 | License as published by the Free Software Foundation; either |
9 | version 2 of the License, or (at your option) any later version. | 9 | version 2 of the License, or (at your option) any later version. |
10 | 10 | ||
11 | This library is distributed in the hope that it will be useful, | 11 | This library is distributed in the hope that it will be useful, |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
14 | Library General Public License for more details. | 14 | Library General Public License for more details. |
15 | 15 | ||
16 | You should have received a copy of the GNU Library General Public License | 16 | You should have received a copy of the GNU Library General Public License |
17 | along with this library; see the file COPYING.LIB. If not, write to | 17 | along with this library; see the file COPYING.LIB. If not, write to |
18 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | 18 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
19 | Boston, MA 02111-1307, USA. | 19 | Boston, MA 02111-1307, USA. |
20 | */ | 20 | */ |
21 | 21 | ||
22 | /* | 22 | /* |
23 | Enhanced Version of the file for platform independent KDE tools. | 23 | Enhanced Version of the file for platform independent KDE tools. |
24 | Copyright (c) 2004 Ulf Schenk | 24 | Copyright (c) 2004 Ulf Schenk |
25 | 25 | ||
26 | $Id$ | 26 | $Id$ |
27 | */ | 27 | */ |
28 | 28 | ||
29 | #include <kconfig.h> | 29 | #include <kconfig.h> |
30 | 30 | ||
31 | #include <ksharedptr.h> | 31 | #include <ksharedptr.h> |
32 | #include <kdebug.h> | 32 | #include <kdebug.h> |
33 | #include <kapplication.h> | 33 | #include <kapplication.h> |
34 | #include <klocale.h> | 34 | #include <klocale.h> |
35 | #include <kidmanager.h> | 35 | #include <kidmanager.h> |
36 | //US | 36 | //US |
37 | #include <kstandarddirs.h> | 37 | #include <kstandarddirs.h> |
38 | #include <libkcal/syncdefines.h> | 38 | #include <libkcal/syncdefines.h> |
39 | 39 | ||
40 | //US #include "resource.h" | 40 | //US #include "resource.h" |
41 | #include "addressee.h" | 41 | #include "addressee.h" |
42 | 42 | ||
43 | using namespace KABC; | 43 | using namespace KABC; |
44 | 44 | ||
45 | static bool matchBinaryPattern( int value, int pattern ); | 45 | static bool matchBinaryPattern( int value, int pattern ); |
46 | static bool matchBinaryPatternA( int value, int pattern ); | 46 | static bool matchBinaryPatternA( int value, int pattern ); |
47 | static bool matchBinaryPatternP( int value, int pattern ); | 47 | static bool matchBinaryPatternP( int value, int pattern ); |
48 | 48 | ||
49 | struct Addressee::AddresseeData : public KShared | 49 | struct Addressee::AddresseeData : public KShared |
50 | { | 50 | { |
51 | QString uid; | 51 | QString uid; |
52 | QString name; | 52 | QString name; |
53 | QString formattedName; | 53 | QString formattedName; |
54 | QString familyName; | 54 | QString familyName; |
55 | QString givenName; | 55 | QString givenName; |
56 | QString additionalName; | 56 | QString additionalName; |
57 | QString prefix; | 57 | QString prefix; |
58 | QString suffix; | 58 | QString suffix; |
59 | QString nickName; | 59 | QString nickName; |
60 | QDateTime birthday; | 60 | QDateTime birthday; |
61 | QString mailer; | 61 | QString mailer; |
62 | TimeZone timeZone; | 62 | TimeZone timeZone; |
63 | Geo geo; | 63 | Geo geo; |
64 | QString title; | 64 | QString title; |
65 | QString role; | 65 | QString role; |
66 | QString organization; | 66 | QString organization; |
67 | QString note; | 67 | QString note; |
68 | QString productId; | 68 | QString productId; |
69 | QDateTime revision; | 69 | QDateTime revision; |
70 | QString sortString; | 70 | QString sortString; |
71 | QString externalUID; | 71 | QString externalUID; |
72 | QString originalExternalUID; | 72 | QString originalExternalUID; |
73 | KURL url; | 73 | KURL url; |
74 | Secrecy secrecy; | 74 | Secrecy secrecy; |
75 | Picture logo; | 75 | Picture logo; |
76 | Picture photo; | 76 | Picture photo; |
77 | Sound sound; | 77 | Sound sound; |
78 | Agent agent; | 78 | Agent agent; |
79 | QString mExternalId; | 79 | QString mExternalId; |
80 | PhoneNumber::List phoneNumbers; | 80 | PhoneNumber::List phoneNumbers; |
81 | Address::List addresses; | 81 | Address::List addresses; |
82 | Key::List keys; | 82 | Key::List keys; |
83 | QStringList emails; | 83 | QStringList emails; |
84 | QStringList categories; | 84 | QStringList categories; |
85 | QStringList custom; | 85 | QStringList custom; |
86 | int mTempSyncStat; | 86 | int mTempSyncStat; |
87 | Resource *resource; | 87 | Resource *resource; |
88 | 88 | ||
89 | bool empty :1; | 89 | bool empty :1; |
90 | bool changed :1; | 90 | bool changed :1; |
91 | bool tagged :1; | ||
91 | }; | 92 | }; |
92 | 93 | ||
93 | Addressee::Addressee() | 94 | Addressee::Addressee() |
94 | { | 95 | { |
95 | mData = new AddresseeData; | 96 | mData = new AddresseeData; |
96 | mData->empty = true; | 97 | mData->empty = true; |
97 | mData->changed = false; | 98 | mData->changed = false; |
98 | mData->resource = 0; | 99 | mData->resource = 0; |
99 | mData->mExternalId = ":"; | 100 | mData->mExternalId = ":"; |
100 | mData->revision = QDateTime ( QDate( 2003,1,1)); | 101 | mData->revision = QDateTime ( QDate( 2003,1,1)); |
101 | mData->mTempSyncStat = SYNC_TEMPSTATE_INITIAL; | 102 | mData->mTempSyncStat = SYNC_TEMPSTATE_INITIAL; |
102 | } | 103 | } |
103 | 104 | ||
104 | Addressee::~Addressee() | 105 | Addressee::~Addressee() |
105 | { | 106 | { |
106 | } | 107 | } |
107 | 108 | ||
108 | Addressee::Addressee( const Addressee &a ) | 109 | Addressee::Addressee( const Addressee &a ) |
109 | { | 110 | { |
110 | mData = a.mData; | 111 | mData = a.mData; |
111 | } | 112 | } |
112 | 113 | ||
113 | Addressee &Addressee::operator=( const Addressee &a ) | 114 | Addressee &Addressee::operator=( const Addressee &a ) |
114 | { | 115 | { |
115 | mData = a.mData; | 116 | mData = a.mData; |
116 | return (*this); | 117 | return (*this); |
117 | } | 118 | } |
118 | 119 | ||
119 | Addressee Addressee::copy() | 120 | Addressee Addressee::copy() |
120 | { | 121 | { |
121 | Addressee a; | 122 | Addressee a; |
122 | *(a.mData) = *mData; | 123 | *(a.mData) = *mData; |
123 | return a; | 124 | return a; |
124 | } | 125 | } |
125 | 126 | ||
126 | void Addressee::detach() | 127 | void Addressee::detach() |
127 | { | 128 | { |
128 | if ( mData.count() == 1 ) return; | 129 | if ( mData.count() == 1 ) return; |
129 | *this = copy(); | 130 | *this = copy(); |
130 | } | 131 | } |
131 | 132 | ||
132 | bool Addressee::operator==( const Addressee &a ) const | 133 | bool Addressee::operator==( const Addressee &a ) const |
133 | { | 134 | { |
134 | if ( uid() != a.uid() ) return false; | 135 | if ( uid() != a.uid() ) return false; |
135 | if ( mData->name != a.mData->name ) return false; | 136 | if ( mData->name != a.mData->name ) return false; |
136 | if ( mData->formattedName != a.mData->formattedName ) return false; | 137 | if ( mData->formattedName != a.mData->formattedName ) return false; |
137 | if ( mData->familyName != a.mData->familyName ) return false; | 138 | if ( mData->familyName != a.mData->familyName ) return false; |
138 | if ( mData->givenName != a.mData->givenName ) return false; | 139 | if ( mData->givenName != a.mData->givenName ) return false; |
139 | if ( mData->additionalName != a.mData->additionalName ) return false; | 140 | if ( mData->additionalName != a.mData->additionalName ) return false; |
140 | if ( mData->prefix != a.mData->prefix ) return false; | 141 | if ( mData->prefix != a.mData->prefix ) return false; |
141 | if ( mData->suffix != a.mData->suffix ) return false; | 142 | if ( mData->suffix != a.mData->suffix ) return false; |
142 | if ( mData->nickName != a.mData->nickName ) return false; | 143 | if ( mData->nickName != a.mData->nickName ) return false; |
143 | if ( mData->birthday != a.mData->birthday ) return false; | 144 | if ( mData->birthday != a.mData->birthday ) return false; |
144 | if ( mData->mailer != a.mData->mailer ) return false; | 145 | if ( mData->mailer != a.mData->mailer ) return false; |
145 | if ( mData->timeZone != a.mData->timeZone ) return false; | 146 | if ( mData->timeZone != a.mData->timeZone ) return false; |
146 | if ( mData->geo != a.mData->geo ) return false; | 147 | if ( mData->geo != a.mData->geo ) return false; |
147 | if ( mData->title != a.mData->title ) return false; | 148 | if ( mData->title != a.mData->title ) return false; |
148 | if ( mData->role != a.mData->role ) return false; | 149 | if ( mData->role != a.mData->role ) return false; |
149 | if ( mData->organization != a.mData->organization ) return false; | 150 | if ( mData->organization != a.mData->organization ) return false; |
150 | if ( mData->note != a.mData->note ) return false; | 151 | if ( mData->note != a.mData->note ) return false; |
151 | if ( mData->productId != a.mData->productId ) return false; | 152 | if ( mData->productId != a.mData->productId ) return false; |
152 | //if ( mData->revision != a.mData->revision ) return false; | 153 | //if ( mData->revision != a.mData->revision ) return false; |
153 | if ( mData->sortString != a.mData->sortString ) return false; | 154 | if ( mData->sortString != a.mData->sortString ) return false; |
154 | if ( mData->secrecy != a.mData->secrecy ) return false; | 155 | if ( mData->secrecy != a.mData->secrecy ) return false; |
155 | if ( mData->logo != a.mData->logo ) return false; | 156 | if ( mData->logo != a.mData->logo ) return false; |
156 | if ( mData->photo != a.mData->photo ) return false; | 157 | if ( mData->photo != a.mData->photo ) return false; |
157 | if ( mData->sound != a.mData->sound ) return false; | 158 | if ( mData->sound != a.mData->sound ) return false; |
158 | if ( mData->agent != a.mData->agent ) return false; | 159 | if ( mData->agent != a.mData->agent ) return false; |
159 | if ( ( mData->url.isValid() || a.mData->url.isValid() ) && | 160 | if ( ( mData->url.isValid() || a.mData->url.isValid() ) && |
160 | ( mData->url != a.mData->url ) ) return false; | 161 | ( mData->url != a.mData->url ) ) return false; |
161 | if ( mData->phoneNumbers != a.mData->phoneNumbers ) return false; | 162 | if ( mData->phoneNumbers != a.mData->phoneNumbers ) return false; |
162 | if ( mData->addresses != a.mData->addresses ) return false; | 163 | if ( mData->addresses != a.mData->addresses ) return false; |
163 | if ( mData->keys != a.mData->keys ) return false; | 164 | if ( mData->keys != a.mData->keys ) return false; |
164 | if ( mData->emails != a.mData->emails ) return false; | 165 | if ( mData->emails != a.mData->emails ) return false; |
165 | if ( mData->categories != a.mData->categories ) return false; | 166 | if ( mData->categories != a.mData->categories ) return false; |
166 | if ( mData->custom != a.mData->custom ) return false; | 167 | if ( mData->custom != a.mData->custom ) return false; |
167 | 168 | ||
168 | return true; | 169 | return true; |
169 | } | 170 | } |
170 | 171 | ||
171 | bool Addressee::operator!=( const Addressee &a ) const | 172 | bool Addressee::operator!=( const Addressee &a ) const |
172 | { | 173 | { |
173 | return !( a == *this ); | 174 | return !( a == *this ); |
174 | } | 175 | } |
175 | 176 | ||
176 | bool Addressee::isEmpty() const | 177 | bool Addressee::isEmpty() const |
177 | { | 178 | { |
178 | return mData->empty; | 179 | return mData->empty; |
179 | } | 180 | } |
180 | ulong Addressee::getCsum4List( const QStringList & attList) | 181 | ulong Addressee::getCsum4List( const QStringList & attList) |
181 | { | 182 | { |
182 | int max = attList.count(); | 183 | int max = attList.count(); |
183 | ulong cSum = 0; | 184 | ulong cSum = 0; |
184 | int j,k,i; | 185 | int j,k,i; |
185 | int add; | 186 | int add; |
186 | for ( i = 0; i < max ; ++i ) { | 187 | for ( i = 0; i < max ; ++i ) { |
187 | QString s = attList[i]; | 188 | QString s = attList[i]; |
188 | if ( ! s.isEmpty() ){ | 189 | if ( ! s.isEmpty() ){ |
189 | j = s.length(); | 190 | j = s.length(); |
190 | for ( k = 0; k < j; ++k ) { | 191 | for ( k = 0; k < j; ++k ) { |
191 | int mul = k +1; | 192 | int mul = k +1; |
192 | add = s[k].unicode (); | 193 | add = s[k].unicode (); |
193 | if ( k < 16 ) | 194 | if ( k < 16 ) |
194 | mul = mul * mul; | 195 | mul = mul * mul; |
195 | int ii = i+1; | 196 | int ii = i+1; |
196 | add = add * mul *ii*ii*ii; | 197 | add = add * mul *ii*ii*ii; |
197 | cSum += add; | 198 | cSum += add; |
198 | } | 199 | } |
199 | } | 200 | } |
200 | 201 | ||
201 | } | 202 | } |
202 | //QString dump = attList.join(","); | 203 | //QString dump = attList.join(","); |
203 | //qDebug("csum: %d %s", cSum,dump.latin1()); | 204 | //qDebug("csum: %d %s", cSum,dump.latin1()); |
204 | 205 | ||
205 | return cSum; | 206 | return cSum; |
206 | 207 | ||
207 | } | 208 | } |
208 | void Addressee::computeCsum(const QString &dev) | 209 | void Addressee::computeCsum(const QString &dev) |
209 | { | 210 | { |
210 | QStringList l; | 211 | QStringList l; |
211 | if ( !mData->name.isEmpty() ) l.append(mData->name); | 212 | if ( !mData->name.isEmpty() ) l.append(mData->name); |
212 | if ( !mData->formattedName.isEmpty() ) l.append(mData->formattedName ); | 213 | if ( !mData->formattedName.isEmpty() ) l.append(mData->formattedName ); |
213 | if ( !mData->familyName.isEmpty() ) l.append( mData->familyName ); | 214 | if ( !mData->familyName.isEmpty() ) l.append( mData->familyName ); |
214 | if ( !mData->givenName.isEmpty() ) l.append(mData->givenName ); | 215 | if ( !mData->givenName.isEmpty() ) l.append(mData->givenName ); |
215 | if ( !mData->additionalName ) l.append( mData->additionalName ); | 216 | if ( !mData->additionalName ) l.append( mData->additionalName ); |
216 | if ( !mData->prefix.isEmpty() ) l.append( mData->prefix ); | 217 | if ( !mData->prefix.isEmpty() ) l.append( mData->prefix ); |
217 | if ( !mData->suffix.isEmpty() ) l.append( mData->suffix ); | 218 | if ( !mData->suffix.isEmpty() ) l.append( mData->suffix ); |
218 | if ( !mData->nickName.isEmpty() ) l.append( mData->nickName ); | 219 | if ( !mData->nickName.isEmpty() ) l.append( mData->nickName ); |
@@ -1696,240 +1697,251 @@ void Addressee::insertCustom( const QString &app, const QString &name, | |||
1696 | 1697 | ||
1697 | void Addressee::removeCustom( const QString &app, const QString &name) | 1698 | void Addressee::removeCustom( const QString &app, const QString &name) |
1698 | { | 1699 | { |
1699 | detach(); | 1700 | detach(); |
1700 | 1701 | ||
1701 | QString qualifiedName = app + "-" + name + ":"; | 1702 | QString qualifiedName = app + "-" + name + ":"; |
1702 | 1703 | ||
1703 | QStringList::Iterator it; | 1704 | QStringList::Iterator it; |
1704 | for( it = mData->custom.begin(); it != mData->custom.end(); ++it ) { | 1705 | for( it = mData->custom.begin(); it != mData->custom.end(); ++it ) { |
1705 | if ( (*it).startsWith( qualifiedName ) ) { | 1706 | if ( (*it).startsWith( qualifiedName ) ) { |
1706 | mData->custom.remove( it ); | 1707 | mData->custom.remove( it ); |
1707 | return; | 1708 | return; |
1708 | } | 1709 | } |
1709 | } | 1710 | } |
1710 | } | 1711 | } |
1711 | 1712 | ||
1712 | QString Addressee::custom( const QString &app, const QString &name ) const | 1713 | QString Addressee::custom( const QString &app, const QString &name ) const |
1713 | { | 1714 | { |
1714 | QString qualifiedName = app + "-" + name + ":"; | 1715 | QString qualifiedName = app + "-" + name + ":"; |
1715 | QString value; | 1716 | QString value; |
1716 | 1717 | ||
1717 | QStringList::ConstIterator it; | 1718 | QStringList::ConstIterator it; |
1718 | for( it = mData->custom.begin(); it != mData->custom.end(); ++it ) { | 1719 | for( it = mData->custom.begin(); it != mData->custom.end(); ++it ) { |
1719 | if ( (*it).startsWith( qualifiedName ) ) { | 1720 | if ( (*it).startsWith( qualifiedName ) ) { |
1720 | value = (*it).mid( (*it).find( ":" ) + 1 ); | 1721 | value = (*it).mid( (*it).find( ":" ) + 1 ); |
1721 | break; | 1722 | break; |
1722 | } | 1723 | } |
1723 | } | 1724 | } |
1724 | 1725 | ||
1725 | return value; | 1726 | return value; |
1726 | } | 1727 | } |
1727 | 1728 | ||
1728 | void Addressee::setCustoms( const QStringList &l ) | 1729 | void Addressee::setCustoms( const QStringList &l ) |
1729 | { | 1730 | { |
1730 | detach(); | 1731 | detach(); |
1731 | mData->empty = false; | 1732 | mData->empty = false; |
1732 | 1733 | ||
1733 | mData->custom = l; | 1734 | mData->custom = l; |
1734 | } | 1735 | } |
1735 | 1736 | ||
1736 | QStringList Addressee::customs() const | 1737 | QStringList Addressee::customs() const |
1737 | { | 1738 | { |
1738 | return mData->custom; | 1739 | return mData->custom; |
1739 | } | 1740 | } |
1740 | 1741 | ||
1741 | void Addressee::parseEmailAddress( const QString &rawEmail, QString &fullName, | 1742 | void Addressee::parseEmailAddress( const QString &rawEmail, QString &fullName, |
1742 | QString &email) | 1743 | QString &email) |
1743 | { | 1744 | { |
1744 | int startPos, endPos, len; | 1745 | int startPos, endPos, len; |
1745 | QString partA, partB, result; | 1746 | QString partA, partB, result; |
1746 | char endCh = '>'; | 1747 | char endCh = '>'; |
1747 | 1748 | ||
1748 | startPos = rawEmail.find('<'); | 1749 | startPos = rawEmail.find('<'); |
1749 | if (startPos < 0) | 1750 | if (startPos < 0) |
1750 | { | 1751 | { |
1751 | startPos = rawEmail.find('('); | 1752 | startPos = rawEmail.find('('); |
1752 | endCh = ')'; | 1753 | endCh = ')'; |
1753 | } | 1754 | } |
1754 | if (startPos < 0) | 1755 | if (startPos < 0) |
1755 | { | 1756 | { |
1756 | // We couldn't find any separators, so we assume the whole string | 1757 | // We couldn't find any separators, so we assume the whole string |
1757 | // is the email address | 1758 | // is the email address |
1758 | email = rawEmail; | 1759 | email = rawEmail; |
1759 | fullName = ""; | 1760 | fullName = ""; |
1760 | } | 1761 | } |
1761 | else | 1762 | else |
1762 | { | 1763 | { |
1763 | // We have a start position, try to find an end | 1764 | // We have a start position, try to find an end |
1764 | endPos = rawEmail.find(endCh, startPos+1); | 1765 | endPos = rawEmail.find(endCh, startPos+1); |
1765 | 1766 | ||
1766 | if (endPos < 0) | 1767 | if (endPos < 0) |
1767 | { | 1768 | { |
1768 | // We couldn't find the end of the email address. We can only | 1769 | // We couldn't find the end of the email address. We can only |
1769 | // assume the entire string is the email address. | 1770 | // assume the entire string is the email address. |
1770 | email = rawEmail; | 1771 | email = rawEmail; |
1771 | fullName = ""; | 1772 | fullName = ""; |
1772 | } | 1773 | } |
1773 | else | 1774 | else |
1774 | { | 1775 | { |
1775 | // We have a start and end to the email address | 1776 | // We have a start and end to the email address |
1776 | 1777 | ||
1777 | // Grab the name part | 1778 | // Grab the name part |
1778 | fullName = rawEmail.left(startPos).stripWhiteSpace(); | 1779 | fullName = rawEmail.left(startPos).stripWhiteSpace(); |
1779 | 1780 | ||
1780 | // grab the email part | 1781 | // grab the email part |
1781 | email = rawEmail.mid(startPos+1, endPos-startPos-1).stripWhiteSpace(); | 1782 | email = rawEmail.mid(startPos+1, endPos-startPos-1).stripWhiteSpace(); |
1782 | 1783 | ||
1783 | // Check that we do not have any extra characters on the end of the | 1784 | // Check that we do not have any extra characters on the end of the |
1784 | // strings | 1785 | // strings |
1785 | len = fullName.length(); | 1786 | len = fullName.length(); |
1786 | if (fullName[0]=='"' && fullName[len-1]=='"') | 1787 | if (fullName[0]=='"' && fullName[len-1]=='"') |
1787 | fullName = fullName.mid(1, len-2); | 1788 | fullName = fullName.mid(1, len-2); |
1788 | else if (fullName[0]=='<' && fullName[len-1]=='>') | 1789 | else if (fullName[0]=='<' && fullName[len-1]=='>') |
1789 | fullName = fullName.mid(1, len-2); | 1790 | fullName = fullName.mid(1, len-2); |
1790 | else if (fullName[0]=='(' && fullName[len-1]==')') | 1791 | else if (fullName[0]=='(' && fullName[len-1]==')') |
1791 | fullName = fullName.mid(1, len-2); | 1792 | fullName = fullName.mid(1, len-2); |
1792 | } | 1793 | } |
1793 | } | 1794 | } |
1794 | } | 1795 | } |
1795 | 1796 | ||
1796 | void Addressee::setResource( Resource *resource ) | 1797 | void Addressee::setResource( Resource *resource ) |
1797 | { | 1798 | { |
1798 | detach(); | 1799 | detach(); |
1799 | mData->resource = resource; | 1800 | mData->resource = resource; |
1800 | } | 1801 | } |
1801 | 1802 | ||
1802 | Resource *Addressee::resource() const | 1803 | Resource *Addressee::resource() const |
1803 | { | 1804 | { |
1804 | return mData->resource; | 1805 | return mData->resource; |
1805 | } | 1806 | } |
1806 | 1807 | ||
1807 | //US | 1808 | //US |
1808 | QString Addressee::resourceLabel() | 1809 | QString Addressee::resourceLabel() |
1809 | { | 1810 | { |
1810 | return i18n("Resource"); | 1811 | return i18n("Resource"); |
1811 | } | 1812 | } |
1812 | 1813 | ||
1813 | void Addressee::setChanged( bool value ) | 1814 | void Addressee::setChanged( bool value ) |
1814 | { | 1815 | { |
1815 | detach(); | 1816 | detach(); |
1816 | mData->changed = value; | 1817 | mData->changed = value; |
1817 | } | 1818 | } |
1818 | 1819 | ||
1819 | bool Addressee::changed() const | 1820 | bool Addressee::changed() const |
1820 | { | 1821 | { |
1821 | return mData->changed; | 1822 | return mData->changed; |
1822 | } | 1823 | } |
1823 | 1824 | ||
1825 | void Addressee::setTagged( bool value ) | ||
1826 | { | ||
1827 | detach(); | ||
1828 | mData->tagged = value; | ||
1829 | } | ||
1830 | |||
1831 | bool Addressee::tagged() const | ||
1832 | { | ||
1833 | return mData->tagged; | ||
1834 | } | ||
1835 | |||
1824 | QDataStream &KABC::operator<<( QDataStream &s, const Addressee &a ) | 1836 | QDataStream &KABC::operator<<( QDataStream &s, const Addressee &a ) |
1825 | { | 1837 | { |
1826 | if (!a.mData) return s; | 1838 | if (!a.mData) return s; |
1827 | 1839 | ||
1828 | s << a.uid(); | 1840 | s << a.uid(); |
1829 | 1841 | ||
1830 | s << a.mData->name; | 1842 | s << a.mData->name; |
1831 | s << a.mData->formattedName; | 1843 | s << a.mData->formattedName; |
1832 | s << a.mData->familyName; | 1844 | s << a.mData->familyName; |
1833 | s << a.mData->givenName; | 1845 | s << a.mData->givenName; |
1834 | s << a.mData->additionalName; | 1846 | s << a.mData->additionalName; |
1835 | s << a.mData->prefix; | 1847 | s << a.mData->prefix; |
1836 | s << a.mData->suffix; | 1848 | s << a.mData->suffix; |
1837 | s << a.mData->nickName; | 1849 | s << a.mData->nickName; |
1838 | s << a.mData->birthday; | 1850 | s << a.mData->birthday; |
1839 | s << a.mData->mailer; | 1851 | s << a.mData->mailer; |
1840 | s << a.mData->timeZone; | 1852 | s << a.mData->timeZone; |
1841 | s << a.mData->geo; | 1853 | s << a.mData->geo; |
1842 | s << a.mData->title; | 1854 | s << a.mData->title; |
1843 | s << a.mData->role; | 1855 | s << a.mData->role; |
1844 | s << a.mData->organization; | 1856 | s << a.mData->organization; |
1845 | s << a.mData->note; | 1857 | s << a.mData->note; |
1846 | s << a.mData->productId; | 1858 | s << a.mData->productId; |
1847 | s << a.mData->revision; | 1859 | s << a.mData->revision; |
1848 | s << a.mData->sortString; | 1860 | s << a.mData->sortString; |
1849 | s << a.mData->url; | 1861 | s << a.mData->url; |
1850 | s << a.mData->secrecy; | 1862 | s << a.mData->secrecy; |
1851 | s << a.mData->logo; | 1863 | s << a.mData->logo; |
1852 | s << a.mData->photo; | 1864 | s << a.mData->photo; |
1853 | s << a.mData->sound; | 1865 | s << a.mData->sound; |
1854 | s << a.mData->agent; | 1866 | s << a.mData->agent; |
1855 | s << a.mData->phoneNumbers; | 1867 | s << a.mData->phoneNumbers; |
1856 | s << a.mData->addresses; | 1868 | s << a.mData->addresses; |
1857 | s << a.mData->emails; | 1869 | s << a.mData->emails; |
1858 | s << a.mData->categories; | 1870 | s << a.mData->categories; |
1859 | s << a.mData->custom; | 1871 | s << a.mData->custom; |
1860 | s << a.mData->keys; | 1872 | s << a.mData->keys; |
1861 | return s; | 1873 | return s; |
1862 | } | 1874 | } |
1863 | 1875 | ||
1864 | QDataStream &KABC::operator>>( QDataStream &s, Addressee &a ) | 1876 | QDataStream &KABC::operator>>( QDataStream &s, Addressee &a ) |
1865 | { | 1877 | { |
1866 | if (!a.mData) return s; | 1878 | if (!a.mData) return s; |
1867 | 1879 | ||
1868 | s >> a.mData->uid; | 1880 | s >> a.mData->uid; |
1869 | 1881 | ||
1870 | s >> a.mData->name; | 1882 | s >> a.mData->name; |
1871 | s >> a.mData->formattedName; | 1883 | s >> a.mData->formattedName; |
1872 | s >> a.mData->familyName; | 1884 | s >> a.mData->familyName; |
1873 | s >> a.mData->givenName; | 1885 | s >> a.mData->givenName; |
1874 | s >> a.mData->additionalName; | 1886 | s >> a.mData->additionalName; |
1875 | s >> a.mData->prefix; | 1887 | s >> a.mData->prefix; |
1876 | s >> a.mData->suffix; | 1888 | s >> a.mData->suffix; |
1877 | s >> a.mData->nickName; | 1889 | s >> a.mData->nickName; |
1878 | s >> a.mData->birthday; | 1890 | s >> a.mData->birthday; |
1879 | s >> a.mData->mailer; | 1891 | s >> a.mData->mailer; |
1880 | s >> a.mData->timeZone; | 1892 | s >> a.mData->timeZone; |
1881 | s >> a.mData->geo; | 1893 | s >> a.mData->geo; |
1882 | s >> a.mData->title; | 1894 | s >> a.mData->title; |
1883 | s >> a.mData->role; | 1895 | s >> a.mData->role; |
1884 | s >> a.mData->organization; | 1896 | s >> a.mData->organization; |
1885 | s >> a.mData->note; | 1897 | s >> a.mData->note; |
1886 | s >> a.mData->productId; | 1898 | s >> a.mData->productId; |
1887 | s >> a.mData->revision; | 1899 | s >> a.mData->revision; |
1888 | s >> a.mData->sortString; | 1900 | s >> a.mData->sortString; |
1889 | s >> a.mData->url; | 1901 | s >> a.mData->url; |
1890 | s >> a.mData->secrecy; | 1902 | s >> a.mData->secrecy; |
1891 | s >> a.mData->logo; | 1903 | s >> a.mData->logo; |
1892 | s >> a.mData->photo; | 1904 | s >> a.mData->photo; |
1893 | s >> a.mData->sound; | 1905 | s >> a.mData->sound; |
1894 | s >> a.mData->agent; | 1906 | s >> a.mData->agent; |
1895 | s >> a.mData->phoneNumbers; | 1907 | s >> a.mData->phoneNumbers; |
1896 | s >> a.mData->addresses; | 1908 | s >> a.mData->addresses; |
1897 | s >> a.mData->emails; | 1909 | s >> a.mData->emails; |
1898 | s >> a.mData->categories; | 1910 | s >> a.mData->categories; |
1899 | s >> a.mData->custom; | 1911 | s >> a.mData->custom; |
1900 | s >> a.mData->keys; | 1912 | s >> a.mData->keys; |
1901 | 1913 | ||
1902 | a.mData->empty = false; | 1914 | a.mData->empty = false; |
1903 | 1915 | ||
1904 | return s; | 1916 | return s; |
1905 | } | 1917 | } |
1906 | bool matchBinaryPattern( int value, int pattern ) | 1918 | bool matchBinaryPattern( int value, int pattern ) |
1907 | { | 1919 | { |
1908 | /** | 1920 | /** |
1909 | We want to match all telephonnumbers/addresses which have the bits in the | 1921 | We want to match all telephonnumbers/addresses which have the bits in the |
1910 | pattern set. More are allowed. | 1922 | pattern set. More are allowed. |
1911 | if pattern == 0 we have a special handling, then we want only those with | 1923 | if pattern == 0 we have a special handling, then we want only those with |
1912 | exactly no bit set. | 1924 | exactly no bit set. |
1913 | */ | 1925 | */ |
1914 | if ( pattern == 0 ) | 1926 | if ( pattern == 0 ) |
1915 | return ( value == 0 ); | 1927 | return ( value == 0 ); |
1916 | else | 1928 | else |
1917 | return ( pattern == ( pattern & value ) ); | 1929 | return ( pattern == ( pattern & value ) ); |
1918 | } | 1930 | } |
1919 | 1931 | ||
1920 | bool matchBinaryPatternP( int value, int pattern ) | 1932 | bool matchBinaryPatternP( int value, int pattern ) |
1921 | { | 1933 | { |
1922 | 1934 | ||
1923 | if ( pattern == 0 ) | 1935 | if ( pattern == 0 ) |
1924 | return ( value == 0 ); | 1936 | return ( value == 0 ); |
1925 | else | 1937 | else |
1926 | return ( (pattern |PhoneNumber::Pref ) == ( value |PhoneNumber::Pref ) ); | 1938 | return ( (pattern |PhoneNumber::Pref ) == ( value |PhoneNumber::Pref ) ); |
1927 | } | 1939 | } |
1928 | bool matchBinaryPatternA( int value, int pattern ) | 1940 | bool matchBinaryPatternA( int value, int pattern ) |
1929 | { | 1941 | { |
1930 | 1942 | ||
1931 | if ( pattern == 0 ) | 1943 | if ( pattern == 0 ) |
1932 | return ( value == 0 ); | 1944 | return ( value == 0 ); |
1933 | else | 1945 | else |
1934 | return ( (pattern | Address::Pref) == ( value | Address::Pref ) ); | 1946 | return ( (pattern | Address::Pref) == ( value | Address::Pref ) ); |
1935 | } | 1947 | } |