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 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486
|
/****************************************************************************
**
** Copyright (C) 2017 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtContacts module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl-3.0.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qcontactmanagerengine.h"
#include <QtCore/qmutex.h>
#include <QtCore/qpointer.h>
#include <QtCore/qset.h>
#include "qcontact_p.h"
#include "qcontactdetail_p.h"
#include "qcontactdetails.h"
#include "qcontactfilters.h"
#include "qcontactabstractrequest_p.h"
#include "qcontactaction.h"
#include "qcontactactiondescriptor.h"
#include "qcontactactionmanager_p.h"
#include "qcontactrequests_p.h"
#include "qcontactsortorder.h"
QT_BEGIN_NAMESPACE_CONTACTS
static bool validateActionFilter(const QContactFilter& filter);
/*!
\class QContactManagerEngine
\brief The QContactManagerEngine class provides the interface for
implementations of the contact manager backend functionality.
\inmodule QtContacts
\ingroup contacts-backends
Instances of this class are usually provided by a
\l QContactManagerEngineFactory, which is loaded from a plugin.
The default implementation of this interface provides a basic
level of functionality for some functions so that specific engines
can simply implement the functionality that is supported by
the specific contacts engine that is being adapted.
More information on writing a contacts engine plugin is available in
the \l{Qt Contacts Manager Engines} documentation.
\sa QContactManager, QContactManagerEngineFactory
*/
/*!
\fn QContactManagerEngine::QContactManagerEngine()
A default, empty constructor.
*/
/*!
\fn QContactManagerEngine::dataChanged()
This signal is emitted some time after changes occur to the data managed by this
engine, and the engine is unable to determine which changes occurred, or if the
engine considers the changes to be radical enough to require clients to reload all data.
If this signal is emitted, no other signals may be emitted for the associated changes.
As it is possible that other processes (or other devices) may have caused the
changes, the timing can not be determined.
\sa contactsAdded(), contactsChanged(), contactsRemoved()
*/
/*!
\fn QContactManagerEngine::contactsAdded(const QList<QContactId>& contactIds);
This signal is emitted some time after a set of contacts has been added to
this engine where the \l dataChanged() signal was not emitted for those changes.
As it is possible that other processes (or other devices) may
have added the contacts, the timing cannot be determined.
The list of ids of contacts added is given by \a contactIds. There may be one or more
ids in the list.
\sa dataChanged()
*/
/*!
\fn QContactManagerEngine::contactsChanged(const QList<QContactId>& contactIds, const QList<QContactDetail::DetailType> &typesChanged);
This signal is emitted some time after a set of contacts has been modified in
this engine where the \l dataChanged() signal was not emitted for those changes.
As it is possible that other processes (or other devices) may
have modified the contacts, the timing cannot be determined.
The list of ids of changed contacts is given by \a contactIds. There may be one or more
ids in the list.
The set of contact detail types modified in the reported changes is a subset of those
listed in \a typesChanged, unless \a typesChanged is empty, in which case no limitation
on the reported changes may be assumed.
\sa dataChanged()
*/
/*!
\fn QContactManagerEngine::contactsRemoved(const QList<QContactId>& contactIds);
This signal is emitted some time after a set of contacts has been removed from
this engine where the \l dataChanged() signal was not emitted for those changes.
As it is possible that other processes (or other devices) may
have removed the contacts, the timing cannot be determined.
The list of ids of removed contacts is given by \a contactIds. There may be one or more
ids in the list.
\sa dataChanged()
*/
/*!
\fn QContactManagerEngine::relationshipsAdded(const QList<QContactId>& affectedContactIds);
This signal is emitted some time after a set of contacts has been added to
this engine where the \l dataChanged() signal was not emitted for those changes.
As it is possible that other processes (or other devices) may
have added the contacts, the timing cannot be determined.
The list of ids of affected contacts is given by \a affectedContactIds. There may be one or more
ids in the list.
\sa dataChanged()
*/
/*!
\fn QContactManagerEngine::relationshipsRemoved(const QList<QContactId>& affectedContactIds);
This signal is emitted some time after a set of relationships has been removed from
this engine where the \l dataChanged() signal was not emitted for those changes.
As it is possible that other processes (or other devices) may
have removed the relationships, the timing cannot be determined.
The list of ids of affected contacts is given by \a affectedContactIds. There may be one or more
ids in the list.
\sa dataChanged()
*/
/*!
\fn QContactManagerEngine::selfContactIdChanged(const QContactId& oldId, const QContactId& newId)
This signal is emitted at some point after the id of the self-contact is changed from \a oldId to \a newId in the manager.
If the \a newId is the invalid, null id, then the self contact was deleted or no self contact exists.
This signal must not be emitted if the dataChanged() signal was previously emitted for this change.
As it is possible that other processes (or other devices) may
have removed or changed the self contact, the timing cannot be determined.
\sa dataChanged()
*/
/*! Returns the manager name for this QContactManagerEngine
*/
QString QContactManagerEngine::managerName() const
{
return QString(QStringLiteral("base"));
}
/*!
Returns the parameters with which this engine was constructed. Note that
the engine may have discarded unused or invalid parameters at the time of
construction, and these will not be returned.
*/
QMap<QString, QString> QContactManagerEngine::managerParameters() const
{
return QMap<QString, QString>(); // default implementation requires no parameters.
}
/*!
Returns the subset of the manager parameters that are relevant when interpreting
contact ID values. Since contact ID comparison involves equivalence of
managerUri values, parameters that do not differentiate contact IDs should not
be returned by this function.
For example, a manager engine may support 'user' and 'cachesize' parameters,
where the former distinguishes between separate user domains, and the latter
is for performance tuning. The 'user' parameter will be relevant to the interpretation
of contact IDs and thus should be returned by this function, whereas 'cachesize'
is not relevant and should be omitted.
\sa managerUri(), managerParamaters()
*/
QMap<QString, QString> QContactManagerEngine::idInterpretationParameters() const
{
return QMap<QString, QString>(); // default implementation returns no parameters.
}
/*!
\fn QString QContactManagerEngine::managerUri() const
Returns the unique URI of this manager, which is built from the manager name and the
ID interpretation parameters used to construct it.
\sa idInterpretationParameters()
*/
/*!
\fn QContactId QContactManagerEngine::contactId(const QString &localId) const
Returns the contact ID for this managerUri() and the given
engine specific ID part \a localId.
*/
/*!
Returns a list of contact ids that match the given \a filter, sorted according to the given list of \a sortOrders.
Depending on the backend, this filtering operation may involve retrieving all the contacts.
Any error which occurs will be saved in \a error.
*/
QList<QContactId> QContactManagerEngine::contactIds(const QContactFilter& filter, const QList<QContactSortOrder>& sortOrders, QContactManager::Error* error) const
{
Q_UNUSED(filter);
Q_UNUSED(sortOrders);
*error = QContactManager::NotSupportedError;
return QList<QContactId>();
}
/*!
Returns the list of contacts which match the given \a filter stored in the manager sorted according to the given list of \a sortOrders.
Any operation error which occurs will be saved in \a error.
The \a fetchHint parameter describes the optimization hints that a manager may take.
If the \a fetchHint is the default constructed hint, all existing details, relationships and
action preferences in the matching contacts will be returned.
If a non-default fetch hint is supplied, and the client wishes to make changes to the contacts,
they should ensure that only a detail type hint is supplied and that when saving it back, a
type mask should be used which corresponds to the detail type hint. This is to ensure
that no data is lost by overwriting an existing contact with a restricted version of it.
\sa QContactFetchHint
*/
QList<QContact> QContactManagerEngine::contacts(const QContactFilter& filter, const QList<QContactSortOrder>& sortOrders, const QContactFetchHint& fetchHint, QContactManager::Error* error) const
{
Q_UNUSED(filter);
Q_UNUSED(sortOrders);
Q_UNUSED(fetchHint);
*error = QContactManager::NotSupportedError;
return QList<QContact>();
}
/*!
Returns the contact in the database identified by \a contactId.
If the contact does not exist, an empty, default constructed QContact will be returned,
and the \a error will be set to \c QContactManager::DoesNotExistError.
Any operation error which occurs will be saved in \a error.
The \a fetchHint parameter describes the optimization hints that a manager may take.
If the \a fetchHint is the default constructed hint, all existing details, relationships and
action preferences in the matching contact will be returned. If a client makes changes to an
contact which has been retrieved with a fetch hint, they should save it back using a partial save,
masked by the same set of detail names in order to avoid information loss.
\sa QContactFetchHint
*/
QContact QContactManagerEngine::contact(const QContactId& contactId, const QContactFetchHint& fetchHint, QContactManager::Error* error) const
{
Q_UNUSED(contactId);
Q_UNUSED(fetchHint);
*error = QContactManager::NotSupportedError;
return QContact();
}
/*!
Sets the id of the "self" contact to the given \a contactId.
Returns true if the "self" contact id was set successfully.
If the given \a contactId does not identify a contact
stored in this manager, the \a error will be set to
\c QContactManager::DoesNotExistError and the function will
return false; if the backend does not support the
concept of a "self" contact, the \a error will be set to
\c QContactManager::NotSupportedError and the function will
return false.
*/
bool QContactManagerEngine::setSelfContactId(const QContactId& contactId, QContactManager::Error* error)
{
Q_UNUSED(contactId);
*error = QContactManager::NotSupportedError;
return false;
}
/*!
Returns the id of the "self" contact which has previously been set.
If no "self" contact has been set, or if the self contact was removed
from the manager after being set, or if the backend does not support
the concept of a "self" contact, the null id will be returned
and the \a error will be set to \c QContactManager::DoesNotExistError.
*/
QContactId QContactManagerEngine::selfContactId(QContactManager::Error* error) const
{
*error = QContactManager::DoesNotExistError;
return QContactId();
}
/*!
Returns a list of relationships of the given \a relationshipType in which the contact identified by \a participantId participates in the given \a role.
If \a participantId is default-constructed, \a role is ignored and all relationships of the given \a relationshipType are returned.
If \a relationshipType is empty, relationships of any type are returned.
If no relationships of the given \a relationshipType in which the contact identified by \a participantId is involved in the given \a role exists,
\a error is set to QContactManager::DoesNotExistError.
*/
QList<QContactRelationship> QContactManagerEngine::relationships(const QString& relationshipType, const QContactId& participantId, QContactRelationship::Role role, QContactManager::Error* error) const
{
Q_UNUSED(relationshipType);
Q_UNUSED(participantId);
Q_UNUSED(role);
*error = QContactManager::NotSupportedError;
return QList<QContactRelationship>();
}
/*!
Saves the given \a relationships in the database and returns true if the operation was successful.
For any relationship which was unable to be saved, an entry into the \a errorMap will be created,
with the key being the index into the input relationships list, and the value being the error which
occurred for that index.
The supplied \a errorMap parameter may be null, if the client does not desire detailed error information.
If supplied, it will be empty upon entry to this function.
The overall operation error will be saved in \a error.
*/
bool QContactManagerEngine::saveRelationships(QList<QContactRelationship>* relationships, QMap<int, QContactManager::Error>* errorMap, QContactManager::Error* error)
{
Q_UNUSED(relationships);
Q_UNUSED(errorMap);
*error = QContactManager::NotSupportedError;
return false;
}
/*!
Saves the given \a relationship in the database. If the relationship already exists in the database, this function will
return \c false and the \a error will be set to \c QContactManager::AlreadyExistsError.
If the relationship is saved successfully, this function will return \c true and \a error will be set
to \c QContactManager::NoError. Note that relationships cannot be updated directly using this function; in order
to update a relationship, you must remove the old relationship, make the required modifications, and then save it.
The given relationship is invalid if it is circular (the first contact is the second contact), or
if it references a non-existent local contact (either the first or second contact). If the given \a relationship is invalid,
the function will return \c false and the \a error will be set to \c QContactManager::InvalidRelationshipError.
The default implementation of this function converts the argument into a call to saveRelationships.
*/
bool QContactManagerEngine::saveRelationship(QContactRelationship *relationship, QContactManager::Error *error)
{
// Convert to a list op
if (relationship) {
QList<QContactRelationship> list;
list.append(*relationship);
QMap<int, QContactManager::Error> errors;
bool ret = saveRelationships(&list, &errors, error);
if (errors.count() > 0)
*error = errors.begin().value();
*relationship = list.value(0);
return ret;
} else {
*error = QContactManager::BadArgumentError;
return false;
}
}
/*!
Removes the given \a relationship from the manager. If the relationship exists in the manager, the relationship
will be removed, the \a error will be set to \c QContactManager::NoError and this function will return true. If no such
relationship exists in the manager, the \a error will be set to \c QContactManager::DoesNotExistError and this function
will return false.
The default implementation of this function converts the argument into a call to removeRelationships
*/
bool QContactManagerEngine::removeRelationship(const QContactRelationship& relationship, QContactManager::Error* error)
{
// Convert to a list op
QList<QContactRelationship> list;
list.append(relationship);
QMap<int, QContactManager::Error> errors;
bool ret = removeRelationships(list, &errors, error);
if (errors.count() > 0)
*error = errors.begin().value();
return ret;
}
/*!
Removes the given \a relationships from the database and returns true if the operation was successful.
For any relationship which was unable to be removed, an entry into the \a errorMap will be created,
with the key being the index into the input relationships list, and the value being the error which
occurred for that index.
The supplied \a errorMap parameter may be null, if the client does not desire detailed error information.
If supplied, it will be empty upon entry to this function.
The overall operation error will be saved in \a error.
*/
bool QContactManagerEngine::removeRelationships(const QList<QContactRelationship>& relationships, QMap<int, QContactManager::Error>* errorMap, QContactManager::Error* error)
{
Q_UNUSED(relationships);
Q_UNUSED(errorMap);
*error = QContactManager::NotSupportedError;
return false;
}
/*!
This function should be reimplemented to support synchronous calls to fetch the default collection id.
*/
QContactCollectionId QContactManagerEngine::defaultCollectionId() const
{
return QContactCollectionId();
}
/*!
This function should be reimplemented to support synchronous calls to fetch a collection based
on its ID. Any errors encountered during this operation should be stored to \a error. If the
given \a collectionId does not specify a valid collection, \a error will be set to
\c QContactManager::DoesNotExistError.
*/
QContactCollection QContactManagerEngine::collection(const QContactCollectionId& collectionId, QContactManager::Error* error)
{
Q_UNUSED(collectionId);
*error = QContactManager::NotSupportedError;
return QContactCollection();
}
/*!
This function should be reimplemented to support synchronous calls to fetch all the collections
managed by this backend. Any errors encountered during this operation should be stored to \a error.
*/
QList<QContactCollection> QContactManagerEngine::collections(QContactManager::Error* error)
{
*error = QContactManager::NotSupportedError;
return QList<QContactCollection>();
}
/*!
This function should be reimplemented to support synchronous calls to save a collection.
This function is supposed to save the given \a collection to the backend, and returns true on
success or false otherwise. Any errors encountered during this operation should be stored to
\a error.
A new collection will be created in the backend store if the collection ID of it is null.
Otherwise, an existing collection with the same ID will be updated. If the given collection ID
does not exist in the backend, it will result a QContactManager::DoesNotExistError error.
Note that upon successful saving, the backend may update the collection, e.g. collection ID for
newly saved collections.
*/
bool QContactManagerEngine::saveCollection(QContactCollection* collection, QContactManager::Error* error)
{
Q_UNUSED(collection);
*error = QContactManager::NotSupportedError;
return false;
}
/*!
This function should be reimplemented to support synchronous calls to remove a collection.
This function is supposed to remove the collection identified by the given \a collectionId, and
all items in the collection. Returns true on success, or false otherwise. Any errors encountered
during this operation should be stored to \a error.
Note that removing the default collection should not be allowed and should result a
QContactManager::PermissionsError error.
*/
bool QContactManagerEngine::removeCollection(const QContactCollectionId& collectionId, QContactManager::Error* error)
{
Q_UNUSED(collectionId);
*error = QContactManager::NotSupportedError;
return false;
}
/*!
Given an input \a filter, returns the canonical version of the filter.
Some of the following transformations may be applied:
\list
\li Any QContactActionFilters are transformed into the corresponding
QContactFilters returned by matching actions
\li Any QContactInvalidFilters contained in a union filter will be removed
\li Any default QContactFilters contained in an intersection filter will be removed
\li Any QContactIntersectionFilters with a QContactInvalidFilter contained will be
replaced with a QContactInvalidFilter
\li Any QContactUnionFilters with a default QContactFilter contained will be replaced
with a default QContactFilter
\li An empty QContactIntersectionFilter will be replaced with a QContactDefaultFilter
\li An empty QContactUnionFilter will be replaced with a QContactInvalidFilter
\li An empty QContactIdFilter will be replaced with a QContactInvalidFilter
\li An intersection or union filter with a single entry will be replaced by that entry
\li A QContactDetailFilter or QContactDetailRangeFilter with no detail type will be replaced with a QContactInvalidFilter
\li A QContactDetailRangeFilter with no range specified will be converted to a QContactDetailFilter
\endlist
*/
QContactFilter QContactManagerEngine::canonicalizedFilter(const QContactFilter &filter)
{
switch(filter.type()) {
case QContactFilter::ActionFilter:
{
// Find any matching actions, and do a union filter on their filter objects
QContactActionFilter af(filter);
QList<QContactActionDescriptor> descriptors = QContactActionManager::instance()->actionDescriptors(af.actionName());
QList<QContactFilter> filters;
for (int j = 0; j < descriptors.count(); j++) {
// Action filters are not allowed to return action filters, at all
// it's too annoying to check for recursion
QContactFilter d = descriptors.at(j).contactFilter();
if (!validateActionFilter(d))
continue;
filters.append(d);
}
if (filters.count() == 0)
return QContactInvalidFilter();
if (filters.count() == 1)
return filters.first();
QContactUnionFilter f;
f.setFilters(filters);
return canonicalizedFilter(f);
}
// unreachable
case QContactFilter::IntersectionFilter:
{
QContactIntersectionFilter f(filter);
QList<QContactFilter> filters = f.filters();
QList<QContactFilter>::iterator it = filters.begin();
// XXX in theory we can remove duplicates in a set filter
while (it != filters.end()) {
QContactFilter canon = canonicalizedFilter(*it);
if (canon.type() == QContactFilter::DefaultFilter) {
it = filters.erase(it);
} else if (canon.type() == QContactFilter::InvalidFilter) {
return QContactInvalidFilter();
} else {
*it = canon;
++it;
}
}
if (filters.count() == 0)
return QContactFilter();
if (filters.count() == 1)
return filters.first();
f.setFilters(filters);
return f;
}
// unreachable
case QContactFilter::UnionFilter:
{
QContactUnionFilter f(filter);
QList<QContactFilter> filters = f.filters();
QList<QContactFilter>::iterator it = filters.begin();
// XXX in theory we can remove duplicates in a set filter
while (it != filters.end()) {
QContactFilter canon = canonicalizedFilter(*it);
if (canon.type() == QContactFilter::InvalidFilter) {
it = filters.erase(it);
} else if (canon.type() == QContactFilter::DefaultFilter) {
return QContactFilter();
} else {
*it = canon;
++it;
}
}
if (filters.count() == 0)
return QContactInvalidFilter();
if (filters.count() == 1)
return filters.first();
f.setFilters(filters);
return f;
}
// unreachable
case QContactFilter::IdFilter:
{
QContactIdFilter f(filter);
if (f.ids().count() == 0)
return QContactInvalidFilter();
}
break; // fall through to return at end
case QContactFilter::ContactDetailRangeFilter:
{
QContactDetailRangeFilter f(filter);
if (f.detailType() == QContactDetail::TypeUndefined)
return QContactInvalidFilter();
if (f.minValue() == f.maxValue()
&& f.rangeFlags() == (QContactDetailRangeFilter::ExcludeLower | QContactDetailRangeFilter::ExcludeUpper))
return QContactInvalidFilter();
if ((f.minValue().isNull() && f.maxValue().isNull()) || (f.minValue() == f.maxValue())) {
QContactDetailFilter df;
df.setDetailType(f.detailType(), f.detailField());
df.setMatchFlags(f.matchFlags());
df.setValue(f.minValue());
return df;
}
}
break; // fall through to return at end
case QContactFilter::ContactDetailFilter:
{
QContactDetailFilter f(filter);
if (f.detailType() == QContactDetail::TypeUndefined)
return QContactInvalidFilter();
}
break; // fall through to return at end
default:
break; // fall through to return at end
}
return filter;
}
/*!
Returns a whether the supplied \a filter can be implemented
natively by this engine. If not, the base class implementation
will emulate the functionality.
*/
bool QContactManagerEngine::isFilterSupported(const QContactFilter& filter) const
{
Q_UNUSED(filter);
return false;
}
/*!
Returns the list of data types supported by this engine.
*/
QList<QVariant::Type> QContactManagerEngine::supportedDataTypes() const
{
return QList<QVariant::Type>();
}
/*!
Returns true if the manager supports the relationship type specified in \a relationshipType for
contacts whose type is the given \a contactType.
Note that some managers may support the relationship type for a contact in a limited manner
(for example, only as the first contact in the relationship, or only as the second contact
in the relationship). In this case, it will still return true. It will only return false
if the relationship is entirely unsupported for the given type of contact.
*/
bool QContactManagerEngine::isRelationshipTypeSupported(const QString& relationshipType, QContactType::TypeValues contactType) const
{
Q_UNUSED(relationshipType);
Q_UNUSED(contactType);
return false;
}
/*!
Returns the list of contact types which are supported by this engine.
This is a convenience function, equivalent to retrieving the allowable values
for the \c QContactType::FieldType field of the QContactType detail
which is valid in this engine.
*/
QList<QContactType::TypeValues> QContactManagerEngine::supportedContactTypes() const
{
QList<QContactType::TypeValues> list;
// By default, TypeFacet is not supported
list << QContactType::TypeContact
<< QContactType::TypeGroup;
return list;
}
/*!
\fn int QContactManagerEngine::managerVersion() const
Returns the engine backend implementation version number
*/
/*!
Returns the list of contact detail types which are supported by this engine.
*/
QList<QContactDetail::DetailType> QContactManagerEngine::supportedContactDetailTypes() const
{
QList<QContactDetail::DetailType> supportedDetails;
supportedDetails << QContactAddress::Type
<< QContactAnniversary::Type
<< QContactAvatar::Type
<< QContactBirthday::Type
<< QContactDisplayLabel::Type
<< QContactEmailAddress::Type
<< QContactExtendedDetail::Type
<< QContactFamily::Type
<< QContactFavorite::Type
<< QContactGender::Type
<< QContactGeoLocation::Type
<< QContactGlobalPresence::Type
<< QContactGuid::Type
<< QContactHobby::Type
<< QContactName::Type
<< QContactNickname::Type
<< QContactNote::Type
<< QContactOnlineAccount::Type
<< QContactOrganization::Type
<< QContactPhoneNumber::Type
<< QContactPresence::Type
<< QContactRingtone::Type
<< QContactSyncTarget::Type
<< QContactTag::Type
<< QContactTimestamp::Type
<< QContactType::Type
<< QContactUrl::Type
<< QContactVersion::Type;
return supportedDetails;
}
/*!
Checks that the given contact \a contact does not have a type which
is not supported. It also checks if the details of the given
\a contact are valid or not.
Note that this function is unable to ensure that all the details of
\a contact are supported by a certain back-end. It also cannot
check that the access constraints (such as CreateOnly and ReadOnly)
are observed; backend specific code must be written if you wish to
enforce these constraints.
Returns true if the \a contact has a valid type, otherwise returns
false.
Any errors encountered during this operation should be stored to
\a error.
*/
bool QContactManagerEngine::validateContact(const QContact &contact, QContactManager::Error *error) const
{
if (!supportedContactTypes().contains(contact.type())) {
*error = QContactManager::InvalidContactTypeError;
return false;
}
if ( (!contact.id().isNull()) && (contact.id().managerUri() != this->managerUri())) {
*error = QContactManager::DoesNotExistError;
return false;
}
QList<QContactDetail> contactDetailList = contact.details();
for (int i=0; i<contactDetailList.count(); i++)
{
QContactDetail currentDetail = contactDetailList.value(i);
if (!supportedContactDetailTypes().contains(currentDetail.type()))
{
*error = QContactManager::InvalidDetailError;
return false;
}
}
*error = QContactManager::NoError;
return true;
}
/*!
Sets the access constraints of \a detail to the supplied \a constraints.
This function is provided to allow engine implementations to report the
access constraints of retrieved details, without generally allowing the
access constraints to be modified after retrieval.
Application code should not call this function, since validation of the
detail will happen in the engine in any case.
*/
void QContactManagerEngine::setDetailAccessConstraints(QContactDetail *detail, QContactDetail::AccessConstraints constraints)
{
if (detail) {
QContactDetailPrivate::setAccessConstraints(detail, constraints);
}
}
/*!
Sets the provenance of \a detail to the supplied \a provenance.
This function is provided to allow engine implementations to report the
provenance of retrieved details, without generally allowing the
provenance metadata to be modified after retrieval.
The provenance of a detail in an aggregate Contact should include the
id of the Facet contact and the detail id of the particular detail in
that Facet contact from which the aggregate Contact's detail was promoted.
Application code should not call this function, since validation of the
detail will happen in the engine in any case.
*/
void QContactManagerEngine::setDetailProvenance(QContactDetail *detail, const QString &provenance)
{
if (detail) {
QContactDetailPrivate::setProvenance(detail, provenance);
}
}
/*!
Adds the given \a contact to the database if \a contact has a
null id, otherwise updates the contact in
the database which has the same id to be the given \a contact.
If the id is not null but does not identify any contact stored in the
manager, the function will return false and \a error will be set to
\c QContactManager::DoesNotExistError.
Returns true if the save operation completed successfully, otherwise
returns false. Any error which occurs will be saved in \a error.
The default implementation will convert this into a call to saveContacts.
\sa managerUri()
*/
bool QContactManagerEngine::saveContact(QContact* contact, QContactManager::Error* error)
{
// Convert to a list op
if (contact) {
QList<QContact> list;
list.append(*contact);
QMap<int, QContactManager::Error> errors;
bool ret = saveContacts(&list, &errors, error);
if (errors.count() > 0)
*error = errors.begin().value();
*contact = list.value(0);
return ret;
} else {
*error = QContactManager::BadArgumentError;
return false;
}
}
/*!
Remove the contact identified by \a contactId from the database,
and also removes any relationships in which the contact was involved.
After the contact has been removed it can not be updated or re-created
with the same contact id anymore.
Returns true if the contact was removed successfully, otherwise
returns false.
Any error which occurs will be saved in \a error.
The default implementation will convert this into a call to removeContacts.
*/
bool QContactManagerEngine::removeContact(const QContactId& contactId, QContactManager::Error* error)
{
// Convert to a list op
QList<QContactId> list;
list.append(contactId);
QMap<int, QContactManager::Error> errors;
bool ret = removeContacts(list, &errors, error);
if (errors.count() > 0)
*error = errors.begin().value();
return ret;
}
/*!
Adds the list of contacts given by \a contacts list to the database.
Returns true if the contacts were saved successfully, otherwise false.
The manager might populate \a errorMap (the map of indices of the \a contacts list to
the error which occurred when saving the contact at that index) for
every index for which the contact could not be saved, if it is able.
The supplied \a errorMap parameter may be null, if the client does not desire detailed error information.
If supplied, it will be empty upon entry to this function.
The \l QContactManager::error() function will only return \c QContactManager::NoError
if all contacts were saved successfully.
For each newly saved contact that was successful, the id of the contact
in the \a contacts list will be updated with the new value. If a failure occurs
when saving a new contact, the id will be cleared.
Any errors encountered during this operation should be stored to
\a error.
\sa QContactManager::saveContact()
*/
bool QContactManagerEngine::saveContacts(QList<QContact>* contacts, QMap<int, QContactManager::Error>* errorMap, QContactManager::Error* error)
{
Q_UNUSED(contacts);
Q_UNUSED(errorMap);
*error = QContactManager::NotSupportedError;
return false;
}
/*!
Remove every contact whose id is contained in the list of contacts ids
\a contactIds. Returns true if all contacts were removed successfully,
otherwise false.
Any contact that was removed successfully will have the relationships
in which it was involved removed also.
The manager might populate \a errorMap (the map of indices of the \a contactIds list to
the error which occurred when saving the contact at that index) for every
index for which the contact could not be removed, if it is able.
The supplied \a errorMap parameter may be null, if the client does not desire detailed error information.
If supplied, it will be empty upon entry to this function.
The \l QContactManager::error() function will
only return \c QContactManager::NoError if all contacts were removed
successfully.
If the list contains ids which do not identify a valid contact in the manager, the function will
remove any contacts which are identified by ids in the \a contactIds list, insert
\c QContactManager::DoesNotExist entries into the \a errorMap for the indices of invalid ids
in the \a contactIds list, return false, and set the overall operation error to
\c QContactManager::DoesNotExistError.
Any errors encountered during this operation should be stored to
\a error.
\sa QContactManager::removeContact()
*/
bool QContactManagerEngine::removeContacts(const QList<QContactId>& contactIds, QMap<int, QContactManager::Error>* errorMap, QContactManager::Error* error)
{
Q_UNUSED(contactIds);
Q_UNUSED(errorMap);
*error = QContactManager::NotSupportedError;
return false;
}
/* This implements the string comparison behaviour required for compareVariant, amongst others */
static inline int compareStrings(const QString& left, const QString& right, Qt::CaseSensitivity sensitivity)
{
if (sensitivity == Qt::CaseSensitive) {
return left.localeAwareCompare(right);
} else {
return left.toCaseFolded().localeAwareCompare(right.toCaseFolded());
}
/*
// manual implementation of string comparison.
// should not be necessary / used, as locale aware compare should be sensible.
// this code exists here for testing / result comparison purposes.
int retn = -50;
for (int i = 0; i < left.size(); ++i) {
if (i >= right.size()) { retn = 1; break; } // right is a substring of left
const QChar &lc(left[i]);
const QChar &rc(right[i]);
const QChar lowerLC = lc.toLower();
const QChar lowerRC = rc.toLower();
#if 0
// upper first (ascii-collation)
if (lc == rc) continue; // characters are identical.
if (sensitivity == Qt::CaseInsensitive && lowerLC == lowerRC) continue; // lowercase characters are identical.
if (lc.isLower() && rc.isUpper()) { retn = 1; break; } // left is greater than right
if (lc.isUpper() && rc.isLower()) { retn = -1; break; } // left is less than right
retn = (lc < rc ? -1 : 1); break; // both lower, or both upper. return relative less-than-ism.
#elif 0
// lower-first
if (lc == rc) continue; // characters are identical.
if (sensitivity == Qt::CaseInsensitive && lowerLC == lowerRC) continue; // lowercase characters are identical.
if (lc.isLower() && rc.isUpper()) { retn = -1; break; } // left is less than right
if (lc.isUpper() && rc.isLower()) { retn = 1; break; } // left is greater than right
retn = (lc < rc ? -1 : 1); break; // both lower, or both upper. return relative less-than-ism.
#elif 0
// interleaved-upper-first
if (lc == rc) continue; // characters are identical.
if (sensitivity == Qt::CaseInsensitive && lowerLC == lowerRC) continue; // lowercase characters are identical.
if (lowerLC == lowerRC) {
// we know that lc.isLower() != rc.isLower() otherwise the original lc==rc check would have been true.
if (lc.isLower()) { retn = 1; break; } // same letter, but left is lowercase :. greater than right.
else { retn = -1; break; } // same letter, but left is uppercase :. less than right
} else if (lowerLC < lowerRC) {
retn = -1; break;
} else {
retn = 1; break;
}
#elif 0
// interleaved-lower-first
if (lc == rc) continue; // characters are identical.
if (sensitivity == Qt::CaseInsensitive && lowerLC == lowerRC) continue; // lowercase characters are identical.
if (lowerLC == lowerRC) {
// we know that lc.isLower() != rc.isLower() otherwise the original lc==rc check would have been true.
if (lc.isLower()) { retn = -1; break; } // same letter, but left is lowercase :. less than right.
else { retn = 1; break; }// same letter, but left is uppercase :. greater than right
} else if (lowerLC < lowerRC) {
retn = -1; break;
} else {
retn = 1; break;
}
#elif 0
// interleaved-upper-first with first-pass case-insensitive comparison
if (i == 0) {
bool firstPassResult = false;
for (int j = 0; j < qMin(left.size(), right.size()); ++j) {
QChar firstpassLLC = left[j].toLower();
QChar firstpassLRC = right[j].toLower();
if (firstpassLLC < firstpassLRC) { retn = -1; firstPassResult = true; break; } // e.g. x < Y
else if (firstpassLLC > firstpassLRC) { retn = 1; firstPassResult = true; break; } // e.g. x > P
else { continue; } // e.g. x == X
}
if (firstPassResult) {
break; // case-insensitive first pass already found result
} else if (left.size() < right.size()) {
retn = -1; break; // no difference in case-insensitive comparison, but left is a (case-insensitive) substring of right.
} else if (left.size() > right.size()) {
retn = 1; break; // no difference in case-insensitive comparison, but right is a (case-insensitive) substring of left.
} else {
}
}
// if we get here, the strings are the same length and differ
// only by case. We use the upper-first semantic to resolve.
if (lc == rc) continue; // characters are identical.
if (sensitivity == Qt::CaseInsensitive && lowerLC == lowerRC) continue; // lowercase characters are identical.
if (lc.isUpper() && rc.isLower()) {
retn = -1; break;
} else if (lc.isLower() && rc.isUpper()) {
retn = 1; break;
} else {
// characters are equal in case, doesn't help us resolve ordering.
}
#elif 0
// interleaved-lower-first with first-pass case-insensitive comparison
if (i == 0) {
bool firstPassResult = false;
for (int j = 0; j < qMin(left.size(), right.size()); ++j) {
QChar firstpassLLC = left[j].toLower();
QChar firstpassLRC = right[j].toLower();
if (firstpassLLC < firstpassLRC) { retn = -1; firstPassResult = true; break; } // e.g. x < Y
else if (firstpassLLC > firstpassLRC) { retn = 1; firstPassResult = true; break; } // e.g. x > P
else { continue; } // e.g. x == X
}
if (firstPassResult) {
break; // case-insensitive first pass already found result
} else if (left.size() < right.size()) {
retn = -1; break; // no difference in case-insensitive comparison, but left is a (case-insensitive) substring of right.
} else if (left.size() > right.size()) {
retn = 1; break; // no difference in case-insensitive comparison, but right is a (case-insensitive) substring of left.
} else {
}
}
// if we get here, the strings are the same length and differ
// only by case. We use the lower-first semantic to resolve.
if (lc == rc) continue; // characters are identical.
if (sensitivity == Qt::CaseInsensitive && lowerLC == lowerRC) continue; // lowercase characters are identical.
if (lc.isUpper() && rc.isLower()) {
retn = 1; break;
} else if (lc.isLower() && rc.isUpper()) {
retn = -1; break;
} else {
// characters are equal in case, doesn't help us resolve ordering.
}
#endif
}
if (retn == -50) {
if (left.size() == right.size()) {
retn = 0; // strings are the same
} else {
retn = -1; // left is a substr of right, therefore less.
}
}
return retn;
*/
}
/*!
Compares \a first against \a second. If the types are
strings (QVariant::String), the \a sensitivity argument controls
case sensitivity when comparing. Also, when comparing strings,
a locale aware comparison is used, and if the sensitivity is
CaseSensitive, strings that are identical under a case insensitive
sort are then sorted case sensitively within that context.
For example:
aaron
Bob
Aaron
aAron
Carol
would sort as:
aaron
aAron
Aaron
Bob
Carol
Returns:
<0 if \a first is less than \a second
0 if \a first is equal to \a second
>0 if \a first is greater than \a second.
The results are undefined if the variants are different types, or
cannot be compared.
*/
int QContactManagerEngine::compareVariant(const QVariant& first, const QVariant& second, Qt::CaseSensitivity sensitivity)
{
switch(first.type()) {
case QVariant::Int:
{
const int a = first.toInt();
const int b = second.toInt();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::LongLong:
{
const qlonglong a = first.toLongLong();
const qlonglong b = second.toLongLong();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::Bool:
case QVariant::UInt:
{
const uint a = first.toUInt();
const uint b = second.toUInt();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::ULongLong:
{
const qulonglong a = first.toULongLong();
const qulonglong b = second.toULongLong();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::Char: // Needs to do proper string comparison
case QVariant::String:
return compareStrings(first.toString(), second.toString(), sensitivity);
case QVariant::Double:
{
const double a = first.toDouble();
const double b = second.toDouble();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::DateTime:
{
const QDateTime a = first.toDateTime();
const QDateTime b = second.toDateTime();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::Date:
{
const QDate a = first.toDate();
const QDate b = second.toDate();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::Time:
{
const QTime a = first.toTime();
const QTime b = second.toTime();
return (a < b) ? -1 : ((a == b) ? 0 : 1);
}
case QVariant::StringList:
{
// We don't actually sort on these, I hope
// {} < {"aa"} < {"aa","bb"} < {"aa", "cc"} < {"bb"}
int i;
const QStringList a = first.toStringList();
const QStringList b = second.toStringList();
for (i = 0; i < a.size(); i++) {
if (b.size() <= i)
return 1; // first is longer
int memberComp = compareStrings(a.at(i), b.at(i), sensitivity);
if (memberComp != 0)
return memberComp;
// this element is the same, so loop again
}
// Either a.size() < b.size() and they are equal all
// the way, or a == b
if (a.size() < b.size())
return -1; // a is less than b;
return 0; // they are equal
}
default:
return 0;
}
}
/*!
Returns true if the supplied contact \a contact matches the supplied filter \a filter.
This function will test each condition in the filter, possibly recursing.
*/
bool QContactManagerEngine::testFilter(const QContactFilter &filter, const QContact &contact)
{
switch(filter.type()) {
case QContactFilter::InvalidFilter:
return false;
case QContactFilter::DefaultFilter:
return true;
case QContactFilter::IdFilter:
{
const QContactIdFilter idf(filter);
if (idf.ids().contains(contact.id()))
return true;
}
// Fall through to end
break;
case QContactFilter::ContactDetailFilter:
{
const QContactDetailFilter cdf(filter);
if (cdf.detailType() == QContactDetail::TypeUndefined)
return false;
/* See if this contact has one of these details in it */
const QList<QContactDetail>& details = contact.details(cdf.detailType());
if (details.count() == 0)
return false; /* can't match */
/* See if we need to check the values */
if (cdf.detailField() == -1)
return true; /* just testing for the presence of a detail of the specified type */
/* Now figure out what tests we are doing */
const bool valueTest = cdf.value().isValid();
const bool presenceTest = !valueTest;
/* See if we need to test any values at all */
if (presenceTest) {
for(int j=0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
/* Check that the field is present and has a non-empty value */
if (detail.values().contains(cdf.detailField()) && !detail.value(cdf.detailField()).isNull())
return true;
}
return false;
}
/* Case sensitivity, for those parts that use it */
Qt::CaseSensitivity cs = (cdf.matchFlags() & QContactFilter::MatchCaseSensitive) ? Qt::CaseSensitive : Qt::CaseInsensitive;
/* See what flags are requested, since we're looking at a value */
if (cdf.matchFlags() & QContactFilter::MatchPhoneNumber) {
/* Doing phone number filtering. We hand roll an implementation here, backends will obviously want to override this. */
QString input = cdf.value().toString();
/* preprocess the input - ignore any non-digits (doesn't perform ITU-T collation */
QString preprocessedInput;
for (int i = 0; i < input.size(); i++) {
QChar current = input.at(i).toLower();
// XXX NOTE: we ignore characters like '+', 'p', 'w', '*' and '#' which may be important.
if (current.isDigit()) {
preprocessedInput.append(current);
}
}
/* Look at every detail in the set of details and compare */
for (int j = 0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
const QString& valueString = detail.value(cdf.detailField()).toString();
QString preprocessedValueString;
for (int i = 0; i < valueString.size(); i++) {
QChar current = valueString.at(i).toLower();
// note: we ignore characters like '+', 'p', 'w', '*' and '#' which may be important.
if (current.isDigit()) {
preprocessedValueString.append(current);
}
}
// if the matchflags input don't require a particular criteria to pass, we assume that it has passed.
// the "default" match strategy is an "endsWith" strategy.
bool me = (cdf.matchFlags() & 7) == QContactFilter::MatchExactly;
bool mc = (cdf.matchFlags() & 7) == QContactFilter::MatchContains;
bool msw = (cdf.matchFlags() & 7) == QContactFilter::MatchStartsWith;
bool mew = (cdf.matchFlags() & 7) == QContactFilter::MatchEndsWith;
bool mer = (me ? preprocessedValueString == preprocessedInput : true);
bool mcr = (mc ? preprocessedValueString.contains(preprocessedInput) : true);
bool mswr = (msw ? preprocessedValueString.startsWith(preprocessedInput) : true);
bool mewr = (mew ? preprocessedValueString.endsWith(preprocessedInput) : true);
if (mewr && mswr && mcr && mer) {
return true; // this detail meets all of the criteria which were required, and hence must match.
}
// fallback case: default MatchPhoneNumber compares the rightmost 7 digits, ignoring other matchflags.
if (preprocessedValueString.right(7) == preprocessedInput.right(7)) {
return true;
}
}
} else if (cdf.matchFlags() & QContactFilter::MatchKeypadCollation) {
// XXX TODO: not sure about the filtering semantics for MatchKeypadCollation.
QString input = cdf.value().toString();
/* Look at every detail in the set of details and compare */
for (int j = 0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
const QString& valueString = detail.value(cdf.detailField()).toString().toLower();
// preprocess the valueString
QString preprocessedValue;
for (int i = 0; i < valueString.size(); i++) {
// we use ITU-T keypad collation by default.
QChar currentValueChar = valueString.at(i);
if (currentValueChar == QLatin1Char('a') || currentValueChar == QLatin1Char('b') || currentValueChar == QLatin1Char('c'))
preprocessedValue.append(QLatin1Char('2'));
else if (currentValueChar == QLatin1Char('d') || currentValueChar == QLatin1Char('e') || currentValueChar == QLatin1Char('f'))
preprocessedValue.append(QLatin1Char('3'));
else if (currentValueChar == QLatin1Char('g') || currentValueChar == QLatin1Char('h') || currentValueChar == QLatin1Char('i'))
preprocessedValue.append(QLatin1Char('4'));
else if (currentValueChar == QLatin1Char('j') || currentValueChar == QLatin1Char('k') || currentValueChar == QLatin1Char('l'))
preprocessedValue.append(QLatin1Char('5'));
else if (currentValueChar == QLatin1Char('m') || currentValueChar == QLatin1Char('n') || currentValueChar == QLatin1Char('o'))
preprocessedValue.append(QLatin1Char('6'));
else if (currentValueChar == QLatin1Char('p') || currentValueChar == QLatin1Char('q') || currentValueChar == QLatin1Char('r') || currentValueChar == QLatin1Char('s'))
preprocessedValue.append(QLatin1Char('7'));
else if (currentValueChar == QLatin1Char('t') || currentValueChar == QLatin1Char('u') || currentValueChar == QLatin1Char('v'))
preprocessedValue.append(QLatin1Char('8'));
else if (currentValueChar == QLatin1Char('w') || currentValueChar == QLatin1Char('x') || currentValueChar == QLatin1Char('y') || currentValueChar == QLatin1Char('z'))
preprocessedValue.append(QLatin1Char('9'));
else
preprocessedValue.append(currentValueChar);
}
bool me = (cdf.matchFlags() & 7) == QContactFilter::MatchExactly;
bool mc = (cdf.matchFlags() & 7) == QContactFilter::MatchContains;
bool msw = (cdf.matchFlags() & 7) == QContactFilter::MatchStartsWith;
bool mew = (cdf.matchFlags() & 7) == QContactFilter::MatchEndsWith;
bool mer = (me ? preprocessedValue == input : true);
bool mcr = (mc ? preprocessedValue.contains(input) : true);
bool mswr = (msw ? preprocessedValue.startsWith(input) : true);
bool mewr = (mew ? preprocessedValue.endsWith(input) : true);
if (mewr && mswr && mcr && mer) {
return true; // this detail meets all of the criteria which were required, and hence must match.
}
}
} else if (cdf.matchFlags() & (QContactFilter::MatchEndsWith | QContactFilter::MatchStartsWith | QContactFilter::MatchContains | QContactFilter::MatchFixedString)) {
/* We're strictly doing string comparisons here */
bool matchStarts = (cdf.matchFlags() & 7) == QContactFilter::MatchStartsWith;
bool matchEnds = (cdf.matchFlags() & 7) == QContactFilter::MatchEndsWith;
bool matchContains = (cdf.matchFlags() & 7) == QContactFilter::MatchContains;
/* Value equality test */
for(int j=0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
const QString& var = detail.value(cdf.detailField()).toString();
const QString& needle = cdf.value().toString();
if (matchStarts && var.startsWith(needle, cs))
return true;
if (matchEnds && var.endsWith(needle, cs))
return true;
if (matchContains && var.contains(needle, cs))
return true;
if (compareStrings(var, needle, cs) == 0)
return true;
}
return false;
} else {
/* Nope, testing the values as a variant */
/* Value equality test */
for(int j = 0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
const QVariant& var = detail.value(cdf.detailField());
if (!var.isNull() && compareVariant(var, cdf.value(), cs) == 0)
return true;
}
}
}
break;
case QContactFilter::ContactDetailRangeFilter:
{
/* The only supported flags are: MatchExactly, MatchFixedString, MatchCaseSensitive */
const QContactDetailRangeFilter cdf(filter);
if (cdf.detailType() == QContactDetail::TypeUndefined)
return false; /* we do not know which field to check */
/* See if this contact has one of these details in it */
const QList<QContactDetail>& details = contact.details(cdf.detailType());
if (details.count() == 0)
return false; /* can't match */
/* Check for a detail presence test */
if (cdf.detailField() == -1)
return true;
/* See if this is a field presence test */
if (!cdf.minValue().isValid() && !cdf.maxValue().isValid()) {
for(int j=0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
if (detail.values().contains(cdf.detailField()))
return true;
}
return false;
}
/* open or closed interval testing support */
const int minComp = cdf.rangeFlags() & QContactDetailRangeFilter::ExcludeLower ? 1 : 0;
const int maxComp = cdf.rangeFlags() & QContactDetailRangeFilter::IncludeUpper ? 1 : 0;
/* Case sensitivity, for those parts that use it */
Qt::CaseSensitivity cs = (cdf.matchFlags() & QContactFilter::MatchCaseSensitive) ? Qt::CaseSensitive : Qt::CaseInsensitive;
/* See what flags are requested, since we're looking at a value */
if (cdf.matchFlags() & QContactFilter::MatchFixedString) {
/* We're strictly doing string comparisons here */
QString minVal = cdf.minValue().toString();
QString maxVal = cdf.maxValue().toString();
const bool testMin = !minVal.isEmpty();
const bool testMax = !maxVal.isEmpty();
for(int j=0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
// The detail has to have a field of this type in order to be compared.
if (!detail.value(cdf.detailField()).isValid())
continue;
const QString& var = detail.value(cdf.detailField()).toString();
if (testMin && compareStrings(var, minVal, cs) < minComp)
continue;
if (testMax && compareStrings(var, maxVal, cs) >= maxComp)
continue;
return true;
}
// Fall through to end
} else {
const bool testMin = cdf.minValue().isValid();
const bool testMax = cdf.maxValue().isValid();
/* Nope, testing the values as a variant */
for(int j=0; j < details.count(); j++) {
const QContactDetail& detail = details.at(j);
const QVariant& var = detail.value(cdf.detailField());
// The detail has to have a field of this type in order to be compared.
if (!var.isValid())
continue;
if (testMin && compareVariant(var, cdf.minValue(), cs) < minComp)
continue;
if (testMax && compareVariant(var, cdf.maxValue(), cs) >= maxComp)
continue;
return true;
}
// Fall through to end
}
}
break;
case QContactFilter::RelationshipFilter:
{
// matches any contact that plays the specified role in a relationship
// of the specified type with the specified other participant.
const QContactRelationshipFilter rf(filter);
// first, retrieve contact IDs
QContactId relatedId = rf.relatedContactId();
QContactId contactId = contact.id();
if (relatedId == contactId) {
return false;
}
// get the relationships in which this contact is involved.
QList<QContactRelationship> allRelationships;
allRelationships = contact.relationships();
// now check to see if we have a match.
foreach (const QContactRelationship& rel, allRelationships) {
// perform the matching.
if (rf.relatedContactRole() == QContactRelationship::Second) { // this is the role of the related contact; ie, to match, contact must be the first in the relationship.
if ((rf.relationshipType().isEmpty() || rel.relationshipType() == rf.relationshipType())
&& (rel.first() == contactId) && (relatedId.isNull() || relatedId == rel.second())) {
return true;
}
} else if (rf.relatedContactRole() == QContactRelationship::First) { // this is the role of the related contact; ie, to match, contact must be the second in the relationship.
if ((rf.relationshipType().isEmpty() || rel.relationshipType() == rf.relationshipType())
&& (rel.second() == contactId) && (relatedId.isNull() || relatedId == rel.first())) {
return true;
}
} else { // QContactRelationship::Either
if ((rf.relationshipType().isEmpty() || rel.relationshipType() == rf.relationshipType())
&& (relatedId.isNull() || (relatedId == rel.first() || relatedId == rel.second()))) {
return true;
}
}
}
// if not found by now, it doesn't match the filter.
return false;
}
//break; // unreachable.
case QContactFilter::ChangeLogFilter:
{
QContactChangeLogFilter ccf(filter);
// See what we can do...
QContactTimestamp ts = contact.detail(QContactTimestamp::Type);
// See if timestamps are even supported
if (ts.isEmpty())
break;
if (ccf.eventType() == QContactChangeLogFilter::EventAdded)
return ccf.since() <= ts.created();
if (ccf.eventType() == QContactChangeLogFilter::EventChanged)
return ccf.since() <= ts.lastModified();
// You can't emulate a removed..
// Fall through to end
}
break;
case QContactFilter::ActionFilter:
{
// Find any matching actions, and do a union filter on their filter objects
QContactActionFilter af(filter);
QList<QContactActionDescriptor> descriptors = QContactActionManager::instance()->actionDescriptors(af.actionName());
// There's a small wrinkle if there's a value specified in the action filter
// we have to adjust any contained QContactDetailFilters to have that value
// or test if a QContactDetailRangeFilter contains this value already
for (int j = 0; j < descriptors.count(); j++) {
// Action filters are not allowed to return action filters, at all
// it's too annoying to check for recursion
QContactFilter d = descriptors.at(j).contactFilter();
if (!validateActionFilter(d))
return false;
// Check for values etc...
if (testFilter(d, contact))
return true;
}
// Fall through to end
}
break;
case QContactFilter::IntersectionFilter:
{
/* XXX In theory we could reorder the terms to put the native tests first */
const QContactIntersectionFilter bf(filter);
const QList<QContactFilter>& terms = bf.filters();
if (terms.count() > 0) {
for(int j = 0; j < terms.count(); j++) {
if (!testFilter(terms.at(j), contact)) {
return false;
}
}
return true;
}
// Fall through to end
}
break;
case QContactFilter::UnionFilter:
{
/* XXX In theory we could reorder the terms to put the native tests first */
const QContactUnionFilter bf(filter);
const QList<QContactFilter>& terms = bf.filters();
if (terms.count() > 0) {
for(int j = 0; j < terms.count(); j++) {
if (testFilter(terms.at(j), contact)) {
return true;
}
}
return false;
}
// Fall through to end
}
break;
case QContactFilter::CollectionFilter:
{
const QContactCollectionFilter cf(filter);
const QSet<QContactCollectionId>& ids = cf.collectionIds();
if (ids.contains(contact.collectionId()))
return true;
return false;
}
}
return false;
}
/*!
Given a QContactFilter \a filter retrieved from a QContactAction,
check that it is valid and cannot cause infinite recursion.
In particular, a filter from a QContactAction cannot contain
any instances of a QContactActionFilter.
Returns true if \a filter seems ok, or false otherwise.
*/
bool validateActionFilter(const QContactFilter& filter)
{
QList<QContactFilter> toVerify;
toVerify << filter;
while(toVerify.count() > 0) {
QContactFilter f = toVerify.takeFirst();
if (f.type() == QContactFilter::ActionFilter)
return false;
if (f.type() == QContactFilter::IntersectionFilter)
toVerify.append(QContactIntersectionFilter(f).filters());
if (f.type() == QContactFilter::UnionFilter)
toVerify.append(QContactUnionFilter(f).filters());
}
return true;
}
/*!
Sets the cached relationships in the given \a contact to \a relationships
*/
void QContactManagerEngine::setContactRelationships(QContact* contact, const QList<QContactRelationship>& relationships)
{
contact->d->m_relationshipsCache = relationships;
}
/*!
Compares two contacts (\a a and \a b) using the given list of \a sortOrders. Returns a negative number if \a a should appear
before \a b according to the sort order, a positive number if \a a should appear after \a b according to the sort order,
and zero if the two are unable to be sorted.
*/
int QContactManagerEngine::compareContact(const QContact& a, const QContact& b, const QList<QContactSortOrder>& sortOrders)
{
foreach(const QContactSortOrder& sortOrder, sortOrders) {
if (!sortOrder.isValid())
break;
const QContactDetail::DetailType detailType = sortOrder.detailType();
const int detailField = sortOrder.detailField();
const QList<QContactDetail> aDetails = a.details(detailType);
const QList<QContactDetail> bDetails = b.details(detailType);
if (aDetails.isEmpty() && bDetails.isEmpty())
continue; // use next sort criteria.
// See if we need to check the values
if (detailField == -1) {
// just testing for the presence of a detail of the specified definition
if (aDetails.size() == bDetails.size())
continue; // use next sort criteria.
if (aDetails.isEmpty())
return sortOrder.blankPolicy() == QContactSortOrder::BlanksFirst ? -1 : 1;
if (bDetails.isEmpty())
return sortOrder.blankPolicy() == QContactSortOrder::BlanksFirst ? 1 : -1;
return 0;
}
// obtain the values which this sort order concerns
const QVariant aVal = !aDetails.isEmpty() ? aDetails.first().value(detailField) : QVariant();
const QVariant bVal = !bDetails.isEmpty() ? bDetails.first().value(detailField) : QVariant();
bool aIsNull = false;
bool bIsNull = false;
// treat empty strings as null qvariants.
if ((aVal.type() == QVariant::String && aVal.toString().isEmpty()) || aVal.isNull()) {
aIsNull = true;
}
if ((bVal.type() == QVariant::String && bVal.toString().isEmpty()) || bVal.isNull()) {
bIsNull = true;
}
// early exit error checking
if (aIsNull && bIsNull)
continue; // use next sort criteria.
if (aIsNull)
return (sortOrder.blankPolicy() == QContactSortOrder::BlanksFirst ? -1 : 1);
if (bIsNull)
return (sortOrder.blankPolicy() == QContactSortOrder::BlanksFirst ? 1 : -1);
// real comparison
int comparison = compareVariant(aVal, bVal, sortOrder.caseSensitivity()) * (sortOrder.direction() == Qt::AscendingOrder ? 1 : -1);
if (comparison == 0)
continue;
return comparison;
}
return 0; // or according to id? return (a.id() < b.id() ? -1 : 1);
}
/* A functor that returns true iff a is less than b, according to the sortOrders passed in to the
* ctor. The sortOrders pointer passed in must remain valid for the lifetime of the functor. */
class ContactLessThan {
public:
ContactLessThan(const QList<QContactSortOrder>* sortOrders) : mSortOrders(sortOrders) {}
bool operator()(const QContact& a, const QContact& b) const
{
return QContactManagerEngine::compareContact(a, b, *mSortOrders) < 0;
}
private:
const QList<QContactSortOrder>* mSortOrders;
};
/*!
Performs insertion sort of the contact \a toAdd into the \a sorted list, according to the provided \a sortOrders list.
The first QContactSortOrder in the list has the highest priority: if the contact \a toAdd is deemed equal to another
in the \a sorted list according to the first QContactSortOrder, the second QContactSortOrder in the list is used (and
so on until either the contact is inserted or there are no more sort order objects in the list).
If a contact is equal to another contact according to all sort orders, it is inserted after the previously-added contact.
*/
void QContactManagerEngine::addSorted(QList<QContact>* sorted, const QContact& toAdd, const QList<QContactSortOrder>& sortOrders)
{
if (sortOrders.count() > 0) {
ContactLessThan lessThan(&sortOrders);
QList<QContact>::iterator it(std::upper_bound(sorted->begin(), sorted->end(), toAdd, lessThan));
sorted->insert(it, toAdd);
} else {
// no sort order? just add it to the end
sorted->append(toAdd);
}
}
/*! Sorts the given list of contacts \a cs according to the provided \a sortOrders
*/
QList<QContactId> QContactManagerEngine::sortContacts(const QList<QContact>& cs, const QList<QContactSortOrder>& sortOrders)
{
QList<QContactId> sortedIds;
QList<QContact> sortedContacts = cs;
if (!sortOrders.isEmpty()) {
ContactLessThan lessThan(&sortOrders);
std::stable_sort(sortedContacts.begin(), sortedContacts.end(), lessThan);
}
foreach(const QContact& c, sortedContacts) {
sortedIds.append(c.id());
}
return sortedIds;
}
/*!
Notifies the manager engine that the given request \a req is in the process of being destroyed.
The request pointer \a req is still valid during this function call, but before returning
from this call the engine should ensure that it no longer holds any references
to the \a req pointer (for example, in a queue in another thread) because directly
following this call the request will be deleted and this pointer will become invalid.
In a multithreaded engine, this may mean blocking the calling thread while other
threads clean up.
If a request is still in progress at this point, it is undefined what will
happen to the operation requested, but in general it should either be
fully completed or fully aborted. In any case, the client has signalled that
they do not care about the outcome (by deleting the request).
*/
void QContactManagerEngine::requestDestroyed(QContactAbstractRequest* req)
{
Q_UNUSED(req);
}
/*!
Asks the manager engine to begin the given request \a req which
is currently in a (re)startable state.
Returns true if the request was started successfully, else returns false.
\sa QContactAbstractRequest::start()
*/
bool QContactManagerEngine::startRequest(QContactAbstractRequest* req)
{
Q_UNUSED(req);
return false;
}
/*!
Asks the manager engine to cancel the given request \a req which was
previously started and is currently in a cancellable state.
Returns true if cancellation of the request was started successfully,
otherwise returns false.
\sa startRequest(), QContactAbstractRequest::cancel()
*/
bool QContactManagerEngine::cancelRequest(QContactAbstractRequest* req)
{
Q_UNUSED(req);
return false;
}
/*!
Blocks until the manager engine has completed the given request \a req
which was previously started, or until \a msecs milliseconds have passed.
Returns true if the request was completed, and false if the request was not in the
\c QContactAbstractRequest::Active state or no progress could be reported.
\sa startRequest()
*/
bool QContactManagerEngine::waitForRequestFinished(QContactAbstractRequest* req, int msecs)
{
Q_UNUSED(req);
Q_UNUSED(msecs);
return false;
}
/*!
Updates the given asynchronous request \a req by setting the new \a state
of the request. If the new state is different, the stateChanged() signal
will be emitted by the request.
*/
void QContactManagerEngine::updateRequestState(QContactAbstractRequest* req, QContactAbstractRequest::State state)
{
Q_ASSERT(req);
QMutexLocker ml(&req->d_ptr->m_mutex);
bool emitState = req->d_ptr->m_state != state;
req->d_ptr->m_state = state;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, state));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactIdFetchRequest \a req with the latest results \a result, and operation error \a error.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateContactIdFetchRequest(QContactIdFetchRequest* req, const QList<QContactId>& result, QContactManager::Error error, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactIdFetchRequestPrivate* rd = static_cast<QContactIdFetchRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_ids = result;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactFetchRequest \a req with the latest results \a result, and operation error \a error.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateContactFetchRequest(QContactFetchRequest* req, const QList<QContact>& result, QContactManager::Error error, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactFetchRequestPrivate* rd = static_cast<QContactFetchRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_contacts = result;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactRemoveRequest \a req with the operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateContactRemoveRequest(QContactRemoveRequest* req, QContactManager::Error error, const QMap<int, QContactManager::Error>& errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactRemoveRequestPrivate* rd = static_cast<QContactRemoveRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactSaveRequest \a req with the latest results \a result, operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateContactSaveRequest(QContactSaveRequest* req, const QList<QContact>& result, QContactManager::Error error, const QMap<int, QContactManager::Error>& errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactSaveRequestPrivate* rd = static_cast<QContactSaveRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_contacts = result;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactRelationshipSaveRequest \a req with the latest results \a result, operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateRelationshipSaveRequest(QContactRelationshipSaveRequest* req, const QList<QContactRelationship>& result, QContactManager::Error error, const QMap<int, QContactManager::Error>& errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactRelationshipSaveRequestPrivate* rd = static_cast<QContactRelationshipSaveRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_relationships = result;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactRelationshipRemoveRequest \a req with the operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateRelationshipRemoveRequest(QContactRelationshipRemoveRequest* req, QContactManager::Error error, const QMap<int, QContactManager::Error>& errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactRelationshipRemoveRequestPrivate* rd = static_cast<QContactRelationshipRemoveRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactRelationshipFetchRequest \a req with the latest results \a result, and operation error \a error.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateRelationshipFetchRequest(QContactRelationshipFetchRequest* req, const QList<QContactRelationship>& result, QContactManager::Error error, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactRelationshipFetchRequestPrivate* rd = static_cast<QContactRelationshipFetchRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_relationships = result;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactCollectionFetchRequest \a req with the latest results \a result and an operation error \a error.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateCollectionFetchRequest(QContactCollectionFetchRequest* req, const QList<QContactCollection>& result, QContactManager::Error error, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactCollectionFetchRequestPrivate* rd = static_cast<QContactCollectionFetchRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_collections = result;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactCollectionRemoveRequest \a req with the operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateCollectionRemoveRequest(QContactCollectionRemoveRequest* req, QContactManager::Error error, const QMap<int, QContactManager::Error>& errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactCollectionRemoveRequestPrivate* rd = static_cast<QContactCollectionRemoveRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
Updates the given QContactCollectionSaveRequest \a req with the latest results \a result, operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateCollectionSaveRequest(QContactCollectionSaveRequest* req, const QList<QContactCollection>& result, QContactManager::Error error, const QMap<int, QContactManager::Error>& errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactCollectionSaveRequestPrivate* rd = static_cast<QContactCollectionSaveRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_collections = result;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
/*!
For each contact in \a contacts, either add it to the database or update an existing one.
This function accepts a \a typeMask, which specifies which details of the contacts should be
updated. Details with types not included in the typeMask will not be updated
or added.
The manager should populate \a errorMap (the map of indices of the \a contacts list to the error
which occurred when saving the contact at that index) for every index for which the contact could
not be saved, if it is able.
The supplied \a errorMap parameter may be null, if the client does not desire detailed error information.
If supplied, it will be empty upon entry to this function.
The \l QContactManager::error() function will only return \c QContactManager::NoError if all
contacts were saved successfully.
For each newly saved contact that was successful, the id of the contact in the \a contacts list
will be updated with the new value. If a failure occurs when saving a new contact, the id will be
cleared.
Any errors encountered during this operation should be stored to \a error.
*/
bool QContactManagerEngine::saveContacts(QList<QContact> *contacts, const QList<QContactDetail::DetailType> &typeMask, QMap<int, QContactManager::Error> *errorMap, QContactManager::Error *error)
{
// TODO should the default implementation do the right thing, or return false?
if (typeMask.isEmpty()) {
// Non partial, just pass it on
return saveContacts(contacts, errorMap, error);
} else {
// Partial contact save.
// Basically
// Need to:
// 1) fetch existing contacts
// 2) strip out details in typeMask for existing contacts
// 3) copy the details from the passed in list for existing contacts
// 4) for any new contacts, copy the masked details to a blank contact
// 5) save the modified ones
// 6) update the id of any new contacts
// 7) transfer any errors from saving to errorMap
QList<QContactId> existingContactIds;
// Error conditions:
// 1) bad id passed in (can't fetch)
// 2) bad fetch (can't save partial update)
// 3) bad save error
// all of which needs to be returned in the error map
QHash<int, int> existingIdMap; // contacts index to existingContacts index
// Try to figure out which of our arguments are new contacts
for(int i = 0; i < contacts->count(); i++) {
// See if there's a contactId that's not from this manager
const QContact c = contacts->at(i);
if (c.id().managerUri() == managerUri()) {
existingIdMap.insert(i, existingContactIds.count());
existingContactIds.append(c.id());
} else if (!c.id().isNull()) {
// Hmm, error (wrong manager)
errorMap->insert(i, QContactManager::DoesNotExistError);
} // else new contact
}
// Now fetch the existing contacts
QMap<int, QContactManager::Error> fetchErrors;
QContactManager::Error fetchError = QContactManager::NoError;
QList<QContact> existingContacts = this->contacts(existingContactIds, QContactFetchHint(),
&fetchErrors, &fetchError);
// Prepare the list to save
QList<QContact> contactsToSave;
QList<int> savedToOriginalMap; // contactsToSave index to contacts index
QSet<QContactDetail::DetailType> mask = typeMask.toSet();
for (int i = 0; i < contacts->count(); i++) {
// See if this is an existing contact or a new one
const int fetchedIdx = existingIdMap.value(i, -1);
QContact contactToSave;
if (fetchedIdx >= 0) {
// See if we had an error
if (fetchErrors[fetchedIdx] != QContactManager::NoError) {
errorMap->insert(i, fetchErrors[fetchedIdx]);
continue;
}
// Existing contact we should have fetched
contactToSave = existingContacts.at(fetchedIdx);
QSharedDataPointer<QContactData>& cd = QContactData::contactData(contactToSave);
cd->removeOnly(mask);
} else if (errorMap->contains(i)) {
// A bad argument. Leave it out of the contactsToSave list
continue;
} // else new contact
// Now copy in the details from the arguments
const QContact& c = contacts->at(i);
foreach (QContactDetail::DetailType type, mask) {
QList<QContactDetail> details = c.details(type);
foreach(QContactDetail detail, details) {
contactToSave.saveDetail(&detail);
}
}
savedToOriginalMap.append(i);
contactsToSave.append(contactToSave);
}
// Now save them
QMap<int, QContactManager::Error> saveErrors;
QContactManager::Error saveError = QContactManager::NoError;
saveContacts(&contactsToSave, &saveErrors, &saveError);
// Now update the passed in arguments, where necessary
// Update IDs of the contacts list
for (int i = 0; i < contactsToSave.count(); i++) {
(*contacts)[savedToOriginalMap[i]].setId(contactsToSave[i].id());
}
// Populate the errorMap with the errorMap of the attempted save
QMap<int, QContactManager::Error>::iterator it(saveErrors.begin());
while (it != saveErrors.end()) {
if (it.value() != QContactManager::NoError) {
errorMap->insert(savedToOriginalMap[it.key()], it.value());
}
it++;
}
return errorMap->isEmpty();
}
}
/*!
Returns the list of contacts with the ids given by \a contactIds. There is a one-to-one
correspondence between the returned contacts and the supplied \a contactIds.
If there is an invalid id in \a contactIds, then an empty QContact will take its place in the
returned list and an entry will be inserted into \a errorMap.
The overall operation error will be saved in \a error.
The \a fetchHint parameter describes the optimization hints that a manager may take.
If the \a fetchHint is the default constructed hint, all existing details, relationships and
action preferences in the matching contacts will be returned.
If a non-default fetch hint is supplied, and the client wishes to make changes to the contacts,
they should ensure that only a detail type hint is supplied and that when saving it back, a
type mask should be used which corresponds to the detail type hint. This is to ensure
that no data is lost by overwriting an existing contact with a restricted version of it.
\sa QContactFetchHint
*/
QList<QContact> QContactManagerEngine::contacts(const QList<QContactId> &contactIds, const QContactFetchHint &fetchHint, QMap<int, QContactManager::Error> *errorMap, QContactManager::Error *error) const
{
QContactIdFilter lif;
lif.setIds(contactIds);
QList<QContact> unsorted = contacts(lif, QContactSortOrder(), fetchHint, error);
// Build an index into the results
QHash<QContactId, int> idMap; // value is index into unsorted
if (*error == QContactManager::NoError) {
for (int i = 0; i < unsorted.size(); i++) {
idMap.insert(unsorted[i].id(), i);
}
}
// Build up the results and errors
QList<QContact> results;
for (int i = 0; i < contactIds.count(); i++) {
QContactId id(contactIds[i]);
if (!idMap.contains(id)) {
if (errorMap)
errorMap->insert(i, QContactManager::DoesNotExistError);
if (*error == QContactManager::NoError)
*error = QContactManager::DoesNotExistError;
results.append(QContact());
} else {
results.append(unsorted[idMap[id]]);
}
}
return results;
}
/*!
Updates the given QContactFetchByIdRequest \a req with the latest results \a result, and operation error \a error, and map of input index to individual error \a errorMap.
In addition, the state of the request will be changed to \a newState.
It then causes the request to emit its resultsAvailable() signal to notify clients of the request progress.
If the new request state is different from the previous state, the stateChanged() signal will also be emitted from the request.
*/
void QContactManagerEngine::updateContactFetchByIdRequest(QContactFetchByIdRequest *req, const QList<QContact> &result, QContactManager::Error error,
const QMap<int, QContactManager::Error> &errorMap, QContactAbstractRequest::State newState)
{
Q_ASSERT(req);
QContactFetchByIdRequestPrivate* rd = static_cast<QContactFetchByIdRequestPrivate*>(req->d_ptr);
QMutexLocker ml(&rd->m_mutex);
bool emitState = rd->m_state != newState;
rd->m_contacts = result;
rd->m_errors = errorMap;
rd->m_error = error;
rd->m_state = newState;
ml.unlock();
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
QPointer<QContactAbstractRequest> guard(req);
#endif
Qt::ConnectionType connectionType = Qt::DirectConnection;
#ifdef QT_NO_THREAD
if (req->thread() != QThread::currentThread())
connectionType = Qt::BlockingQueuedConnection;
#endif
QMetaObject::invokeMethod(req, "resultsAvailable", connectionType);
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
if (emitState)
QMetaObject::invokeMethod(req, "stateChanged", connectionType, Q_ARG(QContactAbstractRequest::State, newState));
#if !defined(QT_NO_DEBUG) || defined(QT_FORCE_ASSERTS)
Q_ASSERT(guard);
#endif
}
QT_END_NAMESPACE_CONTACTS
#include "moc_qcontactmanagerengine.cpp"
|