flpdf 0.3.0

A pure-Rust PDF toolkit modeled on qpdf — read, rewrite, linearize, and inspect PDFs.
Documentation
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
//! qpdf `QPDFPageLabelDocumentHelper`-equivalent page-label access.
//!
//! [`PageLabelDocumentHelper`] reads, renders (ISO 32000-1 §12.4.2), and edits
//! the catalog `/PageLabels` number tree. [`LabelRange`] models one label range
//! (`/S` style, `/P` prefix, `/St` start). The number-tree walking/building is
//! delegated to [`crate::name_number_tree`].

use crate::name_number_tree::DEFAULT_MAX_TREE_DEPTH;
use crate::ref_chain::resolve_ref_chain;
use crate::{Dictionary, Error, Object, ObjectRef, Pdf, Result};
use std::io::{Read, Seek};

/// Page-label numbering style (ISO 32000-1 §12.4.2 `/S`).
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum LabelStyle {
    /// `/D` — decimal arabic.
    Decimal,
    /// `/R` — uppercase roman.
    RomanUpper,
    /// `/r` — lowercase roman.
    RomanLower,
    /// `/A` — uppercase letters (A, B, …, Z, AA, …).
    AlphaUpper,
    /// `/a` — lowercase letters.
    AlphaLower,
    /// No `/S` — labels have no numeric portion (prefix only).
    None,
}

impl LabelStyle {
    /// Map a `/S` name's bytes to a style; unrecognised/absent → [`LabelStyle::None`].
    pub fn from_name(name: &[u8]) -> Self {
        match name {
            b"D" => LabelStyle::Decimal,
            b"R" => LabelStyle::RomanUpper,
            b"r" => LabelStyle::RomanLower,
            b"A" => LabelStyle::AlphaUpper,
            b"a" => LabelStyle::AlphaLower,
            _ => LabelStyle::None,
        }
    }

    /// The `/S` name string, or `None` for [`LabelStyle::None`].
    pub fn to_name(self) -> Option<&'static str> {
        match self {
            LabelStyle::Decimal => Some("D"),
            LabelStyle::RomanUpper => Some("R"),
            LabelStyle::RomanLower => Some("r"),
            LabelStyle::AlphaUpper => Some("A"),
            LabelStyle::AlphaLower => Some("a"),
            LabelStyle::None => None,
        }
    }
}

/// One `/PageLabels` range: numbering style, prefix, and starting value.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct LabelRange {
    /// Numbering style (`/S`).
    pub style: LabelStyle,
    /// Label prefix (`/P`), decoded; empty when absent.
    pub prefix: String,
    /// First value in the range (`/St`); defaults to 1.
    pub start: i64,
}

impl LabelRange {
    /// Parse a label dictionary (`/S`, `/P`, `/St`). Unrecognised/absent `/S`
    /// → [`LabelStyle::None`]; absent `/St` → 1; `/P` decoded via
    /// `crate::json_inspect::decode_pdf_text_string` with lossy fallback.
    ///
    /// This does **not** resolve indirect `/S`/`/P`/`/St` values (it has no
    /// `Pdf` handle): an indirect inner value falls through to its default.
    /// Callers reading a live document should go through
    /// [`PageLabelDocumentHelper::ranges`] (which uses the resolving
    /// `LabelRange::from_dict_resolved`); this plain form is for the
    /// non-resolving JSON-inspection path.
    pub fn from_dict(dict: &Dictionary) -> Self {
        let style = match dict.get("S") {
            Some(Object::Name(bytes)) => LabelStyle::from_name(bytes),
            _ => LabelStyle::None,
        };
        let prefix = match dict.get("P") {
            Some(Object::String(bytes)) => crate::json_inspect::decode_pdf_text_string(bytes)
                .unwrap_or_else(|| String::from_utf8_lossy(bytes).into_owned()),
            _ => String::new(),
        };
        let start = match dict.get("St") {
            Some(Object::Integer(n)) => *n,
            _ => 1,
        };
        LabelRange {
            style,
            prefix,
            start,
        }
    }

    /// Like [`LabelRange::from_dict`] but resolves indirect `/S`, `/P`, `/St`
    /// values via `pdf` before interpreting them (ISO 32000-1 allows any value
    /// to be an indirect reference). Used by the document reader; the plain
    /// [`LabelRange::from_dict`] is retained for callers without a `Pdf` handle.
    pub(crate) fn from_dict_resolved<R: Read + Seek>(
        pdf: &mut Pdf<R>,
        dict: &Dictionary,
    ) -> Result<Self> {
        let style = match resolve_entry(pdf, dict.get("S"))? {
            Some(Object::Name(bytes)) => LabelStyle::from_name(&bytes),
            _ => LabelStyle::None,
        };
        let prefix = match resolve_entry(pdf, dict.get("P"))? {
            Some(Object::String(bytes)) => crate::json_inspect::decode_pdf_text_string(&bytes)
                .unwrap_or_else(|| String::from_utf8_lossy(&bytes).into_owned()),
            _ => String::new(),
        };
        let start = match resolve_entry(pdf, dict.get("St"))? {
            Some(Object::Integer(n)) => n,
            _ => 1,
        };
        Ok(LabelRange {
            style,
            prefix,
            start,
        })
    }

    /// Build a label dictionary mirroring qpdf `pageLabelDict`: `/S` name when
    /// the style is not [`LabelStyle::None`]; `/P` only when non-empty; `/St`
    /// only when `!= 1`.
    ///
    /// Non-ASCII prefixes are emitted as a PDF UTF-16BE text string (BOM +
    /// UTF-16BE bytes, ISO 32000-1 §7.9.2.2). Emitting the Rust `String`'s
    /// raw UTF-8 bytes verbatim would be misread by PDFDocEncoding-only
    /// readers — a source `§` (`c2 a7`) would come back as `§`. Pure ASCII
    /// prefixes are emitted as-is since ASCII 32-127 is identical between
    /// PDFDocEncoding and UTF-8/UTF-16.
    pub fn to_dict(&self) -> Dictionary {
        let mut d = Dictionary::new();
        if let Some(name) = self.style.to_name() {
            d.insert("S", Object::Name(name.into()));
        }
        if !self.prefix.is_empty() {
            let bytes = if self.prefix.is_ascii() {
                self.prefix.clone().into_bytes()
            } else {
                crate::filespec_helper::encode_utf16be(&self.prefix)
            };
            d.insert("P", Object::String(bytes));
        }
        if self.start != 1 {
            d.insert("St", Object::Integer(self.start));
        }
        d
    }

    /// Build a label dictionary in the shape qpdf's
    /// `QPDFPageLabelDocumentHelper::getLabelForPage` reconstruction produces:
    /// `/S` and `/P` are included on the same terms as [`Self::to_dict`], but
    /// `/St` is **always** present — never omitted for the default value `1`.
    ///
    /// Use this (via
    /// [`PageLabelDocumentHelper::write_reconstructed_labels`]) for entries
    /// coming from [`PageLabelDocumentHelper::labels_for_page_range`] / a page-subset or -split
    /// operation; use [`Self::to_dict`] for a directly authored range (qpdf's
    /// `--set-page-labels` shape), where the default `/St 1` is omitted for
    /// brevity.
    pub(crate) fn to_reconstructed_dict(&self) -> Dictionary {
        let mut d = self.to_dict();
        d.insert("St", Object::Integer(self.start));
        d
    }

    /// Render the display label for `value` (§12.4.2): `prefix` followed by the
    /// style-formatted number. [`LabelStyle::None`] and non-positive numeric
    /// values contribute no numeric portion.
    pub fn format(&self, value: i64) -> String {
        let mut s = self.prefix.clone();
        match self.style {
            LabelStyle::Decimal => s.push_str(&value.to_string()),
            LabelStyle::RomanUpper => s.push_str(&to_roman(value, true)),
            LabelStyle::RomanLower => s.push_str(&to_roman(value, false)),
            LabelStyle::AlphaUpper => s.push_str(&to_alpha(value, true)),
            LabelStyle::AlphaLower => s.push_str(&to_alpha(value, false)),
            LabelStyle::None => {}
        }
        s
    }
}

/// Resolve a dictionary entry that may be an indirect reference, returning the
/// owned target object (or the value verbatim if direct, `None` if absent).
fn resolve_entry<R: Read + Seek>(
    pdf: &mut Pdf<R>,
    value: Option<&Object>,
) -> Result<Option<Object>> {
    match value {
        Some(Object::Reference(r)) => Ok(Some(pdf.resolve_borrowed(*r)?.clone())),
        Some(o) => Ok(Some(o.clone())),
        None => Ok(None),
    }
}

/// Collapse a later `(first_page_idx, LabelRange)` entry into its
/// predecessor when the later entry is redundant — its style, prefix, and
/// `/St` are exactly what the predecessor's own numbering would already
/// produce at that page index. Dropping such an entry does not change any
/// page's rendered label; it only removes a needless explicit tree node.
///
/// `ranges` must be sorted ascending by index (the shape [`PageLabelDocumentHelper::ranges`]
/// and [`PageLabelDocumentHelper::labels_for_page_range`] already produce);
/// only consecutive pairs are compared.
///
/// # Examples
///
/// ```
/// use flpdf::{merge_adjacent_ranges, LabelRange, LabelStyle};
///
/// let a = LabelRange { style: LabelStyle::Decimal, prefix: String::new(), start: 1 };
/// // Index 5 continues `a`'s numbering exactly (1 + 5 == 6): redundant, dropped.
/// let b = LabelRange { start: 6, ..a.clone() };
/// let merged = merge_adjacent_ranges(vec![(0, a), (5, b)]);
/// assert_eq!(merged.len(), 1);
/// ```
/// Pure implementation of [`PageLabelDocumentHelper::labels_for_page_range`]
/// against a pre-fetched, ascending `ranges` slice. Same fabricated-first-
/// label rule (LabelStyle::None with `/St = new_start_idx + 1`); same
/// "strictly between start_idx and end_idx" explicit-entry emission.
fn labels_for_page_range_from_ranges(
    ranges: &[(i64, LabelRange)],
    start_idx: i64,
    end_idx: i64,
    new_start_idx: i64,
) -> Vec<(i64, LabelRange)> {
    let first_label = label_from_ranges(ranges, start_idx).unwrap_or_else(|| LabelRange {
        style: LabelStyle::None,
        prefix: String::new(),
        start: new_start_idx.saturating_add(1),
    });
    let mut out = vec![(new_start_idx, first_label)];
    let idx_offset = new_start_idx.saturating_sub(start_idx);
    // Emit each ranges entry that lies strictly BETWEEN start_idx and
    // end_idx (start_idx's label is already emitted as first_label). The
    // guard also folds away single-page (start==end) and inverted
    // (start>end) spans without special-casing them.
    if start_idx < end_idx {
        for (i, lab) in ranges {
            if *i > start_idx && *i <= end_idx {
                out.push((i.saturating_add(idx_offset), lab.clone()));
            }
        }
    }
    out
}

