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
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
2825
2826
2827
2828
2829
2830
2831
2832
2833
2834
2835
2836
2837
2838
2839
2840
2841
2842
2843
2844
2845
2846
2847
2848
2849
2850
2851
2852
2853
2854
2855
2856
2857
2858
2859
2860
2861
2862
2863
2864
2865
2866
2867
2868
2869
2870
2871
2872
2873
2874
2875
2876
2877
2878
2879
2880
2881
2882
2883
2884
2885
2886
2887
2888
2889
2890
2891
2892
2893
2894
2895
2896
2897
2898
2899
2900
2901
2902
2903
2904
2905
2906
2907
2908
2909
2910
2911
2912
2913
2914
2915
2916
2917
2918
2919
2920
2921
2922
2923
2924
2925
2926
2927
2928
2929
2930
2931
2932
2933
2934
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
2946
2947
2948
2949
2950
2951
2952
2953
2954
2955
2956
2957
2958
2959
2960
2961
2962
2963
2964
2965
2966
2967
2968
2969
2970
2971
2972
2973
2974
2975
2976
2977
2978
2979
2980
2981
2982
2983
2984
2985
2986
2987
2988
2989
2990
2991
2992
2993
2994
2995
2996
2997
2998
2999
3000
3001
3002
3003
3004
3005
3006
3007
3008
3009
3010
3011
3012
3013
3014
3015
3016
3017
3018
3019
3020
3021
3022
3023
3024
3025
3026
3027
3028
3029
3030
3031
3032
3033
3034
3035
3036
3037
3038
3039
3040
3041
3042
3043
3044
3045
3046
3047
3048
3049
3050
3051
3052
3053
3054
3055
3056
3057
3058
3059
3060
3061
3062
3063
3064
3065
3066
3067
3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.1, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qpainterpath.h"
#include "qpainterpath_p.h"
#include <qbitmap.h>
#include <qdebug.h>
#include <qiodevice.h>
#include <qlist.h>
#include <qmatrix.h>
#include <qpen.h>
#include <qpolygon.h>
#include <qtextlayout.h>
#include <qvarlengtharray.h>
#include <qmath.h>
#include <private/qbezier_p.h>
#include <private/qfontengine_p.h>
#include <private/qnumeric_p.h>
#include <private/qobject_p.h>
#include <private/qpathclipper_p.h>
#include <private/qstroker_p.h>
#include <private/qtextengine_p.h>
#include <limits.h>
#if 0
#include <performance.h>
#else
#define PM_INIT
#define PM_MEASURE(x)
#define PM_DISPLAY
#endif
QT_BEGIN_NAMESPACE
// This value is used to determine the length of control point vectors
// when approximating arc segments as curves. The factor is multiplied
// with the radius of the circle.
// #define QPP_DEBUG
// #define QPP_STROKE_DEBUG
//#define QPP_FILLPOLYGONS_DEBUG
QPainterPath qt_stroke_dash(const QPainterPath &path, qreal *dashes, int dashCount);
void qt_find_ellipse_coords(const QRectF &r, qreal angle, qreal length,
QPointF* startPoint, QPointF *endPoint)
{
if (r.isNull()) {
if (startPoint)
*startPoint = QPointF();
if (endPoint)
*endPoint = QPointF();
return;
}
qreal w2 = r.width() / 2;
qreal h2 = r.height() / 2;
qreal angles[2] = { angle, angle + length };
QPointF *points[2] = { startPoint, endPoint };
for (int i = 0; i < 2; ++i) {
if (!points[i])
continue;
qreal theta = angles[i] - 360 * qFloor(angles[i] / 360);
qreal t = theta / 90;
// truncate
int quadrant = int(t);
t -= quadrant;
t = qt_t_for_arc_angle(90 * t);
// swap x and y?
if (quadrant & 1)
t = 1 - t;
qreal a, b, c, d;
QBezier::coefficients(t, a, b, c, d);
QPointF p(a + b + c*QT_PATH_KAPPA, d + c + b*QT_PATH_KAPPA);
// left quadrants
if (quadrant == 1 || quadrant == 2)
p.rx() = -p.x();
// top quadrants
if (quadrant == 0 || quadrant == 1)
p.ry() = -p.y();
*points[i] = r.center() + QPointF(w2 * p.x(), h2 * p.y());
}
}
#ifdef QPP_DEBUG
static void qt_debug_path(const QPainterPath &path)
{
const char *names[] = {
"MoveTo ",
"LineTo ",
"CurveTo ",
"CurveToData"
};
printf("\nQPainterPath: elementCount=%d\n", path.elementCount());
for (int i=0; i<path.elementCount(); ++i) {
const QPainterPath::Element &e = path.elementAt(i);
Q_ASSERT(e.type >= 0 && e.type <= QPainterPath::CurveToDataElement);
printf(" - %3d:: %s, (%.2f, %.2f)\n", i, names[e.type], e.x, e.y);
}
}
#endif
/*!
\class QPainterPath
\ingroup multimedia
\ingroup shared
\brief The QPainterPath class provides a container for painting operations,
enabling graphical shapes to be constructed and reused.
A painter path is an object composed of a number of graphical
building blocks, such as rectangles, ellipses, lines, and curves.
Building blocks can be joined in closed subpaths, for example as a
rectangle or an ellipse. A closed path has coinciding start and
end points. Or they can exist independently as unclosed subpaths,
such as lines and curves.
A QPainterPath object can be used for filling, outlining, and
clipping. To generate fillable outlines for a given painter path,
use the QPainterPathStroker class. The main advantage of painter
paths over normal drawing operations is that complex shapes only
need to be created once; then they can be drawn many times using
only calls to the QPainter::drawPath() function.
QPainterPath provides a collection of functions that can be used
to obtain information about the path and its elements. In addition
it is possible to reverse the order of the elements using the
toReversed() function. There are also several functions to convert
this painter path object into a polygon representation.
\tableofcontents
\section1 Composing a QPainterPath
A QPainterPath object can be constructed as an empty path, with a
given start point, or as a copy of another QPainterPath object.
Once created, lines and curves can be added to the path using the
lineTo(), arcTo(), cubicTo() and quadTo() functions. The lines and
curves stretch from the currentPosition() to the position passed
as argument.
The currentPosition() of the QPainterPath object is always the end
position of the last subpath that was added (or the initial start
point). Use the moveTo() function to move the currentPosition()
without adding a component. The moveTo() function implicitly
starts a new subpath, and closes the previous one. Another way of
starting a new subpath is to call the closeSubpath() function
which closes the current path by adding a line from the
currentPosition() back to the path's start position. Note that the
new path will have (0, 0) as its initial currentPosition().
QPainterPath class also provides several convenience functions to
add closed subpaths to a painter path: addEllipse(), addPath(),
addRect(), addRegion() and addText(). The addPolygon() function
adds an \e unclosed subpath. In fact, these functions are all
collections of moveTo(), lineTo() and cubicTo() operations.
In addition, a path can be added to the current path using the
connectPath() function. But note that this function will connect
the last element of the current path to the first element of given
one by adding a line.
Below is a code snippet that shows how a QPainterPath object can
be used:
\table 100%
\row
\o \inlineimage qpainterpath-construction.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 0
\endtable
The painter path is initially empty when constructed. We first add
a rectangle, which is a closed subpath. Then we add two bezier
curves which together form a closed subpath even though they are
not closed individually. Finally we draw the entire path. The path
is filled using the default fill rule, Qt::OddEvenFill. Qt
provides two methods for filling paths:
\table
\row
\o \inlineimage qt-fillrule-oddeven.png
\o \inlineimage qt-fillrule-winding.png
\header
\o Qt::OddEvenFill
\o Qt::WindingFill
\endtable
See the Qt::FillRule documentation for the definition of the
rules. A painter path's currently set fill rule can be retrieved
using the fillRule() function, and altered using the setFillRule()
function.
\section1 QPainterPath Information
The QPainterPath class provides a collection of functions that
returns information about the path and its elements.
The currentPosition() function returns the end point of the last
subpath that was added (or the initial start point). The
elementAt() function can be used to retrieve the various subpath
elements, the \e number of elements can be retrieved using the
elementCount() function, and the isEmpty() function tells whether
this QPainterPath object contains any elements at all.
The controlPointRect() function returns the rectangle containing
all the points and control points in this path. This function is
significantly faster to compute than the exact boundingRect()
which returns the bounding rectangle of this painter path with
floating point precision.
Finally, QPainterPath provides the contains() function which can
be used to determine whether a given point or rectangle is inside
the path, and the intersects() function which determines if any of
the points inside a given rectangle also are inside this path.
\section1 QPainterPath Conversion
For compatibility reasons, it might be required to simplify the
representation of a painter path: QPainterPath provides the
toFillPolygon(), toFillPolygons() and toSubpathPolygons()
functions which convert the painter path into a polygon. The
toFillPolygon() returns the painter path as one single polygon,
while the two latter functions return a list of polygons.
The toFillPolygons() and toSubpathPolygons() functions are
provided because it is usually faster to draw several small
polygons than to draw one large polygon, even though the total
number of points drawn is the same. The difference between the two
is the \e number of polygons they return: The toSubpathPolygons()
creates one polygon for each subpath regardless of intersecting
subpaths (i.e. overlapping bounding rectangles), while the
toFillPolygons() functions creates only one polygon for
overlapping subpaths.
The toFillPolygon() and toFillPolygons() functions first convert
all the subpaths to polygons, then uses a rewinding technique to
make sure that overlapping subpaths can be filled using the
correct fill rule. Note that rewinding inserts additional lines in
the polygon so the outline of the fill polygon does not match the
outline of the path.
\section1 Examples
Qt provides the \l {painting/painterpaths}{Painter Paths Example}
and the \l {demos/deform}{Vector Deformation Demo} which are
located in Qt's example and demo directories respectively.
The \l {painting/painterpaths}{Painter Paths Example} shows how
painter paths can be used to build complex shapes for rendering
and lets the user experiment with the filling and stroking. The
\l {demos/deform}{Vector Deformation Demo} shows how to use
QPainterPath to draw text.
\table
\row
\o \inlineimage qpainterpath-example.png
\o \inlineimage qpainterpath-demo.png
\header
\o \l {painting/painterpaths}{Painter Paths Example}
\o \l {demos/deform}{Vector Deformation Demo}
\endtable
\sa QPainterPathStroker, QPainter, QRegion, {Painter Paths Example}
*/
/*!
\enum QPainterPath::ElementType
This enum describes the types of elements used to connect vertices
in subpaths.
Note that elements added as closed subpaths using the
addEllipse(), addPath(), addPolygon(), addRect(), addRegion() and
addText() convenience functions, is actually added to the path as
a collection of separate elements using the moveTo(), lineTo() and
cubicTo() functions.
\value MoveToElement A new subpath. See also moveTo().
\value LineToElement A line. See also lineTo().
\value CurveToElement A curve. See also cubicTo() and quadTo().
\value CurveToDataElement The extra data required to describe a curve in
a CurveToElement element.
\sa elementAt(), elementCount()
*/
/*!
\class QPainterPath::Element
\brief The QPainterPath::Element class specifies the position and
type of a subpath.
Once a QPainterPath object is constructed, subpaths like lines and
curves can be added to the path (creating
QPainterPath::LineToElement and QPainterPath::CurveToElement
components).
The lines and curves stretch from the currentPosition() to the
position passed as argument. The currentPosition() of the
QPainterPath object is always the end position of the last subpath
that was added (or the initial start point). The moveTo() function
can be used to move the currentPosition() without adding a line or
curve, creating a QPainterPath::MoveToElement component.
\sa QPainterPath
*/
/*!
\variable QPainterPath::Element::x
\brief the x coordinate of the element's position.
\sa {operator QPointF()}
*/
/*!
\variable QPainterPath::Element::y
\brief the y coordinate of the element's position.
\sa {operator QPointF()}
*/
/*!
\variable QPainterPath::Element::type
\brief the type of element
\sa isCurveTo(), isLineTo(), isMoveTo()
*/
/*!
\fn bool QPainterPath::Element::operator==(const Element &other) const
\since 4.2
Returns true if this element is equal to \a other;
otherwise returns false.
\sa operator!=()
*/
/*!
\fn bool QPainterPath::Element::operator!=(const Element &other) const
\since 4.2
Returns true if this element is not equal to \a other;
otherwise returns false.
\sa operator==()
*/
/*!
\fn bool QPainterPath::Element::isCurveTo () const
Returns true if the element is a curve, otherwise returns false.
\sa type, QPainterPath::CurveToElement
*/
/*!
\fn bool QPainterPath::Element::isLineTo () const
Returns true if the element is a line, otherwise returns false.
\sa type, QPainterPath::LineToElement
*/
/*!
\fn bool QPainterPath::Element::isMoveTo () const
Returns true if the element is moving the current position,
otherwise returns false.
\sa type, QPainterPath::MoveToElement
*/
/*!
\fn QPainterPath::Element::operator QPointF () const
Returns the element's position.
\sa x, y
*/
/*!
\fn void QPainterPath::addEllipse(qreal x, qreal y, qreal width, qreal height)
\overload
Creates an ellipse within the bounding rectangle defined by its top-left
corner at (\a x, \a y), \a width and \a height, and adds it to the
painter path as a closed subpath.
*/
/*!
\since 4.4
\fn void QPainterPath::addEllipse(const QPointF ¢er, qreal rx, qreal ry)
\overload
Creates an ellipse positioned at \a{center} with radii \a{rx} and \a{ry},
and adds it to the painter path as a closed subpath.
*/
/*!
\fn void QPainterPath::addText(qreal x, qreal y, const QFont &font, const QString &text)
\overload
Adds the given \a text to this path as a set of closed subpaths created
from the \a font supplied. The subpaths are positioned so that the left
end of the text's baseline lies at the point specified by (\a x, \a y).
*/
/*!
\fn int QPainterPath::elementCount() const
Returns the number of path elements in the painter path.
\sa ElementType, elementAt(), isEmpty()
*/
/*!
\fn const QPainterPath::Element &QPainterPath::elementAt(int index) const
Returns the element at the given \a index in the painter path.
\sa ElementType, elementCount(), isEmpty()
*/
/*!
\fn void QPainterPath::setElementPositionAt(int index, qreal x, qreal y)
\since 4.2
Sets the x and y coordinate of the element at index \a index to \a
x and \a y.
*/
/*###
\fn QPainterPath &QPainterPath::operator +=(const QPainterPath &other)
Appends the \a other painter path to this painter path and returns a
reference to the result.
*/
/*!
Constructs an empty QPainterPath object.
*/
QPainterPath::QPainterPath()
: d_ptr(0)
{
}
/*!
\fn QPainterPath::QPainterPath(const QPainterPath &path)
Creates a QPainterPath object that is a copy of the given \a path.
\sa operator=()
*/
QPainterPath::QPainterPath(const QPainterPath &other)
: d_ptr(other.d_ptr)
{
if (d_func())
d_func()->ref.ref();
}
/*!
Creates a QPainterPath object with the given \a startPoint as its
current position.
*/
QPainterPath::QPainterPath(const QPointF &startPoint)
: d_ptr(new QPainterPathData)
{
Element e = { startPoint.x(), startPoint.y(), MoveToElement };
d_func()->elements << e;
}
/*!
\internal
*/
void QPainterPath::detach_helper()
{
QPainterPathPrivate *data = new QPainterPathData(*d_func());
if (d_ptr && !d_ptr->ref.deref())
delete d_ptr;
d_ptr = data;
}
/*!
\internal
*/
void QPainterPath::ensureData_helper()
{
QPainterPathPrivate *data = new QPainterPathData;
data->elements.reserve(16);
QPainterPath::Element e = { 0, 0, QPainterPath::MoveToElement };
data->elements << e;
if (d_ptr && !d_ptr->ref.deref())
delete d_ptr;
d_ptr = data;
Q_ASSERT(d_ptr != 0);
}
/*!
\fn QPainterPath &QPainterPath::operator=(const QPainterPath &path)
Assigns the given \a path to this painter path.
\sa QPainterPath()
*/
QPainterPath &QPainterPath::operator=(const QPainterPath &other)
{
if (other.d_func() != d_func()) {
QPainterPathPrivate *data = other.d_func();
if (data)
data->ref.ref();
if (d_ptr && !d_ptr->ref.deref())
delete d_ptr;
d_ptr = data;
}
return *this;
}
/*!
Destroys this QPainterPath object.
*/
QPainterPath::~QPainterPath()
{
if (d_func() && !d_func()->ref.deref())
delete d_func();
}
/*!
Closes the current subpath by drawing a line to the beginning of
the subpath, automatically starting a new path. The current point
of the new path is (0, 0).
If the subpath does not contain any elements, this function does
nothing.
\sa moveTo(), {QPainterPath#Composing a QPainterPath}{Composing
a QPainterPath}
*/
void QPainterPath::closeSubpath()
{
#ifdef QPP_DEBUG
printf("QPainterPath::closeSubpath()\n");
#endif
if (isEmpty())
return;
detach();
d_func()->close();
}
/*!
\fn void QPainterPath::moveTo(qreal x, qreal y)
\overload
Moves the current position to (\a{x}, \a{y}) and starts a new
subpath, implicitly closing the previous path.
*/
/*!
\fn void QPainterPath::moveTo(const QPointF &point)
Moves the current point to the given \a point, implicitly starting
a new subpath and closing the previous one.
\sa closeSubpath(), {QPainterPath#Composing a
QPainterPath}{Composing a QPainterPath}
*/
void QPainterPath::moveTo(const QPointF &p)
{
#ifdef QPP_DEBUG
printf("QPainterPath::moveTo() (%.2f,%.2f)\n", p.x(), p.y());
#endif
#ifndef QT_NO_DEBUG
if (qt_is_nan(p.x()) || qt_is_nan(p.y()))
qWarning("QPainterPath::moveTo: Adding point where x or y is NaN, results are undefined");
#endif
ensureData();
detach();
QPainterPathData *d = d_func();
Q_ASSERT(!d->elements.isEmpty());
d->require_moveTo = false;
if (d->elements.last().type == MoveToElement) {
d->elements.last().x = p.x();
d->elements.last().y = p.y();
} else {
Element elm = { p.x(), p.y(), MoveToElement };
d->elements.append(elm);
}
d->cStart = d->elements.size() - 1;
}
/*!
\fn void QPainterPath::lineTo(qreal x, qreal y)
\overload
Draws a line from the current position to the point (\a{x},
\a{y}).
*/
/*!
\fn void QPainterPath::lineTo(const QPointF &endPoint)
Adds a straight line from the current position to the given \a
endPoint. After the line is drawn, the current position is updated
to be at the end point of the line.
\sa addPolygon(), addRect(), {QPainterPath#Composing a
QPainterPath}{Composing a QPainterPath}
*/
void QPainterPath::lineTo(const QPointF &p)
{
#ifdef QPP_DEBUG
printf("QPainterPath::lineTo() (%.2f,%.2f)\n", p.x(), p.y());
#endif
#ifndef QT_NO_DEBUG
if (qt_is_nan(p.x()) || qt_is_nan(p.y()))
qWarning("QPainterPath::lineTo: Adding point where x or y is NaN, results are undefined");
#endif
ensureData();
detach();
QPainterPathData *d = d_func();
Q_ASSERT(!d->elements.isEmpty());
d->maybeMoveTo();
if (p == QPointF(d->elements.last()))
return;
Element elm = { p.x(), p.y(), LineToElement };
d->elements.append(elm);
}
/*!
\fn void QPainterPath::cubicTo(qreal c1X, qreal c1Y, qreal c2X,
qreal c2Y, qreal endPointX, qreal endPointY);
\overload
Adds a cubic Bezier curve between the current position and the end
point (\a{endPointX}, \a{endPointY}) with control points specified
by (\a{c1X}, \a{c1Y}) and (\a{c2X}, \a{c2Y}).
*/
/*!
\fn void QPainterPath::cubicTo(const QPointF &c1, const QPointF &c2, const QPointF &endPoint)
Adds a cubic Bezier curve between the current position and the
given \a endPoint using the control points specified by \a c1, and
\a c2.
After the curve is added, the current position is updated to be at
the end point of the curve.
\table 100%
\row
\o \inlineimage qpainterpath-cubicto.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 1
\endtable
\sa quadTo(), {QPainterPath#Composing a QPainterPath}{Composing
a QPainterPath}
*/
void QPainterPath::cubicTo(const QPointF &c1, const QPointF &c2, const QPointF &e)
{
#ifdef QPP_DEBUG
printf("QPainterPath::cubicTo() (%.2f,%.2f), (%.2f,%.2f), (%.2f,%.2f)\n",
c1.x(), c1.y(), c2.x(), c2.y(), e.x(), e.y());
#endif
#ifndef QT_NO_DEBUG
if (qt_is_nan(c1.x()) || qt_is_nan(c1.y()) || qt_is_nan(c2.x()) || qt_is_nan(c2.y())
|| qt_is_nan(e.x()) || qt_is_nan(e.y()))
qWarning("QPainterPath::cubicTo: Adding point where x or y is NaN, results are undefined");
#endif
ensureData();
detach();
QPainterPathData *d = d_func();
Q_ASSERT(!d->elements.isEmpty());
// Abort on empty curve as a stroker cannot handle this and the
// curve is irrelevant anyway.
if (d->elements.last() == c1 && c1 == c2 && c2 == e)
return;
d->maybeMoveTo();
Element ce1 = { c1.x(), c1.y(), CurveToElement };
Element ce2 = { c2.x(), c2.y(), CurveToDataElement };
Element ee = { e.x(), e.y(), CurveToDataElement };
d->elements << ce1 << ce2 << ee;
}
/*!
\fn void QPainterPath::quadTo(qreal cx, qreal cy, qreal endPointX, qreal endPointY);
\overload
Adds a quadratic Bezier curve between the current point and the endpoint
(\a{endPointX}, \a{endPointY}) with the control point specified by
(\a{cx}, \a{cy}).
*/
/*!
\fn void QPainterPath::quadTo(const QPointF &c, const QPointF &endPoint)
Adds a quadratic Bezier curve between the current position and the
given \a endPoint with the control point specified by \a c.
After the curve is added, the current point is updated to be at
the end point of the curve.
\sa cubicTo(), {QPainterPath#Composing a QPainterPath}{Composing a
QPainterPath}
*/
void QPainterPath::quadTo(const QPointF &c, const QPointF &e)
{
#ifdef QPP_DEBUG
printf("QPainterPath::quadTo() (%.2f,%.2f), (%.2f,%.2f)\n",
c.x(), c.y(), e.x(), e.y());
#endif
#ifndef QT_NO_DEBUG
if (qt_is_nan(c.x()) || qt_is_nan(c.y()) || qt_is_nan(e.x()) || qt_is_nan(e.y()))
qWarning("QPainterPath::quadTo: Adding point where x or y is NaN, results are undefined");
#endif
ensureData();
detach();
Q_D(QPainterPath);
Q_ASSERT(!d->elements.isEmpty());
const QPainterPath::Element &elm = d->elements.at(elementCount()-1);
QPointF prev(elm.x, elm.y);
// Abort on empty curve as a stroker cannot handle this and the
// curve is irrelevant anyway.
if (prev == c && c == e)
return;
QPointF c1((prev.x() + 2*c.x()) / 3, (prev.y() + 2*c.y()) / 3);
QPointF c2((e.x() + 2*c.x()) / 3, (e.y() + 2*c.y()) / 3);
cubicTo(c1, c2, e);
}
/*!
\fn void QPainterPath::arcTo(qreal x, qreal y, qreal width, qreal
height, qreal startAngle, qreal sweepLength)
\overload
Creates an arc that occupies the rectangle QRectF(\a x, \a y, \a
width, \a height), beginning at the specified \a startAngle and
extending \a sweepLength degrees counter-clockwise.
*/
/*!
\fn void QPainterPath::arcTo(const QRectF &rectangle, qreal startAngle, qreal sweepLength)
Creates an arc that occupies the given \a rectangle, beginning at
the specified \a startAngle and extending \a sweepLength degrees
counter-clockwise.
Angles are specified in degrees. Clockwise arcs can be specified
using negative angles.
Note that this function connects the starting point of the arc to
the current position if they are not already connected. After the
arc has been added, the current position is the last point in
arc. To draw a line back to the first point, use the
closeSubpath() function.
\table 100%
\row
\o \inlineimage qpainterpath-arcto.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 2
\endtable
\sa arcMoveTo(), addEllipse(), QPainter::drawArc(), QPainter::drawPie(),
{QPainterPath#Composing a QPainterPath}{Composing a
QPainterPath}
*/
void QPainterPath::arcTo(const QRectF &rect, qreal startAngle, qreal sweepLength)
{
#ifdef QPP_DEBUG
printf("QPainterPath::arcTo() (%.2f, %.2f, %.2f, %.2f, angle=%.2f, sweep=%.2f\n",
rect.x(), rect.y(), rect.width(), rect.height(), startAngle, sweepLength);
#endif
#ifndef QT_NO_DEBUG
if (qt_is_nan(rect.x()) || qt_is_nan(rect.y()) || qt_is_nan(rect.width()) || qt_is_nan(rect.height())
|| qt_is_nan(startAngle) || qt_is_nan(sweepLength))
qWarning("QPainterPath::arcTo: Adding arc where a parameter is NaN, results are undefined");
#endif
if (rect.isNull())
return;
ensureData();
detach();
int point_count;
QPointF pts[15];
QPointF curve_start = qt_curves_for_arc(rect, startAngle, sweepLength, pts, &point_count);
lineTo(curve_start);
for (int i=0; i<point_count; i+=3) {
cubicTo(pts[i].x(), pts[i].y(),
pts[i+1].x(), pts[i+1].y(),
pts[i+2].x(), pts[i+2].y());
}
}
/*!
\fn void QPainterPath::arcMoveTo(qreal x, qreal y, qreal width, qreal height, qreal angle)
\overload
\since 4.2
Creates a move to that lies on the arc that occupies the
QRectF(\a x, \a y, \a width, \a height) at \a angle.
*/
/*!
\fn void QPainterPath::arcMoveTo(const QRectF &rectangle, qreal angle)
\since 4.2
Creates a move to that lies on the arc that occupies the given \a
rectangle at \a angle.
Angles are specified in degrees. Clockwise arcs can be specified
using negative angles.
\sa moveTo(), arcTo()
*/
void QPainterPath::arcMoveTo(const QRectF &rect, qreal angle)
{
if (rect.isNull())
return;
QPointF pt;
qt_find_ellipse_coords(rect, angle, 0, &pt, 0);
moveTo(pt);
}
/*!
\fn QPointF QPainterPath::currentPosition() const
Returns the current position of the path.
*/
QPointF QPainterPath::currentPosition() const
{
return !d_ptr || d_func()->elements.isEmpty()
? QPointF()
: QPointF(d_func()->elements.last().x, d_func()->elements.last().y);
}
/*!
\fn void QPainterPath::addRect(qreal x, qreal y, qreal width, qreal height)
\overload
Adds a rectangle at position (\a{x}, \a{y}), with the given \a
width and \a height, as a closed subpath.
*/
/*!
\fn void QPainterPath::addRect(const QRectF &rectangle)
Adds the given \a rectangle to this path as a closed subpath.
The \a rectangle is added as a clockwise set of lines. The painter
path's current position after the \a rectangle has been added is
at the top-left corner of the rectangle.
\table 100%
\row
\o \inlineimage qpainterpath-addrectangle.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 3
\endtable
\sa addRegion(), lineTo(), {QPainterPath#Composing a
QPainterPath}{Composing a QPainterPath}
*/
void QPainterPath::addRect(const QRectF &r)
{
#ifndef QT_NO_DEBUG
if (qt_is_nan(r.x()) || qt_is_nan(r.y()) || qt_is_nan(r.width()) || qt_is_nan(r.height()))
qWarning("QPainterPath::addRect: Adding rect where a parameter is NaN, results are undefined");
#endif
if (r.isNull())
return;
ensureData();
detach();
d_func()->elements.reserve(d_func()->elements.size() + 5);
moveTo(r.x(), r.y());
Element l1 = { r.x() + r.width(), r.y(), LineToElement };
Element l2 = { r.x() + r.width(), r.y() + r.height(), LineToElement };
Element l3 = { r.x(), r.y() + r.height(), LineToElement };
Element l4 = { r.x(), r.y(), LineToElement };
d_func()->elements << l1 << l2 << l3 << l4;
d_func()->require_moveTo = true;
}
/*!
Adds the given \a polygon to the path as an (unclosed) subpath.
Note that the current position after the polygon has been added,
is the last point in \a polygon. To draw a line back to the first
point, use the closeSubpath() function.
\table 100%
\row
\o \inlineimage qpainterpath-addpolygon.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 4
\endtable
\sa lineTo(), {QPainterPath#Composing a QPainterPath}{Composing
a QPainterPath}
*/
void QPainterPath::addPolygon(const QPolygonF &polygon)
{
if (polygon.isEmpty())
return;
ensureData();
detach();
d_func()->elements.reserve(d_func()->elements.size() + polygon.size());
moveTo(polygon.first());
for (int i=1; i<polygon.size(); ++i) {
Element elm = { polygon.at(i).x(), polygon.at(i).y(), LineToElement };
d_func()->elements << elm;
}
}
/*!
\fn void QPainterPath::addEllipse(const QRectF &boundingRectangle)
Creates an ellipse within the specified \a boundingRectangle
and adds it to the painter path as a closed subpath.
The ellipse is composed of a clockwise curve, starting and
finishing at zero degrees (the 3 o'clock position).
\table 100%
\row
\o \inlineimage qpainterpath-addellipse.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 5
\endtable
\sa arcTo(), QPainter::drawEllipse(), {QPainterPath#Composing a
QPainterPath}{Composing a QPainterPath}
*/
void QPainterPath::addEllipse(const QRectF &boundingRect)
{
#ifndef QT_NO_DEBUG
if (qt_is_nan(boundingRect.x()) || qt_is_nan(boundingRect.y())
|| qt_is_nan(boundingRect.width()) || qt_is_nan(boundingRect.height()))
qWarning("QPainterPath::addEllipse: Adding ellipse where a parameter is NaN, results are undefined");
#endif
if (boundingRect.isNull())
return;
ensureData();
detach();
Q_D(QPainterPath);
d->elements.reserve(d->elements.size() + 13);
QPointF pts[12];
int point_count;
QPointF start = qt_curves_for_arc(boundingRect, 0, -360, pts, &point_count);
moveTo(start);
cubicTo(pts[0], pts[1], pts[2]); // 0 -> 270
cubicTo(pts[3], pts[4], pts[5]); // 270 -> 180
cubicTo(pts[6], pts[7], pts[8]); // 180 -> 90
cubicTo(pts[9], pts[10], pts[11]); // 90 - >0
d_func()->require_moveTo = true;
}
/*!
\fn void QPainterPath::addText(const QPointF &point, const QFont &font, const QString &text)
Adds the given \a text to this path as a set of closed subpaths
created from the \a font supplied. The subpaths are positioned so
that the left end of the text's baseline lies at the specified \a
point.
\table 100%
\row
\o \inlineimage qpainterpath-addtext.png
\o
\snippet doc/src/snippets/code/src_gui_painting_qpainterpath.cpp 6
\endtable
\sa QPainter::drawText(), {QPainterPath#Composing a
QPainterPath}{Composing a QPainterPath}
*/
void QPainterPath::addText(const QPointF &point, const QFont &f, const QString &text)
{
if (text.isEmpty())
return;
ensureData();
detach();
QTextLayout layout(text, f);
layout.setCacheEnabled(true);
QTextEngine *eng = layout.engine();
layout.beginLayout();
QTextLine line = layout.createLine();
layout.endLayout();
const QScriptLine &sl = eng->lines[0];
if (!sl.length || !eng->layoutData)
return;
int nItems = eng->layoutData->items.size();
qreal x(point.x());
qreal y(point.y());
QVarLengthArray<int> visualOrder(nItems);
QVarLengthArray<uchar> levels(nItems);
for (int i = 0; i < nItems; ++i)
levels[i] = eng->layoutData->items[i].analysis.bidiLevel;
QTextEngine::bidiReorder(nItems, levels.data(), visualOrder.data());
for (int i = 0; i < nItems; ++i) {
int item = visualOrder[i];
QScriptItem &si = eng->layoutData->items[item];
if (si.analysis.flags < QScriptAnalysis::TabOrObject) {
QGlyphLayout glyphs = eng->shapedGlyphs(&si);
QFontEngine *fe = f.d->engineForScript(si.analysis.script);
Q_ASSERT(fe);
fe->addOutlineToPath(x, y, glyphs, this,
si.analysis.bidiLevel % 2
? QTextItem::RenderFlags(QTextItem::RightToLeft)
: QTextItem::RenderFlags(0));
const qreal lw = fe->lineThickness().toReal();
if (f.d->underline) {
qreal pos = fe->underlinePosition().toReal();
addRect(x, y + pos, si.width.toReal(), lw);
}
if (f.d->overline) {
qreal pos = fe->ascent().toReal() + 1;
addRect(x, y - pos, si.width.toReal(), lw);
}
if (f.d->strikeOut) {
qreal pos = fe->ascent().toReal() / 3;
addRect(x, y - pos, si.width.toReal(), lw);
}
}
x += si.width.toReal();
}
}
/*!
\fn void QPainterPath::addPath(const QPainterPath &path)
Adds the given \a path to \e this path as a closed subpath.
\sa connectPath(), {QPainterPath#Composing a
QPainterPath}{Composing a QPainterPath}
*/
void QPainterPath::addPath(const QPainterPath &other)
{
if (other.isEmpty())
return;
ensureData();
detach();
QPainterPathData *d = reinterpret_cast<QPainterPathData *>(d_func());
// Remove last moveto so we don't get multiple moveto's
if (d->elements.last().type == MoveToElement)
d->elements.remove(d->elements.size()-1);
// Locate where our own current subpath will start after the other path is added.
int cStart = d->elements.size() + other.d_func()->cStart;
d->elements += other.d_func()->elements;
d->cStart = cStart;
d->require_moveTo = other.d_func()->isClosed();
}
/*!
\fn void QPainterPath::connectPath(const QPainterPath &path)
Connects the given \a path to \e this path by adding a line from the
last element of this path to the first element of the given path.
\sa addPath(), {QPainterPath#Composing a QPainterPath}{Composing
a QPainterPath}
*/
void QPainterPath::connectPath(const QPainterPath &other)
{
if (other.isEmpty())
return;
ensureData();
detach();
QPainterPathData *d = reinterpret_cast<QPainterPathData *>(d_func());
// Remove last moveto so we don't get multiple moveto's
if (d->elements.last().type == MoveToElement)
d->elements.remove(d->elements.size()-1);
// Locate where our own current subpath will start after the other path is added.
int cStart = d->elements.size() + other.d_func()->cStart;
int first = d->elements.size();
d->elements += other.d_func()->elements;
d->elements[first].type = LineToElement;
// avoid duplicate points
if (first > 0 && QPointF(d->elements[first]) == QPointF(d->elements[first - 1])) {
d->elements.remove(first--);
--cStart;
}
if (cStart != first)
d->cStart = cStart;
}
/*!
Adds the given \a region to the path by adding each rectangle in
the region as a separate closed subpath.
\sa addRect(), {QPainterPath#Composing a QPainterPath}{Composing
a QPainterPath}
*/
void QPainterPath::addRegion(const QRegion ®ion)
{
ensureData();
detach();
QVector<QRect> rects = region.rects();
d_func()->elements.reserve(rects.size() * 5);
for (int i=0; i<rects.size(); ++i)
addRect(rects.at(i));
}
/*!
Returns the painter path's currently set fill rule.
\sa setFillRule()
*/
Qt::FillRule QPainterPath::fillRule() const
{
return isEmpty() ? Qt::OddEvenFill : d_func()->fillRule;
}
/*!
\fn void QPainterPath::setFillRule(Qt::FillRule fillRule)
Sets the fill rule of the painter path to the given \a
fillRule. Qt provides two methods for filling paths:
\table
\row
\o \inlineimage qt-fillrule-oddeven.png
\o \inlineimage qt-fillrule-winding.png
\header
\o Qt::OddEvenFill (default)
\o Qt::WindingFill
\endtable
\sa fillRule()
*/
void QPainterPath::setFillRule(Qt::FillRule fillRule)
{
ensureData();
detach();
d_func()->fillRule = fillRule;
}
#define QT_BEZIER_A(bezier, coord) 3 * (-bezier.coord##1 \
+ 3*bezier.coord##2 \
- 3*bezier.coord##3 \
+bezier.coord##4)
#define QT_BEZIER_B(bezier, coord) 6 * (bezier.coord##1 \
- 2*bezier.coord##2 \
+ bezier.coord##3)
#define QT_BEZIER_C(bezier, coord) 3 * (- bezier.coord##1 \
+ bezier.coord##2)
#define QT_BEZIER_CHECK_T(bezier, t) \
if (t >= 0 && t <= 1) { \
QPointF p(b.pointAt(t)); \
if (p.x() < minx) minx = p.x(); \
else if (p.x() > maxx) maxx = p.x(); \
if (p.y() < miny) miny = p.y(); \
else if (p.y() > maxy) maxy = p.y(); \
}
static QRectF qt_painterpath_bezier_extrema(const QBezier &b)
{
qreal minx, miny, maxx, maxy;
// initialize with end points
if (b.x1 < b.x4) {
minx = b.x1;
maxx = b.x4;
} else {
minx = b.x4;
maxx = b.x1;
}
if (b.y1 < b.y4) {
miny = b.y1;
maxy = b.y4;
} else {
miny = b.y4;
maxy = b.y1;
}
// Update for the X extrema
{
qreal ax = QT_BEZIER_A(b, x);
qreal bx = QT_BEZIER_B(b, x);
qreal cx = QT_BEZIER_C(b, x);
// specialcase quadratic curves to avoid div by zero
if (qFuzzyCompare(ax + 1, 1)) {
// linear curves are covered by initialization.
if (!qFuzzyCompare(bx + 1, 1)) {
qreal t = -cx / bx;
QT_BEZIER_CHECK_T(b, t);
}
} else {
const qreal tx = bx * bx - 4 * ax * cx;
if (tx >= 0) {
qreal temp = qSqrt(tx);
qreal rcp = 1 / (2 * ax);
qreal t1 = (-bx + temp) * rcp;
QT_BEZIER_CHECK_T(b, t1);
qreal t2 = (-bx - temp) * rcp;
QT_BEZIER_CHECK_T(b, t2);
}
}
}
// Update for the Y extrema
{
qreal ay = QT_BEZIER_A(b, y);
qreal by = QT_BEZIER_B(b, y);
qreal cy = QT_BEZIER_C(b, y);
// specialcase quadratic curves to avoid div by zero
if (qFuzzyCompare(ay + 1, 1)) {
// linear curves are covered by initialization.
if (!qFuzzyCompare(by + 1, 1)) {
qreal t = -cy / by;
QT_BEZIER_CHECK_T(b, t);
}
} else {
const qreal ty = by * by - 4 * ay * cy;
if (ty > 0) {
qreal temp = qSqrt(ty);
qreal rcp = 1 / (2 * ay);
qreal t1 = (-by + temp) * rcp;
QT_BEZIER_CHECK_T(b, t1);
qreal t2 = (-by - temp) * rcp;
QT_BEZIER_CHECK_T(b, t2);
}
}
}
return QRectF(minx, miny, maxx - minx, maxy - miny);
}
/*!
Returns the bounding rectangle of this painter path as a rectangle with
floating point precision.
\sa controlPointRect()
*/
QRectF QPainterPath::boundingRect() const
{
if (!d_ptr)
return QRectF();
QPainterPathData *d = d_func();
if (d->dirtyBounds)
computeBoundingRect();
return d->bounds;
}
/*!
Returns the rectangle containing all the points and control points
in this path.
This function is significantly faster to compute than the exact
boundingRect(), and the returned rectangle is always a superset of
the rectangle returned by boundingRect().
\sa boundingRect()
*/
QRectF QPainterPath::controlPointRect() const
{
if (!d_ptr)
return QRectF();
QPainterPathData *d = d_func();
if (d->dirtyControlBounds)
computeControlPointRect();
return d->controlBounds;
}
/*!
\fn bool QPainterPath::isEmpty() const
Returns true if either there are no elements in this path, or if the only
element is a MoveToElement; otherwise returns false.
\sa elementCount()
*/
/*!
Creates and returns a reversed copy of the path.
It is the order of the elements that is reversed: If a
QPainterPath is composed by calling the moveTo(), lineTo() and
cubicTo() functions in the specified order, the reversed copy is
composed by calling cubicTo(), lineTo() and moveTo().
*/
QPainterPath QPainterPath::toReversed() const
{
Q_D(const QPainterPath);
QPainterPath rev;
if (isEmpty()) {
rev = *this;
return rev;
}
rev.moveTo(d->elements.at(d->elements.size()-1).x, d->elements.at(d->elements.size()-1).y);
for (int i=d->elements.size()-1; i>=1; --i) {
const QPainterPath::Element &elm = d->elements.at(i);
const QPainterPath::Element &prev = d->elements.at(i-1);
switch (elm.type) {
case LineToElement:
rev.lineTo(prev.x, prev.y);
break;
case MoveToElement:
rev.moveTo(prev.x, prev.y);
break;
case CurveToDataElement:
{
Q_ASSERT(i>=3);
const QPainterPath::Element &cp1 = d->elements.at(i-2);
const QPainterPath::Element &sp = d->elements.at(i-3);
Q_ASSERT(prev.type == CurveToDataElement);
Q_ASSERT(cp1.type == CurveToElement);
rev.cubicTo(prev.x, prev.y, cp1.x, cp1.y, sp.x, sp.y);
i -= 2;
break;
}
default:
Q_ASSERT(!"qt_reversed_path");
break;
}
}
//qt_debug_path(rev);
return rev;
}
/*!
Converts the path into a list of polygons using the QTransform
\a matrix, and returns the list.
This function creates one polygon for each subpath regardless of
intersecting subpaths (i.e. overlapping bounding rectangles). To
make sure that such overlapping subpaths are filled correctly, use
the toFillPolygons() function instead.
\sa toFillPolygons(), toFillPolygon(), {QPainterPath#QPainterPath
Conversion}{QPainterPath Conversion}
*/
QList<QPolygonF> QPainterPath::toSubpathPolygons(const QTransform &matrix) const
{
Q_D(const QPainterPath);
QList<QPolygonF> flatCurves;
if (isEmpty())
return flatCurves;
QPolygonF current;
for (int i=0; i<elementCount(); ++i) {
const QPainterPath::Element &e = d->elements.at(i);
switch (e.type) {
case QPainterPath::MoveToElement:
if (current.size() > 1)
flatCurves += current;
current.clear();
current.reserve(16);
current += QPointF(e.x, e.y) * matrix;
break;
case QPainterPath::LineToElement:
current += QPointF(e.x, e.y) * matrix;
break;
case QPainterPath::CurveToElement: {
Q_ASSERT(d->elements.at(i+1).type == QPainterPath::CurveToDataElement);
Q_ASSERT(d->elements.at(i+2).type == QPainterPath::CurveToDataElement);
QBezier bezier = QBezier::fromPoints(QPointF(d->elements.at(i-1).x, d->elements.at(i-1).y) * matrix,
QPointF(e.x, e.y) * matrix,
QPointF(d->elements.at(i+1).x, d->elements.at(i+1).y) * matrix,
QPointF(d->elements.at(i+2).x, d->elements.at(i+2).y) * matrix);
bezier.addToPolygon(¤t);
i+=2;
break;
}
case QPainterPath::CurveToDataElement:
Q_ASSERT(!"QPainterPath::toSubpathPolygons(), bad element type");
break;
}
}
if (current.size()>1)
flatCurves += current;
return flatCurves;
}
/*!
\overload
*/
QList<QPolygonF> QPainterPath::toSubpathPolygons(const QMatrix &matrix) const
{
return toSubpathPolygons(QTransform(matrix));
}
static inline bool rect_intersects(const QRectF &r1, const QRectF &r2)
{
return qMax(r1.left(), r2.left()) <= qMin(r1.right(), r2.right())
&& qMax(r1.top(), r2.top()) <= qMin(r1.bottom(), r2.bottom());
}
/*!
Converts the path into a list of polygons using the
QTransform \a matrix, and returns the list.
The function differs from the toFillPolygon() function in that it
creates several polygons. It is provided because it is usually
faster to draw several small polygons than to draw one large
polygon, even though the total number of points drawn is the same.
The toFillPolygons() function differs from the toSubpathPolygons()
function in that it create only polygon for subpaths that have
overlapping bounding rectangles.
Like the toFillPolygon() function, this function uses a rewinding
technique to make sure that overlapping subpaths can be filled
using the correct fill rule. Note that rewinding inserts addition
lines in the polygons so the outline of the fill polygon does not
match the outline of the path.
\sa toSubpathPolygons(), toFillPolygon(),
{QPainterPath#QPainterPath Conversion}{QPainterPath Conversion}
*/
QList<QPolygonF> QPainterPath::toFillPolygons(const QTransform &matrix) const
{
QList<QPolygonF> polys;
QList<QPolygonF> subpaths = toSubpathPolygons(matrix);
int count = subpaths.size();
if (count == 0)
return polys;
QList<QRectF> bounds;
for (int i=0; i<count; ++i)
bounds += subpaths.at(i).boundingRect();
#ifdef QPP_FILLPOLYGONS_DEBUG
printf("QPainterPath::toFillPolygons, subpathCount=%d\n", count);
for (int i=0; i<bounds.size(); ++i)
qDebug() << " bounds" << i << bounds.at(i);
#endif
QVector< QList<int> > isects;
isects.resize(count);
// find all intersections
for (int j=0; j<count; ++j) {
if (subpaths.at(j).size() <= 2)
continue;
QRectF cbounds = bounds.at(j);
for (int i=0; i<count; ++i) {
if (rect_intersects(cbounds, bounds.at(i))) {
isects[j] << i;
}
}
}
#ifdef QPP_FILLPOLYGONS_DEBUG
printf("Intersections before flattening:\n");
for (int i = 0; i < count; ++i) {
printf("%d: ", i);
for (int j = 0; j < isects[i].size(); ++j) {
printf("%d ", isects[i][j]);
}
printf("\n");
}
#endif
// flatten the sets of intersections
for (int i=0; i<count; ++i) {
const QList<int> ¤t_isects = isects.at(i);
for (int j=0; j<current_isects.size(); ++j) {
int isect_j = current_isects.at(j);
if (isect_j == i)
continue;
for (int k=0; k<isects[isect_j].size(); ++k) {
int isect_k = isects[isect_j][k];
if (isect_k != i && !isects.at(i).contains(isect_k)) {
isects[i] += isect_k;
}
}
isects[isect_j].clear();
}
}
#ifdef QPP_FILLPOLYGONS_DEBUG
printf("Intersections after flattening:\n");
for (int i = 0; i < count; ++i) {
printf("%d: ", i);
for (int j = 0; j < isects[i].size(); ++j) {
printf("%d ", isects[i][j]);
}
printf("\n");
}
#endif
// Join the intersected subpaths as rewinded polygons
for (int i=0; i<count; ++i) {
const QList<int> &subpath_list = isects[i];
if (!subpath_list.isEmpty()) {
QPolygonF buildUp;
for (int j=0; j<subpath_list.size(); ++j) {
const QPolygonF &subpath = subpaths.at(subpath_list.at(j));
buildUp += subpath;
if (!subpath.isClosed())
buildUp += subpath.first();
if (!buildUp.isClosed())
buildUp += buildUp.first();
}
polys += buildUp;
}
}
return polys;
}
/*!
\overload
*/
QList<QPolygonF> QPainterPath::toFillPolygons(const QMatrix &matrix) const
{
return toFillPolygons(QTransform(matrix));
}
//same as qt_polygon_isect_line in qpolygon.cpp
static void qt_painterpath_isect_line(const QPointF &p1,
const QPointF &p2,
const QPointF &pos,
int *winding)
{
qreal x1 = p1.x();
qreal y1 = p1.y();
qreal x2 = p2.x();
qreal y2 = p2.y();
qreal y = pos.y();
int dir = 1;
if (qFuzzyCompare(y1, y2)) {
// ignore horizontal lines according to scan conversion rule
return;
} else if (y2 < y1) {
qreal x_tmp = x2; x2 = x1; x1 = x_tmp;
qreal y_tmp = y2; y2 = y1; y1 = y_tmp;
dir = -1;
}
if (y >= y1 && y < y2) {
qreal x = x1 + ((x2 - x1) / (y2 - y1)) * (y - y1);
// count up the winding number if we're
if (x<=pos.x()) {
(*winding) += dir;
}
}
}
static void qt_painterpath_isect_curve(const QBezier &bezier, const QPointF &pt,
int *winding)
{
qreal y = pt.y();
qreal x = pt.x();
QRectF bounds = bezier.bounds();
// potential intersection, divide and try again...
// Please note that a sideeffect of the bottom exclusion is that
// horizontal lines are dropped, but this is correct according to
// scan conversion rules.
if (y >= bounds.y() && y < bounds.y() + bounds.height()) {
// hit lower limit... This is a rough threshold, but its a
// tradeoff between speed and precision.
const qreal lower_bound = qreal(.001);
if (bounds.width() < lower_bound && bounds.height() < lower_bound) {
// We make the assumption here that the curve starts to
// approximate a line after while (i.e. that it doesn't
// change direction drastically during its slope)
if (bezier.pt1().x() <= x) {
(*winding) += (bezier.pt4().y() > bezier.pt1().y() ? 1 : -1);
}
return;
}
// split curve and try again...
QBezier first_half, second_half;
bezier.split(&first_half, &second_half);
qt_painterpath_isect_curve(first_half, pt, winding);
qt_painterpath_isect_curve(second_half, pt, winding);
}
}
/*!
\fn bool QPainterPath::contains(const QPointF &point) const
Returns true if the given \a point is inside the path, otherwise
returns false.
\sa intersects()
*/
bool QPainterPath::contains(const QPointF &pt) const
{
if (isEmpty() || !controlPointRect().contains(pt))
return false;
QPainterPathData *d = d_func();
int winding_number = 0;
QPointF last_pt;
QPointF last_start;
for (int i=0; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
switch (e.type) {
case MoveToElement:
if (i > 0) // implicitly close all paths.
qt_painterpath_isect_line(last_pt, last_start, pt, &winding_number);
last_start = last_pt = e;
break;
case LineToElement:
qt_painterpath_isect_line(last_pt, e, pt, &winding_number);
last_pt = e;
break;
case CurveToElement:
{
const QPainterPath::Element &cp2 = d->elements.at(++i);
const QPainterPath::Element &ep = d->elements.at(++i);
qt_painterpath_isect_curve(QBezier::fromPoints(last_pt, e, cp2, ep),
pt, &winding_number);
last_pt = ep;
}
break;
default:
break;
}
}
// implicitly close last subpath
if (last_pt != last_start)
qt_painterpath_isect_line(last_pt, last_start, pt, &winding_number);
return (d->fillRule == Qt::WindingFill
? (winding_number != 0)
: ((winding_number % 2) != 0));
}
static bool qt_painterpath_isect_line_rect(qreal x1, qreal y1, qreal x2, qreal y2,
const QRectF &rect)
{
qreal left = rect.left();
qreal right = rect.right();
qreal top = rect.top();
qreal bottom = rect.bottom();
enum { Left, Right, Top, Bottom };
// clip the lines, after cohen-sutherland, see e.g. http://www.nondot.org/~sabre/graphpro/line6.html
int p1 = ((x1 < left) << Left)
| ((x1 > right) << Right)
| ((y1 < top) << Top)
| ((y1 > bottom) << Bottom);
int p2 = ((x2 < left) << Left)
| ((x2 > right) << Right)
| ((y2 < top) << Top)
| ((y2 > bottom) << Bottom);
if (p1 & p2)
// completely inside
return false;
if (p1 | p2) {
qreal dx = x2 - x1;
qreal dy = y2 - y1;
// clip x coordinates
if (x1 < left) {
y1 += dy/dx * (left - x1);
x1 = left;
} else if (x1 > right) {
y1 -= dy/dx * (x1 - right);
x1 = right;
}
if (x2 < left) {
y2 += dy/dx * (left - x2);
x2 = left;
} else if (x2 > right) {
y2 -= dy/dx * (x2 - right);
x2 = right;
}
p1 = ((y1 < top) << Top)
| ((y1 > bottom) << Bottom);
p2 = ((y2 < top) << Top)
| ((y2 > bottom) << Bottom);
if (p1 & p2)
return false;
// clip y coordinates
if (y1 < top) {
x1 += dx/dy * (top - y1);
y1 = top;
} else if (y1 > bottom) {
x1 -= dx/dy * (y1 - bottom);
y1 = bottom;
}
if (y2 < top) {
x2 += dx/dy * (top - y2);
y2 = top;
} else if (y2 > bottom) {
x2 -= dx/dy * (y2 - bottom);
y2 = bottom;
}
p1 = ((x1 < left) << Left)
| ((x1 > right) << Right);
p2 = ((x2 < left) << Left)
| ((x2 > right) << Right);
if (p1 & p2)
return false;
return true;
}
return false;
}
static bool qt_isect_curve_horizontal(const QBezier &bezier, qreal y, qreal x1, qreal x2)
{
QRectF bounds = bezier.bounds();
if (y >= bounds.top() && y < bounds.bottom()
&& bounds.right() >= x1 && bounds.left() < x2) {
const qreal lower_bound = qreal(.01);
if (bounds.width() < lower_bound && bounds.height() < lower_bound)
return true;
QBezier first_half, second_half;
bezier.split(&first_half, &second_half);
if (qt_isect_curve_horizontal(first_half, y, x1, x2)
|| qt_isect_curve_horizontal(second_half, y, x1, x2))
return true;
}
return false;
}
static bool qt_isect_curve_vertical(const QBezier &bezier, qreal x, qreal y1, qreal y2)
{
QRectF bounds = bezier.bounds();
if (x >= bounds.left() && x < bounds.right()
&& bounds.bottom() >= y1 && bounds.top() < y2) {
const qreal lower_bound = qreal(.01);
if (bounds.width() < lower_bound && bounds.height() < lower_bound)
return true;
QBezier first_half, second_half;
bezier.split(&first_half, &second_half);
if (qt_isect_curve_vertical(first_half, x, y1, y2)
|| qt_isect_curve_vertical(second_half, x, y1, y2))
return true;
}
return false;
}
/*
Returns true if any lines or curves cross the four edges in of rect
*/
static bool qt_painterpath_check_crossing(const QPainterPath *path, const QRectF &rect)
{
QPointF last_pt;
QPointF last_start;
for (int i=0; i<path->elementCount(); ++i) {
const QPainterPath::Element &e = path->elementAt(i);
switch (e.type) {
case QPainterPath::MoveToElement:
if (i > 0
&& qFuzzyCompare(last_pt.x(), last_start.y())
&& qFuzzyCompare(last_pt.y(), last_start.y())
&& qt_painterpath_isect_line_rect(last_pt.x(), last_pt.y(),
last_start.x(), last_start.y(), rect))
return true;
last_start = last_pt = e;
break;
case QPainterPath::LineToElement:
if (qt_painterpath_isect_line_rect(last_pt.x(), last_pt.y(), e.x, e.y, rect))
return true;
last_pt = e;
break;
case QPainterPath::CurveToElement:
{
QPointF cp2 = path->elementAt(++i);
QPointF ep = path->elementAt(++i);
QBezier bezier = QBezier::fromPoints(last_pt, e, cp2, ep);
if (qt_isect_curve_horizontal(bezier, rect.top(), rect.left(), rect.right())
|| qt_isect_curve_horizontal(bezier, rect.bottom(), rect.left(), rect.right())
|| qt_isect_curve_vertical(bezier, rect.left(), rect.top(), rect.bottom())
|| qt_isect_curve_vertical(bezier, rect.right(), rect.top(), rect.bottom()))
return true;
last_pt = ep;
}
break;
default:
break;
}
}
// implicitly close last subpath
if (last_pt != last_start
&& qt_painterpath_isect_line_rect(last_pt.x(), last_pt.y(),
last_start.x(), last_start.y(), rect))
return true;
return false;
}
/*!
\fn bool QPainterPath::intersects(const QRectF &rectangle) const
Returns true if any point in the given \a rectangle intersects the
path; otherwise returns false.
There is an intersection if any of the lines making up the
rectangle crosses a part of the path or if any part of the
rectangle overlaps with any area enclosed by the path. This
function respects the current fillRule to determine what is
considered inside the path.
\sa contains()
*/
bool QPainterPath::intersects(const QRectF &rect) const
{
if (elementCount() == 1 && rect.contains(elementAt(0)))
return true;
if (isEmpty())
return false;
QRectF cp = controlPointRect();
QRectF rn = rect.normalized();
// QRectF::intersects returns false if one of the rects is a null rect
// which would happen for a painter path consisting of a vertical or
// horizontal line
if (qMax(rn.left(), cp.left()) > qMin(rn.right(), cp.right())
|| qMax(rn.top(), cp.top()) > qMin(rn.bottom(), cp.bottom()))
return false;
// If any path element cross the rect its bound to be an intersection
if (qt_painterpath_check_crossing(this, rect))
return true;
if (contains(rect.center()))
return true;
Q_D(QPainterPath);
// Check if the rectangle surounds any subpath...
for (int i=0; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
if (e.type == QPainterPath::MoveToElement && rect.contains(e))
return true;
}
return false;
}
/*!
\fn bool QPainterPath::contains(const QRectF &rectangle) const
Returns true if the given \a rectangle is inside the path,
otherwise returns false.
*/
bool QPainterPath::contains(const QRectF &rect) const
{
Q_D(QPainterPath);
// the path is empty or the control point rect doesn't completely
// cover the rectangle we abort stratight away.
if (isEmpty() || !controlPointRect().contains(rect))
return false;
// if there are intersections, chances are that the rect is not
// contained, except if we have winding rule, in which case it
// still might.
if (qt_painterpath_check_crossing(this, rect)) {
if (fillRule() == Qt::OddEvenFill) {
return false;
} else {
// Do some wague sampling in the winding case. This is not
// precise but it should mostly be good enough.
if (!contains(rect.topLeft()) ||
!contains(rect.topRight()) ||
!contains(rect.bottomRight()) ||
!contains(rect.bottomLeft()))
return false;
}
}
// If there exists a point inside that is not part of the path its
// because: rectangle lies completely outside path or a subpath
// excludes parts of the rectangle. Both cases mean that the rect
// is not contained
if (!contains(rect.center()))
return false;
// If there are any subpaths inside this rectangle we need to
// check if they are still contained as a result of the fill
// rule. This can only be the case for WindingFill though. For
// OddEvenFill the rect will never be contained if it surrounds a
// subpath. (the case where two subpaths are completely identical
// can be argued but we choose to neglect it).
for (int i=0; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
if (e.type == QPainterPath::MoveToElement && rect.contains(e)) {
if (fillRule() == Qt::OddEvenFill)
return false;
bool stop = false;
for (; !stop && i<d->elements.size(); ++i) {
const Element &el = d->elements.at(i);
switch (el.type) {
case MoveToElement:
stop = true;
break;
case LineToElement:
if (!contains(el))
return false;
break;
case CurveToElement:
if (!contains(d->elements.at(i+2)))
return false;
i += 2;
break;
default:
break;
}
}
// compensate for the last ++i in the inner for
--i;
}
}
return true;
}
static inline bool epsilonCompare(const QPointF &a, const QPointF &b, const QSizeF &epsilon)
{
return qAbs(a.x() - b.x()) <= epsilon.width()
&& qAbs(a.y() - b.y()) <= epsilon.height();
}
/*!
Returns true if this painterpath is equal to the given \a path.
Note that comparing paths may involve a per element comparison
which can be slow for complex paths.
\sa operator!=()
*/
bool QPainterPath::operator==(const QPainterPath &path) const
{
QPainterPathData *d = reinterpret_cast<QPainterPathData *>(d_func());
if (path.d_func() == d)
return true;
else if (!d || !path.d_func())
return false;
else if (d->fillRule != path.d_func()->fillRule)
return false;
else if (d->elements.size() != path.d_func()->elements.size())
return false;
const qreal qt_epsilon = sizeof(qreal) == sizeof(double) ? 1e-12 : qreal(1e-5);
QSizeF epsilon = boundingRect().size();
epsilon.rwidth() *= qt_epsilon;
epsilon.rheight() *= qt_epsilon;
for (int i = 0; i < d->elements.size(); ++i)
if (d->elements.at(i).type != path.d_func()->elements.at(i).type
|| !epsilonCompare(d->elements.at(i), path.d_func()->elements.at(i), epsilon))
return false;
return true;
}
/*!
Returns true if this painter path differs from the given \a path.
Note that comparing paths may involve a per element comparison
which can be slow for complex paths.
\sa operator==()
*/
bool QPainterPath::operator!=(const QPainterPath &path) const
{
return !(*this==path);
}
/*!
\since 4.5
Returns the intersection of this path and the \a other path.
\sa intersected(), operator&=(), united(), operator|()
*/
QPainterPath QPainterPath::operator&(const QPainterPath &other) const
{
return intersected(other);
}
/*!
\since 4.5
Returns the union of this path and the \a other path.
\sa united(), operator|=(), intersected(), operator&()
*/
QPainterPath QPainterPath::operator|(const QPainterPath &other) const
{
return united(other);
}
/*!
\since 4.5
Returns the union of this path and the \a other path. This function is equivalent
to operator|().
\sa united(), operator+=(), operator-()
*/
QPainterPath QPainterPath::operator+(const QPainterPath &other) const
{
return united(other);
}
/*!
\since 4.5
Subtracts the \a other path from a copy of this path, and returns the copy.
\sa subtracted(), operator-=(), operator+()
*/
QPainterPath QPainterPath::operator-(const QPainterPath &other) const
{
return subtracted(other);
}
/*!
\since 4.5
Intersects this path with \a other and returns a reference to this path.
\sa intersected(), operator&(), operator|=()
*/
QPainterPath &QPainterPath::operator&=(const QPainterPath &other)
{
return *this = (*this & other);
}
/*!
\since 4.5
Unites this path with \a other and returns a reference to this path.
\sa united(), operator|(), operator&=()
*/
QPainterPath &QPainterPath::operator|=(const QPainterPath &other)
{
return *this = (*this | other);
}
/*!
\since 4.5
Unites this path with \a other, and returns a reference to this path. This
is equivalent to operator|=().
\sa united(), operator+(), operator-=()
*/
QPainterPath &QPainterPath::operator+=(const QPainterPath &other)
{
return *this = (*this + other);
}
/*!
\since 4.5
Subtracts \a other from this path, and returns a reference to this
path.
\sa subtracted(), operator-(), operator+=()
*/
QPainterPath &QPainterPath::operator-=(const QPainterPath &other)
{
return *this = (*this - other);
}
#ifndef QT_NO_DATASTREAM
/*!
\fn QDataStream &operator<<(QDataStream &stream, const QPainterPath &path)
\relates QPainterPath
Writes the given painter \a path to the given \a stream, and
returns a reference to the \a stream.
\sa {Format of the QDataStream Operators}
*/
QDataStream &operator<<(QDataStream &s, const QPainterPath &p)
{
if (p.isEmpty()) {
s << 0;
return s;
}
s << p.elementCount();
for (int i=0; i < p.d_func()->elements.size(); ++i) {
const QPainterPath::Element &e = p.d_func()->elements.at(i);
s << int(e.type);
s << double(e.x) << double(e.y);
}
s << p.d_func()->cStart;
s << int(p.d_func()->fillRule);
return s;
}
/*!
\fn QDataStream &operator>>(QDataStream &stream, QPainterPath &path)
\relates QPainterPath
Reads a painter path from the given \a stream into the specified \a path,
and returns a reference to the \a stream.
\sa {Format of the QDataStream Operators}
*/
QDataStream &operator>>(QDataStream &s, QPainterPath &p)
{
int size;
s >> size;
if (size == 0)
return s;
p.ensureData(); // in case if p.d_func() == 0
if (p.d_func()->elements.size() == 1) {
Q_ASSERT(p.d_func()->elements.at(0).type == QPainterPath::MoveToElement);
p.d_func()->elements.clear();
}
p.d_func()->elements.reserve(p.d_func()->elements.size() + size);
for (int i=0; i<size; ++i) {
int type;
double x, y;
s >> type;
s >> x;
s >> y;
Q_ASSERT(type >= 0 && type <= 3);
#ifndef QT_NO_DEBUG
if (qt_is_nan(x) || qt_is_nan(y))
qWarning("QDataStream::operator>>: Adding a NaN element to path, results are undefined");
#endif
QPainterPath::Element elm = { x, y, QPainterPath::ElementType(type) };
p.d_func()->elements.append(elm);
}
s >> p.d_func()->cStart;
int fillRule;
s >> fillRule;
Q_ASSERT(fillRule == Qt::OddEvenFill || Qt::WindingFill);
p.d_func()->fillRule = Qt::FillRule(fillRule);
p.d_func()->dirtyBounds = true;
p.d_func()->dirtyControlBounds = true;
return s;
}
#endif
/*******************************************************************************
* class QPainterPathStroker
*/
void qt_path_stroke_move_to(qfixed x, qfixed y, void *data)
{
((QPainterPath *) data)->moveTo(qt_fixed_to_real(x), qt_fixed_to_real(y));
}
void qt_path_stroke_line_to(qfixed x, qfixed y, void *data)
{
((QPainterPath *) data)->lineTo(qt_fixed_to_real(x), qt_fixed_to_real(y));
}
void qt_path_stroke_cubic_to(qfixed c1x, qfixed c1y,
qfixed c2x, qfixed c2y,
qfixed ex, qfixed ey,
void *data)
{
((QPainterPath *) data)->cubicTo(qt_fixed_to_real(c1x), qt_fixed_to_real(c1y),
qt_fixed_to_real(c2x), qt_fixed_to_real(c2y),
qt_fixed_to_real(ex), qt_fixed_to_real(ey));
}
/*!
\since 4.1
\class QPainterPathStroker
\ingroup multimedia
\brief The QPainterPathStroker class is used to generate fillable
outlines for a given painter path.
By calling the createStroke() function, passing a given
QPainterPath as argument, a new painter path representing the
outline of the given path is created. The newly created painter
path can then be filled to draw the original painter path's
outline.
You can control the various design aspects (width, cap styles,
join styles and dash pattern) of the outlining using the following
functions:
\list
\o setWidth()
\o setCapStyle()
\o setJoinStyle()
\o setDashPattern()
\endlist
The setDashPattern() function accepts both a Qt::PenStyle object
and a vector representation of the pattern as argument.
In addition you can specify a curve's threshold, controlling the
granularity with which a curve is drawn, using the
setCurveThreshold() function. The default threshold is a well
adjusted value (0.25), and normally you should not need to modify
it. However, you can make the curve's appearance smoother by
decreasing its value.
You can also control the miter limit for the generated outline
using the setMiterLimit() function. The miter limit describes how
far from each join the miter join can extend. The limit is
specified in the units of width so the pixelwise miter limit will
be \c {miterlimit * width}. This value is only used if the join
style is Qt::MiterJoin.
The painter path generated by the createStroke() function should
only be used for outlining the given painter path. Otherwise it
may cause unexpected behavior. Generated outlines also require the
Qt::WindingFill rule which is set by default.
\sa QPen, QBrush
*/
QPainterPathStrokerPrivate::QPainterPathStrokerPrivate()
: dashOffset(0)
{
stroker.setMoveToHook(qt_path_stroke_move_to);
stroker.setLineToHook(qt_path_stroke_line_to);
stroker.setCubicToHook(qt_path_stroke_cubic_to);
}
/*!
Creates a new stroker.
*/
QPainterPathStroker::QPainterPathStroker()
: d_ptr(new QPainterPathStrokerPrivate)
{
}
/*!
Destroys the stroker.
*/
QPainterPathStroker::~QPainterPathStroker()
{
delete d_ptr;
}
/*!
Generates a new path that is a fillable area representing the
outline of the given \a path.
The various design aspects of the outline are based on the
stroker's properties: width(), capStyle(), joinStyle(),
dashPattern(), curveThreshold() and miterLimit().
The generated path should only be used for outlining the given
painter path. Otherwise it may cause unexpected
behavior. Generated outlines also require the Qt::WindingFill rule
which is set by default.
*/
QPainterPath QPainterPathStroker::createStroke(const QPainterPath &path) const
{
QPainterPathStrokerPrivate *d = const_cast<QPainterPathStrokerPrivate *>(d_func());
QPainterPath stroke;
if (path.isEmpty())
return path;
if (d->dashPattern.isEmpty()) {
d->stroker.strokePath(path, &stroke, QTransform());
} else {
QDashStroker dashStroker(&d->stroker);
dashStroker.setDashPattern(d->dashPattern);
dashStroker.setDashOffset(d->dashOffset);
dashStroker.setClipRect(d->stroker.clipRect());
dashStroker.strokePath(path, &stroke, QTransform());
}
stroke.setFillRule(Qt::WindingFill);
return stroke;
}
/*!
Sets the width of the generated outline painter path to \a width.
The generated outlines will extend approximately 50% of \a width
to each side of the given input path's original outline.
*/
void QPainterPathStroker::setWidth(qreal width)
{
Q_D(QPainterPathStroker);
if (width <= 0)
width = 1;
d->stroker.setStrokeWidth(qt_real_to_fixed(width));
}
/*!
Returns the width of the generated outlines.
*/
qreal QPainterPathStroker::width() const
{
return qt_fixed_to_real(d_func()->stroker.strokeWidth());
}
/*!
Sets the cap style of the generated outlines to \a style. If a
dash pattern is set, each segment of the pattern is subject to the
cap \a style.
*/
void QPainterPathStroker::setCapStyle(Qt::PenCapStyle style)
{
d_func()->stroker.setCapStyle(style);
}
/*!
Returns the cap style of the generated outlines.
*/
Qt::PenCapStyle QPainterPathStroker::capStyle() const
{
return d_func()->stroker.capStyle();
}
/*!
Sets the join style of the generated outlines to \a style.
*/
void QPainterPathStroker::setJoinStyle(Qt::PenJoinStyle style)
{
d_func()->stroker.setJoinStyle(style);
}
/*!
Returns the join style of the generated outlines.
*/
Qt::PenJoinStyle QPainterPathStroker::joinStyle() const
{
return d_func()->stroker.joinStyle();
}
/*!
Sets the miter limit of the generated outlines to \a limit.
The miter limit describes how far from each join the miter join
can extend. The limit is specified in units of the currently set
width. So the pixelwise miter limit will be \c { miterlimit *
width}.
This value is only used if the join style is Qt::MiterJoin.
*/
void QPainterPathStroker::setMiterLimit(qreal limit)
{
d_func()->stroker.setMiterLimit(qt_real_to_fixed(limit));
}
/*!
Returns the miter limit for the generated outlines.
*/
qreal QPainterPathStroker::miterLimit() const
{
return qt_fixed_to_real(d_func()->stroker.miterLimit());
}
/*!
Specifies the curve flattening \a threshold, controlling the
granularity with which the generated outlines' curve is drawn.
The default threshold is a well adjusted value (0.25), and
normally you should not need to modify it. However, you can make
the curve's appearance smoother by decreasing its value.
*/
void QPainterPathStroker::setCurveThreshold(qreal threshold)
{
d_func()->stroker.setCurveThreshold(qt_real_to_fixed(threshold));
}
/*!
Returns the curve flattening threshold for the generated
outlines.
*/
qreal QPainterPathStroker::curveThreshold() const
{
return qt_fixed_to_real(d_func()->stroker.curveThreshold());
}
/*!
Sets the dash pattern for the generated outlines to \a style.
*/
void QPainterPathStroker::setDashPattern(Qt::PenStyle style)
{
d_func()->dashPattern = QDashStroker::patternForStyle(style);
}
/*!
\overload
Sets the dash pattern for the generated outlines to \a
dashPattern. This function makes it possible to specify custom
dash patterns.
Each element in the vector contains the lengths of the dashes and spaces
in the stroke, beginning with the first dash in the first element, the
first space in the second element, and alternating between dashes and
spaces for each following pair of elements.
The vector can contain an odd number of elements, in which case the last
element will be extended by the length of the first element when the
pattern repeats.
*/
void QPainterPathStroker::setDashPattern(const QVector<qreal> &dashPattern)
{
d_func()->dashPattern.clear();
for (int i=0; i<dashPattern.size(); ++i)
d_func()->dashPattern << qt_real_to_fixed(dashPattern.at(i));
}
/*!
Returns the dash pattern for the generated outlines.
*/
QVector<qreal> QPainterPathStroker::dashPattern() const
{
return d_func()->dashPattern;
}
/*!
Returns the dash offset for the generated outlines.
*/
qreal QPainterPathStroker::dashOffset() const
{
return d_func()->dashOffset;
}
/*!
Sets the dash offset for the generated outlines to \a offset.
See the documentation for QPen::setDashOffset() for a description of the
dash offset.
*/
void QPainterPathStroker::setDashOffset(qreal offset)
{
d_func()->dashOffset = offset;
}
/*!
Converts the path into a polygon using the QTransform
\a matrix, and returns the polygon.
The polygon is created by first converting all subpaths to
polygons, then using a rewinding technique to make sure that
overlapping subpaths can be filled using the correct fill rule.
Note that rewinding inserts addition lines in the polygon so
the outline of the fill polygon does not match the outline of
the path.
\sa toSubpathPolygons(), toFillPolygons(),
{QPainterPath#QPainterPath Conversion}{QPainterPath Conversion}
*/
QPolygonF QPainterPath::toFillPolygon(const QTransform &matrix) const
{
QList<QPolygonF> flats = toSubpathPolygons(matrix);
QPolygonF polygon;
if (flats.isEmpty())
return polygon;
QPointF first = flats.first().first();
for (int i=0; i<flats.size(); ++i) {
polygon += flats.at(i);
if (!flats.at(i).isClosed())
polygon += flats.at(i).first();
if (i > 0)
polygon += first;
}
return polygon;
}
/*!
\overload
*/
QPolygonF QPainterPath::toFillPolygon(const QMatrix &matrix) const
{
return toFillPolygon(QTransform(matrix));
}
//derivative of the equation
static inline qreal slopeAt(qreal t, qreal a, qreal b, qreal c, qreal d)
{
return 3*t*t*(d - 3*c + 3*b - a) + 6*t*(c - 2*b + a) + 3*(b - a);
}
/*!
Returns the length of the current path.
*/
qreal QPainterPath::length() const
{
Q_D(QPainterPath);
if (isEmpty())
return 0;
qreal len = 0;
for (int i=1; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
switch (e.type) {
case MoveToElement:
break;
case LineToElement:
{
len += QLineF(d->elements.at(i-1), e).length();
break;
}
case CurveToElement:
{
QBezier b = QBezier::fromPoints(d->elements.at(i-1),
e,
d->elements.at(i+1),
d->elements.at(i+2));
len += b.length();
i += 2;
break;
}
default:
break;
}
}
return len;
}
/*!
Returns percentage of the whole path at the specified length \a len.
Note that similarly to other percent methods, the percentage measurement
is not linear with regards to the length, if curves are present
in the path. When curves are present the percentage argument is mapped
to the t parameter of the Bezier equations.
*/
qreal QPainterPath::percentAtLength(qreal len) const
{
Q_D(QPainterPath);
if (isEmpty() || len <= 0)
return 0;
qreal totalLength = length();
if (len > totalLength)
return 1;
qreal curLen = 0;
for (int i=1; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
switch (e.type) {
case MoveToElement:
break;
case LineToElement:
{
QLineF line(d->elements.at(i-1), e);
qreal llen = line.length();
curLen += llen;
if (curLen >= len) {
return len/totalLength ;
}
break;
}
case CurveToElement:
{
QBezier b = QBezier::fromPoints(d->elements.at(i-1),
e,
d->elements.at(i+1),
d->elements.at(i+2));
qreal blen = b.length();
qreal prevLen = curLen;
curLen += blen;
if (curLen >= len) {
qreal res = b.tAtLength(len - prevLen);
return (res * blen + prevLen)/totalLength;
}
i += 2;
break;
}
default:
break;
}
}
return 0;
}
static inline QBezier bezierAtT(const QPainterPath &path, qreal t, qreal *startingLength, qreal *bezierLength)
{
*startingLength = 0;
if (t > 1)
return QBezier();
qreal curLen = 0;
qreal totalLength = path.length();
const int lastElement = path.elementCount() - 1;
for (int i=0; i <= lastElement; ++i) {
const QPainterPath::Element &e = path.elementAt(i);
switch (e.type) {
case QPainterPath::MoveToElement:
break;
case QPainterPath::LineToElement:
{
QLineF line(path.elementAt(i-1), e);
qreal llen = line.length();
curLen += llen;
if (i == lastElement || curLen/totalLength >= t) {
*bezierLength = llen;
QPointF a = path.elementAt(i-1);
QPointF delta = e - a;
return QBezier::fromPoints(a, a + delta / 3, a + 2 * delta / 3, e);
}
break;
}
case QPainterPath::CurveToElement:
{
QBezier b = QBezier::fromPoints(path.elementAt(i-1),
e,
path.elementAt(i+1),
path.elementAt(i+2));
qreal blen = b.length();
curLen += blen;
if (i + 2 == lastElement || curLen/totalLength >= t) {
*bezierLength = blen;
return b;
}
i += 2;
break;
}
default:
break;
}
*startingLength = curLen;
}
return QBezier();
}
/*!
Returns the point at at the percentage \a t of the current path.
The argument \a t has to be between 0 and 1.
Note that similarly to other percent methods, the percentage measurement
is not linear with regards to the length, if curves are present
in the path. When curves are present the percentage argument is mapped
to the t parameter of the Bezier equations.
*/
QPointF QPainterPath::pointAtPercent(qreal t) const
{
if (t < 0 || t > 1) {
qWarning("QPainterPath::pointAtPercent accepts only values between 0 and 1");
return QPointF();
}
if (isEmpty())
return QPointF();
qreal totalLength = length();
qreal curLen = 0;
qreal bezierLen = 0;
QBezier b = bezierAtT(*this, t, &curLen, &bezierLen);
qreal realT = (totalLength * t - curLen) / bezierLen;
return b.pointAt(qBound(qreal(0), realT, qreal(1)));
}
/*!
Returns the angle of the path tangent at the percentage \a t.
The argument \a t has to be between 0 and 1.
Positive values for the angles mean counter-clockwise while negative values
mean the clockwise direction. Zero degrees is at the 3 o'clock position.
Note that similarly to the other percent methods, the percentage measurement
is not linear with regards to the length if curves are present
in the path. When curves are present the percentage argument is mapped
to the t parameter of the Bezier equations.
*/
qreal QPainterPath::angleAtPercent(qreal t) const
{
if (t < 0 || t > 1) {
qWarning("QPainterPath::angleAtPercent accepts only values between 0 and 1");
return 0;
}
qreal totalLength = length();
qreal curLen = 0;
qreal bezierLen = 0;
QBezier bez = bezierAtT(*this, t, &curLen, &bezierLen);
qreal realT = (totalLength * t - curLen) / bezierLen;
qreal m1 = slopeAt(realT, bez.x1, bez.x2, bez.x3, bez.x4);
qreal m2 = slopeAt(realT, bez.y1, bez.y2, bez.y3, bez.y4);
return QLineF(0, 0, m1, m2).angle();
}
#if defined(Q_OS_WINCE)
#pragma warning( disable : 4056 4756 )
#endif
/*!
Returns the slope of the path at the percentage \a t. The
argument \a t has to be between 0 and 1.
Note that similarly to other percent methods, the percentage measurement
is not linear with regards to the length, if curves are present
in the path. When curves are present the percentage argument is mapped
to the t parameter of the Bezier equations.
*/
qreal QPainterPath::slopeAtPercent(qreal t) const
{
if (t < 0 || t > 1) {
qWarning("QPainterPath::slopeAtPercent accepts only values between 0 and 1");
return 0;
}
qreal totalLength = length();
qreal curLen = 0;
qreal bezierLen = 0;
QBezier bez = bezierAtT(*this, t, &curLen, &bezierLen);
qreal realT = (totalLength * t - curLen) / bezierLen;
qreal m1 = slopeAt(realT, bez.x1, bez.x2, bez.x3, bez.x4);
qreal m2 = slopeAt(realT, bez.y1, bez.y2, bez.y3, bez.y4);
//tangent line
qreal slope = 0;
#define SIGN(x) ((x < 0)?-1:1)
if (m1)
slope = m2/m1;
else {
//windows doesn't define INFINITY :(
#ifdef INFINITY
slope = INFINITY*SIGN(m2);
#else
if (sizeof(qreal) == sizeof(double)) {
return 1.79769313486231570e+308;
} else {
return ((qreal)3.40282346638528860e+38);
}
#endif
}
return slope;
}
/*!
\since 4.4
Adds the given rectangle \a rect with rounded corners to the path.
The \a xRadius and \a yRadius arguments specify the radii of
the ellipses defining the corners of the rounded rectangle.
When \a mode is Qt::RelativeSize, \a xRadius and
\a yRadius are specified in percentage of half the rectangle's
width and height respectively, and should be in the range 0.0 to 100.0.
\sa addRect()
*/
void QPainterPath::addRoundedRect(const QRectF &rect, qreal xRadius, qreal yRadius,
Qt::SizeMode mode)
{
QRectF r = rect.normalized();
if (r.isNull())
return;
if (mode == Qt::AbsoluteSize) {
qreal w = r.width() / 2;
qreal h = r.height() / 2;
if (w == 0) {
xRadius = 0;
} else {
xRadius = 100 * qMin(xRadius, w) / w;
}
if (h == 0) {
yRadius = 0;
} else {
yRadius = 100 * qMin(yRadius, h) / h;
}
} else {
if (xRadius > 100) // fix ranges
xRadius = 100;
if (yRadius > 100)
yRadius = 100;
}
if (xRadius <= 0 || yRadius <= 0) { // add normal rectangle
addRect(r);
return;
}
qreal x = r.x();
qreal y = r.y();
qreal w = r.width();
qreal h = r.height();
qreal rxx2 = w*xRadius/100;
qreal ryy2 = h*yRadius/100;
ensureData();
detach();
arcMoveTo(x, y, rxx2, ryy2, 90);
arcTo(x, y, rxx2, ryy2, 90, 90);
arcTo(x, y+h-ryy2, rxx2, ryy2, 2*90, 90);
arcTo(x+w-rxx2, y+h-ryy2, rxx2, ryy2, 3*90, 90);
arcTo(x+w-rxx2, y, rxx2, ryy2, 0, 90);
closeSubpath();
d_func()->require_moveTo = true;
}
/*!
\fn void QPainterPath::addRoundedRect(qreal x, qreal y, qreal w, qreal h, qreal xRadius, qreal yRadius, Qt::SizeMode mode = Qt::AbsoluteSize);
\since 4.4
\overload
Adds the given rectangle \a x, \a y, \a w, \a h with rounded corners to the path.
*/
/*!
\obsolete
Adds a rectangle \a r with rounded corners to the path.
The \a xRnd and \a yRnd arguments specify how rounded the corners
should be. 0 is angled corners, 99 is maximum roundedness.
\sa addRoundedRect()
*/
void QPainterPath::addRoundRect(const QRectF &r, int xRnd, int yRnd)
{
if(xRnd >= 100) // fix ranges
xRnd = 99;
if(yRnd >= 100)
yRnd = 99;
if(xRnd <= 0 || yRnd <= 0) { // add normal rectangle
addRect(r);
return;
}
QRectF rect = r.normalized();
if (rect.isNull())
return;
qreal x = rect.x();
qreal y = rect.y();
qreal w = rect.width();
qreal h = rect.height();
qreal rxx2 = w*xRnd/100;
qreal ryy2 = h*yRnd/100;
ensureData();
detach();
arcMoveTo(x, y, rxx2, ryy2, 90);
arcTo(x, y, rxx2, ryy2, 90, 90);
arcTo(x, y+h-ryy2, rxx2, ryy2, 2*90, 90);
arcTo(x+w-rxx2, y+h-ryy2, rxx2, ryy2, 3*90, 90);
arcTo(x+w-rxx2, y, rxx2, ryy2, 0, 90);
closeSubpath();
d_func()->require_moveTo = true;
}
/*!
\obsolete
\fn bool QPainterPath::addRoundRect(const QRectF &rect, int roundness);
\since 4.3
\overload
Adds a rounded rectangle, \a rect, to the path.
The \a roundness argument specifies uniform roundness for the
rectangle. Vertical and horizontal roundness factors will be
adjusted accordingly to act uniformly around both axes. Use this
method if you want a rectangle equally rounded across both the X and
Y axis.
\sa addRoundedRect()
*/
/*!
\obsolete
\fn void QPainterPath::addRoundRect(qreal x, qreal y, qreal w, qreal h, int xRnd, int yRnd);
\overload
Adds a rectangle with rounded corners to the path. The rectangle
is constructed from \a x, \a y, and the width and height \a w
and \a h.
The \a xRnd and \a yRnd arguments specify how rounded the corners
should be. 0 is angled corners, 99 is maximum roundedness.
\sa addRoundedRect()
*/
/*!
\obsolete
\fn bool QPainterPath::addRoundRect(qreal x, qreal y, qreal width, qreal height, int roundness);
\since 4.3
\overload
Adds a rounded rectangle to the path, defined by the coordinates \a
x and \a y with the specified \a width and \a height.
The \a roundness argument specifies uniform roundness for the
rectangle. Vertical and horizontal roundness factors will be
adjusted accordingly to act uniformly around both axes. Use this
method if you want a rectangle equally rounded across both the X and
Y axis.
\sa addRoundedRect()
*/
/*!
\since 4.3
Returns a path which is the union of this path's fill area and \a p's fill area.
Set operations on paths will treat the paths as areas. Non-closed
paths will be treated as implicitly closed.
\sa intersected(), subtracted(), subtractedInverted()
*/
QPainterPath QPainterPath::united(const QPainterPath &p) const
{
if (isEmpty() || p.isEmpty())
return isEmpty() ? p : *this;
QPathClipper clipper(*this, p);
return clipper.clip(QPathClipper::BoolOr);
}
/*!
\since 4.3
Returns a path which is the intersection of this path's fill area and \a p's fill area.
*/
QPainterPath QPainterPath::intersected(const QPainterPath &p) const
{
if (isEmpty() || p.isEmpty())
return QPainterPath();
QPathClipper clipper(*this, p);
return clipper.clip(QPathClipper::BoolAnd);
}
/*!
\since 4.3
Returns a path which is \a p's fill area subtracted from this path's fill area.
Set operations on paths will treat the paths as areas. Non-closed
paths will be treated as implicitly closed.
*/
QPainterPath QPainterPath::subtracted(const QPainterPath &p) const
{
if (isEmpty() || p.isEmpty())
return *this;
QPathClipper clipper(*this, p);
return clipper.clip(QPathClipper::BoolSub);
}
/*!
\since 4.3
\obsolete
Use subtracted() instead.
\sa subtracted()
*/
QPainterPath QPainterPath::subtractedInverted(const QPainterPath &p) const
{
return p.subtracted(*this);
}
/*!
\since 4.4
Returns a simplified version of this path. This implies merging all subpaths that intersect,
and returning a path containing no intersecting edges. Consecutive parallel lines will also
be merged. The simplified path will always use the default fill rule, Qt::OddEvenFill.
*/
QPainterPath QPainterPath::simplified() const
{
if(isEmpty())
return *this;
QPathClipper clipper(*this, QPainterPath());
return clipper.clip(QPathClipper::Simplify);
}
/*!
\since 4.3
Returns true if the current path intersects at any point the given path \a p.
Also returns true if the current path contains or is contained by any part of \a p.
Set operations on paths will treat the paths as areas. Non-closed
paths will be treated as implicitly closed.
\sa contains()
*/
bool QPainterPath::intersects(const QPainterPath &p) const
{
if (p.elementCount() == 1)
return contains(p.elementAt(0));
if (isEmpty() || p.isEmpty())
return false;
QPathClipper clipper(*this, p);
return clipper.intersect();
}
/*!
\since 4.3
Returns true if the given path \a p is contained within
the current path. Returns false if any edges of the current path and
\a p intersect.
Set operations on paths will treat the paths as areas. Non-closed
paths will be treated as implicitly closed.
\sa intersects()
*/
bool QPainterPath::contains(const QPainterPath &p) const
{
if (p.elementCount() == 1)
return contains(p.elementAt(0));
if (isEmpty() || p.isEmpty())
return false;
QPathClipper clipper(*this, p);
return clipper.contains();
}
void QPainterPath::setDirty(bool dirty)
{
d_func()->dirtyBounds = dirty;
d_func()->dirtyControlBounds = dirty;
}
void QPainterPath::computeBoundingRect() const
{
QPainterPathData *d = d_func();
d->dirtyBounds = false;
if (!d_ptr) {
d->bounds = QRect();
return;
}
qreal minx, maxx, miny, maxy;
minx = maxx = d->elements.at(0).x;
miny = maxy = d->elements.at(0).y;
for (int i=1; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
switch (e.type) {
case MoveToElement:
case LineToElement:
if (e.x > maxx) maxx = e.x;
else if (e.x < minx) minx = e.x;
if (e.y > maxy) maxy = e.y;
else if (e.y < miny) miny = e.y;
break;
case CurveToElement:
{
QBezier b = QBezier::fromPoints(d->elements.at(i-1),
e,
d->elements.at(i+1),
d->elements.at(i+2));
QRectF r = qt_painterpath_bezier_extrema(b);
qreal right = r.right();
qreal bottom = r.bottom();
if (r.x() < minx) minx = r.x();
if (right > maxx) maxx = right;
if (r.y() < miny) miny = r.y();
if (bottom > maxy) maxy = bottom;
i += 2;
}
break;
default:
break;
}
}
d->bounds = QRectF(minx, miny, maxx - minx, maxy - miny);
}
void QPainterPath::computeControlPointRect() const
{
QPainterPathData *d = d_func();
d->dirtyControlBounds = false;
if (!d_ptr) {
d->controlBounds = QRect();
return;
}
qreal minx, maxx, miny, maxy;
minx = maxx = d->elements.at(0).x;
miny = maxy = d->elements.at(0).y;
for (int i=1; i<d->elements.size(); ++i) {
const Element &e = d->elements.at(i);
if (e.x > maxx) maxx = e.x;
else if (e.x < minx) minx = e.x;
if (e.y > maxy) maxy = e.y;
else if (e.y < miny) miny = e.y;
}
d->controlBounds = QRectF(minx, miny, maxx - minx, maxy - miny);
}
#ifndef QT_NO_DEBUG_STREAM
QDebug operator<<(QDebug s, const QPainterPath &p)
{
s.nospace() << "QPainterPath: Element count=" << p.elementCount() << endl;
const char *types[] = {"MoveTo", "LineTo", "CurveTo", "CurveToData"};
for (int i=0; i<p.elementCount(); ++i) {
s.nospace() << " -> " << types[p.elementAt(i).type] << "(x=" << p.elementAt(i).x << ", y=" << p.elementAt(i).y << ")" << endl;
}
return s;
}
#endif
QT_END_NAMESPACE
|