tabulark 0.1.0

A WebAssembly-first engine for format-agnostic tabular data preview
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
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
//! Incremental CSV/TSV scanning and checkpoint-based range decoding.
//!
//! The scanner never retains the source. A browser Worker can keep a `Blob`,
//! feed bounded slices into [`CsvScanner`], and later use [`RangePlan`] to feed
//! a fresh [`RangeDecoder`] from the closest record boundary. [`MemorySource`]
//! is provided only as a convenient native reference implementation and test
//! fixture.

use std::borrow::Cow;

use csv_core::{ReadFieldResult, Reader, ReaderBuilder};
use serde::{Deserialize, Serialize};

use crate::error::{ErrorCode, Result, TabularkError};
use crate::model::{
    AxisExtent, Capabilities, ColumnSchema, RandomAccess, RangeRequest, Schema, StringColumnBatch,
    TableBatch, TableDataType, TableExtent, TableMetadata,
};

const UTF8_BOM: &[u8; 3] = b"\xEF\xBB\xBF";
const FIELD_SCRATCH_BYTES: usize = 16 * 1024;

/// Parsing behavior for recoverable source problems.
#[derive(Clone, Copy, Debug, Default, Deserialize, Eq, Hash, PartialEq, Serialize)]
#[serde(rename_all = "lowercase")]
pub enum ParseMode {
    /// Preserve usable records and emit structured warnings.
    #[default]
    Lenient,
    /// Fail at the first malformed quote, invalid UTF-8 field, or ragged row.
    Strict,
}

/// Resource limits applied during scanning and range decoding.
#[derive(Clone, Debug, Deserialize, Eq, PartialEq, Serialize)]
#[serde(default, rename_all = "camelCase")]
pub struct CsvLimits {
    /// Maximum decoded bytes in one field.
    pub max_field_bytes: usize,
    /// Maximum logical columns discovered in one record.
    pub max_columns: usize,
    /// Maximum cells returned by one range request.
    pub max_cells_per_range: u64,
    /// Maximum encoded bytes returned by one range request.
    pub max_batch_bytes: usize,
    /// Maximum diagnostics retained and returned by one parser.
    pub max_diagnostics: usize,
}

impl Default for CsvLimits {
    fn default() -> Self {
        Self {
            max_field_bytes: 16 * 1024 * 1024,
            max_columns: 16_384,
            max_cells_per_range: 250_000,
            max_batch_bytes: 32 * 1024 * 1024,
            max_diagnostics: 1_000,
        }
    }
}

/// Options shared by a progressive scan and all later range decoders.
#[derive(Clone, Debug, Deserialize, Eq, PartialEq, Serialize)]
#[serde(default, rename_all = "camelCase")]
pub struct DelimitedOptions {
    /// ASCII field delimiter encoded as a one-character string in JSON.
    #[serde(with = "ascii_byte")]
    pub delimiter: u8,
    /// Whether the first record supplies column display names.
    #[serde(with = "header_mode")]
    pub header: bool,
    /// Recoverable source handling mode.
    pub mode: ParseMode,
    /// Number of logical data rows between sparse checkpoints.
    pub checkpoint_interval: u64,
    /// Logical table display name.
    pub table_name: String,
    /// Parser and response resource limits.
    pub limits: CsvLimits,
}

impl Default for DelimitedOptions {
    fn default() -> Self {
        Self::csv()
    }
}

impl DelimitedOptions {
    /// Returns conservative CSV defaults.
    #[must_use]
    pub fn csv() -> Self {
        Self {
            delimiter: b',',
            header: true,
            mode: ParseMode::Lenient,
            checkpoint_interval: 1_024,
            table_name: "Table 1".into(),
            limits: CsvLimits::default(),
        }
    }

    /// Returns conservative TSV defaults.
    #[must_use]
    pub fn tsv() -> Self {
        Self {
            delimiter: b'\t',
            ..Self::csv()
        }
    }

    /// Validates delimiter and resource limit invariants.
    pub fn validate(&self) -> Result<()> {
        if !self.delimiter.is_ascii()
            || self.delimiter == 0
            || matches!(self.delimiter, b'\r' | b'\n' | b'"')
        {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "delimiter must be one non-NUL ASCII byte other than CR, LF, or quote",
            ));
        }
        if self.checkpoint_interval == 0 {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "checkpoint interval must be greater than zero",
            ));
        }
        if self.limits.max_field_bytes == 0
            || self.limits.max_columns == 0
            || self.limits.max_cells_per_range == 0
            || self.limits.max_batch_bytes == 0
        {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "CSV resource limits must be greater than zero",
            ));
        }
        Ok(())
    }
}

/// Stable kinds for recoverable CSV diagnostics.
#[derive(Clone, Copy, Debug, Deserialize, Eq, Hash, PartialEq, Serialize)]
#[serde(rename_all = "kebab-case")]
pub enum CsvDiagnosticKind {
    /// A row contains fewer or more fields than the current schema.
    RaggedRow,
    /// A field contains malformed UTF-8.
    InvalidUtf8,
    /// Quoting is malformed or a quoted field is not terminated.
    MalformedQuote,
}

/// A source diagnostic that is separate from display text.
#[derive(Clone, Debug, Deserialize, Eq, PartialEq, Serialize)]
#[serde(rename_all = "camelCase")]
pub struct CsvDiagnostic {
    kind: CsvDiagnosticKind,
    row: Option<u64>,
    byte_offset: u64,
    message: String,
}

impl CsvDiagnostic {
    fn new(
        kind: CsvDiagnosticKind,
        row: Option<u64>,
        byte_offset: u64,
        message: impl Into<String>,
    ) -> Self {
        Self {
            kind,
            row,
            byte_offset,
            message: message.into(),
        }
    }

    /// Returns the stable diagnostic kind.
    #[must_use]
    pub const fn kind(&self) -> CsvDiagnosticKind {
        self.kind
    }

    /// Returns the zero-based logical data row when known.
    #[must_use]
    pub const fn row(&self) -> Option<u64> {
        self.row
    }

    /// Returns the source byte offset nearest the problem.
    #[must_use]
    pub const fn byte_offset(&self) -> u64 {
        self.byte_offset
    }

    /// Returns a safe diagnostic message.
    #[must_use]
    pub fn message(&self) -> &str {
        &self.message
    }
}

/// A sparse logical-row to source-byte mapping at a record boundary.
#[derive(Clone, Copy, Debug, Deserialize, Eq, Hash, PartialEq, Serialize)]
#[serde(rename_all = "camelCase")]
pub struct CsvCheckpoint {
    row: u64,
    byte_offset: u64,
}

impl CsvCheckpoint {
    /// Returns the logical data row beginning at this checkpoint.
    #[must_use]
    pub const fn row(self) -> u64 {
        self.row
    }

    /// Returns the absolute source byte offset at the record boundary.
    #[must_use]
    pub const fn byte_offset(self) -> u64 {
        self.byte_offset
    }
}

/// State returned after accepting one source chunk.
#[derive(Clone, Debug, Deserialize, Eq, PartialEq, Serialize)]
#[serde(rename_all = "camelCase")]
pub struct ScanUpdate {
    /// Latest table metadata snapshot.
    pub metadata: TableMetadata,
    /// Raw source bytes accepted, including a possible BOM.
    pub bytes_scanned: u64,
    /// Logical data rows discovered so far.
    pub rows_discovered: u64,
    /// Checkpoints created while processing this chunk.
    pub checkpoints_added: Vec<CsvCheckpoint>,
    /// New recoverable diagnostics from this chunk.
    pub warnings: Vec<CsvDiagnostic>,
    /// Whether end-of-file was finalized.
    pub done: bool,
}

/// A source slice and logical skip plan for a non-contiguous range read.
#[derive(Clone, Copy, Debug, Deserialize, Eq, PartialEq, Serialize)]
#[serde(rename_all = "camelCase")]
pub struct RangePlan {
    checkpoint: CsvCheckpoint,
    request: RangeRequest,
    rows_to_skip: u64,
}

impl RangePlan {
    /// Returns the nearest checkpoint at or before the requested row.
    #[must_use]
    pub const fn checkpoint(self) -> CsvCheckpoint {
        self.checkpoint
    }

    /// Returns the normalized requested range.
    #[must_use]
    pub const fn request(self) -> RangeRequest {
        self.request
    }

    /// Returns how many logical records precede the first requested row.
    #[must_use]
    pub const fn rows_to_skip(self) -> u64 {
        self.rows_to_skip
    }

    /// Returns the first absolute byte offset the Worker must read.
    #[must_use]
    pub const fn source_offset(self) -> u64 {
        self.checkpoint.byte_offset
    }
}

/// An incremental scanner that keeps metadata and sparse indexes, not source bytes.
#[derive(Debug)]
pub struct CsvScanner {
    options: DelimitedOptions,
    reader: Reader,
    lexical: QuoteTracker,
    bom_prefix: Vec<u8>,
    bom_resolved: bool,
    bytes_received: u64,
    parser_offset: u64,
    record_start_offset: u64,
    field: Vec<u8>,
    record_fields: usize,
    header_names: Vec<String>,
    header_pending: bool,
    rows: u64,
    columns: Vec<ColumnSchema>,
    column_string_bytes: usize,
    schema_version: u64,
    checkpoints: Vec<CsvCheckpoint>,
    diagnostics: Vec<CsvDiagnostic>,
    finished: bool,
}