/// Effective label for `page_idx` given a pre-fetched, ascending `ranges`.
///
/// Pure function used by [`PageLabelDocumentHelper::label_for_page`] and the
/// selection-batch API — sharing the lookup lets callers fetch `/PageLabels`
/// once and reuse it instead of paying per-page tree walks.
pub(crate) fn label_from_ranges(ranges: &[(i64, LabelRange)], page_idx: i64) -> Option<LabelRange> {
    // ranges is ascending; take the last with first_index <= page_idx.
    let mut chosen: Option<&(i64, LabelRange)> = None;
    for entry in ranges {
        if entry.0 <= page_idx {
            chosen = Some(entry);
        } else {
            break;
        }
    }
    chosen.map(|(first, r)| {
        // Saturating arithmetic: `first <= page_idx` so the offset is
        // non-negative, but a hostile `/St` near i64::MAX could otherwise
        // overflow the start (panic in debug, wrap in release).
        let offset = page_idx.saturating_sub(*first);
        LabelRange {
            style: r.style,
            prefix: r.prefix.clone(),
            start: r.start.saturating_add(offset),
        }
    })
}

pub fn merge_adjacent_ranges(ranges: Vec<(i64, LabelRange)>) -> Vec<(i64, LabelRange)> {
    let mut out: Vec<(i64, LabelRange)> = Vec::with_capacity(ranges.len());
    for (idx, range) in ranges {
        if let Some((prev_idx, prev_range)) = out.last() {
            let expected_start = idx
                .checked_sub(*prev_idx)
                .and_then(|gap| prev_range.start.checked_add(gap));
            if let Some(expected_start) = expected_start {
                if prev_range.style == range.style
                    && prev_range.prefix == range.prefix
                    && range.start == expected_start
                {
                    continue; // redundant with the predecessor — drop the explicit entry
                }
            }
            // Overflow signals either an unsorted input (checked_sub
            // underflow) or a pathological i64::MAX-adjacent start (checked_add
            // overflow); adversarial input or a caller bug. Safety first —
            // keep the explicit entry rather than trust a synthetic
            // "expected_start" that could accidentally match. Redundant
            // entries never break correctness, only compactness.
        }
        out.push((idx, range));
    }
    out
}

/// Upper bound on the numeric value [`to_roman`]/[`to_alpha`] will render.
///
/// Values above this produce an empty numeric portion — a defensive cap against
/// CPU/memory exhaustion from a hostile `/St`: without it the roman subtraction
/// loop and the alphabetic repeat both scale with `value`, so an `i64::MAX`
/// `/St` would spin/allocate unboundedly. 100 000 is far beyond any real page
/// label yet keeps the rendered string short.
const MAX_RENDERABLE_LABEL_VALUE: i64 = 100_000;

/// Format `value` as a roman numeral (`upper` → uppercase). Empty for
/// `value <= 0` or `value > MAX_RENDERABLE_LABEL_VALUE`.
fn to_roman(value: i64, upper: bool) -> String {
    if value <= 0 || value > MAX_RENDERABLE_LABEL_VALUE {
        return String::new();
    }
    const TABLE: &[(i64, &str, &str)] = &[
        (1000, "M", "m"),
        (900, "CM", "cm"),
        (500, "D", "d"),
        (400, "CD", "cd"),
        (100, "C", "c"),
        (90, "XC", "xc"),
        (50, "L", "l"),
        (40, "XL", "xl"),
        (10, "X", "x"),
        (9, "IX", "ix"),
        (5, "V", "v"),
        (4, "IV", "iv"),
        (1, "I", "i"),
    ];
    let mut v = value;
    let mut out = String::new();
    for &(n, up, lo) in TABLE {
        while v >= n {
            out.push_str(if upper { up } else { lo });
            v -= n;
        }
    }
    out
}

/// Format `value` as repeating letters (§12.4.2): 1→A … 26→Z, 27→AA, 53→AAA.
/// Empty for `value <= 0` or `value > MAX_RENDERABLE_LABEL_VALUE`.
fn to_alpha(value: i64, upper: bool) -> String {
    if value <= 0 || value > MAX_RENDERABLE_LABEL_VALUE {
        return String::new();
    }
    let v = value - 1;
    let letter = (v % 26) as u8;
    let count = (v / 26) + 1;
    let ch = if upper { b'A' + letter } else { b'a' + letter } as char;
    (0..count).map(|_| ch).collect()
}

/// High-level helper for a document's `/PageLabels` number tree.
///
/// Construct with [`PageLabelDocumentHelper::new`] or [`Pdf::page_labels`]. The
/// helper caches nothing; methods re-read the live document.
pub struct PageLabelDocumentHelper<'a, R: Read + Seek> {
    pdf: &'a mut Pdf<R>,
}

impl<'a, R: Read + Seek> PageLabelDocumentHelper<'a, R> {
    /// Create a new helper borrowing `pdf` mutably.
    pub fn new(pdf: &'a mut Pdf<R>) -> Self {
        Self { pdf }
    }

    /// Resolve the catalog's `/PageLabels` value (Reference or inline dict), or
    /// `None` when absent.
    fn pagelabels_root(&mut self) -> Result<Option<Object>> {
        let Some(catalog_ref) = self.pdf.root_ref() else {
            return Ok(None);
        };
        let Some(catalog) = self.pdf.resolve_borrowed(catalog_ref)?.as_dict() else {
            return Ok(None);
        };
        Ok(catalog.get("PageLabels").cloned())
    }

    /// Whether the document carries a `/PageLabels` tree with at least the root.
    ///
    /// # Errors
    ///
    /// - Any error from [`Pdf::resolve`].
    pub fn has_page_labels(&mut self) -> Result<bool> {
        Ok(self.pagelabels_root()?.is_some())
    }

    /// All label ranges as `(first_page_index, LabelRange)`, ascending by index.
    /// Empty when `/PageLabels` is absent.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded.
    /// - Any error from [`Pdf::resolve`].
    pub fn ranges(&mut self) -> Result<Vec<(i64, LabelRange)>> {
        let Some(root) = self.pagelabels_root()? else {
            return Ok(vec![]);
        };
        crate::name_number_tree::read_number_tree(
            self.pdf,
            root,
            |pdf, v| {
                let dict = match v {
                    Object::Dictionary(d) => Some(d),
                    Object::Reference(r) => {
                        // A label-range value may be stored behind a holder
                        // chain (ref -> ref -> dict); follow the chain to its
                        // terminal rather than a single hop, then move the
                        // owned dictionary out.
                        let (terminal, _) = resolve_ref_chain(pdf, &Object::Reference(r))?;
                        terminal.into_dict()
                    }
                    _ => None,
                };
                match dict {
                    Some(d) => Ok(Some(LabelRange::from_dict_resolved(pdf, &d)?)),
                    None => Ok(None),
                }
            },
            DEFAULT_MAX_TREE_DEPTH,
        )
    }

    /// The effective label for a 0-based page index (qpdf `getLabelForPage`):
    /// the range whose first index is the largest `<= page_idx`, with `start`
    /// offset to that page. `None` when no range applies (no `/PageLabels`, or
    /// the page precedes the first range).
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded.
    /// - Any error from [`Pdf::resolve`].
    pub fn label_for_page(&mut self, page_idx: i64) -> Result<Option<LabelRange>> {
        let ranges = self.ranges()?;
        Ok(label_from_ranges(&ranges, page_idx))
    }

    /// The rendered display string for a 0-based page index. Falls back to
    /// 1-based decimal (`(page_idx + 1)`) when no range applies — matching the
    /// "default 1-based numeric labels" requirement.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded.
    /// - Any error from [`Pdf::resolve`].
    pub fn label_string_for_page(&mut self, page_idx: i64) -> Result<String> {
        match self.label_for_page(page_idx)? {
            Some(effective) => Ok(effective.format(effective.start)),
            None => Ok((page_idx + 1).to_string()),
        }
    }

    /// qpdf `getLabelsForPageRange` port: collect the label entries needed to
    /// reproduce the labels of pages `start_idx..=end_idx` if they were
    /// renumbered to begin at `new_start_idx`. Returns `(new_index, LabelRange)`
    /// pairs (the first entry plus every explicit entry in the source range),
    /// renumbered by `new_start_idx - start_idx`. Read-only; intended for
    /// page-extraction/subsetting call sites that reconstruct a document's
    /// `/PageLabels` for a new page range (pair with
    /// [`PageLabelDocumentHelper::write_reconstructed_labels`]).
    ///
    /// `start_idx` must be `<= end_idx`. An inverted span (`start_idx >
    /// end_idx`) is a caller bug: this returns only the first-page label
    /// with no explicit-range entries, matching an empty-span read; it does
    /// not panic. `start_idx == end_idx` denotes a single-page span.
    ///
    /// `new_start_idx` is expected to be a valid page-index-shaped value
    /// (typically `0..page_count`). Pathological inputs near `i64::MAX`
    /// saturate on internal `+1`/`+idx_offset` arithmetic — no panic, but
    /// the resulting `/St` and output indices are clamped to `i64::MAX`;
    /// the caller is responsible for supplying realistic page indices.
    ///
    /// Unlike qpdf's accumulating signature, this is a single self-contained
    /// call: the leading entry is always emitted (the result vector starts
    /// empty, so there is no prior entry to be redundant against). A later
    /// accumulating consumer can dedupe across calls.
    ///
    /// Re-reads the `/PageLabels` tree once per explicit page in the span (the
    /// helper caches nothing by design); acceptable for typical small label trees.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded.
    /// - Any error from [`Pdf::resolve`].
    pub fn labels_for_page_range(
        &mut self,
        start_idx: i64,
        end_idx: i64,
        new_start_idx: i64,
    ) -> Result<Vec<(i64, LabelRange)>> {
        // debug_assert catches an inverted span (a caller bug per the doc
        // contract) in dev/tests. Release keeps the graceful empty-span
        // behavior documented above.
        debug_assert!(
            start_idx <= end_idx,
            "labels_for_page_range: inverted span (start={start_idx}, end={end_idx})",
        );
        let ranges = self.ranges()?;
        Ok(labels_for_page_range_from_ranges(
            &ranges,
            start_idx,
            end_idx,
            new_start_idx,
        ))
    }

