1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
use crate::config::SamplerConfig;
use crate::constants::splits::is_reserved_source_id;
use crate::data::DataRecord;
use crate::errors::SamplerError;
use crate::hash::derive_epoch_seed;
use crate::source::{DataSource, SourceCursor, SourceSnapshot};
use crate::types::{RecordId, RecordKey, SourceId};
use chrono::Utc;
use indexmap::IndexMap;
use std::collections::HashMap;
use std::collections::VecDeque;
use std::sync::{Arc, Condvar, Mutex, RwLock};
use std::thread;
use std::time::Duration;
use tracing::{debug, warn};
/// Thread-safe in-memory cache of ingested records keyed by record id.
#[derive(Clone)]
pub struct RecordCache {
inner: Arc<RwLock<RecordCacheInner>>,
notifier: Arc<(Mutex<CacheStats>, Condvar)>,
}
/// Internal mutable cache storage behind `RecordCache` locks.
struct RecordCacheInner {
records: IndexMap<RecordId, CachedRecord>,
order: VecDeque<RecordId>,
max_records: usize,
next_version: u64,
/// Log of evicted record IDs with their version numbers for delta sync.
eviction_log: VecDeque<(u64, RecordId)>,
}
/// Internal cache entry plus monotonic version marker.
struct CachedRecord {
record: Arc<DataRecord>,
version: u64,
}
/// Internal ingest notification counters.
#[derive(Default)]
struct CacheStats {
ingests: u64,
}
impl RecordCache {
/// Create a cache capped to at most `max_records` live records.
pub fn new(max_records: usize) -> Self {
Self {
inner: Arc::new(RwLock::new(RecordCacheInner {
records: IndexMap::new(),
order: VecDeque::new(),
max_records,
next_version: 0,
eviction_log: VecDeque::new(),
})),
notifier: Arc::new((Mutex::new(CacheStats::default()), Condvar::new())),
}
}
/// Ingest a batch of records, replacing existing entries by id.
pub fn ingest<I>(&self, records: I)
where
I: IntoIterator<Item = DataRecord>,
{
let mut batch: Vec<DataRecord> = records.into_iter().collect();
if batch.is_empty() {
return;
}
let mut inner = self.inner.write().expect("record cache poisoned");
inner.ingest_batch(&mut batch);
drop(inner);
let (lock, cvar) = &*self.notifier;
let mut stats = lock.lock().expect("record cache stats poisoned");
stats.ingests = stats.ingests.saturating_add(1);
cvar.notify_all();
}
/// Ingest a batch of records with an explicit version number from the global counter.
pub fn ingest_with_version<I>(&self, records: I, version: u64)
where
I: IntoIterator<Item = DataRecord>,
{
let mut batch: Vec<DataRecord> = records.into_iter().collect();
if batch.is_empty() {
return;
}
let mut inner = self.inner.write().expect("record cache poisoned");
inner.ingest_batch_with_version(&mut batch, version);
drop(inner);
let (lock, cvar) = &*self.notifier;
let mut stats = lock.lock().expect("record cache stats poisoned");
stats.ingests = stats.ingests.saturating_add(1);
cvar.notify_all();
}
/// Remove all cached records.
pub fn clear(&self) {
let mut inner = self.inner.write().expect("record cache poisoned");
// Log evictions so a subsequent `sync_delta` reports records removed
// by the clear (e.g. force-refresh replacing the pool) and the sampler
// can prune `emitted_text_hashes` / `split_labels` for IDs that truly
// left. The version is bumped so entries survive the
// `version > last_version` filter in `sync_delta`; the sampler keeps
// state for IDs simultaneously re-added (see `sync_records_from_cache`
// evicted-minus-added guard). The log stays bounded at `max_records`
// (same bound as `enforce_limit`).
if !inner.records.is_empty() {
inner.next_version = inner.next_version.saturating_add(1);
let version = inner.next_version;
let evicted: Vec<RecordId> = inner.records.keys().cloned().collect();
for id in evicted {
inner.eviction_log.push_back((version, id));
}
while inner.eviction_log.len() > inner.max_records {
inner.eviction_log.pop_front();
}
}
inner.records.clear();
inner.order.clear();
}
/// Return a snapshot of current cached records as Arc references (cheap clone).
pub fn snapshot(&self) -> Vec<Arc<DataRecord>> {
let inner = self.inner.read().expect("record cache poisoned");
inner
.records
.values()
.map(|entry| Arc::clone(&entry.record))
.collect()
}
/// Return the number of completed ingest operations.
pub fn ingest_count(&self) -> u64 {
let (lock, _) = &*self.notifier;
lock.lock().expect("record cache stats poisoned").ingests
}
/// Wait until ingest count exceeds `last_seen`, or until timeout elapses.
pub fn wait_for_ingest(&self, last_seen: u64, timeout: Duration) -> u64 {
let (lock, cvar) = &*self.notifier;
let mut stats = lock.lock().expect("record cache stats poisoned");
while stats.ingests <= last_seen {
let result = cvar
.wait_timeout(stats, timeout)
.expect("record cache stats poisoned");
stats = result.0;
if result.1.timed_out() {
break;
}
}
stats.ingests
}
/// Wait indefinitely until ingest count exceeds `last_seen`.
pub fn wait_for_ingest_blocking(&self, last_seen: u64) -> u64 {
let (lock, cvar) = &*self.notifier;
let mut stats = lock.lock().expect("record cache stats poisoned");
while stats.ingests <= last_seen {
stats = cvar.wait(stats).expect("record cache stats poisoned");
}
stats.ingests
}
/// Returns `true` when the cache has no records.
pub fn is_empty(&self) -> bool {
let inner = self.inner.read().expect("record cache poisoned");
inner.records.is_empty()
}
/// Return the number of records currently cached.
pub fn len(&self) -> usize {
let inner = self.inner.read().expect("record cache poisoned");
inner.records.len()
}
/// Return a delta of records added since `last_version` and record IDs evicted since `last_version`.
pub fn sync_delta(&self, last_version: u64) -> (u64, Vec<Arc<DataRecord>>, Vec<RecordId>) {
let mut inner = self.inner.write().expect("record cache poisoned");
inner.sync_delta(last_version)
}
}
impl RecordCacheInner {
fn ingest_batch(&mut self, records: &mut Vec<DataRecord>) {
for record in records.drain(..) {
self.next_version = self.next_version.saturating_add(1);
let record_id = record.id.clone();
if self.records.contains_key(&record_id) {
if let Some(entry) = self.records.get_mut(&record_id) {
entry.record = Arc::new(record);
entry.version = self.next_version;
}
Self::refresh_order(&mut self.order, &record_id);
self.order.push_back(record_id);
} else {
self.order.push_back(record_id.clone());
self.records.insert(
record_id,
CachedRecord {
record: Arc::new(record),
version: self.next_version,
},
);
}
self.enforce_limit();
}
}
fn ingest_batch_with_version(&mut self, records: &mut Vec<DataRecord>, version: u64) {
for record in records.drain(..) {
self.next_version = version;
let record_id = record.id.clone();
if self.records.contains_key(&record_id) {
if let Some(entry) = self.records.get_mut(&record_id) {
entry.record = Arc::new(record);
entry.version = version;
}
Self::refresh_order(&mut self.order, &record_id);
self.order.push_back(record_id);
} else {
self.order.push_back(record_id.clone());
self.records.insert(
record_id,
CachedRecord {
record: Arc::new(record),
version,
},
);
}
self.enforce_limit();
}
}
fn enforce_limit(&mut self) {
if self.max_records == 0 {
self.records.clear();
self.order.clear();
return;
}
while self.records.len() > self.max_records {
if let Some(oldest) = self.order.pop_front() {
self.records.swap_remove(&oldest);
// Log the eviction for delta sync
self.eviction_log.push_back((self.next_version, oldest));
// Bound eviction_log to max_records to prevent unbounded growth
while self.eviction_log.len() > self.max_records {
self.eviction_log.pop_front();
}
} else {
break;
}
}
}
fn refresh_order(order: &mut VecDeque<RecordId>, id: &RecordId) {
if order.is_empty() {
return;
}
if let Some(pos) = order.iter().position(|existing| existing == id) {
order.remove(pos);
}
}
/// Return a delta of records added since `last_version` and record IDs evicted since `last_version`.
fn sync_delta(&mut self, last_version: u64) -> (u64, Vec<Arc<DataRecord>>, Vec<RecordId>) {
// Drain eviction log entries where version <= last_version.
// This preserves entries for version watermarks that haven't synced yet.
self.eviction_log.retain(|&(v, _)| v > last_version);
// Collect added records (version > last_version)
let added: Vec<Arc<DataRecord>> = self
.records
.values()
.filter(|entry| entry.version > last_version)
.map(|entry| Arc::clone(&entry.record))
.collect();
// Collect evicted IDs since last_version
let evicted: Vec<RecordId> = self.eviction_log.iter().map(|(_, id)| id.clone()).collect();
// Do NOT clear eviction_log here — retain entries for watermarks
// that haven't called sync_delta yet. enforce_limit() handles
// bounding the log size.
(self.next_version, added, evicted)
}
}
/// Coordinates on-demand source refresh and per-source-cache population.
pub struct IngestionManager {
sources: Vec<SourceState>,
max_records: usize,
sampler_config: SamplerConfig,
/// Current epoch used to vary per-source permutation seeds across epochs.
epoch: u64,
/// Monotonic generation incremented whenever at least one source is refreshed.
source_refresh_generation: u64,
/// Source ids refreshed during the most recent `refresh_all_internal` call.
///
/// This is updated even when cache ingest does not change, and is cleared when
/// no source refresh occurs in that cycle.
last_refreshed_sources: Vec<SourceId>,
/// Rotating start index for the round-robin buffer drain. Instead of always
/// draining from source 0 (which starves high-index sources of refresh
/// opportunities), each cycle begins at this position and advances by one.
/// Over N cycles every source is drained first exactly once.
drain_start: usize,
/// Monotonic step counter incremented on every advance/refresh_all and set
/// on SourceCursor.step so all sources can observe per-call progress.
epoch_step: u64,
/// Global monotonic version counter shared across all source caches.
/// Ensures a single, monotonic version timeline across all registered sources.
global_next_version: u64,
/// Monotonic generation incremented on every force-refresh cycle (cache
/// clear + refill). The sampler watches this to fall back to a full
/// record-pool resync after force refreshes, restoring exact full-snapshot
/// semantics on that path while steady-state advances keep the O(Δ) delta
/// fast path. Reset-type clears that do NOT refill (e.g. epoch stream
/// cursor resets) do not touch this counter.
force_refresh_generation: u64,
}
#[derive(Clone, Debug, Default)]
/// Last-refresh telemetry captured per source.
pub struct SourceRefreshStats {
/// Duration of the most recent refresh in milliseconds.
pub last_refresh_ms: u128,
/// Number of records returned by the most recent refresh.
pub last_record_count: usize,
/// Throughput estimate from the most recent refresh.
pub last_records_per_sec: f64,
/// Last refresh error message, if any.
pub last_error: Option<String>,
/// Total refresh failures seen for this source.
pub error_count: u64,
}
impl IngestionManager {
/// Create a new ingestion manager that ingests on demand.
pub fn new(max_records: usize, sampler_config: SamplerConfig) -> Self {
Self {
sources: Vec::new(),
max_records,
sampler_config,
epoch: 0,
source_refresh_generation: 0,
last_refreshed_sources: Vec::new(),
drain_start: 0,
epoch_step: 0,
global_next_version: 0,
force_refresh_generation: 0,
}
}
/// Return a monotonic generation for source refresh cycles.
pub fn source_refresh_generation(&self) -> u64 {
self.source_refresh_generation
}
/// Return the force-refresh generation. Incremented once per
/// force-refresh cycle; see the field docs.
pub fn force_refresh_generation(&self) -> u64 {
self.force_refresh_generation
}
/// Return source ids refreshed by the most recent refresh cycle.
pub fn last_refreshed_sources(&self) -> &[SourceId] {
&self.last_refreshed_sources
}
/// Update the current epoch value so subsequent `refresh` calls pass
/// `seed ^ epoch` to sources, producing a different permutation.
/// Stream cursors are intentionally NOT reset here — the cursor is a raw
/// I/O offset into the source's stream and must continue advancing so
/// every record is eventually fetched (resetting it would repeat the
/// leading slice of the source on every epoch boundary).
pub(crate) fn set_epoch(&mut self, epoch: u64) {
self.epoch = epoch;
}
/// Reset epoch step counter to 0 (called at epoch boundaries).
/// The step counter is a sub-counter within an epoch: each epoch starts
/// with step=0 so that batch calls produce deterministic seeds.
pub(crate) fn reset_epoch_step(&mut self) {
self.epoch_step = 0;
}
/// Increment epoch step counter by 1. Called once per `next_*_batch` call so that
/// the epoch step tracks model training steps, not ingestion refresh events.
pub(crate) fn increment_epoch_step(&mut self) {
self.epoch_step = self.epoch_step.saturating_add(1);
}
/// Return the current epoch step counter.
pub fn epoch_step(&self) -> u64 {
self.epoch_step
}
/// Set the epoch step counter directly (used when restoring persisted state).
pub(crate) fn set_epoch_step(&mut self, step: u64) {
self.epoch_step = step;
}
/// Return the current epoch.
#[cfg(test)]
pub fn epoch(&self) -> u64 {
self.epoch
}
/// Reset all raw source stream cursors and drain per-source buffers.
///
/// Use this only when starting a deterministic replay from a specific
/// epoch (e.g. explicit `set_epoch` calls). A clean-start reset ensures
/// the new permutation begins at position 0 of the permuted index space.
pub(crate) fn reset_stream_cursors(&mut self) {
for state in &mut self.sources {
state.cursor = None;
state.buffer.clear();
state.cache.clear();
}
}
/// Register a source for on-demand ingestion.
///
/// Returns an error if the source's `id()` matches the reserved `__*__`
/// pattern used for internal synthetic/metadata source identifiers.
pub fn register_source(
&mut self,
source: Box<dyn DataSource + 'static>,
) -> Result<(), SamplerError> {
let source_id = source.id().to_string();
if is_reserved_source_id(&source_id) {
return Err(SamplerError::ReservedSourceId(source_id));
}
let cache = RecordCache::new(self.max_records);
self.sources.push(SourceState {
source,
cursor: None,
buffer: VecDeque::new(),
cache,
stats: SourceRefreshStats::default(),
});
Ok(())
}
/// Load persisted per-source stream cursors.
pub fn load_cursors(&mut self, cursors: &[(SourceId, u64)]) {
if cursors.is_empty() {
return;
}
let mut map = std::collections::HashMap::with_capacity(cursors.len());
for (id, revision) in cursors {
map.insert(id.as_str(), *revision);
}
for state in &mut self.sources {
if let Some(revision) = map.get(state.source.id()) {
state.cursor = Some(SourceCursor {
last_seen: Utc::now(),
revision: *revision,
});
}
}
}
/// Snapshot current per-source stream cursors.
pub fn snapshot_cursors(&self) -> Vec<(SourceId, u64)> {
let mut out = Vec::new();
for state in &self.sources {
if let Some(cursor) = state.cursor.as_ref() {
out.push((state.source.id().to_string(), cursor.revision));
}
}
out
}
/// Return latest refresh telemetry for each registered source.
pub fn source_refresh_stats(&self) -> Vec<(SourceId, SourceRefreshStats)> {
self.sources
.iter()
.map(|state| (state.source.id().to_string(), state.stats.clone()))
.collect()
}
/// Return a flat snapshot of every record currently in all per-source caches.
///
/// Records are returned as Arc references (cheap clone); the `source` field
/// is guaranteed to be set (it is normalised in `refresh_all_internal`).
pub fn all_records_snapshot(&self) -> Vec<Arc<DataRecord>> {
self.sources
.iter()
.flat_map(|s| s.cache.snapshot())
.collect()
}
/// Returns `true` when ALL per-source caches are empty.
pub fn all_caches_empty(&self) -> bool {
self.sources.iter().all(|s| s.cache.is_empty())
}
/// Returns the total number of records across all per-source caches.
pub fn all_records_len(&self) -> usize {
self.sources.iter().map(|s| s.cache.len()).sum()
}
/// Returns the sum of ingest counts across all per-source caches.
///
/// Used as a monotonic proxy to detect whether any cache has been updated
/// since the last sync.
pub fn total_ingest_count(&self) -> u64 {
self.sources.iter().map(|s| s.cache.ingest_count()).sum()
}
/// Refresh all registered sources once.
pub fn refresh_all(&mut self) {
self.refresh_all_internal(false, None, None);
}
/// Advance the ingestion window by ingesting `step` new records.
pub fn advance(&mut self, step: usize) {
self.refresh_all_internal(false, Some(step), None);
}
/// Advance the ingestion window by ingesting `step` new records with weights.
///
/// Returns `Err(SamplerError::InvalidWeight)` if `weights` contains an unregistered
/// source ID or a negative value.
pub fn advance_with_weights(
&mut self,
step: usize,
weights: &HashMap<SourceId, f32>,
) -> Result<(), SamplerError> {
self.validate_weights(weights)?;
self.refresh_all_internal(false, Some(step), Some(weights));
Ok(())
}
/// Force refresh all registered sources, discarding buffered records.
pub fn force_refresh_all(&mut self) {
self.refresh_all_internal(true, None, None);
}
/// Refresh all registered sources once with per-call source weights.
///
/// Returns `Err(SamplerError::InvalidWeight)` if `weights` contains an unregistered
/// source ID or a negative value.
pub fn refresh_all_with_weights(
&mut self,
weights: &HashMap<SourceId, f32>,
) -> Result<(), SamplerError> {
self.validate_weights(weights)?;
self.refresh_all_internal(false, None, Some(weights));
Ok(())
}
/// Force refresh all registered sources with per-call source weights.
///
/// Returns `Err(SamplerError::InvalidWeight)` if `weights` contains an unregistered
/// source ID or a negative value.
pub fn force_refresh_all_with_weights(
&mut self,
weights: &HashMap<SourceId, f32>,
) -> Result<(), SamplerError> {
self.validate_weights(weights)?;
self.refresh_all_internal(true, None, Some(weights));
Ok(())
}
pub(crate) fn validate_weights(
&self,
weights: &HashMap<SourceId, f32>,
) -> Result<(), SamplerError> {
let known_ids: std::collections::HashSet<&str> =
self.sources.iter().map(|s| s.source.id()).collect();
for (id, &w) in weights {
if !known_ids.contains(id.as_str()) {
return Err(SamplerError::InvalidWeight {
source_id: id.clone(),
reason: "source is not registered".to_string(),
});
}
if w < 0.0 {
return Err(SamplerError::InvalidWeight {
source_id: id.clone(),
reason: format!("weight {w} is negative"),
});
}
}
Ok(())
}
/// Rebuild the shared cache by round-robin draining per-source buffers.
///
/// When `force_refresh` is false, each source only refreshes when its buffer
/// is empty; when true, all buffers are cleared and all sources refresh.
/// If `step` is provided, performs a rolling update of `step` records (no clear).
/// If `step` is None, clears the cache and fills up to max capacity.
fn refresh_all_internal(
&mut self,
force_refresh: bool,
step: Option<usize>,
weights: Option<&HashMap<SourceId, f32>>,
) {
self.last_refreshed_sources.clear();
if force_refresh {
// Bump before clearing/refilling so a subsequent delta sync can
// observe that a full pool replacement happened and fall back to
// full-resync semantics (see `sync_records_from_cache`).
self.force_refresh_generation = self.force_refresh_generation.saturating_add(1);
}
let mut refresh_plan = Vec::new();
for (idx, state) in self.sources.iter_mut().enumerate() {
if force_refresh {
state.buffer.clear();
}
if force_refresh || state.buffer.is_empty() {
refresh_plan.push((idx, state.cursor.clone()));
}
}
if !refresh_plan.is_empty() {
self.source_refresh_generation = self.source_refresh_generation.saturating_add(1);
self.last_refreshed_sources = refresh_plan
.iter()
.map(|(idx, _)| self.sources[*idx].source.id().to_string())
.collect();
let mut results: Vec<
Option<(Result<SourceSnapshot, SamplerError>, std::time::Duration)>,
> = Vec::with_capacity(self.sources.len());
results.resize_with(self.sources.len(), || None);
let fetch_limit = self.max_records;
let sampler_config = self.sampler_config.clone();
let step = self.epoch_step;
thread::scope(|scope| {
let mut handles = Vec::with_capacity(refresh_plan.len());
for (idx, cursor) in &refresh_plan {
let source = &self.sources[*idx].source;
let cursor = cursor.clone();
let sampler_config = sampler_config.clone();
let epoch = self.epoch;
handles.push((
*idx,
scope.spawn(move || {
let start = std::time::Instant::now();
// XOR the source epoch into the seed so each epoch
// produces a distinct permutation within the source.
// XOR the step counter into the seed so every
// advance/refresh call gets a distinct seed, which
// sources can use for e.g. shard ordering.
let epoch_config = SamplerConfig {
seed: derive_epoch_seed(sampler_config.seed, epoch) ^ step,
..sampler_config
};
let result =
source.refresh(&epoch_config, cursor.as_ref(), Some(fetch_limit));
let elapsed = start.elapsed();
(result, elapsed)
}),
));
}
for (idx, handle) in handles {
let result = match handle.join() {
Ok((result, elapsed)) => {
debug!(
source_id = %self.sources[idx].source.id(),
refresh_ms = elapsed.as_millis(),
"source refresh completed"
);
(result, elapsed)
}
Err(_) => (
Err(SamplerError::SourceUnavailable {
source_id: self.sources[idx].source.id().to_string(),
reason: "source refresh thread panicked".into(),
}),
std::time::Duration::from_secs(0),
),
};
results[idx] = Some(result);
}
});
for (idx, _) in refresh_plan {
let Some((result, elapsed)) = results[idx].take() else {
continue;
};
match result {
Ok(snapshot) => {
let SourceSnapshot {
records,
cursor: next_cursor,
} = snapshot;
let record_count = records.len();
let seconds = elapsed.as_secs_f64();
let per_sec = if seconds > 0.0 {
(record_count as f64) / seconds
} else {
0.0
};
let stats = &mut self.sources[idx].stats;
stats.last_refresh_ms = elapsed.as_millis();
stats.last_record_count = record_count;
stats.last_records_per_sec = per_sec;
stats.last_error = None;
debug!(
source_id = %self.sources[idx].source.id(),
record_count,
refresh_ms = elapsed.as_millis(),
records_per_sec = per_sec,
"source refresh ingested records"
);
let source_id = self.sources[idx].source.id().to_string();
let normalized = records
.into_iter()
.map(|mut record| {
record.source = source_id.clone();
record
})
.collect::<Vec<_>>();
self.sources[idx].buffer.extend(normalized);
self.sources[idx].cursor = Some(next_cursor);
}
Err(err) => {
let stats = &mut self.sources[idx].stats;
stats.last_refresh_ms = elapsed.as_millis();
stats.last_record_count = 0;
stats.last_records_per_sec = 0.0;
stats.last_error = Some(err.to_string());
stats.error_count = stats.error_count.saturating_add(1);
warn!(
source = %self.sources[idx].source.id(),
error = %err,
"Source refresh failed"
);
}
}
}
}
// On a full refresh (step=None) clear every per-source cache so that the
// snapshot always reflects the newest window, matching the previous
// shared-cache clear semantics.
if step.is_none() {
for state in self.sources.iter_mut() {
state.cache.clear();
}
}
if self.max_records == 0 {
return;
}
let target_limit = step.unwrap_or(self.max_records);
if let Some(weights) = weights {
self.weighted_drain_into_caches(target_limit, weights);
} else {
// Fair round-robin drain: start from `drain_start` instead of 0 so
// that the drain cursor rotates across cycles. This prevents head
// sources (low indices) from always draining faster than tail sources,
// which was starving tail sources of refresh opportunities.
let n = self.sources.len();
if n > 0 {
let mut per_source: Vec<Vec<DataRecord>> = vec![Vec::new(); n];
let mut total_drained = 0;
let mut any_remaining = true;
while total_drained < target_limit && any_remaining {
any_remaining = false;
for offset in 0..n {
if total_drained >= target_limit {
break;
}
let idx = (self.drain_start + offset) % n;
if let Some(record) = self.sources[idx].buffer.pop_front() {
per_source[idx].push(record);
total_drained += 1;
any_remaining = true;
}
}
}
// Advance the drain cursor so the next cycle starts from a different
// position. Only advance when at least one record was drained, so a
// burst of drain-noop cycles on an empty source list doesn't rotate.
if total_drained > 0 {
self.drain_start = (self.drain_start + 1) % n;
}
// Increment global version for this batch
self.global_next_version = self.global_next_version.saturating_add(1);
for (idx, batch) in per_source.into_iter().enumerate() {
if !batch.is_empty() {
self.sources[idx]
.cache
.ingest_with_version(batch, self.global_next_version);
}
}
}
}
}
fn weighted_drain_into_caches(&mut self, limit: usize, weights: &HashMap<SourceId, f32>) {
let len = self.sources.len();
if len == 0 {
return;
}
let mut weight_values = Vec::with_capacity(len);
let mut any_positive = false;
for state in &self.sources {
let weight = weights.get(state.source.id()).copied().unwrap_or(1.0);
if weight > 0.0 {
any_positive = true;
}
weight_values.push(weight);
}
if !any_positive {
weight_values.fill(1.0);
}
let mut current = vec![0.0f32; len];
let mut per_source: Vec<Vec<DataRecord>> = vec![Vec::new(); len];
let mut total = 0;
while total < limit {
let mut total_weight = 0.0f32;
for (idx, weight) in weight_values.iter().copied().enumerate().take(len) {
if weight <= 0.0 {
continue;
}
if self.sources[idx].buffer.is_empty() {
continue;
}
total_weight += weight;
}
if total_weight == 0.0 {
break;
}
let mut best_idx = None;
let mut best_score = f32::MIN;
// Rotating tie-breaker: when scores are equal, prefer the source
// just PAST drain_start in rotation order (i.e. the source whose
// turn is coming up in the round-robin).
let closer_to_start = |a: usize, b: usize| -> bool {
let da = (a + len - self.drain_start) % len;
let db = (b + len - self.drain_start) % len;
da < db
};
for idx in 0..len {
if weight_values[idx] <= 0.0 {
continue;
}
if self.sources[idx].buffer.is_empty() {
continue;
}
current[idx] += weight_values[idx];
let is_better = if current[idx] > best_score {
true
} else if current[idx] == best_score {
closer_to_start(idx, best_idx.unwrap_or(0))
} else {
false
};
if is_better {
best_score = current[idx];
best_idx = Some(idx);
}
}
let idx = match best_idx {
Some(idx) => idx,
None => break,
};
current[idx] -= total_weight;
if let Some(record) = self.sources[idx].buffer.pop_front() {
per_source[idx].push(record);
total += 1;
}
}
if total > 0 && len > 0 {
self.drain_start = (self.drain_start + 1) % len;
}
// Increment global version for this batch
self.global_next_version = self.global_next_version.saturating_add(1);
for (idx, batch) in per_source.into_iter().enumerate() {
if !batch.is_empty() {
self.sources[idx]
.cache
.ingest_with_version(batch, self.global_next_version);
}
}
}
/// Returns `true` when at least one source is registered.
pub fn has_sources(&self) -> bool {
!self.sources.is_empty()
}
/// Return a delta of records added since `last_version` and record keys
/// evicted since `last_version`. Evicted ids are scoped to their source
/// here (per-source caches key by bare id, which is only unique within
/// one source). Queries all child caches using the unified version
/// watermark and aggregates the results.
pub fn sync_delta(&mut self, last_version: u64) -> (u64, Vec<Arc<DataRecord>>, Vec<RecordKey>) {
let mut all_added = Vec::new();
let mut all_evicted = Vec::new();
let mut max_version = last_version;
for state in &mut self.sources {
let (new_version, added, evicted) = state.cache.sync_delta(last_version);
if new_version > max_version {
max_version = new_version;
}
all_added.extend(added);
all_evicted.extend(
evicted
.into_iter()
.map(|id| RecordKey::new(state.source.id(), id)),
);
}
(max_version, all_added, all_evicted)
}
/// Return the current global version counter.
pub fn global_version(&self) -> u64 {
self.global_next_version
}
}
/// Per-source ingestion runtime state.
struct SourceState {
source: Box<dyn DataSource + 'static>,
cursor: Option<SourceCursor>,
buffer: VecDeque<DataRecord>,
/// Per-source LRU record cache capped at `max_records`.
cache: RecordCache,
stats: SourceRefreshStats,
}
#[cfg(test)]
// The unweighted batch-fetch convenience methods (`next_*_batch`,
// `next_*_batch_for_split`, `prefetch_*_batches`) are deprecated in favor of the
// `*_with_weights` variants. These tests intentionally exercise the unweighted
// path, so suppress the deprecation lint here.
#[allow(deprecated)]
mod tests {
use super::*;
use crate::TripletSampler;
use crate::config::{Selector, TextRecipe, TripletRecipe};
use crate::data::{QualityScore, RecordSection, SectionRole};
use crate::sampler::Sampler;
use crate::splits::{DeterministicSplitStore, SamplerStateStore, SplitLabel, SplitRatios};
use chrono::Utc;
use std::collections::HashMap;
use std::collections::VecDeque;
use std::sync::atomic::{AtomicUsize, Ordering};
use std::sync::{Arc, Mutex};
fn make_record(id: &str, source: &str) -> DataRecord {
let now = Utc::now();
DataRecord {
id: id.to_string(),
source: source.to_string(),
created_at: now,
updated_at: now,
quality: QualityScore { trust: 1.0 },
taxonomy: Vec::new(),
sections: vec![RecordSection {
role: SectionRole::Anchor,
heading: None,
text: id.to_string(),
sentences: vec![id.to_string()],
token_count: 0,
embedding: None,
}],
meta_prefix: None,
label: None,
}
}
struct ScriptedSource {
id: String,
refreshes: Arc<AtomicUsize>,
script: Arc<Mutex<VecDeque<Result<SourceSnapshot, SamplerError>>>>,
}
impl ScriptedSource {
fn new(
id: &str,
refreshes: Arc<AtomicUsize>,
script: Vec<Result<SourceSnapshot, SamplerError>>,
) -> Self {
Self {
id: id.to_string(),
refreshes,
script: Arc::new(Mutex::new(script.into_iter().collect())),
}
}
}
impl DataSource for ScriptedSource {
fn id(&self) -> &str {
&self.id
}
fn refresh(
&self,
_config: &SamplerConfig,
_cursor: Option<&SourceCursor>,
_limit: Option<usize>,
) -> Result<SourceSnapshot, SamplerError> {
self.refreshes.fetch_add(1, Ordering::SeqCst);
let mut guard = self.script.lock().expect("script lock poisoned");
guard.pop_front().unwrap_or_else(|| {
Ok(SourceSnapshot {
records: Vec::new(),
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 0,
},
})
})
}
fn reported_record_count(&self, _config: &SamplerConfig) -> Result<u128, SamplerError> {
Ok(0)
}
fn default_triplet_recipes(&self) -> Vec<TripletRecipe> {
Vec::new()
}
}
struct PanicSource {
id: String,
}
impl DataSource for PanicSource {
fn id(&self) -> &str {
&self.id
}
fn refresh(
&self,
_config: &SamplerConfig,
_cursor: Option<&SourceCursor>,
_limit: Option<usize>,
) -> Result<SourceSnapshot, SamplerError> {
panic!("panic source refresh")
}
fn reported_record_count(&self, _config: &SamplerConfig) -> Result<u128, SamplerError> {
Ok(0)
}
}
#[test]
fn record_cache_waits_len_and_clear_paths_are_covered() {
let cache = RecordCache::new(2);
assert!(cache.is_empty());
assert_eq!(cache.len(), 0);
assert_eq!(cache.ingest_count(), 0);
cache.ingest(Vec::<DataRecord>::new());
assert_eq!(cache.wait_for_ingest(0, Duration::from_millis(1)), 0);
let cache_for_waiter = cache.clone();
let handle = std::thread::spawn(move || cache_for_waiter.wait_for_ingest_blocking(0));
std::thread::sleep(Duration::from_millis(5));
cache.ingest(vec![make_record("r1", "s")]);
assert_eq!(handle.join().unwrap(), 1);
assert_eq!(cache.ingest_count(), 1);
cache.ingest(vec![make_record("r2", "s"), make_record("r3", "s")]);
assert_eq!(cache.len(), 2);
let ids: Vec<String> = cache
.snapshot()
.into_iter()
.map(|record| record.id.clone())
.collect();
assert!(ids.contains(&"r2".to_string()));
assert!(ids.contains(&"r3".to_string()));
cache.clear();
assert!(cache.is_empty());
}
#[test]
fn record_cache_zero_limit_discards_everything() {
let cache = RecordCache::new(0);
cache.ingest(vec![make_record("r1", "s")]);
assert!(cache.is_empty());
assert_eq!(cache.len(), 0);
}
#[test]
fn manager_loads_and_snapshots_cursors_and_reports_has_sources() {
let mut manager = IngestionManager::new(4, SamplerConfig::default());
assert!(!manager.has_sources());
manager.load_cursors(&[]);
let refreshes = Arc::new(AtomicUsize::new(0));
manager
.register_source(Box::new(ScriptedSource::new(
"cursor_source",
refreshes,
vec![Ok(SourceSnapshot {
records: vec![make_record("id_1", "original_source")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 33,
},
})],
)))
.unwrap();
assert!(manager.has_sources());
manager.load_cursors(&[("cursor_source".to_string(), 7)]);
let cursors = manager.snapshot_cursors();
assert_eq!(cursors.len(), 1);
assert_eq!(cursors[0], ("cursor_source".to_string(), 7));
manager.refresh_all();
let updated = manager.snapshot_cursors();
assert_eq!(updated.len(), 1);
assert_eq!(updated[0], ("cursor_source".to_string(), 33));
let records = manager.all_records_snapshot();
assert_eq!(records.len(), 1);
assert_eq!(records[0].source, "cursor_source");
}
#[test]
fn advance_uses_buffer_before_refreshing_again() {
let refreshes = Arc::new(AtomicUsize::new(0));
let mut manager = IngestionManager::new(5, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"buffered",
refreshes.clone(),
vec![Ok(SourceSnapshot {
records: vec![
make_record("a", "x"),
make_record("b", "x"),
make_record("c", "x"),
],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
manager.advance(1);
assert_eq!(refreshes.load(Ordering::SeqCst), 1);
assert_eq!(manager.all_records_len(), 1);
manager.advance(1);
assert_eq!(refreshes.load(Ordering::SeqCst), 1);
assert_eq!(manager.all_records_len(), 2);
}
#[test]
fn force_refresh_clears_buffer_and_fetches_again() {
let refreshes = Arc::new(AtomicUsize::new(0));
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"force",
refreshes.clone(),
vec![
Ok(SourceSnapshot {
records: vec![
make_record("r1", "x"),
make_record("r2", "x"),
make_record("r3", "x"),
],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 10,
},
}),
Ok(SourceSnapshot {
records: vec![make_record("r4", "x")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 11,
},
}),
],
)))
.unwrap();
manager.advance(1);
assert_eq!(manager.all_records_len(), 1);
assert_eq!(refreshes.load(Ordering::SeqCst), 1);
manager.force_refresh_all();
assert_eq!(refreshes.load(Ordering::SeqCst), 2);
let records = manager.all_records_snapshot();
assert_eq!(records.len(), 1);
assert_eq!(records[0].id, "r4");
}
#[test]
fn weighted_drain_respects_zero_and_fallback_weights() {
let mut manager = IngestionManager::new(6, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"a",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("a1", "a"), make_record("a2", "a")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
manager
.register_source(Box::new(ScriptedSource::new(
"b",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("b1", "b"), make_record("b2", "b")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
let mut only_b = HashMap::new();
only_b.insert("a".to_string(), 0.0);
only_b.insert("b".to_string(), 1.0);
manager.refresh_all_with_weights(&only_b).unwrap();
let ids: Vec<String> = manager
.all_records_snapshot()
.into_iter()
.map(|record| record.id.clone())
.collect();
assert!(ids.iter().all(|id| id.starts_with('b')));
let mut manager_fallback = IngestionManager::new(6, SamplerConfig::default());
manager_fallback
.register_source(Box::new(ScriptedSource::new(
"a",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("a1", "a")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 2,
},
})],
)))
.unwrap();
manager_fallback
.register_source(Box::new(ScriptedSource::new(
"b",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("b1", "b")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 2,
},
})],
)))
.unwrap();
let mut all_zero = HashMap::new();
all_zero.insert("a".to_string(), 0.0);
all_zero.insert("b".to_string(), 0.0);
manager_fallback
.refresh_all_with_weights(&all_zero)
.unwrap();
let ids: Vec<String> = manager_fallback
.all_records_snapshot()
.into_iter()
.map(|record| record.id.clone())
.collect();
assert!(ids.contains(&"a1".to_string()));
assert!(ids.contains(&"b1".to_string()));
}
#[test]
fn refresh_errors_and_panics_update_source_stats() {
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"err_source",
Arc::new(AtomicUsize::new(0)),
vec![Err(SamplerError::SourceUnavailable {
source_id: "err_source".to_string(),
reason: "boom".to_string(),
})],
)))
.unwrap();
manager
.register_source(Box::new(PanicSource {
id: "panic_source".to_string(),
}))
.unwrap();
manager.refresh_all();
let stats = manager.source_refresh_stats();
let err_stats = stats
.iter()
.find(|(source, _)| source == "err_source")
.map(|(_, stats)| stats)
.unwrap();
assert_eq!(err_stats.error_count, 1);
assert!(
err_stats
.last_error
.as_ref()
.is_some_and(|msg| msg.contains("boom"))
);
let panic_stats = stats
.iter()
.find(|(source, _)| source == "panic_source")
.map(|(_, stats)| stats)
.unwrap();
assert_eq!(panic_stats.error_count, 1);
assert!(
panic_stats
.last_error
.as_ref()
.is_some_and(|msg| msg.contains("panicked"))
);
}
#[test]
fn force_refresh_with_weights_path_is_exercised() {
let mut manager = IngestionManager::new(3, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"w",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("w1", "w")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 3,
},
})],
)))
.unwrap();
let mut weights = HashMap::new();
weights.insert("w".to_string(), 1.0);
manager.force_refresh_all_with_weights(&weights).unwrap();
assert_eq!(manager.all_records_len(), 1);
}
#[test]
fn advance_with_weights_rejects_unknown_source() {
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"known",
Arc::new(AtomicUsize::new(0)),
vec![],
)))
.unwrap();
let mut weights = HashMap::new();
weights.insert("known".to_string(), 1.0);
weights.insert("unknown".to_string(), 0.5);
let err = manager.advance_with_weights(1, &weights).unwrap_err();
assert!(
matches!(err, SamplerError::InvalidWeight { ref source_id, .. } if source_id == "unknown"),
"expected InvalidWeight for unknown source, got {err:?}"
);
}
#[test]
fn refresh_all_with_weights_rejects_negative_weight() {
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"src",
Arc::new(AtomicUsize::new(0)),
vec![],
)))
.unwrap();
let mut weights = HashMap::new();
weights.insert("src".to_string(), -1.0);
let err = manager.refresh_all_with_weights(&weights).unwrap_err();
assert!(
matches!(err, SamplerError::InvalidWeight { ref source_id, .. } if source_id == "src"),
"expected InvalidWeight for negative weight, got {err:?}"
);
}
#[test]
fn force_refresh_all_with_weights_rejects_unknown_source() {
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"real",
Arc::new(AtomicUsize::new(0)),
vec![],
)))
.unwrap();
let mut weights = HashMap::new();
weights.insert("ghost".to_string(), 1.0);
let err = manager
.force_refresh_all_with_weights(&weights)
.unwrap_err();
assert!(
matches!(err, SamplerError::InvalidWeight { ref source_id, .. } if source_id == "ghost"),
"expected InvalidWeight for unknown source, got {err:?}"
);
}
/// A source that records the `config.seed` value it receives on each `refresh()` call.
struct SeedCapturingSource {
id: String,
received_seeds: Arc<Mutex<Vec<u64>>>,
}
impl SeedCapturingSource {
fn new(id: &str, received_seeds: Arc<Mutex<Vec<u64>>>) -> Self {
Self {
id: id.to_string(),
received_seeds,
}
}
}
impl DataSource for SeedCapturingSource {
fn id(&self) -> &str {
&self.id
}
fn refresh(
&self,
config: &SamplerConfig,
_cursor: Option<&SourceCursor>,
_limit: Option<usize>,
) -> Result<SourceSnapshot, SamplerError> {
self.received_seeds
.lock()
.expect("seed lock poisoned")
.push(config.seed);
Ok(SourceSnapshot {
records: Vec::new(),
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 0,
},
})
}
fn reported_record_count(&self, _config: &SamplerConfig) -> Result<u128, SamplerError> {
Ok(0)
}
fn default_triplet_recipes(&self) -> Vec<crate::config::TripletRecipe> {
Vec::new()
}
}
#[test]
fn epoch_xor_changes_seed_received_by_source() {
// Verify that derive_epoch_seed(base, epoch) is actually threaded through to
// the source's refresh() call, and that different epochs produce different seeds.
let base_seed = 0xDEAD_BEEF_u64;
let config = SamplerConfig {
seed: base_seed,
..SamplerConfig::default()
};
let seeds_epoch0 = Arc::new(Mutex::new(Vec::<u64>::new()));
let seeds_epoch1 = Arc::new(Mutex::new(Vec::<u64>::new()));
// --- epoch 0 ---
let mut manager = IngestionManager::new(4, config.clone());
manager
.register_source(Box::new(SeedCapturingSource::new(
"src",
Arc::clone(&seeds_epoch0),
)))
.unwrap();
// epoch defaults to 0; refresh_all passes derive_epoch_seed(base, 0)
manager.refresh_all();
// --- epoch 1 ---
let mut manager2 = IngestionManager::new(4, config.clone());
manager2
.register_source(Box::new(SeedCapturingSource::new(
"src",
Arc::clone(&seeds_epoch1),
)))
.unwrap();
manager2.set_epoch(1);
manager2.refresh_all();
let received0 = seeds_epoch0.lock().unwrap();
let received1 = seeds_epoch1.lock().unwrap();
assert!(!received0.is_empty(), "epoch-0 source was never refreshed");
assert!(!received1.is_empty(), "epoch-1 source was never refreshed");
let seed_at_epoch0 = received0[0];
let seed_at_epoch1 = received1[0];
// The seeds must differ — epoch XOR has a real effect.
assert_ne!(
seed_at_epoch0, seed_at_epoch1,
"epoch 0 and epoch 1 both produced seed {seed_at_epoch0:#x}; \
derive_epoch_seed is not reaching the source"
);
// They must match the expected derive_epoch_seed values.
// epoch_step stays at 0 for direct refresh_all calls
// (it's only bumped by next_*_batch calls).
assert_eq!(
seed_at_epoch0,
derive_epoch_seed(base_seed, 0),
"epoch-0 seed mismatch (epoch_step=0)"
);
assert_eq!(
seed_at_epoch1,
derive_epoch_seed(base_seed, 1),
"epoch-1 seed mismatch (epoch_step=0)"
);
}
#[test]
fn epoch_step_resets_on_epoch_change() {
// Proves that set_epoch + reset_epoch_step gives epoch_step=0 so each
// epoch produces the same step sequence starting from step 1.
let config = SamplerConfig::default();
let seeds = Arc::new(Mutex::new(Vec::new()));
let mut manager = IngestionManager::new(4, config.clone());
manager
.register_source(Box::new(SeedCapturingSource::new(
"src",
Arc::clone(&seeds),
)))
.unwrap();
// Epoch 0, first refresh: epoch_step stays at 0 (no longer
// incremented by refresh_all — it's bumped per batch call instead).
manager.refresh_all();
let step1_seed = seeds.lock().unwrap()[0];
assert_eq!(
step1_seed,
derive_epoch_seed(config.seed, 0),
"epoch 0 step 0 seed"
);
// Advance epoch — epoch_step must stay 0 (no batch calls yet).
manager.set_epoch(1);
assert_eq!(manager.epoch_step(), 0);
seeds.lock().unwrap().clear();
// Epoch 1, first refresh: step stays at 0 (no batch calls in this test).
manager.refresh_all();
let step1_epoch1 = seeds.lock().unwrap()[0];
assert_eq!(
step1_epoch1,
derive_epoch_seed(config.seed, 1),
"epoch 1 step 0 seed (must be ^0 since refresh_all no longer bumps step)"
);
}
#[test]
fn epoch_step_survives_sampler_save_and_load_state() {
// Proves the epoch step survives through the REAL API path:
// TripletSampler::save_sampler_state → persist_source_state
// → self.ingestion.snapshot_cursors() internally
// → DeterministicSplitStore.save_sampler_state
// → load_sampler_state → load_cursors
let store = Arc::new(DeterministicSplitStore::new(SplitRatios::default(), 1).unwrap());
// Sampler with ScriptedSource (provides empty recipes but that's fine)
let sampler = TripletSampler::new(
SamplerConfig {
seed: 42,
..SamplerConfig::default()
},
Arc::clone(&store),
);
let refreshes = Arc::new(AtomicUsize::new(0));
sampler
.register_source(Box::new(ScriptedSource::new(
"src",
refreshes,
vec![Ok(SourceSnapshot {
records: vec![make_record("r1", "src")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
// Call a batch method to trigger ensure_source_state() so
// save_sampler_state actually writes. The batch itself may
// exhaust (no recipes) but the state is loaded regardless.
let _ = sampler.next_text_batch(SplitLabel::Train);
// Save through the REAL sampler API
sampler.save_sampler_state(None).unwrap();
// Load back what the sampler saved
let loaded = store.load_sampler_state().unwrap().unwrap();
let step_saved = loaded.epoch_step;
assert!(
step_saved > 0,
"epoch_step must be >0 after batch call through TripletSampler"
);
// Feed the REAL loaded cursors to a new manager
let mut manager2 = IngestionManager::new(4, SamplerConfig::default());
manager2
.register_source(Box::new(ScriptedSource::new(
"src",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("r2", "src")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 2,
},
})],
)))
.unwrap();
manager2.load_cursors(&loaded.source_stream_cursors);
manager2.set_epoch_step(loaded.epoch_step);
// epoch_step restored to saved value; verify it's stable (no batch
// call was made, so step does not change).
let step_before = manager2.epoch_step();
assert_eq!(
step_before, step_saved,
"load_cursors must restore epoch_step to saved value"
);
// Verify the step is still present after a refresh (no increment).
manager2.refresh_all();
let step_after = manager2.epoch_step();
assert_eq!(
step_after, step_saved,
"epoch_step must survive refresh_all without increment (step is per-batch,
not per-refresh): loaded {step_saved}, got {step_after}"
);
}
#[test]
fn scripted_and_panic_sources_cover_default_trait_paths() {
let refreshes = Arc::new(AtomicUsize::new(0));
let scripted = ScriptedSource::new("scripted", refreshes, vec![]);
// Empty script falls back to an empty snapshot.
let snapshot = scripted
.refresh(&SamplerConfig::default(), None, None)
.expect("fallback snapshot");
assert!(snapshot.records.is_empty());
assert_eq!(snapshot.cursor.revision, 0);
assert_eq!(
scripted
.reported_record_count(&SamplerConfig::default())
.expect("record count"),
0
);
assert!(scripted.default_triplet_recipes().is_empty());
let panic_source = PanicSource {
id: "panic_count".to_string(),
};
assert_eq!(
panic_source
.reported_record_count(&SamplerConfig::default())
.expect("record count"),
0
);
}
#[test]
fn seed_capturing_source_trait_defaults_are_exercised() {
let source = SeedCapturingSource::new("seed_defaults", Arc::new(Mutex::new(Vec::new())));
assert_eq!(
source
.reported_record_count(&SamplerConfig::default())
.expect("record count"),
0
);
assert!(source.default_triplet_recipes().is_empty());
}
#[test]
fn refresh_paths_handle_zero_capacity_and_no_sources() {
let mut manager = IngestionManager::new(0, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"zero_capacity",
Arc::new(AtomicUsize::new(0)),
vec![Ok(SourceSnapshot {
records: vec![make_record("r1", "zero_capacity")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
manager.refresh_all();
assert!(manager.all_caches_empty());
// Weighted refresh with no sources should be a no-op.
let mut empty_manager = IngestionManager::new(4, SamplerConfig::default());
let empty_weights = HashMap::new();
empty_manager
.refresh_all_with_weights(&empty_weights)
.expect("no sources should not error");
assert!(empty_manager.all_caches_empty());
}
#[test]
fn drain_start_rotates_fairly_across_sources() {
// Create 3 sources, each with 10 records in their buffer after refresh.
// The fair round-robin should ensure all 3 drain at the same rate
// over multiple advance cycles.
struct FairSource {
id: String,
refresh_count: Arc<AtomicUsize>,
}
impl DataSource for FairSource {
fn id(&self) -> &str {
&self.id
}
fn refresh(
&self,
_config: &SamplerConfig,
_cursor: Option<&SourceCursor>,
_limit: Option<usize>,
) -> Result<SourceSnapshot, SamplerError> {
self.refresh_count.fetch_add(1, Ordering::SeqCst);
Ok(SourceSnapshot {
records: (0..10)
.map(|i| make_record(&format!("r{i}"), &self.id))
.collect(),
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})
}
fn reported_record_count(&self, _: &SamplerConfig) -> Result<u128, SamplerError> {
Ok(10)
}
}
let counts = (
Arc::new(AtomicUsize::new(0)),
Arc::new(AtomicUsize::new(0)),
Arc::new(AtomicUsize::new(0)),
);
let mut manager = IngestionManager::new(30, SamplerConfig::default());
manager
.register_source(Box::new(FairSource {
id: "src_0".to_string(),
refresh_count: Arc::clone(&counts.0),
}))
.unwrap();
manager
.register_source(Box::new(FairSource {
id: "src_1".to_string(),
refresh_count: Arc::clone(&counts.1),
}))
.unwrap();
manager
.register_source(Box::new(FairSource {
id: "src_2".to_string(),
refresh_count: Arc::clone(&counts.2),
}))
.unwrap();
// First refresh_all fills all buffers.
manager.refresh_all();
// All 3 refreshed once.
assert_eq!(counts.0.load(Ordering::SeqCst), 1);
assert_eq!(counts.1.load(Ordering::SeqCst), 1);
assert_eq!(counts.2.load(Ordering::SeqCst), 1);
// Each advance(1) drains 1 record from 1 source, rotating via
// drain_start. With 3 sources, after 3 advances each source
// loses 1 record. After 30 advances each source loses 10 records
// and triggers a refresh. Run 33 advances and check all 3 refreshed
// roughly the same number of times.
for _ in 0..33 {
manager.advance(1);
}
let r0 = counts.0.load(Ordering::SeqCst);
let r1 = counts.1.load(Ordering::SeqCst);
let r2 = counts.2.load(Ordering::SeqCst);
// Each had 10 records after initial refresh_all.
// 10 records / (1 drained per 3 cycles) = 30 cycles to drain each buffer.
// After 33 more advances each buffer emptied ~1 time and re-filled, so
// each source should have refreshed ~2 times total (initial + 1 drain).
// The exact count can vary by 1 due to timing, but all 3 must be within
// 1 of each other — no source can be starved.
let min = r0.min(r1).min(r2);
let max = r0.max(r1).max(r2);
assert!(
max <= min + 1,
"sources should refresh at roughly the same rate: got {r0}/{r1}/{r2}"
);
}
#[test]
fn direct_drain_start_rotates_fairly_with_batch_2_of_5() {
// Direct IngestionManager test with batch_size=2, 5 sources.
// Isolates the drain_start rotation from the sampler pipeline.
struct SimpleSource {
id: String,
refresh_count: Arc<AtomicUsize>,
}
impl DataSource for SimpleSource {
fn id(&self) -> &str {
&self.id
}
fn refresh(
&self,
_: &SamplerConfig,
_: Option<&SourceCursor>,
_: Option<usize>,
) -> Result<SourceSnapshot, SamplerError> {
self.refresh_count.fetch_add(1, Ordering::SeqCst);
let now = Utc::now();
let records: Vec<DataRecord> = (0..8)
.map(|i| DataRecord {
id: format!("{}_r{i}", self.id),
source: self.id.clone(),
created_at: now,
updated_at: now,
quality: QualityScore { trust: 1.0 },
taxonomy: Vec::new(),
sections: Vec::new(),
meta_prefix: None,
label: None,
})
.collect();
Ok(SourceSnapshot {
records,
cursor: SourceCursor {
last_seen: now,
revision: 1,
},
})
}
fn reported_record_count(&self, _: &SamplerConfig) -> Result<u128, SamplerError> {
Ok(8)
}
}
let counts: Vec<Arc<AtomicUsize>> = (0..5).map(|_| Arc::new(AtomicUsize::new(0))).collect();
let mut manager = IngestionManager::new(40, SamplerConfig::default());
for (i, count) in counts.iter().enumerate() {
manager
.register_source(Box::new(SimpleSource {
id: format!("src_{i}"),
refresh_count: Arc::clone(count),
}))
.unwrap();
}
manager.refresh_all();
for c in &counts {
assert_eq!(c.load(Ordering::SeqCst), 1);
}
for _ in 0..80 {
manager.advance(2);
}
let totals: Vec<usize> = counts.iter().map(|c| c.load(Ordering::SeqCst)).collect();
// Round-robin drain with 5 sources, 8 records each, batch_size=2, 80
// advance calls. Most sources refresh 5×; sources 2-4 get one extra
// cycle (6) due to the rotating drain_start tie-breaker positioning.
assert_eq!(
totals,
vec![5, 5, 6, 6, 6],
"direct manager: unexpected refresh distribution"
);
}
/// Helper: create 5 sources with 8 records each and a sampler configured for
/// text batches with batch_size=2. Returns the sampler and refresh counters.
fn make_five_source_sampler(
counts: &[Arc<AtomicUsize>],
) -> TripletSampler<DeterministicSplitStore> {
struct Tracked {
id: String,
refresh_count: Arc<AtomicUsize>,
}
impl DataSource for Tracked {
fn id(&self) -> &str {
&self.id
}
fn refresh(
&self,
_: &SamplerConfig,
_: Option<&SourceCursor>,
_: Option<usize>,
) -> Result<SourceSnapshot, SamplerError> {
self.refresh_count.fetch_add(1, Ordering::SeqCst);
let now = Utc::now();
let records: Vec<DataRecord> = (0..8)
.map(|i| DataRecord {
id: format!("{}_r{i}", self.id),
source: self.id.clone(),
created_at: now,
updated_at: now,
quality: QualityScore { trust: 1.0 },
taxonomy: Vec::new(),
sections: vec![RecordSection {
role: SectionRole::Anchor,
heading: None,
text: format!("{}_x{}", self.id, i),
sentences: vec![format!("{}_x{}", self.id, i)],
token_count: 0,
embedding: None,
}],
meta_prefix: None,
label: None,
})
.collect();
Ok(SourceSnapshot {
records,
cursor: SourceCursor {
last_seen: now,
revision: 1,
},
})
}
fn reported_record_count(&self, _: &SamplerConfig) -> Result<u128, SamplerError> {
Ok(8)
}
}
let config = SamplerConfig {
batch_size: 2,
text_recipes: vec![TextRecipe {
name: "anchor".into(),
selector: Selector::Role(SectionRole::Anchor),
weight: 1.0,
instruction: None,
}],
split: SplitRatios {
train: 1.0,
validation: 0.0,
test: 0.0,
},
allowed_splits: vec![SplitLabel::Train],
// Small enough that the cache slides on every advance, changing
// the record pool each batch. Without this, all 40 records fit in
// the cache permanently and the cross-batch text dedup would never
// clear `emitted_texts`, causing early Exhausted after only a few
// batches (only 8 unique texts across 40 records).
ingestion_max_records: 4,
..SamplerConfig::default()
};
let store = Arc::new(DeterministicSplitStore::new(config.split, 99).unwrap());
let sampler = TripletSampler::new(config, store);
for (i, count) in counts.iter().enumerate() {
sampler
.register_source(Box::new(Tracked {
id: format!("src_{i}"),
refresh_count: Arc::clone(count),
}))
.unwrap();
}
sampler
}
#[test]
fn sampler_unweighted_drain_distributes_evenly() {
let counts: Vec<Arc<AtomicUsize>> = (0..5).map(|_| Arc::new(AtomicUsize::new(0))).collect();
let sampler = make_five_source_sampler(&counts);
sampler.next_text_batch(SplitLabel::Train).unwrap();
for _ in 0..80 {
sampler.next_text_batch(SplitLabel::Train).unwrap();
}
let totals: Vec<usize> = counts.iter().map(|c| c.load(Ordering::SeqCst)).collect();
let min = *totals.iter().min().unwrap();
let max = *totals.iter().max().unwrap();
assert!(
max <= min + 1,
"unweighted: all sources must refresh at roughly the same rate: {totals:?}"
);
assert!(
min >= 4,
"unweighted: each source should have refreshed at least 4 times: {totals:?}"
);
}
#[test]
fn sampler_weighted_drain_with_equal_weights_distributes_evenly() {
// Same as unweighted but goes through the public weighted API with equal
// weights for all 5 sources — verifies the weighted drain also rotates
// fairly via drain_start bias.
let counts: Vec<Arc<AtomicUsize>> = (0..5).map(|_| Arc::new(AtomicUsize::new(0))).collect();
let sampler = make_five_source_sampler(&counts);
let weights: HashMap<String, f32> = (0..5).map(|i| (format!("src_{i}"), 1.0)).collect();
sampler
.next_text_batch_with_weights(SplitLabel::Train, &weights)
.unwrap();
for _ in 0..80 {
sampler
.next_text_batch_with_weights(SplitLabel::Train, &weights)
.unwrap();
}
let totals: Vec<usize> = counts.iter().map(|c| c.load(Ordering::SeqCst)).collect();
let min = *totals.iter().min().unwrap();
let max = *totals.iter().max().unwrap();
assert!(
max <= min + 1,
"weighted (equal): all sources must refresh at roughly the same rate: {totals:?}"
);
assert!(
min >= 4,
"weighted (equal): each source should have refreshed at least 4 times: {totals:?}"
);
}
#[test]
fn sampler_unweighted_and_weighted_match_distribution() {
// Verify both paths produce similar refresh distributions.
let uc: Vec<Arc<AtomicUsize>> = (0..5).map(|_| Arc::new(AtomicUsize::new(0))).collect();
let wc: Vec<Arc<AtomicUsize>> = (0..5).map(|_| Arc::new(AtomicUsize::new(0))).collect();
let usampler = make_five_source_sampler(&uc);
let wsampler = make_five_source_sampler(&wc);
let weights: HashMap<String, f32> = (0..5).map(|i| (format!("src_{i}"), 1.0)).collect();
usampler.next_text_batch(SplitLabel::Train).unwrap();
wsampler
.next_text_batch_with_weights(SplitLabel::Train, &weights)
.unwrap();
for _ in 0..80 {
usampler.next_text_batch(SplitLabel::Train).unwrap();
wsampler
.next_text_batch_with_weights(SplitLabel::Train, &weights)
.unwrap();
}
let ut: Vec<usize> = uc.iter().map(|c| c.load(Ordering::SeqCst)).collect();
let wt: Vec<usize> = wc.iter().map(|c| c.load(Ordering::SeqCst)).collect();
let umax = *ut.iter().max().unwrap();
let umin = *ut.iter().min().unwrap();
let wmax = *wt.iter().max().unwrap();
let wmin = *wt.iter().min().unwrap();
assert!(umax <= umin + 1, "unweighted: {ut:?}");
assert!(wmax <= wmin + 1, "weighted equal: {wt:?}");
}
#[test]
fn sampler_weighted_drain_with_unequal_weights_respects_ratios() {
// Source 3 gets weight 2.0, others get 1.0. The weighted
// proportional-fair drain must give source 3 proportionally more
// refresh cycles than any weight-1.0 source.
let counts: Vec<Arc<AtomicUsize>> = (0..5).map(|_| Arc::new(AtomicUsize::new(0))).collect();
let sampler = make_five_source_sampler(&counts);
let mut weights = HashMap::new();
for i in 0..5 {
weights.insert(format!("src_{i}"), if i == 3 { 2.0f32 } else { 1.0 });
}
sampler
.next_text_batch_with_weights(SplitLabel::Train, &weights)
.unwrap();
for _ in 0..200 {
sampler
.next_text_batch_with_weights(SplitLabel::Train, &weights)
.unwrap();
}
let totals: Vec<usize> = counts.iter().map(|c| c.load(Ordering::SeqCst)).collect();
// The highest-weight source (src_3, w=2.0) must have strictly more
// refreshes than EVERY weight-1.0 source.
// Note: src_4 (index 4, w=1.0) gets 12 refreshes while the other
// weight-1.0 sources get 6-7. This happens because the proportional-
// fair scheduler uses drain_start as a rotating tie-breaker — being
// positioned right after the high-weight source (src_3) gives src_4
// extra wins when src_3's buffer empties and refills more frequently.
assert!(
totals
.iter()
.enumerate()
.all(|(i, &t)| i == 3 || t < totals[3]),
"src_3 (w=2.0) must outpace all w=1.0 sources (totals: {totals:?})"
);
// Lock in the exact deterministic distribution.
// (Distribution changed after per-source text uniqueness: each source
// now emits distinct texts (`{id}_x{i}` instead of shared `x{i}`), so
// cross-batch text dedup no longer collides across sources and the
// sampler exhausts and force-refreshes less often, which reduces the
// total number of refresh cycles but preserves the weighted
// distribution pattern. The key invariant (src_3 with w=2.0 outpaces
// all w=1.0 sources) is unchanged.)
assert_eq!(
totals,
vec![6, 6, 6, 26, 11],
"unequal-weights: unexpected refresh distribution"
);
}
#[test]
fn register_source_rejects_reserved_id_pattern() {
use crate::constants::splits::is_reserved_source_id;
let mut manager = IngestionManager::new(4, SamplerConfig::default());
// Verify the utility function catches common patterns
assert!(is_reserved_source_id("__meta__"));
assert!(is_reserved_source_id("__anything__"));
assert!(is_reserved_source_id("__x__"));
assert!(!is_reserved_source_id(""));
assert!(!is_reserved_source_id("__"));
assert!(!is_reserved_source_id("___"));
assert!(!is_reserved_source_id("normal_source"));
assert!(!is_reserved_source_id("_prefix_suffix_"));
assert!(!is_reserved_source_id("__unclosed"));
assert!(!is_reserved_source_id("unopened__"));
// Registering with a `__*__` id should fail
let result = manager.register_source(Box::new(ScriptedSource::new(
"__reserved__",
Arc::new(AtomicUsize::new(0)),
vec![],
)));
assert!(
result.is_err(),
"register_source should reject reserved source id"
);
let err = result.unwrap_err();
assert!(
matches!(&err, SamplerError::ReservedSourceId(id) if id == "__reserved__"),
"expected ReservedSourceId error, got: {err}"
);
// Verify source was NOT registered (still zero sources)
assert!(!manager.has_sources());
// Normal source IDs still work
manager
.register_source(Box::new(ScriptedSource::new(
"valid_source",
Arc::new(AtomicUsize::new(0)),
vec![],
)))
.unwrap();
assert!(manager.has_sources());
}
#[test]
fn record_cache_ingest_with_version_empty_batch_is_noop() {
let cache = RecordCache::new(4);
cache.ingest_with_version(Vec::<DataRecord>::new(), 99);
assert!(cache.is_empty());
assert_eq!(cache.ingest_count(), 0);
}
#[test]
fn record_cache_ingest_with_version_assigns_explicit_version() {
let cache = RecordCache::new(4);
cache.ingest_with_version(vec![make_record("v1", "s")], 10);
assert_eq!(cache.len(), 1);
// A subsequent sync_delta from version 0 should see the record as added.
let (_, added, evicted) = cache.sync_delta(0);
assert_eq!(added.len(), 1);
assert!(evicted.is_empty());
assert_eq!(added[0].id, "v1");
}
#[test]
fn record_cache_sync_delta_returns_nothing_when_fully_consumed() {
let cache = RecordCache::new(4);
cache.ingest_with_version(vec![make_record("a", "s")], 5);
// First pull consumes the delta.
let (v1, added1, _) = cache.sync_delta(0);
assert_eq!(added1.len(), 1);
// Second pull with same watermark returns empty.
let (v2, added2, evicted2) = cache.sync_delta(v1);
assert!(added2.is_empty());
assert!(evicted2.is_empty());
assert_eq!(v2, v1);
}
#[test]
fn record_cache_sync_delta_reports_evictions_from_clear() {
let cache = RecordCache::new(4);
cache.ingest(vec![make_record("e1", "s"), make_record("e2", "s")]);
// Consume the initial add.
let (v1, _, _) = cache.sync_delta(0);
assert!(v1 > 0);
// Clear records — should log evictions.
cache.clear();
let (_, added, evicted) = cache.sync_delta(v1);
assert!(added.is_empty());
assert_eq!(evicted.len(), 2);
assert!(evicted.contains(&"e1".to_string()));
assert!(evicted.contains(&"e2".to_string()));
}
#[test]
fn record_cache_sync_delta_filters_evictions_by_version_watermark() {
let cache = RecordCache::new(4);
cache.ingest_with_version(vec![make_record("old", "s")], 1);
let (v1, _, _) = cache.sync_delta(0);
assert!(v1 >= 1);
cache.clear();
// Pull at the old watermark — should see eviction for "old".
let (_, _, evicted_at_v1) = cache.sync_delta(v1);
assert_eq!(evicted_at_v1.len(), 1);
// Pull at a higher watermark that was bumped by clear — should be empty.
let (_, _, evicted_at_higher) = cache.sync_delta(v1 + 1);
assert!(evicted_at_higher.is_empty());
}
#[test]
fn record_cache_enforce_limit_trims_fifo_and_logs_evictions() {
let cache = RecordCache::new(2);
cache.ingest(vec![
make_record("first", "s"),
make_record("second", "s"),
make_record("third", "s"),
]);
// Cache should hold only 2 records.
assert_eq!(cache.len(), 2);
// Consume delta to establish a baseline version.
let (v1, _, _) = cache.sync_delta(0);
// Ingest one more to trigger eviction of "second" (FIFO order).
cache.ingest(vec![make_record("fourth", "s")]);
let (_, _, evicted) = cache.sync_delta(v1);
// "first" was evicted when "third" was ingested, "second" when "fourth" was.
// At minimum one eviction must appear.
assert!(!evicted.is_empty());
}
#[test]
fn manager_force_refresh_generation_and_global_version() {
let refreshes = Arc::new(AtomicUsize::new(0));
let mut manager = IngestionManager::new(4, SamplerConfig::default());
assert_eq!(manager.force_refresh_generation(), 0);
assert_eq!(manager.global_version(), 0);
manager
.register_source(Box::new(ScriptedSource::new(
"gen_src",
refreshes,
vec![Ok(SourceSnapshot {
records: vec![make_record("g1", "gen_src")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
manager.refresh_all();
assert_eq!(manager.force_refresh_generation(), 0);
assert!(manager.global_version() > 0);
let v_before = manager.global_version();
manager.force_refresh_all();
assert_eq!(manager.force_refresh_generation(), 1);
assert!(manager.global_version() > v_before);
}
#[test]
fn manager_sync_delta_aggregates_across_sources() {
let refreshes = Arc::new(AtomicUsize::new(0));
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"agg_a",
refreshes.clone(),
vec![Ok(SourceSnapshot {
records: vec![make_record("a1", "agg_a")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
manager
.register_source(Box::new(ScriptedSource::new(
"agg_b",
refreshes,
vec![Ok(SourceSnapshot {
records: vec![make_record("b1", "agg_b")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
manager.refresh_all();
let (version, added, evicted) = manager.sync_delta(0);
assert!(version > 0);
assert_eq!(added.len(), 2);
let ids: Vec<&str> = added.iter().map(|r| r.id.as_str()).collect();
assert!(ids.contains(&"a1"));
assert!(ids.contains(&"b1"));
assert!(evicted.is_empty());
// Second pull should be empty.
let (_, added2, evicted2) = manager.sync_delta(version);
assert!(added2.is_empty());
assert!(evicted2.is_empty());
}
#[test]
fn manager_source_refresh_stats_returns_telemetry() {
let refreshes = Arc::new(AtomicUsize::new(0));
let mut manager = IngestionManager::new(4, SamplerConfig::default());
manager
.register_source(Box::new(ScriptedSource::new(
"stats_src",
refreshes,
vec![Ok(SourceSnapshot {
records: vec![make_record("s1", "stats_src")],
cursor: SourceCursor {
last_seen: Utc::now(),
revision: 1,
},
})],
)))
.unwrap();
let stats = manager.source_refresh_stats();
assert_eq!(stats.len(), 1);
assert_eq!(stats[0].0, "stats_src");
assert_eq!(stats[0].1.last_refresh_ms, 0);
manager.refresh_all();
let stats = manager.source_refresh_stats();
assert_eq!(stats[0].1.last_record_count, 1);
}
#[test]
fn record_cache_ingest_batch_replaces_existing_record() {
let cache = RecordCache::new(4);
// First ingest creates the record.
cache.ingest(vec![make_record("dup", "s")]);
assert_eq!(cache.len(), 1);
// Re-ingest same id replaces it (does not duplicate).
cache.ingest(vec![make_record("dup", "s")]);
assert_eq!(cache.len(), 1);
}
#[test]
fn record_cache_ingest_with_version_replaces_existing_record() {
let cache = RecordCache::new(4);
cache.ingest_with_version(vec![make_record("vr", "s")], 5);
let (v1, _, _) = cache.sync_delta(0);
assert_eq!(cache.len(), 1);
// Re-ingest same id with higher version.
cache.ingest_with_version(vec![make_record("vr", "s")], v1 + 5);
let (_, added, evicted) = cache.sync_delta(v1);
assert_eq!(added.len(), 1);
assert!(evicted.is_empty());
assert_eq!(cache.len(), 1);
}
#[test]
fn record_cache_enforce_limit_evicts_oldest_and_trims_eviction_log() {
// Create a cache with max 3 records and ingest 5 — the eviction log
// must stay bounded at max_records.
let cache = RecordCache::new(3);
for i in 0..5 {
cache.ingest(vec![make_record(&format!("r{i}"), "s")]);
}
assert_eq!(cache.len(), 3);
// Consume delta to flush.
let (v1, _, _) = cache.sync_delta(0);
// Verify eviction log is bounded by calling sync_delta —
// should not panic or grow unbounded.
let (_, added, evicted) = cache.sync_delta(v1);
// New records from the last ingest may appear as added.
// Evictions from the FIFO limit should appear.
assert!(added.len() + evicted.len() <= 5);
}
#[test]
fn weighted_drain_breaks_when_all_buffers_empty() {
let refreshes = Arc::new(AtomicUsize::new(0));
let mut manager = IngestionManager::new(4, SamplerConfig::default());
// Register source but don't refresh — buffer is empty.
manager
.register_source(Box::new(ScriptedSource::new(
"empty_buf",
refreshes,
vec![],
)))
.unwrap();
let mut weights = HashMap::new();
weights.insert("empty_buf".to_string(), 1.0);
// advance_with_weights calls weighted_drain_into_caches with empty buffers.
// Should not panic — the drain loop breaks when total_weight == 0.
manager.advance_with_weights(1, &weights).unwrap();
assert_eq!(manager.all_records_len(), 0);
}
#[test]
fn wait_for_ingest_times_out_without_notification() {
let cache = RecordCache::new(4);
// No ingest happens — should time out immediately.
let result = cache.wait_for_ingest(0, Duration::from_millis(1));
assert_eq!(result, 0);
}
}