impl CsvScanner {
    /// Creates a scanner ready to receive the source from absolute offset zero.
    pub fn new(options: DelimitedOptions) -> Result<Self> {
        options.validate()?;
        Ok(Self {
            reader: build_reader(options.delimiter),
            lexical: QuoteTracker::new(options.delimiter),
            bom_prefix: Vec::with_capacity(3),
            bom_resolved: false,
            bytes_received: 0,
            parser_offset: 0,
            record_start_offset: 0,
            field: Vec::new(),
            record_fields: 0,
            header_names: Vec::new(),
            header_pending: options.header,
            rows: 0,
            columns: Vec::new(),
            column_string_bytes: 0,
            schema_version: 0,
            checkpoints: Vec::new(),
            diagnostics: Vec::new(),
            finished: false,
            options,
        })
    }

    /// Accepts the next contiguous source chunk.
    ///
    /// `absolute_offset` is the chunk's position in the original source,
    /// including a possible UTF-8 BOM. Set `eof` only on the final chunk.
    pub fn feed_chunk(
        &mut self,
        absolute_offset: u64,
        bytes: &[u8],
        eof: bool,
    ) -> Result<ScanUpdate> {
        if self.finished {
            return Err(TabularkError::new(
                ErrorCode::HandleClosed,
                "CSV scanner is already finalized",
            ));
        }
        if absolute_offset != self.bytes_received {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "CSV scan chunks must be contiguous and ordered",
            )
            .with_detail("expectedOffset", self.bytes_received)
            .with_detail("actualOffset", absolute_offset));
        }
        self.bytes_received = self
            .bytes_received
            .checked_add(u64::try_from(bytes.len()).map_err(|_| {
                TabularkError::new(ErrorCode::ResourceLimit, "source chunk is too large")
            })?)
            .ok_or_else(|| {
                TabularkError::new(ErrorCode::ResourceLimit, "source byte offset overflow")
            })?;

        let diagnostics_before = self.diagnostics.len();
        let checkpoints_before = self.checkpoints.len();
        let mut cursor = 0;
        if !self.bom_resolved {
            while cursor < bytes.len() && self.bom_prefix.len() < UTF8_BOM.len() {
                self.bom_prefix.push(bytes[cursor]);
                cursor += 1;
                if !UTF8_BOM.starts_with(&self.bom_prefix) {
                    break;
                }
            }
            let is_possible_bom = UTF8_BOM.starts_with(&self.bom_prefix);
            if !is_possible_bom || self.bom_prefix.len() == UTF8_BOM.len() || eof {
                self.bom_resolved = true;
                if self.bom_prefix == UTF8_BOM {
                    self.parser_offset = 3;
                    self.record_start_offset = 3;
                    self.bom_prefix.clear();
                } else {
                    let prefix = std::mem::take(&mut self.bom_prefix);
                    self.process_bytes(0, &prefix)?;
                }
            }
        }
        if self.bom_resolved && cursor < bytes.len() {
            let cursor_offset = u64::try_from(cursor).map_err(|_| {
                TabularkError::new(ErrorCode::ResourceLimit, "chunk cursor overflow")
            })?;
            self.process_bytes(absolute_offset + cursor_offset, &bytes[cursor..])?;
        }
        if eof {
            if !self.bom_resolved {
                self.bom_resolved = true;
                let prefix = std::mem::take(&mut self.bom_prefix);
                self.process_bytes(0, &prefix)?;
            }
            self.finish()?;
        }

        Ok(ScanUpdate {
            metadata: self.metadata()?,
            bytes_scanned: self.bytes_received,
            rows_discovered: self.rows,
            checkpoints_added: self.checkpoints[checkpoints_before..].to_vec(),
            warnings: self.diagnostics[diagnostics_before..].to_vec(),
            done: self.finished,
        })
    }

    /// Returns the latest progressive table metadata.
    pub fn metadata(&self) -> Result<TableMetadata> {
        let rows = if self.finished {
            AxisExtent::exact(self.rows)?
        } else {
            AxisExtent::at_least(self.rows)?
        };
        let column_count = u64::try_from(self.columns.len()).map_err(|_| {
            TabularkError::new(ErrorCode::ResourceLimit, "column count exceeds u64")
        })?;
        let columns = if self.finished {
            AxisExtent::exact(column_count)?
        } else if self.columns.is_empty() {
            AxisExtent::Unknown
        } else {
            AxisExtent::at_least(column_count)?
        };
        Ok(TableMetadata::new(
            "table-0",
            self.options.table_name.clone(),
            0,
            TableExtent::new(rows, columns),
            Schema::new(self.schema_version, self.columns.clone())?,
            Capabilities::delimited(if self.finished {
                RandomAccess::Full
            } else {
                RandomAccess::IndexedPrefix
            }),
        ))
    }

    /// Returns all sparse checkpoints created so far.
    #[must_use]
    pub fn checkpoints(&self) -> &[CsvCheckpoint] {
        &self.checkpoints
    }

    /// Returns retained lenient-mode diagnostics.
    #[must_use]
    pub fn diagnostics(&self) -> &[CsvDiagnostic] {
        &self.diagnostics
    }

    /// Returns the accepted raw byte count.
    #[must_use]
    pub const fn bytes_scanned(&self) -> u64 {
        self.bytes_received
    }

    /// Returns whether the scanner reached end-of-file.
    #[must_use]
    pub const fn is_finished(&self) -> bool {
        self.finished
    }

    /// Returns a conservative estimate of heap bytes retained for scanning and indexing.
    ///
    /// The estimate uses allocated capacities rather than logical lengths for sparse
    /// checkpoints, schema columns, pending headers, diagnostics, the in-progress field,
    /// and the possible UTF-8 BOM prefix. Heap allocations owned by strings nested in
    /// those collections are included as well.
    #[must_use]
    pub fn estimated_index_bytes(&self) -> usize {
        let checkpoint_bytes = allocated_vec_bytes::<CsvCheckpoint>(&self.checkpoints);
        let column_bytes = allocated_vec_bytes::<ColumnSchema>(&self.columns)
            .saturating_add(self.column_string_bytes);
        let header_bytes = allocated_vec_bytes::<String>(&self.header_names).saturating_add(
            self.header_names
                .iter()
                .fold(0_usize, |bytes, name| bytes.saturating_add(name.capacity())),
        );
        let diagnostic_bytes = allocated_vec_bytes::<CsvDiagnostic>(&self.diagnostics)
            .saturating_add(self.diagnostics.iter().fold(0_usize, |bytes, diagnostic| {
                bytes.saturating_add(diagnostic.message.capacity())
            }));

        checkpoint_bytes
            .saturating_add(column_bytes)
            .saturating_add(header_bytes)
            .saturating_add(diagnostic_bytes)
            .saturating_add(self.field.capacity())
            .saturating_add(self.bom_prefix.capacity())
    }

    /// Produces a checkpoint-based source read plan.
    pub fn plan_range(&self, request: RangeRequest) -> Result<RangePlan> {
        self.validate_range(request)?;
        if request.row_count() > 0 && !self.finished && request.row_start() >= self.rows {
            return Err(TabularkError::new(
                ErrorCode::RangeNotIndexed,
                "requested row has not been indexed yet",
            )
            .with_retryable(true)
            .with_detail("indexedRows", self.rows));
        }

        let checkpoint = self
            .checkpoints
            .iter()
            .rev()
            .copied()
            .find(|checkpoint| checkpoint.row <= request.row_start())
            .unwrap_or(CsvCheckpoint {
                row: self.rows,
                byte_offset: self.parser_offset,
            });
        Ok(RangePlan {
            checkpoint,
            request,
            rows_to_skip: request.row_start().saturating_sub(checkpoint.row),
        })
    }

    /// Creates a fresh range decoder from a previously produced plan.
    pub fn range_decoder(&self, plan: RangePlan) -> Result<RangeDecoder> {
        RangeDecoder::new(
            self.options.clone(),
            plan,
            Schema::new(self.schema_version, self.columns.clone())?,
        )
    }

    fn validate_range(&self, request: RangeRequest) -> Result<()> {
        request.validate_public()?;
        if request.cell_count()? > self.options.limits.max_cells_per_range {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "range exceeds the configured cell limit",
            )
            .with_detail("maxCells", self.options.limits.max_cells_per_range));
        }
        let column_end = request.column_end()?;
        let schema_columns = u64::try_from(self.columns.len()).map_err(|_| {
            TabularkError::new(ErrorCode::ResourceLimit, "column count exceeds u64")
        })?;
        if column_end > schema_columns {
            return Err(TabularkError::new(
                ErrorCode::InvalidRange,
                "requested columns exceed the current schema",
            )
            .with_detail("schemaColumns", schema_columns));
        }
        Ok(())
    }

    fn process_bytes(&mut self, base: u64, bytes: &[u8]) -> Result<()> {
        if base != self.parser_offset {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "parser input does not begin at the expected absolute offset",
            )
            .with_detail("expectedOffset", self.parser_offset)
            .with_detail("actualOffset", base));
        }
        for issue in self.lexical.consume(bytes, base) {
            self.handle_diagnostic(CsvDiagnostic::new(
                CsvDiagnosticKind::MalformedQuote,
                None,
                issue.offset,
                issue.message,
            ))?;
        }

        let mut input = bytes;
        let mut scratch = [0_u8; FIELD_SCRATCH_BYTES];
        while !input.is_empty() {
            let (result, consumed, written) = self.reader.read_field(input, &mut scratch);
            self.append_field(&scratch[..written])?;
            let consumed_u64 = u64::try_from(consumed).map_err(|_| {
                TabularkError::new(ErrorCode::ResourceLimit, "parser offset overflow")
            })?;
            self.parser_offset = self
                .parser_offset
                .checked_add(consumed_u64)
                .ok_or_else(|| {
                    TabularkError::new(ErrorCode::ResourceLimit, "parser offset overflow")
                })?;
            input = &input[consumed..];
            match result {
                ReadFieldResult::InputEmpty => break,
                ReadFieldResult::OutputFull => {}
                ReadFieldResult::Field { record_end } => {
                    self.finish_field()?;
                    if record_end {
                        self.finish_record()?;
                    }
                }
                ReadFieldResult::End => {
                    return Err(TabularkError::new(
                        ErrorCode::RuntimeFailure,
                        "CSV parser reached end before the input chunk was exhausted",
                    ));
                }
            }
            if consumed == 0 && written == 0 {
                return Err(TabularkError::new(
                    ErrorCode::RuntimeFailure,
                    "CSV parser made no progress",
                ));
            }
        }
        Ok(())
    }

    fn finish(&mut self) -> Result<()> {
        if let Some(offset) = self.lexical.unclosed_quote_offset() {
            self.handle_diagnostic(CsvDiagnostic::new(
                CsvDiagnosticKind::MalformedQuote,
                None,
                offset,
                "quoted field is not terminated before end-of-file",
            ))?;
        }

        let mut scratch = [0_u8; FIELD_SCRATCH_BYTES];
        for _ in 0..4 {
            let (result, consumed, written) = self.reader.read_field(&[], &mut scratch);
            debug_assert_eq!(consumed, 0);
            self.append_field(&scratch[..written])?;
            match result {
                ReadFieldResult::Field { record_end } => {
                    self.finish_field()?;
                    if record_end {
                        self.finish_record()?;
                    }
                }
                ReadFieldResult::End => {
                    self.finished = true;
                    return Ok(());
                }
                ReadFieldResult::OutputFull => continue,
                ReadFieldResult::InputEmpty => continue,
            }
        }
        Err(TabularkError::new(
            ErrorCode::RuntimeFailure,
            "CSV parser did not terminate at end-of-file",
        ))
    }

    fn append_field(&mut self, bytes: &[u8]) -> Result<()> {
        let new_len = self.field.len().checked_add(bytes.len()).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "CSV field length overflow")
        })?;
        if new_len > self.options.limits.max_field_bytes {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "CSV field exceeds the configured byte limit",
            )
            .with_detail("maxFieldBytes", self.options.limits.max_field_bytes));
        }
        self.field.extend_from_slice(bytes);
        Ok(())
    }

    fn finish_field(&mut self) -> Result<()> {
        self.record_fields = self.record_fields.checked_add(1).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "CSV column count overflow")
        })?;
        if self.record_fields > self.options.limits.max_columns {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "CSV record exceeds the configured column limit",
            )
            .with_detail("maxColumns", self.options.limits.max_columns));
        }

        let bytes = std::mem::take(&mut self.field);
        let decoded = match std::str::from_utf8(&bytes) {
            Ok(value) => Cow::Borrowed(value),
            Err(_) => {
                self.handle_diagnostic(CsvDiagnostic::new(
                    CsvDiagnosticKind::InvalidUtf8,
                    (!self.header_pending).then_some(self.rows),
                    self.record_start_offset,
                    "field contains invalid UTF-8; replacement characters were used",
                ))?;
                String::from_utf8_lossy(&bytes)
            }
        };
        if self.header_pending {
            self.header_names.push(decoded.into_owned());
        }
        Ok(())
    }

    fn finish_record(&mut self) -> Result<()> {
        let fields = std::mem::take(&mut self.record_fields);
        if self.header_pending {
            let names = std::mem::take(&mut self.header_names);
            self.ensure_columns(fields, Some(&names))?;
            self.header_pending = false;
        } else {
            if self.rows % self.options.checkpoint_interval == 0 {
                self.checkpoints.push(CsvCheckpoint {
                    row: self.rows,
                    byte_offset: self.record_start_offset,
                });
            }
            if self.columns.is_empty() {
                self.ensure_columns(fields, None)?;
            } else if fields != self.columns.len() {
                self.handle_diagnostic(CsvDiagnostic::new(
                    CsvDiagnosticKind::RaggedRow,
                    Some(self.rows),
                    self.record_start_offset,
                    format!(
                        "row has {fields} fields but the current schema has {}",
                        self.columns.len()
                    ),
                ))?;
                if fields > self.columns.len() {
                    self.ensure_columns(fields, None)?;
                }
            }
            self.rows = self.rows.checked_add(1).ok_or_else(|| {
                TabularkError::new(ErrorCode::ResourceLimit, "CSV row count overflow")
            })?;
        }
        self.record_start_offset = self.parser_offset;
        Ok(())
    }

    fn ensure_columns(&mut self, count: usize, header_names: Option<&[String]>) -> Result<()> {
        if count > self.options.limits.max_columns {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "CSV schema exceeds the configured column limit",
            ));
        }
        if count <= self.columns.len() {
            return Ok(());
        }
        for index in self.columns.len()..count {
            let name = header_names
                .and_then(|names| names.get(index))
                .filter(|name| !name.is_empty())
                .cloned()
                .unwrap_or_else(|| format!("column_{}", index + 1));
            let id = format!("c{index}");
            let string_bytes = id.capacity().saturating_add(name.capacity());
            let index_u64 = u64::try_from(index).map_err(|_| {
                TabularkError::new(ErrorCode::ResourceLimit, "column index exceeds u64")
            })?;
            self.columns.push(ColumnSchema::new(
                id,
                name,
                index_u64,
                TableDataType::Utf8,
                true,
            )?);
            self.column_string_bytes = self.column_string_bytes.saturating_add(string_bytes);
        }
        self.schema_version = self.schema_version.checked_add(1).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "schema version overflow")
        })?;
        Ok(())
    }

    fn handle_diagnostic(&mut self, diagnostic: CsvDiagnostic) -> Result<()> {
        if self.options.mode == ParseMode::Strict {
            let mut error = TabularkError::new(ErrorCode::ParseFailed, diagnostic.message.clone())
                .with_detail("kind", diagnostic_kind_name(diagnostic.kind))
                .with_detail("byteOffset", diagnostic.byte_offset);
            if let Some(row) = diagnostic.row {
                error = error.with_detail("row", row);
            }
            return Err(error);
        }
        if self.diagnostics.len() < self.options.limits.max_diagnostics {
            self.diagnostics.push(diagnostic);
        }
        Ok(())
    }
}