    /// Batch variant of [`Self::labels_for_page_range`] for
    /// page-selection/split/merge callers that would otherwise re-parse the
    /// `/PageLabels` tree once per selected page. Fetches `ranges()` ONCE and
    /// emits one entry per input index (in input order); each entry's output
    /// index is `out_start_idx + i`, so multi-input mergers can pass a
    /// running base. Pair with [`merge_adjacent_ranges`] to fold away
    /// redundant tail entries before writing.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded while reading the existing tree.
    /// - Any error from [`Pdf::resolve`].
    pub fn labels_for_selection(
        &mut self,
        src_indices: &[i64],
        out_start_idx: i64,
    ) -> Result<Vec<(i64, LabelRange)>> {
        let ranges = self.ranges()?;
        let mut out = Vec::with_capacity(src_indices.len());
        for (i, &src_idx) in src_indices.iter().enumerate() {
            let out_idx = out_start_idx.saturating_add(i as i64);
            let label = label_from_ranges(&ranges, src_idx).unwrap_or_else(|| LabelRange {
                style: LabelStyle::None,
                prefix: String::new(),
                start: out_idx.saturating_add(1),
            });
            out.push((out_idx, label));
        }
        Ok(out)
    }

    /// Install `entries` as the catalog's `/PageLabels`: a direct
    /// (non-indirect) `<< /Nums [...] >>` dictionary — never a balanced
    /// number tree — with each entry's label dictionary built in the same
    /// shape qpdf's `getLabelForPage` reconstruction uses (`/S` iff the style
    /// is not [`LabelStyle::None`], `/P` iff the prefix is non-empty, `/St`
    /// always present).
    ///
    /// This is the shape qpdf produces when reconstructing labels for a page
    /// subset or split (`QPDFJob::handlePageSpecs`, `QPDFJob::doSplitPages`):
    /// it always unconditionally replaces the catalog's `/PageLabels` with a
    /// freshly built flat array — never merging with, or preserving the
    /// shape of, any prior value. Pair with [`Self::labels_for_page_range`] /
    /// [`Self::label_for_page`], which produce the `entries` this expects.
    /// Contrast with [`Self::write_labels`], which instead rebuilds a
    /// balanced number tree (the shape used for directly authored ranges).
    ///
    /// A no-op when the document has no catalog, or the catalog is not a
    /// dictionary.
    ///
    /// # Errors
    ///
    /// Any error from [`Pdf::resolve`].
    pub fn write_reconstructed_labels(&mut self, entries: &[(i64, LabelRange)]) -> Result<()> {
        let Some(catalog_ref) = self.pdf.root_ref() else {
            return Ok(());
        };
        let Some(mut catalog) = self.pdf.resolve_borrowed(catalog_ref)?.as_dict().cloned() else {
            return Ok(());
        };
        let mut nums = Vec::with_capacity(entries.len() * 2);
        for (idx, range) in entries {
            nums.push(Object::Integer(*idx));
            nums.push(Object::Dictionary(range.to_reconstructed_dict()));
        }
        let mut page_labels = Dictionary::new();
        page_labels.insert("Nums", Object::Array(nums));
        catalog.insert("PageLabels", Object::Dictionary(page_labels));
        self.pdf
            .set_object(catalog_ref, Object::Dictionary(catalog));
        Ok(())
    }

    /// Collect the raw `(index, value Object)` entries of the `/PageLabels` tree
    /// verbatim (values un-decoded), for rebuild.
    fn raw_entries(&mut self) -> Result<Vec<(i64, Object)>> {
        let Some(root) = self.pagelabels_root()? else {
            return Ok(vec![]);
        };
        crate::name_number_tree::read_number_tree(
            self.pdf,
            root,
            |_, v| Ok(Some(v)),
            DEFAULT_MAX_TREE_DEPTH,
        )
    }

    /// Insert or replace the label range whose first page index is
    /// `first_page_idx`. Rebuilds the `/Nums` tree and points the catalog
    /// `/PageLabels` at the new (indirect) root.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded while reading the existing tree.
    /// - Any error from [`Pdf::resolve`].
    pub fn set_range(&mut self, first_page_idx: i64, range: LabelRange) -> Result<()> {
        let mut entries = self.raw_entries()?;
        let value = Object::Dictionary(range.to_dict());
        match entries.iter_mut().find(|(k, _)| *k == first_page_idx) {
            Some(e) => e.1 = value,
            None => {
                entries.push((first_page_idx, value));
                entries.sort_by_key(|(k, _)| *k);
            }
        }
        self.rebuild(entries)
    }

    /// Remove the label range whose first page index is `first_page_idx`.
    /// Returns `false` if no such range exists. When the last range is removed,
    /// `/PageLabels` is dropped from the catalog.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded while reading the existing tree.
    /// - Any error from [`Pdf::resolve`].
    pub fn remove_range(&mut self, first_page_idx: i64) -> Result<bool> {
        let mut entries = self.raw_entries()?;
        let before = entries.len();
        entries.retain(|(k, _)| *k != first_page_idx);
        if entries.len() == before {
            return Ok(false);
        }
        self.rebuild(entries)?;
        Ok(true)
    }