fn allocated_vec_bytes<T>(values: &Vec<T>) -> usize {
    values.capacity().saturating_mul(std::mem::size_of::<T>())
}

/// Result of feeding a range decoder.
#[derive(Clone, Debug, Eq, PartialEq)]
pub enum RangeDecodeStatus {
    /// More source bytes are required.
    NeedMore,
    /// The requested range or end-of-file was reached.
    Complete(TableBatch),
}

/// Incrementally decodes one requested range from a checkpoint source slice.
#[derive(Debug)]
pub struct RangeDecoder {
    options: DelimitedOptions,
    plan: RangePlan,
    schema: Schema,
    reader: Reader,
    lexical: QuoteTracker,
    expected_offset: u64,
    field: Vec<u8>,
    field_index: usize,
    current_row: u64,
    selected_values: Vec<Option<Vec<u8>>>,
    builders: Vec<StringColumnBuilder>,
    returned_rows: u64,
    batch_bytes: usize,
    diagnostics: Vec<CsvDiagnostic>,
    done: bool,
}

impl RangeDecoder {
    fn new(options: DelimitedOptions, plan: RangePlan, schema: Schema) -> Result<Self> {
        let selected = usize::try_from(plan.request.column_count()).map_err(|_| {
            TabularkError::new(ErrorCode::ResourceLimit, "range column count exceeds usize")
        })?;
        let start = usize::try_from(plan.request.column_start()).map_err(|_| {
            TabularkError::new(ErrorCode::ResourceLimit, "range column start exceeds usize")
        })?;
        let mut builders = Vec::with_capacity(selected);
        for column in &schema.columns()[start..start + selected] {
            builders.push(StringColumnBuilder::new(column.id()));
        }
        let batch_bytes = selected
            .checked_mul(std::mem::size_of::<u32>())
            .ok_or_else(|| {
                TabularkError::new(ErrorCode::ResourceLimit, "batch byte length overflow")
            })?;
        if batch_bytes > options.limits.max_batch_bytes {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "range response exceeds the configured byte limit",
            ));
        }
        Ok(Self {
            reader: build_reader(options.delimiter),
            lexical: QuoteTracker::new(options.delimiter),
            expected_offset: plan.source_offset(),
            field: Vec::new(),
            field_index: 0,
            current_row: plan.checkpoint.row,
            selected_values: vec![None; selected],
            builders,
            returned_rows: 0,
            batch_bytes,
            diagnostics: Vec::new(),
            done: plan.request.row_count() == 0,
            options,
            plan,
            schema,
        })
    }

    /// Returns diagnostics emitted during range decoding.
    #[must_use]
    pub fn diagnostics(&self) -> &[CsvDiagnostic] {
        &self.diagnostics
    }

    /// Returns the next absolute byte offset expected from the source.
    #[must_use]
    pub const fn expected_offset(&self) -> u64 {
        self.expected_offset
    }

    /// Returns whether the decoder already produced its terminal batch.
    #[must_use]
    pub const fn is_done(&self) -> bool {
        self.done
    }

    /// Returns an immediate empty batch for a zero-row request.
    pub fn immediate_batch(&mut self) -> Result<Option<TableBatch>> {
        if self.done && self.returned_rows == 0 && self.plan.request.row_count() == 0 {
            return self.build_batch(true).map(Some);
        }
        Ok(None)
    }

    /// Accepts the next contiguous source slice for this range.
    pub fn feed_chunk(
        &mut self,
        absolute_offset: u64,
        bytes: &[u8],
        eof: bool,
    ) -> Result<RangeDecodeStatus> {
        if self.done {
            return Err(TabularkError::new(
                ErrorCode::HandleClosed,
                "range decoder is already complete",
            ));
        }
        if absolute_offset != self.expected_offset {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "range chunks must be contiguous and begin at the planned offset",
            )
            .with_detail("expectedOffset", self.expected_offset)
            .with_detail("actualOffset", absolute_offset));
        }
        for issue in self.lexical.consume(bytes, absolute_offset) {
            self.handle_diagnostic(CsvDiagnostic::new(
                CsvDiagnosticKind::MalformedQuote,
                Some(self.current_row),
                issue.offset,
                issue.message,
            ))?;
        }

        let mut input = bytes;
        let mut scratch = [0_u8; FIELD_SCRATCH_BYTES];
        while !input.is_empty() && !self.done {
            let (result, consumed, written) = self.reader.read_field(input, &mut scratch);
            self.append_field(&scratch[..written])?;
            let consumed_u64 = u64::try_from(consumed).map_err(|_| {
                TabularkError::new(ErrorCode::ResourceLimit, "range parser offset overflow")
            })?;
            self.expected_offset =
                self.expected_offset
                    .checked_add(consumed_u64)
                    .ok_or_else(|| {
                        TabularkError::new(ErrorCode::ResourceLimit, "range parser offset overflow")
                    })?;
            input = &input[consumed..];
            match result {
                ReadFieldResult::InputEmpty => break,
                ReadFieldResult::OutputFull => {}
                ReadFieldResult::Field { record_end } => {
                    self.finish_field()?;
                    if record_end {
                        self.finish_record()?;
                    }
                }
                ReadFieldResult::End => {
                    return Err(TabularkError::new(
                        ErrorCode::RuntimeFailure,
                        "range parser reached end before its chunk was exhausted",
                    ));
                }
            }
            if consumed == 0 && written == 0 {
                return Err(TabularkError::new(
                    ErrorCode::RuntimeFailure,
                    "range parser made no progress",
                ));
            }
        }
        if self.done {
            return Ok(RangeDecodeStatus::Complete(self.build_batch(true)?));
        }
        if eof {
            return self.finish_eof();
        }
        Ok(RangeDecodeStatus::NeedMore)
    }

    fn finish_eof(&mut self) -> Result<RangeDecodeStatus> {
        if let Some(offset) = self.lexical.unclosed_quote_offset() {
            self.handle_diagnostic(CsvDiagnostic::new(
                CsvDiagnosticKind::MalformedQuote,
                Some(self.current_row),
                offset,
                "quoted field is not terminated before end-of-file",
            ))?;
        }
        let mut scratch = [0_u8; FIELD_SCRATCH_BYTES];
        for _ in 0..4 {
            let (result, _, written) = self.reader.read_field(&[], &mut scratch);
            self.append_field(&scratch[..written])?;
            match result {
                ReadFieldResult::Field { record_end } => {
                    self.finish_field()?;
                    if record_end {
                        self.finish_record()?;
                    }
                }
                ReadFieldResult::End => {
                    self.done = true;
                    return Ok(RangeDecodeStatus::Complete(self.build_batch(
                        self.returned_rows == self.plan.request.row_count(),
                    )?));
                }
                ReadFieldResult::OutputFull | ReadFieldResult::InputEmpty => continue,
            }
            if self.done {
                return Ok(RangeDecodeStatus::Complete(self.build_batch(true)?));
            }
        }
        Err(TabularkError::new(
            ErrorCode::RuntimeFailure,
            "range parser did not terminate at end-of-file",
        ))
    }

    fn append_field(&mut self, bytes: &[u8]) -> Result<()> {
        let new_len = self.field.len().checked_add(bytes.len()).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "CSV field length overflow")
        })?;
        if new_len > self.options.limits.max_field_bytes {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "CSV field exceeds the configured byte limit",
            ));
        }
        self.field.extend_from_slice(bytes);
        Ok(())
    }

    fn finish_field(&mut self) -> Result<()> {
        self.field_index = self.field_index.checked_add(1).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "CSV column count overflow")
        })?;
        if self.field_index > self.options.limits.max_columns {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "CSV record exceeds the configured column limit",
            ));
        }
        let logical_index = self.field_index - 1;
        let start = usize::try_from(self.plan.request.column_start()).map_err(|_| {
            TabularkError::new(ErrorCode::ResourceLimit, "column start exceeds usize")
        })?;
        let end = start + self.selected_values.len();
        let field = std::mem::take(&mut self.field);
        if self.current_row >= self.plan.request.row_start()
            && self.current_row < self.plan.request.row_end()?
            && (start..end).contains(&logical_index)
        {
            let normalized = match std::str::from_utf8(&field) {
                Ok(_) => field,
                Err(_) => {
                    self.handle_diagnostic(CsvDiagnostic::new(
                        CsvDiagnosticKind::InvalidUtf8,
                        Some(self.current_row),
                        self.expected_offset,
                        "field contains invalid UTF-8; replacement characters were used",
                    ))?;
                    String::from_utf8_lossy(&field).into_owned().into_bytes()
                }
            };
            self.selected_values[logical_index - start] = Some(normalized);
        }
        Ok(())
    }

    fn finish_record(&mut self) -> Result<()> {
        if self.field_index != self.schema.len() {
            self.handle_diagnostic(CsvDiagnostic::new(
                CsvDiagnosticKind::RaggedRow,
                Some(self.current_row),
                self.expected_offset,
                format!(
                    "row has {} fields but the schema has {}",
                    self.field_index,
                    self.schema.len()
                ),
            ))?;
        }
        if self.current_row >= self.plan.request.row_start()
            && self.current_row < self.plan.request.row_end()?
        {
            for (builder, value) in self.builders.iter_mut().zip(&mut self.selected_values) {
                builder.push(
                    value.take(),
                    &mut self.batch_bytes,
                    self.options.limits.max_batch_bytes,
                )?;
            }
            self.returned_rows += 1;
        }
        self.field_index = 0;
        self.selected_values.fill(None);
        self.current_row = self.current_row.checked_add(1).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "range row count overflow")
        })?;
        if self.returned_rows == self.plan.request.row_count() {
            self.done = true;
        }
        Ok(())
    }

    fn handle_diagnostic(&mut self, diagnostic: CsvDiagnostic) -> Result<()> {
        if self.options.mode == ParseMode::Strict {
            let mut error = TabularkError::new(ErrorCode::ParseFailed, diagnostic.message.clone())
                .with_detail("kind", diagnostic_kind_name(diagnostic.kind))
                .with_detail("byteOffset", diagnostic.byte_offset);
            if let Some(row) = diagnostic.row {
                error = error.with_detail("row", row);
            }
            return Err(error);
        }
        if self.diagnostics.len() < self.options.limits.max_diagnostics {
            self.diagnostics.push(diagnostic);
        }
        Ok(())
    }

    fn build_batch(&mut self, complete: bool) -> Result<TableBatch> {
        let returned_range = RangeRequest::new(
            self.plan.request.row_start(),
            self.returned_rows,
            self.plan.request.column_start(),
            self.plan.request.column_count(),
        )?;
        let builders = std::mem::take(&mut self.builders);
        let columns = builders
            .into_iter()
            .map(StringColumnBuilder::finish)
            .collect::<Result<Vec<_>>>()?;
        Ok(TableBatch::new(
            "table-0",
            0,
            self.schema.version(),
            returned_range,
            complete,
            columns,
        ))
    }
}

/// A native reference source that intentionally retains bytes for tests and examples.
#[derive(Debug)]
pub struct MemorySource {
    bytes: Vec<u8>,
    scanner: CsvScanner,
    chunk_size: usize,
}

impl MemorySource {
    /// Opens and fully scans an in-memory delimited source in bounded chunks.
    pub fn open(bytes: impl Into<Vec<u8>>, options: DelimitedOptions) -> Result<Self> {
        Self::open_with_chunk_size(bytes, options, 1_024 * 1_024)
    }

    /// Opens an in-memory source with a chosen scanner chunk size.
    pub fn open_with_chunk_size(
        bytes: impl Into<Vec<u8>>,
        options: DelimitedOptions,
        chunk_size: usize,
    ) -> Result<Self> {
        if chunk_size == 0 {
            return Err(TabularkError::new(
                ErrorCode::InvalidArgument,
                "memory source chunk size must be greater than zero",
            ));
        }
        let bytes = bytes.into();
        let mut scanner = CsvScanner::new(options)?;
        if bytes.is_empty() {
            scanner.feed_chunk(0, &[], true)?;
        } else {
            let mut offset = 0;
            while offset < bytes.len() {
                let end = offset.saturating_add(chunk_size).min(bytes.len());
                scanner.feed_chunk(
                    u64::try_from(offset).map_err(|_| {
                        TabularkError::new(ErrorCode::ResourceLimit, "source offset exceeds u64")
                    })?,
                    &bytes[offset..end],
                    end == bytes.len(),
                )?;
                offset = end;
            }
        }
        Ok(Self {
            bytes,
            scanner,
            chunk_size,
        })
    }