    /// Replace the entire `/PageLabels` tree with `ranges` — `(first_page_idx,
    /// LabelRange)` pairs, ascending by index (the same shape [`Self::ranges`]
    /// returns). An empty slice removes `/PageLabels` from the catalog
    /// entirely.
    ///
    /// This is the bulk counterpart to [`Self::set_range`]/[`Self::remove_range`]:
    /// where those mutate one entry of the existing tree, `write_labels`
    /// discards whatever the tree currently holds and rebuilds it from the
    /// given list (rebalanced through [`crate::name_number_tree::build_number_tree`],
    /// same leaf-chunking rule as every other tree in this crate).
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] if any range's `/St` (`start`) is
    ///   non-positive, or if any `first_page_idx` is negative — ISO 32000-2
    ///   §7.9.7 defines `/St` as a starting page number (`>= 1`), and a page
    ///   index cannot be negative.
    /// - Any error from [`Pdf::resolve`].
    pub fn write_labels(&mut self, ranges: &[(i64, LabelRange)]) -> Result<()> {
        for (idx, range) in ranges {
            if *idx < 0 {
                return Err(Error::Unsupported(format!(
                    "page label first_page_idx must be >= 0, got {idx}"
                )));
            }
            if range.start < 1 {
                return Err(Error::Unsupported(format!(
                    "page label /St must be >= 1, got {}",
                    range.start
                )));
            }
        }
        let mut entries: Vec<(i64, Object)> = ranges
            .iter()
            .map(|(idx, range)| (*idx, Object::Dictionary(range.to_dict())))
            .collect();
        // build_number_tree requires pre-sorted UNIQUE input; callers
        // (merge_adjacent_ranges, shifted insert/remove lists) already preserve
        // ascending order and normally uniqueness, but this is a public entry
        // point, so sort defensively and dedup by key. ISO 32000-1 §7.9.7
        // requires number-tree keys to be unique; a duplicate would produce
        // a malformed PDF.
        entries.sort_by_key(|(idx, _)| *idx);
        entries.dedup_by(|a, b| a.0 == b.0);
        self.rebuild(entries)
    }

    /// Shift every label range at or after `at` forward by `count`, modeling
    /// `count` pages inserted at 0-based position `at`. Ranges before `at` are
    /// left untouched, so pages inserted in the middle of an existing range's
    /// span inherit that range's numbering (no new explicit entry is needed).
    /// [`merge_adjacent_ranges`] then folds away a shifted range that the
    /// insertion happened to turn into a redundant continuation of its
    /// predecessor (an intentional gap of exactly `count` pages closes up).
    ///
    /// A no-op when `count == 0` or when the document has no `/PageLabels`
    /// (this never fabricates a tree where none existed).
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded while reading the existing tree.
    /// - Any error from [`Pdf::resolve`].
    pub fn insert_pages(&mut self, at: usize, count: usize) -> Result<()> {
        if count == 0 {
            return Ok(());
        }
        let ranges = self.ranges()?;
        if ranges.is_empty() {
            return Ok(());
        }
        let at = i64::try_from(at)
            .map_err(|_| Error::Unsupported(format!("insert_pages: at={} exceeds i64::MAX", at)))?;
        let count = i64::try_from(count).map_err(|_| {
            Error::Unsupported(format!("insert_pages: count={} exceeds i64::MAX", count))
        })?;

        // Compute the label that old source page `at` was showing — the
        // first surviving page (which will end up at output index `at +
        // count`) has to keep that label. Without this, an insertion inside
        // an existing range (or inside the default-decimal prefix) shifts
        // the effective numbering: `insert_pages(2, 1)` on a single decimal
        // range at 0 makes old page 2 (previously "3") render as "4"
        // instead of "3"; the same happens in the default prefix when
        // no explicit range covers `at`.
        let mut effective_at: Option<&(i64, LabelRange)> = None;
        for entry in &ranges {
            if entry.0 <= at {
                effective_at = Some(entry);
            } else {
                break;
            }
        }
        let preservation_label = match effective_at {
            Some((first, r)) => LabelRange {
                style: r.style,
                prefix: r.prefix.clone(),
                start: r.start.saturating_add(at.saturating_sub(*first)),
            },
            // Default-decimal prefix before the first explicit range: old
            // source page `at` was rendering as decimal `at + 1`.
            None => LabelRange {
                style: LabelStyle::Decimal,
                prefix: String::new(),
                start: at.saturating_add(1),
            },
        };

        let mut result: Vec<(i64, LabelRange)> = ranges
            .into_iter()
            .map(|(idx, range)| {
                if idx >= at {
                    (idx.saturating_add(count), range)
                } else {
                    (idx, range)
                }
            })
            .collect();
        // Insert the preservation range at `at + count` so surviving pages
        // keep their original labels. merge_adjacent_ranges below folds it
        // away when it is redundant with a predecessor.
        result.push((at.saturating_add(count), preservation_label));
        result.sort_by_key(|(idx, _)| *idx);

        // Shifting + preservation may leave neighbours that are structurally
        // equivalent (e.g. the preservation range equals a shifted first
        // range's continuation); fold them away like `remove_pages` does.
        let merged = merge_adjacent_ranges(result);
        self.write_labels(&merged)
    }

    /// Update label ranges for `count` pages removed at 0-based position
    /// `at`, modeling the effect of deleting document pages `at..at+count`.
    ///
    /// Ranges entirely before `at` are kept verbatim. Ranges from `at+count`
    /// onward are recomputed with [`Self::labels_for_page_range`] (the same
    /// renumbering qpdf's `getLabelsForPageRange` performs for page
    /// extraction/merging), so a range whose span is partially consumed by
    /// the removal gets a fresh `/St` reflecting the pages actually lost, and
    /// a range whose entire span falls inside `at..at+count` disappears.
    /// [`merge_adjacent_ranges`] then collapses a trailing entry that turns
    /// out to be redundant with its new predecessor (the common case when the
    /// removed pages sat inside a single, otherwise-uninterrupted range).
    ///
    /// This helper does not know the document's total page count, so
    /// removing pages up to (or past) the end of the labeled range can
    /// still produce a trailing entry describing pages that no longer
    /// exist — e.g. `remove_pages(4, 1)` on a 5-page document writes an
    /// explicit range at output index 4 even though the output has only
    /// pages 0..3. That entry is inert for lookups
    /// ([`Self::label_for_page`] never queries past the caller's page
    /// count) but the on-disk `/PageLabels` tree carries a stale key.
    /// Callers who care about a clean tree at output time should call
    /// [`Self::write_labels`] afterwards with the trimmed range list.
    ///
    /// A no-op when `count == 0` or when the document has no `/PageLabels`.
    ///
    /// # Errors
    ///
    /// - [`crate::Error::Unsupported`] when the number-tree depth limit is
    ///   exceeded while reading the existing tree.
    /// - Any error from [`Pdf::resolve`].
    pub fn remove_pages(&mut self, at: usize, count: usize) -> Result<()> {
        if count == 0 {
            return Ok(());
        }
        let ranges = self.ranges()?;
        if ranges.is_empty() {
            return Ok(());
        }
        let at = i64::try_from(at)
            .map_err(|_| Error::Unsupported(format!("remove_pages: at={} exceeds i64::MAX", at)))?;
        let count = i64::try_from(count).map_err(|_| {
            Error::Unsupported(format!("remove_pages: count={} exceeds i64::MAX", count))
        })?;
        let removed_end = at.saturating_add(count);

        // Everything before `at` is unchanged.
        let mut result: Vec<(i64, LabelRange)> = ranges
            .iter()
            .filter(|(idx, _)| *idx < at)
            .cloned()
            .collect();

        // Fabricate the tail's first-label entry from the range effective at
        // `removed_end` (or a LabelStyle::None default if no range applies) —
        // both use `at` as the new base index in the output. This mirrors what
        // the previous `labels_for_page_range` call did, but reuses `ranges`
        // already in scope: O(N) in-memory pass instead of an O(M × N) tree
        // re-parse per surviving explicit index.
        let mut effective_at_removed_end: Option<&(i64, LabelRange)> = None;
        for entry in &ranges {
            if entry.0 <= removed_end {
                effective_at_removed_end = Some(entry);
            } else {
                break;
            }
        }
        let tail_first_label = match effective_at_removed_end {
            Some((first, r)) => {
                let offset = removed_end.saturating_sub(*first);
                LabelRange {
                    style: r.style,
                    prefix: r.prefix.clone(),
                    start: r.start.saturating_add(offset),
                }
            }
            // No explicit range covers `removed_end`: those pages were
            // showing the PDF default label sequence (decimal starting at
            // 1). After removal the page at output index `at` was previously
            // source page `removed_end`, whose default label was
            // `removed_end + 1`; preserve that decimal sequence rather than
            // fabricating a LabelStyle::None entry that would render every
            // surviving page's label as an empty string.
            None => LabelRange {
                style: LabelStyle::Decimal,
                prefix: String::new(),
                start: removed_end.saturating_add(1),
            },
        };
        result.push((at, tail_first_label));

        // Every explicit entry past `removed_end` survives, shifted left by
        // `count` so its output index accounts for the removed span.
        let idx_offset = at.saturating_sub(removed_end);
        for (idx, range) in &ranges {
            if *idx > removed_end {
                result.push((idx.saturating_add(idx_offset), range.clone()));
            }
        }

        let merged = merge_adjacent_ranges(result);
        self.write_labels(&merged)
    }

    /// Rebuild `/PageLabels` from sorted entries and patch the catalog. Empty
    /// entries → remove `/PageLabels`.
    fn rebuild(&mut self, entries: Vec<(i64, Object)>) -> Result<()> {
        let Some(catalog_ref) = self.pdf.root_ref() else {
            return Ok(());
        };
        let Some(mut catalog) = self.pdf.resolve_borrowed(catalog_ref)?.as_dict().cloned() else {
            return Ok(());
        };

        if entries.is_empty() {
            catalog.remove("PageLabels");
            self.pdf
                .set_object(catalog_ref, Object::Dictionary(catalog));
            return Ok(());
        }

        let mut next_num: u32 = self
            .pdf
            .object_refs()
            .iter()
            .map(|r| r.number)
            .max()
            .unwrap_or(0);
        let mut alloc = move || -> ObjectRef {
            next_num += 1;
            ObjectRef::new(next_num, 0)
        };

        let (root_ref, nodes) = crate::name_number_tree::build_number_tree(&entries, &mut alloc);
        for (r, node) in nodes {
            self.pdf.set_object(r, node);
        }
        catalog.insert("PageLabels", Object::Reference(root_ref));
        self.pdf
            .set_object(catalog_ref, Object::Dictionary(catalog));
        Ok(())
    }
}

/// Extension constructor mirroring [`Pdf::acroform`].
impl<R: Read + Seek> Pdf<R> {
    /// Return a high-level page-label helper for this document.
    pub fn page_labels(&mut self) -> PageLabelDocumentHelper<'_, R> {
        PageLabelDocumentHelper::new(self)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use std::io::Cursor;

    /// A minimal one-page PDF with no `/PageLabels` key at all (as opposed to
    /// [`pdf_with_pagelabels`], whose catalog always carries `/PageLabels`,
    /// even when `/Nums` is empty).
    fn bare_one_page_pdf() -> Pdf<Cursor<Vec<u8>>> {
        let mut bytes = Vec::new();
        bytes.extend_from_slice(b"%PDF-1.7\n");
        let off1 = bytes.len() as u64;
        bytes.extend_from_slice(b"1 0 obj\n<< /Type /Catalog /Pages 2 0 R >>\nendobj\n");
        let off2 = bytes.len() as u64;
        bytes.extend_from_slice(b"2 0 obj\n<< /Type /Pages /Kids [3 0 R] /Count 1 >>\nendobj\n");
        let off3 = bytes.len() as u64;
        bytes.extend_from_slice(
            b"3 0 obj\n<< /Type /Page /Parent 2 0 R /MediaBox [0 0 612 792] >>\nendobj\n",
        );
        let xref = bytes.len() as u64;
        bytes.extend_from_slice(
            format!(
                "xref\n0 4\n0000000000 65535 f \n{off1:010} 00000 n \n{off2:010} 00000 n \n{off3:010} 00000 n \ntrailer\n<< /Size 4 /Root 1 0 R >>\nstartxref\n{xref}\n%%EOF\n"
            )
            .as_bytes(),
        );
        Pdf::open(Cursor::new(bytes)).expect("open")
    }

    fn pdf_with_pagelabels(nums: Vec<Object>) -> Pdf<Cursor<Vec<u8>>> {
        // Minimal one-page PDF; then attach an inline /PageLabels leaf via set_object.
        let mut pdf = bare_one_page_pdf();
        // /PageLabels root leaf at obj 10, catalog points to it.
        let pl_ref = ObjectRef::new(10, 0);
        let mut leaf = Dictionary::new();
        leaf.insert("Nums", Object::Array(nums));
        pdf.set_object(pl_ref, Object::Dictionary(leaf));
        let catalog_ref = pdf.root_ref().unwrap();
        let mut catalog = pdf
            .resolve_borrowed(catalog_ref)
            .unwrap()
            .as_dict()
            .unwrap()
            .clone();
        catalog.insert("PageLabels", Object::Reference(pl_ref));
        pdf.set_object(catalog_ref, Object::Dictionary(catalog));
        pdf
    }

    fn label_dict(style: &str, st: Option<i64>, prefix: Option<&str>) -> Object {
        let mut d = Dictionary::new();
        d.insert("S", Object::Name(style.into()));
        if let Some(s) = st {
            d.insert("St", Object::Integer(s));
        }
        if let Some(p) = prefix {
            d.insert("P", Object::String(p.as_bytes().to_vec()));
        }
        Object::Dictionary(d)
    }