    /// Returns the final metadata snapshot.
    pub fn metadata(&self) -> Result<TableMetadata> {
        self.scanner.metadata()
    }

    /// Returns the underlying sparse index.
    #[must_use]
    pub fn checkpoints(&self) -> &[CsvCheckpoint] {
        self.scanner.checkpoints()
    }

    /// Reads a bounded range by decoding from the nearest sparse checkpoint.
    pub fn read_range(&self, request: RangeRequest) -> Result<TableBatch> {
        let plan = self.scanner.plan_range(request)?;
        let mut decoder = self.scanner.range_decoder(plan)?;
        if let Some(batch) = decoder.immediate_batch()? {
            return Ok(batch);
        }
        let mut offset = usize::try_from(plan.source_offset()).map_err(|_| {
            TabularkError::new(ErrorCode::InvalidRange, "range source offset exceeds usize")
        })?;
        if offset >= self.bytes.len() {
            return match decoder.feed_chunk(plan.source_offset(), &[], true)? {
                RangeDecodeStatus::Complete(batch) => Ok(batch),
                RangeDecodeStatus::NeedMore => Err(TabularkError::new(
                    ErrorCode::RuntimeFailure,
                    "range decoder requested bytes beyond end-of-file",
                )),
            };
        }
        loop {
            let end = offset.saturating_add(self.chunk_size).min(self.bytes.len());
            let status = decoder.feed_chunk(
                u64::try_from(offset).map_err(|_| {
                    TabularkError::new(ErrorCode::ResourceLimit, "source offset exceeds u64")
                })?,
                &self.bytes[offset..end],
                end == self.bytes.len(),
            )?;
            match status {
                RangeDecodeStatus::Complete(batch) => return Ok(batch),
                RangeDecodeStatus::NeedMore => offset = end,
            }
        }
    }
}

#[derive(Debug)]
struct StringColumnBuilder {
    column_id: String,
    data: Vec<u8>,
    offsets: Vec<u32>,
    validity: Vec<u8>,
    values: usize,
}

impl StringColumnBuilder {
    fn new(column_id: &str) -> Self {
        Self {
            column_id: column_id.into(),
            data: Vec::new(),
            offsets: vec![0],
            validity: Vec::new(),
            values: 0,
        }
    }

    fn push(
        &mut self,
        value: Option<Vec<u8>>,
        batch_bytes: &mut usize,
        max_batch_bytes: usize,
    ) -> Result<()> {
        let validity_byte = usize::from(self.values % 8 == 0);
        let value_bytes = value.as_ref().map_or(0, Vec::len);
        let encoded_bytes = value_bytes
            .checked_add(std::mem::size_of::<u32>())
            .and_then(|bytes| bytes.checked_add(validity_byte))
            .ok_or_else(|| {
                TabularkError::new(ErrorCode::ResourceLimit, "batch byte length overflow")
            })?;
        let new_batch_bytes = batch_bytes.checked_add(encoded_bytes).ok_or_else(|| {
            TabularkError::new(ErrorCode::ResourceLimit, "batch byte length overflow")
        })?;
        if new_batch_bytes > max_batch_bytes {
            return Err(TabularkError::new(
                ErrorCode::ResourceLimit,
                "range response exceeds the configured byte limit",
            ));
        }
        if let Some(value) = value {
            self.data.extend_from_slice(&value);
            let byte = self.values / 8;
            if self.validity.len() <= byte {
                self.validity.push(0);
            }
            self.validity[byte] |= 1 << (self.values % 8);
        } else {
            let byte = self.values / 8;
            if self.validity.len() <= byte {
                self.validity.push(0);
            }
        }
        let offset = u32::try_from(self.data.len()).map_err(|_| {
            TabularkError::new(
                ErrorCode::ResourceLimit,
                "one encoded string column exceeds the u32 offset limit",
            )
        })?;
        self.offsets.push(offset);
        self.values += 1;
        *batch_bytes = new_batch_bytes;
        Ok(())
    }

    fn finish(self) -> Result<StringColumnBatch> {
        StringColumnBatch::new(self.column_id, self.data, self.offsets, self.validity)
    }
}

#[derive(Clone, Copy, Debug, Eq, PartialEq)]
enum QuoteState {
    StartField,
    Unquoted,
    Quoted { opening_offset: u64 },
    AfterQuote,
}

#[derive(Debug)]
struct QuoteIssue {
    offset: u64,
    message: &'static str,
}

#[derive(Debug)]
struct QuoteTracker {
    delimiter: u8,
    state: QuoteState,
    quoted_opening: Option<u64>,
}

impl QuoteTracker {
    const fn new(delimiter: u8) -> Self {
        Self {
            delimiter,
            state: QuoteState::StartField,
            quoted_opening: None,
        }
    }

    fn consume(&mut self, bytes: &[u8], base: u64) -> Vec<QuoteIssue> {
        let mut issues = Vec::new();
        for (index, byte) in bytes.iter().copied().enumerate() {
            let offset = base + u64::try_from(index).unwrap_or(u64::MAX);
            match self.state {
                QuoteState::StartField => match byte {
                    b'"' => {
                        self.state = QuoteState::Quoted {
                            opening_offset: offset,
                        };
                        self.quoted_opening = Some(offset);
                    }
                    b if b == self.delimiter || matches!(b, b'\r' | b'\n') => {}
                    _ => self.state = QuoteState::Unquoted,
                },
                QuoteState::Unquoted => {
                    if byte == b'"' {
                        issues.push(QuoteIssue {
                            offset,
                            message: "quote appears inside an unquoted field",
                        });
                    } else if byte == self.delimiter || matches!(byte, b'\r' | b'\n') {
                        self.state = QuoteState::StartField;
                    }
                }
                QuoteState::Quoted { .. } => {
                    if byte == b'"' {
                        self.state = QuoteState::AfterQuote;
                    }
                }
                QuoteState::AfterQuote => {
                    if byte == b'"' {
                        self.state = QuoteState::Quoted {
                            opening_offset: self.quoted_opening.unwrap_or(offset),
                        };
                    } else if byte == self.delimiter || matches!(byte, b'\r' | b'\n') {
                        self.state = QuoteState::StartField;
                        self.quoted_opening = None;
                    } else {
                        issues.push(QuoteIssue {
                            offset,
                            message: "unexpected data follows a closing quote",
                        });
                        self.state = QuoteState::Unquoted;
                        self.quoted_opening = None;
                    }
                }
            }
        }
        issues
    }

    const fn unclosed_quote_offset(&self) -> Option<u64> {
        match self.state {
            QuoteState::Quoted { opening_offset } => Some(opening_offset),
            _ => None,
        }
    }
}

fn build_reader(delimiter: u8) -> Reader {
    let mut builder = ReaderBuilder::new();
    builder.delimiter(delimiter);
    builder.build()
}

fn diagnostic_kind_name(kind: CsvDiagnosticKind) -> &'static str {
    match kind {
        CsvDiagnosticKind::RaggedRow => "ragged-row",
        CsvDiagnosticKind::InvalidUtf8 => "invalid-utf8",
        CsvDiagnosticKind::MalformedQuote => "malformed-quote",
    }
}

mod ascii_byte {
    use serde::{Deserialize, Deserializer, Serializer, de::Error as _};

    pub fn serialize<S>(value: &u8, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        serializer.serialize_str(&char::from(*value).to_string())
    }