    #[test]
    fn label_string_multi_range_matches_spec() {
        // /Nums [0 <</S /r>> 3 <</S /D /St 1>> 6 <</S /D /P "A-" /St 1>>]
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("r", None, None),
            Object::Integer(3),
            label_dict("D", Some(1), None),
            Object::Integer(6),
            label_dict("D", Some(1), Some("A-")),
        ]);
        let mut h = pdf.page_labels();
        assert!(h.has_page_labels().unwrap());
        assert_eq!(h.label_string_for_page(0).unwrap(), "i");
        assert_eq!(h.label_string_for_page(1).unwrap(), "ii");
        assert_eq!(h.label_string_for_page(2).unwrap(), "iii");
        assert_eq!(h.label_string_for_page(3).unwrap(), "1");
        assert_eq!(h.label_string_for_page(5).unwrap(), "3");
        assert_eq!(h.label_string_for_page(6).unwrap(), "A-1");
        assert_eq!(h.label_string_for_page(8).unwrap(), "A-3");
    }

    #[test]
    fn label_for_page_offsets_start() {
        let mut pdf =
            pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(10), None)]);
        let mut h = pdf.page_labels();
        let lab = h.label_for_page(2).unwrap().expect("range applies");
        assert_eq!(lab.start, 12, "/St 10 + offset 2");
        assert_eq!(lab.style, LabelStyle::Decimal);
    }

    #[test]
    fn no_pagelabels_defaults_to_decimal() {
        let mut pdf = pdf_with_pagelabels(vec![]); // empty /Nums -> ranges empty
        let mut h = pdf.page_labels();
        assert_eq!(h.label_string_for_page(0).unwrap(), "1");
        assert_eq!(h.label_string_for_page(4).unwrap(), "5");
        assert!(h.label_for_page(0).unwrap().is_none());
    }

    #[test]
    fn page_before_first_range_defaults_to_decimal() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(3), label_dict("R", Some(1), None)]);
        let mut h = pdf.page_labels();
        assert_eq!(
            h.label_string_for_page(0).unwrap(),
            "1",
            "page before first range"
        );
        assert_eq!(h.label_string_for_page(3).unwrap(), "I");
    }

    #[test]
    fn labels_for_page_range_renumbers_and_copies_explicit() {
        // ranges at 0 (roman) and 5 (decimal). Extract pages 3..=6 to new_start 0.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("r", Some(1), None),
            Object::Integer(5),
            label_dict("D", Some(1), None),
        ]);
        let mut h = pdf.page_labels();
        let out = h.labels_for_page_range(3, 6, 0).unwrap();
        // First page (idx 3) is in the roman range with offset 3 -> start 4.
        assert_eq!(out[0].0, 0);
        assert_eq!(out[0].1.style, LabelStyle::RomanLower);
        assert_eq!(out[0].1.start, 4);
        // Page 5 has an explicit entry -> copied, renumbered to new index 2.
        assert!(out
            .iter()
            .any(|(idx, r)| *idx == 2 && r.style == LabelStyle::Decimal));
    }

    #[test]
    fn set_range_inserts_and_round_trips() {
        let mut pdf = pdf_with_pagelabels(vec![]); // start with empty /PageLabels root
        {
            let mut h = pdf.page_labels();
            h.set_range(
                0,
                LabelRange {
                    style: LabelStyle::RomanLower,
                    prefix: String::new(),
                    start: 1,
                },
            )
            .unwrap();
            h.set_range(
                3,
                LabelRange {
                    style: LabelStyle::Decimal,
                    prefix: "A-".into(),
                    start: 1,
                },
            )
            .unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges.len(), 2);
        assert_eq!(ranges[0].0, 0);
        assert_eq!(ranges[0].1.style, LabelStyle::RomanLower);
        assert_eq!(ranges[1].0, 3);
        assert_eq!(ranges[1].1.prefix, "A-");
        assert_eq!(h.label_string_for_page(4).unwrap(), "A-2");
    }

    #[test]
    fn set_range_replaces_existing_index() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.set_range(
                0,
                LabelRange {
                    style: LabelStyle::RomanUpper,
                    prefix: String::new(),
                    start: 1,
                },
            )
            .unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges.len(), 1);
        assert_eq!(ranges[0].1.style, LabelStyle::RomanUpper);
    }

    #[test]
    fn remove_range_drops_entry_and_pagelabels_when_empty() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            assert!(h.remove_range(0).unwrap());
            assert!(!h.remove_range(99).unwrap(), "absent index => false");
        }
        let mut h = pdf.page_labels();
        assert!(
            !h.has_page_labels().unwrap(),
            "/PageLabels dropped when empty"
        );
        assert_eq!(
            h.label_string_for_page(0).unwrap(),
            "1",
            "defaults after removal"
        );
    }

    #[test]
    fn roman_matches_spec() {
        assert_eq!(to_roman(1, true), "I");
        assert_eq!(to_roman(4, true), "IV");
        assert_eq!(to_roman(9, false), "ix");
        assert_eq!(to_roman(40, true), "XL");
        assert_eq!(to_roman(90, false), "xc");
        assert_eq!(to_roman(400, true), "CD");
        assert_eq!(to_roman(900, true), "CM");
        assert_eq!(to_roman(3888, true), "MMMDCCCLXXXVIII");
        assert_eq!(to_roman(0, true), "");
        assert_eq!(to_roman(-3, false), "");
    }

    #[test]
    fn formatters_cap_huge_values() {
        // DoS guard: at the cap the formatters still render; above it (incl.
        // i64::MAX) they return empty instead of spinning/allocating unboundedly.
        assert!(!to_roman(MAX_RENDERABLE_LABEL_VALUE, true).is_empty());
        assert_eq!(to_roman(MAX_RENDERABLE_LABEL_VALUE + 1, true), "");
        assert_eq!(to_roman(i64::MAX, true), "");
        assert!(!to_alpha(MAX_RENDERABLE_LABEL_VALUE, true).is_empty());
        assert_eq!(to_alpha(MAX_RENDERABLE_LABEL_VALUE + 1, true), "");
        assert_eq!(to_alpha(i64::MAX, true), "");
    }

    #[test]
    fn alpha_repeating_letters() {
        assert_eq!(to_alpha(1, true), "A");
        assert_eq!(to_alpha(26, true), "Z");
        assert_eq!(to_alpha(27, true), "AA");
        assert_eq!(to_alpha(52, false), "zz");
        assert_eq!(to_alpha(53, true), "AAA");
        assert_eq!(to_alpha(0, true), "");
    }

    #[test]
    fn label_range_format_prefix_and_styles() {
        let d = LabelRange {
            style: LabelStyle::Decimal,
            prefix: "A-".into(),
            start: 1,
        };
        assert_eq!(d.format(5), "A-5");
        let r = LabelRange {
            style: LabelStyle::RomanLower,
            prefix: String::new(),
            start: 1,
        };
        assert_eq!(r.format(3), "iii");
        let none = LabelRange {
            style: LabelStyle::None,
            prefix: "Cover".into(),
            start: 1,
        };
        assert_eq!(
            none.format(9),
            "Cover",
            "None style => prefix only, no number"
        );
    }

    #[test]
    fn label_range_dict_round_trip() {
        let r = LabelRange {
            style: LabelStyle::RomanUpper,
            prefix: "App-".into(),
            start: 5,
        };
        let dict = r.to_dict();
        assert_eq!(dict.get("S"), Some(&Object::Name("R".into())));
        assert_eq!(dict.get("St"), Some(&Object::Integer(5)));
        assert_eq!(LabelRange::from_dict(&dict), r);
        // Defaults omitted: St=1 and empty prefix and None style produce empty dict.
        let bare = LabelRange {
            style: LabelStyle::None,
            prefix: String::new(),
            start: 1,
        };
        assert!(
            bare.to_dict().iter().next().is_none(),
            "all-default range => empty dict"
        );
    }

    #[test]
    fn ranges_resolves_indirect_inner_st() {
        let mut pdf = pdf_with_pagelabels(vec![]); // empty root; we set a custom tree below
                                                   // Put an indirect /St value: label dict {/S /D /St 11 0 R}, 11 0 obj = Integer(7).
        let st_ref = ObjectRef::new(11, 0);
        pdf.set_object(st_ref, Object::Integer(7));
        let mut label = Dictionary::new();
        label.insert("S", Object::Name("D".into()));
        label.insert("St", Object::Reference(st_ref));
        let pl_ref = ObjectRef::new(10, 0);
        let mut leaf = Dictionary::new();
        leaf.insert(
            "Nums",
            Object::Array(vec![Object::Integer(0), Object::Dictionary(label)]),
        );
        pdf.set_object(pl_ref, Object::Dictionary(leaf));
        // catalog already points /PageLabels -> 10 0 R from pdf_with_pagelabels.
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges.len(), 1);
        assert_eq!(ranges[0].1.start, 7, "indirect /St must be resolved");
    }

    #[test]
    fn set_range_round_trips_multi_leaf_tree() {
        let mut pdf = pdf_with_pagelabels(vec![]);
        {
            let mut h = pdf.page_labels();
            for i in 0..40i64 {
                h.set_range(
                    i * 2,
                    LabelRange {
                        style: LabelStyle::Decimal,
                        prefix: String::new(),
                        start: 1,
                    },
                )
                .unwrap();
            }
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(
            ranges.len(),
            40,
            "all 40 ranges survive the multi-leaf tree"
        );
        // Spot-check ordering + a mid entry.
        assert_eq!(ranges[0].0, 0);
        assert_eq!(ranges[39].0, 78);
        assert!(ranges.windows(2).all(|w| w[0].0 < w[1].0), "ascending");
    }

    #[test]
    fn label_style_name_round_trip_all_variants() {
        for (bytes, style, name) in [
            (b"D".as_ref(), LabelStyle::Decimal, Some("D")),
            (b"R".as_ref(), LabelStyle::RomanUpper, Some("R")),
            (b"r".as_ref(), LabelStyle::RomanLower, Some("r")),
            (b"A".as_ref(), LabelStyle::AlphaUpper, Some("A")),
            (b"a".as_ref(), LabelStyle::AlphaLower, Some("a")),
        ] {
            assert_eq!(LabelStyle::from_name(bytes), style);
            assert_eq!(style.to_name(), name);
        }
        // Unrecognised /S name -> None (from_name `_` arm); None has no name.
        assert_eq!(LabelStyle::from_name(b"Z"), LabelStyle::None);
        assert_eq!(LabelStyle::None.to_name(), None);
    }

    #[test]
    fn format_alpha_styles() {
        let up = LabelRange {
            style: LabelStyle::AlphaUpper,
            prefix: String::new(),
            start: 1,
        };
        assert_eq!(up.format(27), "AA");
        let lo = LabelRange {
            style: LabelStyle::AlphaLower,
            prefix: "x".into(),
            start: 1,
        };
        assert_eq!(lo.format(2), "xb");
    }

    #[test]
    fn from_dict_non_name_style_is_none() {
        let mut d = Dictionary::new();
        d.insert("S", Object::Integer(0)); // /S not a Name -> LabelStyle::None
        assert_eq!(LabelRange::from_dict(&d).style, LabelStyle::None);
    }

    /// Non-ASCII prefix must survive a to_dict → from_dict round trip. Emitting
    /// the raw UTF-8 bytes verbatim (as this code originally did) would be
    /// misread by PDFDocEncoding readers — a source `§` (`c2 a7`) came back
    /// as `§`. UTF-16BE with BOM survives both interpretations.
    #[test]
    fn to_dict_non_ascii_prefix_round_trips_through_pdf_text_string() {
        let r = LabelRange {
            style: LabelStyle::Decimal,
            prefix: "§ Foo—Bar".into(),
            start: 1,
        };
        let d = r.to_dict();
        let re_read = LabelRange::from_dict(&d);
        assert_eq!(re_read.prefix, r.prefix, "round-trip must preserve prefix");
        // The serialised /P must be UTF-16BE-with-BOM (starts with 0xFE 0xFF),
        // NOT raw UTF-8 (which for `§` would be 0xC2 0xA7).
        let Object::String(bytes) = d.get("P").expect("/P present") else {
            panic!("/P must be a string"); // cov:ignore: test-shape guard, unreachable given to_dict emits Object::String
        };
        assert_eq!(&bytes[..2], &[0xFE, 0xFF], "must have UTF-16BE BOM");
    }

    /// ASCII-only prefixes stay verbatim (avoiding a needless UTF-16BE
    /// re-encoding when ASCII is safe under both PDFDocEncoding and UTF-8).
    #[test]
    fn to_dict_ascii_prefix_stays_verbatim() {
        let r = LabelRange {
            style: LabelStyle::Decimal,
            prefix: "App-".into(),
            start: 1,
        };
        let d = r.to_dict();
        let Object::String(bytes) = d.get("P").expect("/P present") else {
            panic!("/P must be a string"); // cov:ignore: test-shape guard, unreachable given to_dict emits Object::String
        };
        assert_eq!(bytes, b"App-", "pure ASCII must stay verbatim");
    }

    #[test]
    fn ranges_handles_indirect_and_non_dict_values() {
        // entry 0: indirect ref to a label dict; entry 5: a non-dict value (skipped).
        let mut pdf = pdf_with_pagelabels(vec![]);
        let lab_ref = ObjectRef::new(20, 0);
        let mut lab = Dictionary::new();
        lab.insert("S", Object::Name("D".into()));
        pdf.set_object(lab_ref, Object::Dictionary(lab));
        let pl_ref = ObjectRef::new(10, 0);
        let mut leaf = Dictionary::new();
        leaf.insert(
            "Nums",
            Object::Array(vec![
                Object::Integer(0),
                Object::Reference(lab_ref), // indirect entry value -> resolve
                Object::Integer(5),
                Object::Integer(99), // non-dict entry value -> skipped
            ]),
        );
        pdf.set_object(pl_ref, Object::Dictionary(leaf));
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges.len(), 1, "non-dict value skipped");
        assert_eq!(ranges[0].0, 0);
        assert_eq!(ranges[0].1.style, LabelStyle::Decimal);
    }

    #[test]
    fn ranges_non_name_style_resolves_to_none() {
        // A label dict whose /S is not a Name resolves to LabelStyle::None via
        // the resolving reader path (from_dict_resolved).
        let mut pdf = pdf_with_pagelabels(vec![]);
        let pl_ref = ObjectRef::new(10, 0);
        let mut lab = Dictionary::new();
        lab.insert("S", Object::Integer(0)); // non-Name /S
        let mut leaf = Dictionary::new();
        leaf.insert(
            "Nums",
            Object::Array(vec![Object::Integer(0), Object::Dictionary(lab)]),
        );
        pdf.set_object(pl_ref, Object::Dictionary(leaf));
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges.len(), 1);
        assert_eq!(ranges[0].1.style, LabelStyle::None);
    }

    #[test]
    fn labels_for_page_range_fabricates_default_when_first_unlabeled() {
        // Only an explicit range at index 5; extract starting before it (idx 0).
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(5), label_dict("D", Some(1), None)]);
        let mut h = pdf.page_labels();
        let out = h.labels_for_page_range(0, 6, 0).unwrap();
        // First entry fabricated: no /S (LabelStyle::None), start = new_start(0) + 1 = 1.
        // Matches qpdf 11.9.0's own fabricated dict (`getLabelForPage` returning
        // null): `<< /St 1 >>`, no `/S /D`.
        assert_eq!(out[0].0, 0);
        assert_eq!(out[0].1.style, LabelStyle::None);
        assert_eq!(out[0].1.start, 1);
        // The explicit range at 5 is copied (renumbered to 5).
        assert!(out.iter().any(|(idx, _)| *idx == 5));
    }

    #[test]
    fn labels_for_page_range_single_page_span_does_not_panic() {
        // start_idx == end_idx (a single-page span, the common case for
        // --split-pages=1 or a chunk's last page) must not panic: the
        // internal `explicit.range((start_idx+1)..=end_idx)` bound would
        // otherwise be inverted, which `BTreeSet::range` panics on.
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        let mut h = pdf.page_labels();
        let out = h.labels_for_page_range(4, 4, 0).unwrap();
        assert_eq!(out, vec![(0, dec(5))], "St 1 + offset 4 = 5");
    }

    #[test]
    fn helper_tolerates_non_dict_catalog() {
        let mut pdf = pdf_with_pagelabels(vec![]);
        let catalog_ref = pdf.root_ref().unwrap();
        pdf.set_object(catalog_ref, Object::Integer(0)); // catalog no longer a dict
        let mut h = pdf.page_labels();
        assert!(
            !h.has_page_labels().unwrap(),
            "non-dict catalog => no labels"
        );
        assert_eq!(h.ranges().unwrap(), vec![]);
        // rebuild path bails out gracefully when the catalog is not a dict.
        h.set_range(
            0,
            LabelRange {
                style: LabelStyle::Decimal,
                prefix: String::new(),
                start: 1,
            },
        )
        .unwrap();
    }

    #[test]
    fn helper_tolerates_missing_root() {
        // A trailer without /Root makes root_ref() return None; the helper must
        // degrade gracefully (no labels, rebuild is a no-op).
        let mut bytes = Vec::new();
        bytes.extend_from_slice(b"%PDF-1.7\n");
        let off1 = bytes.len() as u64;
        bytes.extend_from_slice(b"1 0 obj\n<< /Type /Catalog >>\nendobj\n");
        let xref = bytes.len() as u64;
        bytes.extend_from_slice(
            format!(
                "xref\n0 2\n0000000000 65535 f \n{off1:010} 00000 n \ntrailer\n<< /Size 2 >>\nstartxref\n{xref}\n%%EOF\n"
            )
            .as_bytes(),
        );
        let mut pdf = Pdf::open(Cursor::new(bytes)).expect("rootless trailer still opens");
        assert!(pdf.root_ref().is_none(), "rootless trailer => no root_ref");
        let mut h = pdf.page_labels();
        assert!(!h.has_page_labels().unwrap());
        assert_eq!(h.ranges().unwrap(), vec![]);
        h.set_range(
            0,
            LabelRange {
                style: LabelStyle::Decimal,
                prefix: String::new(),
                start: 1,
            },
        )
        .unwrap();
    }

    /// Shorthand for a plain decimal range starting at `start`, no prefix.
    fn dec(start: i64) -> LabelRange {
        LabelRange {
            style: LabelStyle::Decimal,
            prefix: String::new(),
            start,
        }
    }

    /// Shorthand for a style-less range (no `/S`), no prefix, starting at
    /// `start` — the shape of qpdf's fabricated "unlabeled page" default.
    fn none_range(start: i64) -> LabelRange {
        LabelRange {
            style: LabelStyle::None,
            prefix: String::new(),
            start,
        }
    }

    // ── write_labels ──────────────────────────────────────────────────────

    #[test]
    fn write_labels_round_trips_multi_style_ranges() {
        let mut pdf = pdf_with_pagelabels(vec![]); // start with no /PageLabels
        let ranges = vec![
            (
                0,
                LabelRange {
                    style: LabelStyle::RomanLower,
                    prefix: String::new(),
                    start: 1,
                },
            ),
            (
                3,
                LabelRange {
                    style: LabelStyle::Decimal,
                    prefix: "A-".into(),
                    start: 1,
                },
            ),
            (
                7,
                LabelRange {
                    style: LabelStyle::AlphaUpper,
                    prefix: String::new(),
                    start: 1,
                },
            ),
        ];
        {
            let mut h = pdf.page_labels();
            h.write_labels(&ranges).unwrap();
        }
        let mut h = pdf.page_labels();
        assert_eq!(h.ranges().unwrap(), ranges);
    }

    #[test]
    fn write_labels_empty_removes_pagelabels() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.write_labels(&[]).unwrap();
        }
        let mut h = pdf.page_labels();
        assert!(
            !h.has_page_labels().unwrap(),
            "/PageLabels removed by an empty write_labels"
        );
    }

    #[test]
    fn write_labels_rejects_negative_start() {
        let mut pdf = bare_one_page_pdf();
        let mut h = pdf.page_labels();
        let err = h
            .write_labels(&[(0, dec(-1))])
            .expect_err("/St < 1 must be rejected");
        assert!(matches!(err, Error::Unsupported(_)));
        assert!(
            !h.has_page_labels().unwrap(),
            "rejected write must not partially apply"
        );
    }

    #[test]
    fn write_labels_rejects_negative_index() {
        let mut pdf = bare_one_page_pdf();
        let mut h = pdf.page_labels();
        let err = h
            .write_labels(&[(-1, dec(1))])
            .expect_err("negative first_page_idx must be rejected");
        assert!(matches!(err, Error::Unsupported(_)));
    }

    // ── write_reconstructed_labels / to_reconstructed_dict ────────────────

    #[test]
    fn to_reconstructed_dict_always_includes_st() {
        // Unlike to_dict, /St is present even at the default value 1 — qpdf's
        // getLabelForPage-reconstructed dicts always carry an explicit /St.
        let bare = LabelRange {
            style: LabelStyle::None,
            prefix: String::new(),
            start: 1,
        };
        let dict = bare.to_reconstructed_dict();
        assert_eq!(dict.get("St"), Some(&Object::Integer(1)));
        assert_eq!(dict.get("S"), None, "None style => no /S key");
        assert_eq!(dict.get("P"), None, "empty prefix => no /P key");

        let full = LabelRange {
            style: LabelStyle::Decimal,
            prefix: "A-".into(),
            start: 5,
        };
        let dict2 = full.to_reconstructed_dict();
        assert_eq!(dict2.get("S"), Some(&Object::Name("D".into())));
        assert_eq!(dict2.get("P"), Some(&Object::String(b"A-".to_vec())));
        assert_eq!(dict2.get("St"), Some(&Object::Integer(5)));
    }

    #[test]
    fn write_reconstructed_labels_installs_direct_nums_dict() {
        // Installed as a direct dict — not an indirect number tree — and
        // every entry's /St is explicit (qpdf --split-pages/--pages parity).
        let mut pdf = bare_one_page_pdf();
        {
            let mut h = pdf.page_labels();
            h.write_reconstructed_labels(&[
                (0, none_range(1)),
                (
                    3,
                    LabelRange {
                        style: LabelStyle::Decimal,
                        prefix: String::new(),
                        start: 1,
                    },
                ),
            ])
            .unwrap();
        }
        let catalog_ref = pdf.root_ref().unwrap();
        let catalog = pdf
            .resolve_borrowed(catalog_ref)
            .unwrap()
            .as_dict()
            .unwrap()
            .clone();
        let Some(Object::Dictionary(page_labels)) = catalog.get("PageLabels") else {
            panic!("/PageLabels must be a direct dictionary, got {catalog:?}"); // cov:ignore: defensive — write_reconstructed_labels always installs a direct dict
        };
        let Some(Object::Array(nums)) = page_labels.get("Nums") else {
            panic!("/Nums must be a direct array"); // cov:ignore: defensive — write_reconstructed_labels always installs a direct array
        };
        assert_eq!(nums.len(), 4, "2 entries * (index, dict)");
        assert_eq!(nums[0], Object::Integer(0));
        assert_eq!(
            nums[1],
            Object::Dictionary({
                let mut d = Dictionary::new();
                d.insert("St", Object::Integer(1));
                d
            }),
            "no /S for a None-style fabricated entry"
        );
        assert_eq!(nums[2], Object::Integer(3));
        assert_eq!(
            nums[3],
            Object::Dictionary({
                let mut d = Dictionary::new();
                d.insert("S", Object::Name("D".into()));
                d.insert("St", Object::Integer(1));
                d
            }),
            "/St 1 stays explicit, unlike to_dict"
        );

        // The high-level reader round-trips the installed entries too.
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges.len(), 2);
        assert_eq!(ranges[0].0, 0);
        assert_eq!(ranges[1].0, 3);
    }

    #[test]
    fn write_reconstructed_labels_replaces_existing_indirect_tree() {
        // A pre-existing indirect /PageLabels root is unconditionally replaced
        // by a fresh direct dict (qpdf never merges).
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("R", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.write_reconstructed_labels(&[(0, none_range(1))]).unwrap();
        }
        let catalog_ref = pdf.root_ref().unwrap();
        let catalog = pdf
            .resolve_borrowed(catalog_ref)
            .unwrap()
            .as_dict()
            .unwrap()
            .clone();
        assert!(
            matches!(catalog.get("PageLabels"), Some(Object::Dictionary(_))),
            "/PageLabels must now be a direct dict, not the old indirect ref"
        );
    }

    #[test]
    fn write_reconstructed_labels_noop_without_root() {
        // A trailer without /Root must degrade gracefully, matching the same
        // tolerant style as rebuild()/set_range() elsewhere in this file.
        let mut bytes = Vec::new();
        bytes.extend_from_slice(b"%PDF-1.7\n");
        let off1 = bytes.len() as u64;
        bytes.extend_from_slice(b"1 0 obj\n<< /Type /Catalog >>\nendobj\n");
        let xref = bytes.len() as u64;
        bytes.extend_from_slice(
            format!(
                "xref\n0 2\n0000000000 65535 f \n{off1:010} 00000 n \ntrailer\n<< /Size 2 >>\nstartxref\n{xref}\n%%EOF\n"
            )
            .as_bytes(),
        );
        let mut pdf = Pdf::open(Cursor::new(bytes)).expect("rootless trailer still opens");
        let mut h = pdf.page_labels();
        h.write_reconstructed_labels(&[(0, none_range(1))]).unwrap();
    }

    #[test]
    fn write_reconstructed_labels_noop_on_non_dict_catalog() {
        let mut pdf = bare_one_page_pdf();
        let catalog_ref = pdf.root_ref().unwrap();
        pdf.set_object(catalog_ref, Object::Integer(0)); // catalog no longer a dict
        let mut h = pdf.page_labels();
        h.write_reconstructed_labels(&[(0, none_range(1))]).unwrap();
    }

    // ── insert_pages ──────────────────────────────────────────────────────

    #[test]
    fn insert_pages_in_middle_shifts_only_ranges_at_or_after_it() {
        // Roman range at 0, decimal range at 5. Insert 2 pages at position 3,
        // inside the roman range's span.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("r", Some(1), None),
            Object::Integer(5),
            label_dict("D", Some(1), None),
        ]);
        {
            let mut h = pdf.page_labels();
            h.insert_pages(3, 2).unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        // Three ranges after insertion:
        //   0: original roman start 1 (inserted pages 3, 4 render iv, v)
        //   5: preservation roman start 4 (old page 3, now output page 5,
        //      keeps its original "iv" label instead of drifting to "vi")
        //   7: original decimal restart shifted from 5 by count
        assert_eq!(ranges.len(), 3, "got {ranges:?}");
        assert_eq!(ranges[0].0, 0);
        assert_eq!(ranges[1].0, 5);
        assert_eq!(ranges[1].1.start, 4, "old source page 3's roman position");
        assert_eq!(ranges[2].0, 7);
        // End-to-end: old page 3's label survives at its new position.
        assert_eq!(h.label_string_for_page(5).unwrap(), "iv");
    }

    #[test]
    fn insert_pages_at_beginning_shifts_first_range_and_leading_pages_default() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.insert_pages(0, 2).unwrap();
        }
        let mut h = pdf.page_labels();
        assert_eq!(h.ranges().unwrap(), vec![(2, dec(1))]);
        // The two newly-inserted leading pages precede any range, so they fall
        // back to the plain 1-based default rather than inheriting page 2's "1".
        assert_eq!(h.label_string_for_page(0).unwrap(), "1");
        assert_eq!(h.label_string_for_page(2).unwrap(), "1");
    }

    /// Cover the `None` arm of insert_pages's preservation-label match:
    /// when `at` sits BEFORE the first explicit range, no entry has
    /// `entry.0 <= at`, so `effective_at` stays None and the fabricated
    /// LabelStyle::Decimal-at-1 range at `at + count` runs.
    #[test]
    fn insert_pages_before_first_range_fabricates_decimal_preservation() {
        // First explicit range at index 5 (roman), leaving pages 0..4 with
        // the PDF default decimal sequence "1".."5".
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(5), label_dict("r", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            // Insert 2 pages at position 0 — inside the default prefix, no
            // explicit range covers `at = 0`.
            h.insert_pages(0, 2).unwrap();
        }
        let mut h = pdf.page_labels();
        // Old page 0 (previously "1") moves to output index 2 and must
        // still render as "1"; the fabricated Decimal-start-1 preservation
        // range at index 2 encodes that.
        assert_eq!(h.label_string_for_page(2).unwrap(), "1");
        // Old page 4 (previously "5") moves to output index 6, still "5".
        assert_eq!(h.label_string_for_page(6).unwrap(), "5");
        // Roman range shifted from 5 to 7.
        assert_eq!(h.label_string_for_page(7).unwrap(), "i");
    }

    #[test]
    fn insert_pages_preserves_old_page_labels_across_gap_close() {
        // (5, Decimal, start 8) is an intentional forward jump over
        // (0, Decimal, start 1) — numbers 6 and 7 are deliberately skipped.
        // Insert 2 pages at position 2. The pre-fix version dropped the
        // preservation range and merged everything into a single (0, dec 1)
        // sequence, breaking old page 2's original "3" → it showed "5"
        // instead after insertion. The correct behaviour keeps old pages'
        // labels stable: old page 2 stays "3" at its new position 4.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("D", Some(1), None),
            Object::Integer(5),
            label_dict("D", Some(8), None),
        ]);
        {
            let mut h = pdf.page_labels();
            h.insert_pages(2, 2).unwrap();
        }
        let mut h = pdf.page_labels();
        // Old page 2 (label "3") now sits at output page 4 and must still
        // render as "3", not drift to "5".
        assert_eq!(h.label_string_for_page(4).unwrap(), "3");
        // Old page 5 (the deliberate restart to "8") now sits at output
        // page 7 and must still render as "8".
        assert_eq!(h.label_string_for_page(7).unwrap(), "8");
    }

    #[test]
    fn insert_pages_after_last_range_leaves_entries_unchanged() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.insert_pages(10, 3).unwrap(); // append pages well past the only range
        }
        let mut h = pdf.page_labels();
        // Inserted pages 10-12 continue the decimal-1 sequence (labels
        // "11","12","13"); old page 10 moves to position 13 but its label
        // was already "11" under the (0, dec 1) range, so it must still
        // render as "11" — the preservation range at index 13 with start
        // 11 encodes this invariant even though it looks redundant to a
        // naïve reader.
        assert_eq!(h.label_string_for_page(13).unwrap(), "11");
        // Pages before the insertion point are untouched.
        assert_eq!(h.label_string_for_page(0).unwrap(), "1");
        assert_eq!(h.label_string_for_page(9).unwrap(), "10");
    }

    #[test]
    fn insert_pages_noop_on_empty_tree() {
        let mut pdf = bare_one_page_pdf();
        let mut h = pdf.page_labels();
        h.insert_pages(0, 5).unwrap();
        assert!(
            !h.has_page_labels().unwrap(),
            "insert_pages must not fabricate a tree where none existed"
        );
    }

    #[test]
    fn insert_pages_noop_when_count_zero() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.insert_pages(3, 0).unwrap();
        }
        let mut h = pdf.page_labels();
        assert_eq!(h.ranges().unwrap(), vec![(0, dec(1))]);
    }

    // ── remove_pages ──────────────────────────────────────────────────────

    #[test]
    fn remove_pages_partial_delete_leaves_gap_entry() {
        // A single range at 0 covers the whole document. Deleting page index 2
        // means the numbers that belonged to it are gone, so the surviving
        // pages after it need a fresh explicit entry (no silent renumbering).
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.remove_pages(2, 1).unwrap();
        }
        let mut h = pdf.page_labels();
        assert_eq!(h.ranges().unwrap(), vec![(0, dec(1)), (2, dec(4))]);
    }

    #[test]
    fn remove_pages_wipes_range_entirely_consumed_by_removal() {
        // Decimal at 0, roman spanning indices 5..8, alpha at 8. Remove exactly
        // the roman range's span.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("D", Some(1), None),
            Object::Integer(5),
            label_dict("R", Some(1), None),
            Object::Integer(8),
            label_dict("A", Some(1), None),
        ]);
        {
            let mut h = pdf.page_labels();
            h.remove_pages(5, 3).unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(
            ranges,
            vec![
                (0, dec(1)),
                (
                    5,
                    LabelRange {
                        style: LabelStyle::AlphaUpper,
                        prefix: String::new(),
                        start: 1
                    }
                ),
            ]
        );
        assert!(
            !ranges
                .iter()
                .any(|(_, r)| r.style == LabelStyle::RomanUpper),
            "the roman range is fully consumed by the removal"
        );
    }

    #[test]
    fn remove_pages_spanning_multiple_ranges_consumes_middle_range() {
        // Decimal at 0, roman spanning 3..7, alpha at 7. Remove indices 2..8:
        // the tail of decimal, all of roman, and the head of alpha.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("D", Some(1), None),
            Object::Integer(3),
            label_dict("R", Some(1), None),
            Object::Integer(7),
            label_dict("A", Some(1), None),
        ]);
        {
            let mut h = pdf.page_labels();
            h.remove_pages(2, 6).unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(
            ranges,
            vec![
                (0, dec(1)),
                (
                    2,
                    LabelRange {
                        style: LabelStyle::AlphaUpper,
                        prefix: String::new(),
                        start: 2
                    }
                ),
            ]
        );
    }

    #[test]
    fn remove_pages_collapses_pre_existing_redundant_neighbor() {
        // (5, Decimal, start 6) is already exactly the natural continuation of
        // (0, Decimal, start 1) (1 + (5-0) == 6); this pair survives untouched
        // in the head, and write_labels re-merges it via merge_adjacent_ranges
        // on every rebuild. Removing pages far past both (20..23) exercises the
        // real-gap tail entry at the same time: it must NOT merge with (0,1)
        // once the redundant (5,6) is folded away, because 3 pages of real
        // numbering were actually consumed by the removal.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("D", Some(1), None),
            Object::Integer(5),
            label_dict("D", Some(6), None),
        ]);
        {
            let mut h = pdf.page_labels();
            h.remove_pages(20, 3).unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        assert_eq!(ranges, vec![(0, dec(1)), (20, dec(24))]);
    }

    #[test]
    fn remove_pages_noop_on_empty_tree() {
        let mut pdf = bare_one_page_pdf();
        let mut h = pdf.page_labels();
        h.remove_pages(0, 3).unwrap();
        assert!(
            !h.has_page_labels().unwrap(),
            "remove_pages must not fabricate a tree where none existed"
        );
    }

    #[test]
    fn remove_pages_noop_when_count_zero() {
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(0), label_dict("D", Some(1), None)]);
        {
            let mut h = pdf.page_labels();
            h.remove_pages(0, 0).unwrap();
        }
        let mut h = pdf.page_labels();
        assert_eq!(h.ranges().unwrap(), vec![(0, dec(1))]);
    }

    /// Covers the `None` arm of the `effective_at_removed_end` match in
    /// remove_pages: when `removed_end` is BEFORE the first explicit range,
    /// the surviving pages must keep the PDF-default decimal label sequence
    /// they had before removal (starting at `removed_end + 1`), NOT get a
    /// LabelStyle::None entry that would render every label as an empty
    /// string.
    #[test]
    fn remove_pages_before_first_range_preserves_default_decimal_sequence() {
        // Ranges start at index 5 (roman), leaving 0..5 with the PDF
        // default label sequence "1"…"5".
        let mut pdf = pdf_with_pagelabels(vec![Object::Integer(5), label_dict("r", Some(1), None)]);
        // Remove pages 0..2 — removed_end=2, before the first range at index 5.
        // Old source page 2 (previously "3") now becomes output page 0.
        {
            let mut h = pdf.page_labels();
            h.remove_pages(0, 2).unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        // Two entries survive: an explicit decimal range starting at 3 (so
        // new page 0 renders as "3", matching source page 2), and the
        // original roman range now at index 3 (5 - 2 shift).
        assert_eq!(ranges.len(), 2, "got {ranges:?}");
        assert_eq!(ranges[0].0, 0);
        assert_eq!(ranges[0].1.style, LabelStyle::Decimal);
        assert_eq!(ranges[0].1.start, 3);
        assert_eq!(ranges[1].0, 3);
        assert_eq!(ranges[1].1.style, LabelStyle::RomanLower);
        // End-to-end: the rendered label for new page 0 must be "3".
        assert_eq!(h.label_string_for_page(0).unwrap(), "3");
    }

    /// Cover the trailing shift-loop `if *idx > removed_end` in remove_pages:
    /// deletion touches only the first range, so a downstream range must
    /// survive with its output index shifted left.
    #[test]
    fn remove_pages_shifts_trailing_range_past_removed_span() {
        // Two ranges: roman starting at 0, decimal restart at 4. Remove
        // one page at index 0, so the trailing range must shift to index 3.
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            label_dict("r", Some(1), None),
            Object::Integer(4),
            label_dict("D", Some(1), None),
        ]);
        {
            let mut h = pdf.page_labels();
            h.remove_pages(0, 1).unwrap();
        }
        let mut h = pdf.page_labels();
        let ranges = h.ranges().unwrap();
        // Trailing decimal range slides from index 4 to 3.
        assert!(
            ranges
                .iter()
                .any(|(idx, r)| *idx == 3 && r.style == LabelStyle::Decimal),
            "trailing range must survive at shifted index 3: {ranges:?}"
        );
    }

    // ── merge_adjacent_ranges ─────────────────────────────────────────────

    #[test]
    fn merge_adjacent_ranges_collapses_contiguous_identical_neighbor() {
        // 1 + (5-0) == 6: the second entry adds no information.
        let merged = merge_adjacent_ranges(vec![(0, dec(1)), (5, dec(6))]);
        assert_eq!(merged, vec![(0, dec(1))]);
    }

    #[test]
    fn merge_adjacent_ranges_keeps_non_contiguous_start() {
        let ranges = vec![(0, dec(1)), (5, dec(100))];
        assert_eq!(merge_adjacent_ranges(ranges.clone()), ranges);
    }

    #[test]
    fn merge_adjacent_ranges_keeps_style_mismatch() {
        let b = LabelRange {
            style: LabelStyle::RomanUpper,
            prefix: String::new(),
            start: 6, // numerically contiguous with dec(1), but a different style
        };
        let ranges = vec![(0, dec(1)), (5, b)];
        assert_eq!(
            merge_adjacent_ranges(ranges.clone()),
            ranges,
            "different style must block the merge even when /St lines up"
        );
    }

    #[test]
    fn merge_adjacent_ranges_keeps_prefix_mismatch() {
        let a = LabelRange {
            style: LabelStyle::Decimal,
            prefix: "A-".into(),
            start: 1,
        };
        let b = LabelRange {
            style: LabelStyle::Decimal,
            prefix: "B-".into(),
            start: 6,
        };
        let ranges = vec![(0, a), (5, b)];
        assert_eq!(
            merge_adjacent_ranges(ranges.clone()),
            ranges,
            "different prefix must block the merge even when style/St line up"
        );
    }

    #[test]
    fn merge_adjacent_ranges_handles_empty_and_singleton() {
        assert_eq!(merge_adjacent_ranges(vec![]), vec![]);
        let only = vec![(0, dec(1))];
        assert_eq!(merge_adjacent_ranges(only.clone()), only);
    }

    #[test]
    fn merge_adjacent_ranges_skips_merge_on_arithmetic_overflow() {
        // Unsorted input (idx < prev_idx) → checked_sub underflows → no merge.
        // The function is total: it must not panic and must preserve the entry.
        let a = LabelRange {
            style: LabelStyle::Decimal,
            prefix: String::new(),
            start: 1,
        };
        let b = a.clone();
        let unsorted = vec![(10, a), (5, b)];
        assert_eq!(
            merge_adjacent_ranges(unsorted.clone()),
            unsorted,
            "underflow in gap arithmetic must fall through, not merge"
        );

        // Add-overflow branch: prev.start = i64::MAX with a positive gap
        // saturates in the old code; checked_add now short-circuits.
        let big = LabelRange {
            style: LabelStyle::Decimal,
            prefix: String::new(),
            start: i64::MAX,
        };
        let follow = LabelRange {
            style: LabelStyle::Decimal,
            prefix: String::new(),
            start: 0, // any value; the point is that checked_add must be None
        };
        let overflow = vec![(0, big), (1, follow)];
        assert_eq!(
            merge_adjacent_ranges(overflow.clone()),
            overflow,
            "add overflow must fall through, not merge"
        );
    }

    #[test]
    fn insert_pages_rejects_at_or_count_exceeding_i64_max() {
        // Need a document with at least one range so we get past the
        // early-return; usize::MAX > i64::MAX on any target with usize >= 64-bit.
        // (On 32-bit targets usize::MAX < i64::MAX and try_from succeeds; those
        // are not our supported targets for this behaviour.)
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            Object::Dictionary(Dictionary::new()),
        ]);
        let mut helper = PageLabelDocumentHelper::new(&mut pdf);
        let err = helper.insert_pages(usize::MAX, 1).unwrap_err();
        assert!(matches!(err, Error::Unsupported(_)), "got {err:?}");
        let err = helper.insert_pages(0, usize::MAX).unwrap_err();
        assert!(matches!(err, Error::Unsupported(_)), "got {err:?}");
    }

    #[test]
    fn remove_pages_rejects_at_or_count_exceeding_i64_max() {
        let mut pdf = pdf_with_pagelabels(vec![
            Object::Integer(0),
            Object::Dictionary(Dictionary::new()),
        ]);
        let mut helper = PageLabelDocumentHelper::new(&mut pdf);
        let err = helper.remove_pages(usize::MAX, 1).unwrap_err();
        assert!(matches!(err, Error::Unsupported(_)), "got {err:?}");
        let err = helper.remove_pages(0, usize::MAX).unwrap_err();
        assert!(matches!(err, Error::Unsupported(_)), "got {err:?}");
    }
}