    pub fn deserialize<'de, D>(deserializer: D) -> Result<u8, D::Error>
    where
        D: Deserializer<'de>,
    {
        let value = String::deserialize(deserializer)?;
        let bytes = value.as_bytes();
        if bytes.len() != 1 || !bytes[0].is_ascii() {
            return Err(D::Error::custom(
                "delimiter must be exactly one ASCII character",
            ));
        }
        Ok(bytes[0])
    }
}

mod header_mode {
    use serde::{Deserialize, Deserializer, Serializer, de::Error as _};

    #[derive(Deserialize)]
    #[serde(untagged)]
    enum HeaderValue {
        Boolean(bool),
        Name(String),
    }

    pub fn serialize<S>(value: &bool, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
    {
        serializer.serialize_str(if *value { "first-row" } else { "none" })
    }

    pub fn deserialize<'de, D>(deserializer: D) -> Result<bool, D::Error>
    where
        D: Deserializer<'de>,
    {
        match HeaderValue::deserialize(deserializer)? {
            HeaderValue::Boolean(value) => Ok(value),
            HeaderValue::Name(value) if value == "first-row" => Ok(true),
            HeaderValue::Name(value) if value == "none" => Ok(false),
            HeaderValue::Name(_) => Err(D::Error::custom(
                "header must be first-row, none, true, or false",
            )),
        }
    }
}

#[cfg(test)]
mod tests {
    use super::{
        CsvDiagnosticKind, CsvScanner, DelimitedOptions, MemorySource, ParseMode,
        RangeDecodeStatus, UTF8_BOM,
    };
    use crate::error::ErrorCode;
    use crate::model::{AxisExtent, RandomAccess, RangeRequest, TableBatch, TableDataType};
    use serde::Deserialize;
    use std::collections::HashSet;
    use std::fs;
    use std::path::{Component, Path};

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields, rename_all = "camelCase")]
    struct CorpusManifest {
        version: u64,
        chunk_sizes: Vec<usize>,
        cases: Vec<CorpusCase>,
    }

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields)]
    struct CorpusCase {
        id: String,
        file: String,
        options: CorpusOptions,
        #[serde(default)]
        source: CorpusSource,
        expect: CorpusExpectation,
    }

    #[derive(Clone, Copy, Debug, Deserialize)]
    #[serde(rename_all = "lowercase")]
    enum CorpusFormat {
        Csv,
        Tsv,
    }

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields)]
    struct CorpusOptions {
        format: CorpusFormat,
        header: bool,
        mode: ParseMode,
    }

    #[derive(Clone, Copy, Debug, Deserialize)]
    #[serde(rename_all = "lowercase")]
    enum CorpusLineEndings {
        Crlf,
    }

    #[derive(Clone, Copy, Debug, Deserialize)]
    #[serde(rename_all = "lowercase")]
    enum CorpusEncoding {
        Latin1,
    }

    #[derive(Debug, Default, Deserialize)]
    #[serde(deny_unknown_fields, rename_all = "camelCase")]
    struct CorpusSource {
        line_endings: Option<CorpusLineEndings>,
        encoding: Option<CorpusEncoding>,
        #[serde(default)]
        utf8_bom: bool,
        #[serde(default)]
        strip_final_newline: bool,
    }

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields, tag = "status", rename_all = "lowercase")]
    enum CorpusExpectation {
        Success {
            metadata: CorpusMetadata,
            #[serde(default)]
            rows: Option<Vec<Vec<Option<String>>>>,
            #[serde(default)]
            samples: Vec<CorpusSample>,
            #[serde(default)]
            warnings: Vec<CorpusDiagnostic>,
        },
        Error {
            code: ErrorCode,
            kind: CsvDiagnosticKind,
            #[serde(default)]
            row: Option<u64>,
            #[serde(rename = "byteOffset")]
            byte_offset: u64,
            #[serde(rename = "messageContains")]
            message_contains: String,
        },
    }

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields)]
    struct CorpusSample {
        row: u64,
        values: Vec<Option<String>>,
    }

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields, rename_all = "camelCase")]
    struct CorpusMetadata {
        rows: u64,
        columns: Vec<String>,
        schema_version: u64,
    }

    #[derive(Debug, Deserialize)]
    #[serde(deny_unknown_fields, rename_all = "camelCase")]
    struct CorpusDiagnostic {
        kind: CsvDiagnosticKind,
        row: Option<u64>,
        byte_offset: u64,
        message_contains: String,
    }

    #[test]
    fn scans_bom_crlf_quotes_and_embedded_newlines_across_tiny_chunks() {
        let source = MemorySource::open_with_chunk_size(
            b"\xEF\xBB\xBFname,note\r\nAlice,\"hello\r\nworld\"\r\nBob,\"a \"\"quote\"\"\"\r\n",
            DelimitedOptions::csv(),
            1,
        )
        .expect("scan source");

        let metadata = source.metadata().expect("metadata");
        assert_eq!(metadata.extent().rows(), AxisExtent::Exact { value: 2 });
        assert_eq!(metadata.schema().columns()[0].name(), "name");

        let batch = source
            .read_range(RangeRequest::new(0, 2, 0, 2).expect("range"))
            .expect("read range");
        assert_eq!(batch.columns()[0].value(0), Some(Some("Alice")));
        assert_eq!(batch.columns()[1].value(0), Some(Some("hello\r\nworld")));
        assert_eq!(batch.columns()[1].value(1), Some(Some("a \"quote\"")));
    }

    #[test]
    fn lenient_mode_distinguishes_missing_from_empty_and_expands_schema() {
        let source = MemorySource::open(b"a,b\n1\n2,,3\n".to_vec(), DelimitedOptions::csv())
            .expect("scan source");
        let batch = source
            .read_range(RangeRequest::new(0, 2, 0, 3).expect("range"))
            .expect("read range");

        assert_eq!(batch.columns()[1].value(0), Some(None));
        assert_eq!(batch.columns()[1].value(1), Some(Some("")));
        assert_eq!(batch.columns()[2].value(0), Some(None));
        assert_eq!(batch.columns()[2].value(1), Some(Some("3")));
        let warnings = source.scanner.diagnostics();
        assert!(!warnings.is_empty());
        assert!(
            warnings
                .iter()
                .all(|warning| warning.kind() == CsvDiagnosticKind::RaggedRow)
        );
        assert_eq!(warnings[0].row(), Some(0));
        assert_eq!(warnings[0].byte_offset(), 4);
        assert!(!warnings[0].message().is_empty());
    }

    #[test]
    fn strict_mode_rejects_ragged_rows_and_invalid_utf8() {
        let mut strict = DelimitedOptions::csv();
        strict.mode = ParseMode::Strict;
        let ragged = MemorySource::open(b"a,b\n1\n".to_vec(), strict.clone())
            .expect_err("ragged row must fail");
        assert_eq!(ragged.code(), ErrorCode::ParseFailed);
        assert_eq!(ragged.details()["kind"], "ragged-row");
        assert_eq!(ragged.details()["row"], 0);
        assert!(ragged.details().contains_key("byteOffset"));

        let invalid =
            MemorySource::open(b"a\n\xFF\n".to_vec(), strict).expect_err("invalid UTF-8 must fail");
        assert_eq!(invalid.code(), ErrorCode::ParseFailed);
        assert_eq!(invalid.details()["kind"], "invalid-utf8");
        assert_eq!(invalid.details()["row"], 0);
    }

    #[test]
    fn lenient_mode_replaces_invalid_utf8_in_batches() {
        let source = MemorySource::open(b"a\n\xFF\n".to_vec(), DelimitedOptions::csv())
            .expect("scan source");
        let batch = source
            .read_range(RangeRequest::new(0, 1, 0, 1).expect("range"))
            .expect("range read");

        assert_eq!(batch.columns()[0].value(0), Some(Some("�")));
    }

    #[test]
    fn sparse_checkpoint_serves_non_adjacent_ranges() {
        let mut options = DelimitedOptions::csv();
        options.checkpoint_interval = 2;
        let source = MemorySource::open(b"value\nr0\nr1\nr2\nr3\nr4\n".to_vec(), options)
            .expect("scan source");

        assert_eq!(
            source
                .checkpoints()
                .iter()
                .map(|checkpoint| checkpoint.row())
                .collect::<Vec<_>>(),
            vec![0, 2, 4]
        );
        let late = source
            .read_range(RangeRequest::new(4, 1, 0, 1).expect("range"))
            .expect("late range");
        let early = source
            .read_range(RangeRequest::new(1, 2, 0, 1).expect("range"))
            .expect("early range");
        assert_eq!(late.columns()[0].value(0), Some(Some("r4")));
        assert_eq!(early.columns()[0].value(0), Some(Some("r1")));
        assert_eq!(early.columns()[0].value(1), Some(Some("r2")));
    }

    #[test]
    fn scanner_plans_only_the_indexed_prefix_until_eof() {
        let mut scanner = CsvScanner::new(DelimitedOptions::csv()).expect("scanner");
        scanner
            .feed_chunk(0, b"a\nfirst\n", false)
            .expect("partial scan");
        let error = scanner
            .plan_range(RangeRequest::new(1, 1, 0, 1).expect("range"))
            .expect_err("next row is not indexed");
        assert_eq!(error.code(), ErrorCode::RangeNotIndexed);
    }

    #[test]
    fn range_decoder_can_be_fed_independently_from_the_scan() {
        let bytes = b"a\nr0\nr1\n";
        let source = MemorySource::open(bytes.to_vec(), DelimitedOptions::csv()).expect("source");
        let plan = source
            .scanner
            .plan_range(RangeRequest::new(1, 1, 0, 1).expect("range"))
            .expect("plan");
        let mut decoder = source.scanner.range_decoder(plan).expect("decoder");
        let offset = usize::try_from(plan.source_offset()).expect("offset");
        let result = decoder
            .feed_chunk(plan.source_offset(), &bytes[offset..], true)
            .expect("decode");
        let RangeDecodeStatus::Complete(batch) = result else {
            panic!("expected completed batch");
        };
        assert_eq!(batch.columns()[0].value(0), Some(Some("r1")));
    }

    #[test]
    fn strict_range_decoder_preserves_diagnostic_location() {
        let bytes = b"a,b\n1,2\n3\n";
        let mut options = DelimitedOptions::csv();
        options.mode = ParseMode::Strict;
        let mut scanner = CsvScanner::new(options).expect("scanner");
        scanner
            .feed_chunk(0, &bytes[..8], false)
            .expect("indexed prefix");
        let plan = scanner
            .plan_range(RangeRequest::new(0, 2, 0, 2).expect("range"))
            .expect("plan");
        let offset = usize::try_from(plan.source_offset()).expect("offset");
        let mut decoder = scanner.range_decoder(plan).expect("decoder");

        let error = decoder
            .feed_chunk(plan.source_offset(), &bytes[offset..], true)
            .expect_err("ragged range row must fail");
        assert_eq!(error.code(), ErrorCode::ParseFailed);
        assert_eq!(error.details()["kind"], "ragged-row");
        assert_eq!(error.details()["row"], 1);
        assert!(error.details().contains_key("byteOffset"));
    }

    #[test]
    fn versioned_delimited_compatibility_corpus_is_stable_across_chunk_sizes() {
        let corpus_root = Path::new(env!("CARGO_MANIFEST_DIR"))
            .join("test")
            .join("fixtures")
            .join("csv")
            .join("v1");
        if !corpus_root.exists() {
            // Repository-only compatibility fixtures are excluded from the
            // published crate archive, just like the shared protocol fixtures.
            return;
        }
        let manifest_source = fs::read_to_string(corpus_root.join("manifest.json"))
            .expect("read CSV/TSV corpus manifest");
        let manifest: CorpusManifest =
            serde_json::from_str(&manifest_source).expect("parse CSV/TSV corpus manifest");
        assert_eq!(
            manifest.version, 1,
            "update the fixture directory for a new corpus version"
        );
        assert!(!manifest.cases.is_empty(), "the corpus must contain cases");
        assert!(
            !manifest.chunk_sizes.is_empty(),
            "the corpus must exercise chunking"
        );

        let mut case_ids = HashSet::new();
        let mut chunk_sizes = HashSet::new();
        for chunk_size in &manifest.chunk_sizes {
            assert!(*chunk_size > 0, "chunk sizes must be positive");
            assert!(chunk_sizes.insert(chunk_size), "chunk sizes must be unique");
        }

        for case in &manifest.cases {
            assert!(
                case_ids.insert(&case.id),
                "case IDs must be unique: {}",
                case.id
            );
            let bytes = corpus_bytes(&corpus_root, case);
            for &chunk_size in &manifest.chunk_sizes {
                match &case.expect {
                    CorpusExpectation::Success {
                        metadata,
                        rows,
                        samples,
                        warnings,
                    } => assert_success_case(
                        case,
                        &bytes,
                        chunk_size,
                        metadata,
                        rows.as_deref(),
                        samples,
                        warnings,
                    ),
                    expected @ CorpusExpectation::Error { .. } => {
                        assert_error_case(case, &bytes, chunk_size, expected)
                    }
                }
            }
        }
    }

    fn corpus_bytes(corpus_root: &Path, case: &CorpusCase) -> Vec<u8> {
        let fixture_name = Path::new(&case.file);
        let mut components = fixture_name.components();
        assert!(
            matches!(components.next(), Some(Component::Normal(_))) && components.next().is_none(),
            "fixture paths must stay within their corpus version: {}",
            case.file
        );
        let path = corpus_root.join(fixture_name);
        let mut bytes = fs::read(&path)
            .unwrap_or_else(|error| panic!("read fixture {}: {error}", path.display()));
        assert!(
            !bytes.starts_with(UTF8_BOM),
            "fixture {} must declare its BOM in the manifest",
            case.file
        );

        if let Some(CorpusLineEndings::Crlf) = case.source.line_endings {
            let text = std::str::from_utf8(&bytes).unwrap_or_else(|error| {
                panic!("fixture {} must be UTF-8 text: {error}", case.file)
            });
            let normalized = text.replace("\r\n", "\n").replace('\r', "\n");
            bytes = normalized.replace('\n', "\r\n").into_bytes();
        }
        if case.source.strip_final_newline {
            if bytes.ends_with(b"\r\n") {
                bytes.truncate(bytes.len() - 2);
            } else if bytes.ends_with(b"\n") || bytes.ends_with(b"\r") {
                bytes.truncate(bytes.len() - 1);
            } else {
                panic!(
                    "fixture {} must end with a newline before stripFinalNewline",
                    case.file
                );
            }
        }
        if let Some(CorpusEncoding::Latin1) = case.source.encoding {
            let text = std::str::from_utf8(&bytes).unwrap_or_else(|error| {
                panic!("fixture {} must be UTF-8 review text: {error}", case.file)
            });
            bytes = text
                .chars()
                .map(|character| {
                    u8::try_from(u32::from(character)).unwrap_or_else(|_| {
                        panic!(
                            "fixture {} contains {:?}, which is outside Latin-1",
                            case.file, character
                        )
                    })
                })
                .collect();
        }
        if case.source.utf8_bom {
            let mut with_bom = Vec::with_capacity(UTF8_BOM.len() + bytes.len());
            with_bom.extend_from_slice(UTF8_BOM);
            with_bom.extend_from_slice(&bytes);
            bytes = with_bom;
        }
        bytes
    }

    fn corpus_options(case: &CorpusCase) -> DelimitedOptions {
        let mut options = match case.options.format {
            CorpusFormat::Csv => DelimitedOptions::csv(),
            CorpusFormat::Tsv => DelimitedOptions::tsv(),
        };
        options.header = case.options.header;
        options.mode = case.options.mode;
        options.checkpoint_interval = 1;
        options.table_name = format!("corpus:{}", case.id);
        options
    }

    fn assert_success_case(
        case: &CorpusCase,
        bytes: &[u8],
        chunk_size: usize,
        expected_metadata: &CorpusMetadata,
        expected_rows: Option<&[Vec<Option<String>>]>,
        expected_samples: &[CorpusSample],
        expected_warnings: &[CorpusDiagnostic],
    ) {
        let source =
            MemorySource::open_with_chunk_size(bytes.to_vec(), corpus_options(case), chunk_size)
                .unwrap_or_else(|error| {
                    panic!(
                        "case {} unexpectedly failed at chunk size {chunk_size}: {error:?}",
                        case.id
                    )
                });
        let metadata = source.metadata().unwrap_or_else(|error| {
            panic!(
                "case {} did not produce metadata at chunk size {chunk_size}: {error:?}",
                case.id
            )
        });

        assert_eq!(
            metadata.table_id(),
            "table-0",
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            metadata.name(),
            format!("corpus:{}", case.id),
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            metadata.extent().rows(),
            AxisExtent::Exact {
                value: expected_metadata.rows
            },
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            metadata.extent().columns(),
            AxisExtent::Exact {
                value: u64::try_from(expected_metadata.columns.len()).expect("column count")
            },
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            metadata.schema().version(),
            expected_metadata.schema_version,
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            metadata.capabilities().random_access(),
            RandomAccess::Full,
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            metadata
                .schema()
                .columns()
                .iter()
                .map(|column| column.name())
                .collect::<Vec<_>>(),
            expected_metadata.columns,
            "case {} chunk {chunk_size}",
            case.id
        );
        for (index, column) in metadata.schema().columns().iter().enumerate() {
            assert_eq!(
                column.id(),
                format!("c{index}"),
                "case {} chunk {chunk_size}",
                case.id
            );
            assert_eq!(
                column.index(),
                u64::try_from(index).expect("column index"),
                "case {} chunk {chunk_size}",
                case.id
            );
            assert_eq!(
                column.data_type(),
                &TableDataType::Utf8,
                "case {} chunk {chunk_size}",
                case.id
            );
            assert!(column.nullable(), "case {} chunk {chunk_size}", case.id);
        }

        assert!(
            expected_rows.is_some() || !expected_samples.is_empty(),
            "case {} must declare full rows or sampled rows",
            case.id
        );
        if let Some(expected_rows) = expected_rows {
            assert_eq!(
                expected_rows.len(),
                usize::try_from(expected_metadata.rows).expect("row count"),
                "case {} manifest metadata and batch rows disagree",
                case.id
            );
        }
        for row in expected_rows.into_iter().flatten() {
            assert_eq!(
                row.len(),
                expected_metadata.columns.len(),
                "case {} has a non-rectangular expected batch",
                case.id
            );
        }
        let mut sampled_rows = HashSet::new();
        for sample in expected_samples {
            assert!(
                sample.row < expected_metadata.rows,
                "case {} sample row {} exceeds the table",
                case.id,
                sample.row
            );
            assert!(
                sampled_rows.insert(sample.row),
                "case {} repeats sample row {}",
                case.id,
                sample.row
            );
            assert_eq!(
                sample.values.len(),
                expected_metadata.columns.len(),
                "case {} sample row {} has the wrong width",
                case.id,
                sample.row
            );
        }

        let warnings = source.scanner.diagnostics();
        assert_eq!(
            warnings.len(),
            expected_warnings.len(),
            "case {} chunk {chunk_size}",
            case.id
        );
        for (actual, expected) in warnings.iter().zip(expected_warnings) {
            assert_eq!(
                actual.kind(),
                expected.kind,
                "case {} chunk {chunk_size}",
                case.id
            );
            assert_eq!(
                actual.row(),
                expected.row,
                "case {} chunk {chunk_size}",
                case.id
            );
            assert_eq!(
                actual.byte_offset(),
                expected.byte_offset,
                "case {} chunk {chunk_size}",
                case.id
            );
            assert!(
                actual.message().contains(&expected.message_contains),
                "case {} chunk {chunk_size}: expected warning to contain {:?}, got {:?}",
                case.id,
                expected.message_contains,
                actual.message()
            );
        }

        let rows = expected_metadata.rows;
        let columns = u64::try_from(expected_metadata.columns.len()).expect("column count");
        let full_request = RangeRequest::new(0, rows, 0, columns).expect("full range");
        let full_batch = source.read_range(full_request).unwrap_or_else(|error| {
            panic!(
                "case {} did not decode full batch at chunk size {chunk_size}: {error:?}",
                case.id
            )
        });
        if let Some(expected_rows) = expected_rows {
            assert_batch(
                &full_batch,
                full_request,
                true,
                expected_rows,
                expected_metadata.schema_version,
                &case.id,
                chunk_size,
            );
        } else {
            assert_batch_shape(
                &full_batch,
                full_request,
                true,
                usize::try_from(rows).expect("row count"),
                expected_metadata.schema_version,
                &case.id,
                chunk_size,
            );
        }

        let overrun_request = RangeRequest::new(0, rows + 1, 0, columns).expect("overrun range");
        let overrun_batch = source.read_range(overrun_request).unwrap_or_else(|error| {
            panic!(
                "case {} did not decode overrun batch at chunk size {chunk_size}: {error:?}",
                case.id
            )
        });
        let returned_overrun = RangeRequest::new(0, rows, 0, columns).expect("returned range");
        if let Some(expected_rows) = expected_rows {
            assert_batch(
                &overrun_batch,
                returned_overrun,
                false,
                expected_rows,
                expected_metadata.schema_version,
                &case.id,
                chunk_size,
            );
        } else {
            assert_batch_shape(
                &overrun_batch,
                returned_overrun,
                false,
                usize::try_from(rows).expect("row count"),
                expected_metadata.schema_version,
                &case.id,
                chunk_size,
            );
        }

        for sample in expected_samples {
            let sample_request =
                RangeRequest::new(sample.row, 1, 0, columns).expect("sample range");
            let sample_batch = source.read_range(sample_request).unwrap_or_else(|error| {
                panic!(
                    "case {} did not decode sample row {} at chunk size {chunk_size}: {error:?}",
                    case.id, sample.row
                )
            });
            assert_batch(
                &sample_batch,
                sample_request,
                true,
                std::slice::from_ref(&sample.values),
                expected_metadata.schema_version,
                &case.id,
                chunk_size,
            );
        }

        if rows > 0 && columns > 0 {
            let last_row = usize::try_from(rows - 1).expect("last row");
            let last_column = usize::try_from(columns - 1).expect("last column");
            let expected_last_cell = expected_rows
                .map(|rows| rows[last_row][last_column].clone())
                .or_else(|| {
                    expected_samples
                        .iter()
                        .find(|sample| sample.row == rows - 1)
                        .map(|sample| sample.values[last_column].clone())
                })
                .unwrap_or_else(|| {
                    panic!(
                        "case {} with sampled rows must include its last row",
                        case.id
                    )
                });
            let last_cell_request =
                RangeRequest::new(rows - 1, 1, columns - 1, 1).expect("last-cell range");
            let last_cell_batch = source.read_range(last_cell_request).unwrap_or_else(|error| {
                panic!(
                    "case {} did not decode checkpointed batch at chunk size {chunk_size}: {error:?}",
                    case.id
                )
            });
            assert_batch(
                &last_cell_batch,
                last_cell_request,
                true,
                &[vec![expected_last_cell]],
                expected_metadata.schema_version,
                &case.id,
                chunk_size,
            );
        }
    }

    fn assert_error_case(
        case: &CorpusCase,
        bytes: &[u8],
        chunk_size: usize,
        expected: &CorpusExpectation,
    ) {
        let CorpusExpectation::Error {
            code: expected_code,
            kind: expected_kind,
            row: expected_row,
            byte_offset: expected_byte_offset,
            message_contains: expected_message,
        } = expected
        else {
            unreachable!("error assertion requires an error expectation");
        };
        let error =
            MemorySource::open_with_chunk_size(bytes.to_vec(), corpus_options(case), chunk_size)
                .expect_err("strict corpus case must fail");
        assert_eq!(
            error.code(),
            *expected_code,
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            error
                .details()
                .get("kind")
                .and_then(serde_json::Value::as_str),
            Some(match expected_kind {
                CsvDiagnosticKind::RaggedRow => "ragged-row",
                CsvDiagnosticKind::InvalidUtf8 => "invalid-utf8",
                CsvDiagnosticKind::MalformedQuote => "malformed-quote",
            }),
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            error
                .details()
                .get("row")
                .and_then(serde_json::Value::as_u64),
            *expected_row,
            "case {} chunk {chunk_size}",
            case.id
        );
        assert_eq!(
            error
                .details()
                .get("byteOffset")
                .and_then(serde_json::Value::as_u64),
            Some(*expected_byte_offset),
            "case {} chunk {chunk_size}",
            case.id
        );
        assert!(
            error.message().contains(expected_message),
            "case {} chunk {chunk_size}: expected error to contain {:?}, got {:?}",
            case.id,
            expected_message,
            error.message()
        );
    }

    fn assert_batch(
        batch: &TableBatch,
        expected_range: RangeRequest,
        expected_complete: bool,
        expected_rows: &[Vec<Option<String>>],
        expected_schema_version: u64,
        case_id: &str,
        chunk_size: usize,
    ) {
        assert_batch_shape(
            batch,
            expected_range,
            expected_complete,
            expected_rows.len(),
            expected_schema_version,
            case_id,
            chunk_size,
        );
        for (column_index, column) in batch.columns().iter().enumerate() {
            for (row_index, expected_row) in expected_rows.iter().enumerate() {
                assert_eq!(
                    column.value(row_index),
                    Some(expected_row[column_index].as_deref()),
                    "case {case_id} chunk {chunk_size}, row {row_index}, column {column_index}"
                );
            }
        }
    }

    fn assert_batch_shape(
        batch: &TableBatch,
        expected_range: RangeRequest,
        expected_complete: bool,
        expected_row_count: usize,
        expected_schema_version: u64,
        case_id: &str,
        chunk_size: usize,
    ) {
        assert_eq!(
            batch.table_id(),
            "table-0",
            "case {case_id} chunk {chunk_size}"
        );
        assert_eq!(batch.revision(), 0, "case {case_id} chunk {chunk_size}");
        assert_eq!(
            batch.schema_version(),
            expected_schema_version,
            "case {case_id} chunk {chunk_size}"
        );
        assert_eq!(
            batch.range(),
            expected_range,
            "case {case_id} chunk {chunk_size}"
        );
        assert_eq!(
            batch.complete(),
            expected_complete,
            "case {case_id} chunk {chunk_size}"
        );
        assert_eq!(
            batch.columns().len(),
            usize::try_from(expected_range.column_count()).expect("column count"),
            "case {case_id} chunk {chunk_size}"
        );
        for (column_index, column) in batch.columns().iter().enumerate() {
            assert_eq!(
                column.column_id(),
                format!(
                    "c{}",
                    expected_range.column_start()
                        + u64::try_from(column_index).expect("column index")
                ),
                "case {case_id} chunk {chunk_size}"
            );
            assert_eq!(
                column.len(),
                expected_row_count,
                "case {case_id} chunk {chunk_size}"
            );
        }
    }
}