libdictenstein 0.1.0

High-performance dictionary data structures (trie, DAWG, double-array trie, suffix automaton, lock-free durable persistent ART) behind one trait API; pairs with liblevenshtein for fuzzy matching
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
//! Concurrent access tests for PersistentARTrie.
//!
//! These tests verify thread-safety of the PersistentARTrie implementation:
//! - Multiple concurrent readers
//! - Single writer with multiple readers
//! - Concurrent transducer queries
//! - Reader during checkpoint operations
//!
//! # Architecture Notes
//!
//! PersistentARTrie uses `SharedARTrie` (Arc<RwLock<...>>) for thread-safety:
//! - Arc::clone creates a shared reference to the same underlying data
//! - Multiple clones can be passed to different threads
//! - RwLock ensures read/write safety
//!
//! # Known Limitations
//!
//! - Bucket capacity is 256 entries per bucket
//! - Tests stay within safe capacity limits
//! - Write operations are serialized by RwLock

#![cfg(feature = "persistent-artrie")]

use libdictenstein::persistent_artrie::{PersistentARTrie, SharedARTrie};
use libdictenstein::persistent_artrie_core::durability::DurabilityPolicy;
use libdictenstein::persistent_artrie_core::shared_access::SharedTrieAccess;
use libdictenstein::Dictionary;
use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering};
use std::sync::{Arc, Barrier};
use std::thread;
use std::time::Duration;
use tempfile::TempDir;

/// Number of reader threads for concurrent tests.
const NUM_READERS: usize = 8;

/// Number of operations per thread.
const OPS_PER_THREAD: usize = 100;

/// Generate diverse terms for concurrent tests.
fn generate_terms(count: usize, prefix: &str) -> Vec<String> {
    (0..count).map(|i| format!("{}{:05}", prefix, i)).collect()
}

/// Helper to create a SharedARTrie from a PersistentARTrie
fn make_shared<V: libdictenstein::DictionaryValue>(trie: PersistentARTrie<V>) -> SharedARTrie<V> {
    Arc::new(trie)
}

// =============================================================================
// Test: Multiple Concurrent Readers
// =============================================================================

#[test]
fn test_concurrent_readers() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("concurrent_readers.part");

    // Create and populate dictionary
    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Insert test terms with values
    let terms: Vec<String> = generate_terms(100, "term");
    for (i, term) in terms.iter().enumerate() {
        let _ = dict.insert_with_value(term, i as i32);
    }
    dict.sync().expect("sync");

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    // Use a barrier to synchronize thread starts
    let barrier = Arc::new(Barrier::new(NUM_READERS));
    let terms_arc = Arc::new(terms);
    let success_count = Arc::new(AtomicUsize::new(0));

    let handles: Vec<_> = (0..NUM_READERS)
        .map(|_| {
            let dict_clone = Arc::clone(&shared_dict);
            let barrier_clone = barrier.clone();
            let terms_clone = terms_arc.clone();
            let success = success_count.clone();

            thread::spawn(move || {
                // Wait for all threads to be ready
                barrier_clone.wait();

                // Perform concurrent reads
                let mut local_success = 0;
                let dict_guard = dict_clone.read();
                for term in terms_clone.iter() {
                    if dict_guard.contains(term) {
                        local_success += 1;
                    }
                }

                success.fetch_add(local_success, Ordering::SeqCst);
            })
        })
        .collect();

    // Wait for all threads to complete
    for handle in handles {
        handle.join().expect("thread join");
    }

    // Each reader should find all 100 terms
    let total = success_count.load(Ordering::SeqCst);
    assert_eq!(
        total,
        NUM_READERS * 100,
        "All readers should find all terms"
    );
}

// =============================================================================
// Test: Single Writer with Multiple Readers
// =============================================================================

#[test]
fn test_single_writer_multiple_readers() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("writer_readers.part");

    // Create dictionary with initial terms
    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Insert some initial terms
    let initial_terms: Vec<String> = generate_terms(50, "init");
    for (i, term) in initial_terms.iter().enumerate() {
        let _ = dict.insert_with_value(term, i as i32);
    }
    dict.sync().expect("sync");

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let stop_flag = Arc::new(AtomicBool::new(false));
    let read_count = Arc::new(AtomicUsize::new(0));
    let terms_arc = Arc::new(initial_terms.clone());

    // Spawn reader threads
    let reader_handles: Vec<_> = (0..NUM_READERS)
        .map(|_| {
            let dict_clone = Arc::clone(&shared_dict);
            let stop = stop_flag.clone();
            let count = read_count.clone();
            let terms = terms_arc.clone();

            thread::spawn(move || {
                while !stop.load(Ordering::Relaxed) {
                    let dict_guard = dict_clone.read();
                    for term in terms.iter() {
                        // Read operations should succeed even during writes
                        let _ = dict_guard.contains(term);
                        count.fetch_add(1, Ordering::Relaxed);
                    }
                    drop(dict_guard);
                    thread::yield_now();
                }
            })
        })
        .collect();

    // Writer thread: insert new terms
    let new_terms: Vec<String> = generate_terms(50, "new_");
    let writer_dict = Arc::clone(&shared_dict);
    let writer_handle = thread::spawn(move || {
        for (i, term) in new_terms.iter().enumerate() {
            let dict_guard = writer_dict.write();
            let _ = dict_guard.insert_with_value(term, (i + 1000) as i32);
            drop(dict_guard);
            thread::sleep(Duration::from_micros(100));
        }
    });

    // Let it run for a short time
    thread::sleep(Duration::from_millis(100));

    // Stop readers and wait for writer
    stop_flag.store(true, Ordering::SeqCst);
    writer_handle.join().expect("writer join");

    for handle in reader_handles {
        handle.join().expect("reader join");
    }

    // Verify reads occurred
    let reads = read_count.load(Ordering::SeqCst);
    assert!(reads > 0, "Readers should have performed reads");

    // Verify all terms are present after writes complete
    let dict_guard = shared_dict.read();
    for term in initial_terms.iter() {
        assert!(
            dict_guard.contains(term),
            "Initial term should exist: {}",
            term
        );
    }
}

// =============================================================================
// Test: Concurrent Reads During Checkpoint
// =============================================================================

#[test]
fn test_reader_during_checkpoint() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("checkpoint_readers.part");

    // Create and populate dictionary
    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    let terms: Vec<String> = generate_terms(100, "chkp");
    for (i, term) in terms.iter().enumerate() {
        let _ = dict.insert_with_value(term, i as i32);
    }
    dict.sync().expect("sync");

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let stop_flag = Arc::new(AtomicBool::new(false));
    let read_errors = Arc::new(AtomicUsize::new(0));
    let terms_arc = Arc::new(terms.clone());

    // Spawn reader threads that continuously read during checkpoint
    let reader_handles: Vec<_> = (0..NUM_READERS)
        .map(|_| {
            let dict_clone = Arc::clone(&shared_dict);
            let stop = stop_flag.clone();
            let errors = read_errors.clone();
            let terms = terms_arc.clone();

            thread::spawn(move || {
                while !stop.load(Ordering::Relaxed) {
                    let dict_guard = dict_clone.read();
                    for term in terms.iter() {
                        if !dict_guard.contains(term) {
                            // Term should always be found (snapshot isolation)
                            errors.fetch_add(1, Ordering::Relaxed);
                        }
                    }
                }
            })
        })
        .collect();

    // Perform checkpoints while readers are active
    for _ in 0..3 {
        let dict_guard = shared_dict.write();
        dict_guard.checkpoint().expect("checkpoint");
        drop(dict_guard);
        thread::sleep(Duration::from_millis(10));
    }

    // Stop readers
    stop_flag.store(true, Ordering::SeqCst);

    for handle in reader_handles {
        handle.join().expect("reader join");
    }

    // No read errors should occur
    let errors = read_errors.load(Ordering::SeqCst);
    assert_eq!(errors, 0, "No read errors should occur during checkpoints");
}

// =============================================================================
// Test: Concurrent Value Lookups
// =============================================================================

#[test]
fn test_concurrent_value_lookups() {
    use libdictenstein::MappedDictionary;

    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("value_lookups.part");

    // Create and populate dictionary with values
    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    let terms: Vec<(String, i32)> = (0..100)
        .map(|i| (format!("value{:05}", i), i * 10))
        .collect();

    for (term, value) in &terms {
        let _ = dict.insert_with_value(term, *value);
    }
    dict.sync().expect("sync");

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let barrier = Arc::new(Barrier::new(NUM_READERS));
    let terms_arc = Arc::new(terms);
    let value_mismatches = Arc::new(AtomicUsize::new(0));

    let handles: Vec<_> = (0..NUM_READERS)
        .map(|_| {
            let dict_clone = Arc::clone(&shared_dict);
            let barrier_clone = barrier.clone();
            let terms_clone = terms_arc.clone();
            let mismatches = value_mismatches.clone();

            thread::spawn(move || {
                barrier_clone.wait();

                let dict_guard = dict_clone.read();
                for (term, expected) in terms_clone.iter() {
                    if let Some(actual) = dict_guard.get_value(term) {
                        if actual != *expected {
                            mismatches.fetch_add(1, Ordering::Relaxed);
                        }
                    } else {
                        mismatches.fetch_add(1, Ordering::Relaxed);
                    }
                }
            })
        })
        .collect();

    for handle in handles {
        handle.join().expect("thread join");
    }

    let mismatches = value_mismatches.load(Ordering::SeqCst);
    assert_eq!(mismatches, 0, "All values should match expected");
}

// =============================================================================
// Test: Writer Contention
// =============================================================================

#[test]
fn test_writer_contention() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("writer_contention.part");

    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let barrier = Arc::new(Barrier::new(4));
    let successful_inserts = Arc::new(AtomicUsize::new(0));

    // Spawn 4 writer threads, each trying to insert different terms
    let handles: Vec<_> = (0..4)
        .map(|thread_id| {
            let dict_clone = Arc::clone(&shared_dict);
            let barrier_clone = barrier.clone();
            let inserts = successful_inserts.clone();

            thread::spawn(move || {
                barrier_clone.wait();

                // Each thread inserts terms with unique prefix
                let prefix = format!("t{}_", thread_id);
                for i in 0..25 {
                    let term = format!("{}{:03}", prefix, i);
                    let dict_guard = dict_clone.write();
                    if dict_guard.insert_with_value(&term, (thread_id * 100 + i) as i32) {
                        inserts.fetch_add(1, Ordering::Relaxed);
                    }
                }
            })
        })
        .collect();

    for handle in handles {
        handle.join().expect("thread join");
    }

    // All 100 inserts should succeed (4 threads × 25 terms)
    let total = successful_inserts.load(Ordering::SeqCst);
    assert_eq!(total, 100, "All inserts should succeed");

    // Verify all terms are present
    let dict_guard = shared_dict.read();
    for thread_id in 0..4 {
        for i in 0..25 {
            let term = format!("t{}_{:03}", thread_id, i);
            assert!(dict_guard.contains(&term), "Term should exist: {}", term);
        }
    }
}

// =============================================================================
// Test: Read-Write Interleaving
// =============================================================================

#[test]
fn test_read_write_interleaving() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("interleaving.part");

    // Pre-populate with some terms
    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    let initial_terms: Vec<String> = generate_terms(50, "pre_");
    for (i, term) in initial_terms.iter().enumerate() {
        let _ = dict.insert_with_value(term, i as i32);
    }

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let operations = Arc::new(AtomicUsize::new(0));
    let stop_flag = Arc::new(AtomicBool::new(false));

    // Spawn interleaved reader/writer threads
    let handles: Vec<_> = (0..4)
        .map(|thread_id| {
            let dict_clone = Arc::clone(&shared_dict);
            let ops = operations.clone();
            let stop = stop_flag.clone();
            let terms = initial_terms.clone();

            thread::spawn(move || {
                let mut local_ops = 0;

                while !stop.load(Ordering::Relaxed) && local_ops < OPS_PER_THREAD {
                    // Alternate between reads and writes
                    if local_ops % 2 == 0 {
                        // Read operation
                        let dict_guard = dict_clone.read();
                        let term = &terms[local_ops % terms.len()];
                        let _ = dict_guard.contains(term);
                    } else {
                        // Write operation
                        let dict_guard = dict_clone.write();
                        let term = format!("new_t{}_{:04}", thread_id, local_ops);
                        let _ = dict_guard.insert_with_value(&term, local_ops as i32);
                    }

                    local_ops += 1;
                    ops.fetch_add(1, Ordering::Relaxed);
                }
            })
        })
        .collect();

    // Let threads run
    thread::sleep(Duration::from_millis(50));
    stop_flag.store(true, Ordering::SeqCst);

    for handle in handles {
        handle.join().expect("thread join");
    }

    // Should have completed many operations
    let total_ops = operations.load(Ordering::SeqCst);
    assert!(total_ops > 0, "Operations should have been performed");

    // Original terms should still exist
    let dict_guard = shared_dict.read();
    for term in &initial_terms {
        assert!(
            dict_guard.contains(term),
            "Original term should exist: {}",
            term
        );
    }
}

// =============================================================================
// Test: Stress - Many Short-Lived Threads
// =============================================================================

#[test]
fn test_many_short_lived_threads() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("short_lived.part");

    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Pre-populate
    for i in 0..50 {
        let term = format!("base{:03}", i);
        let _ = dict.insert_with_value(&term, i);
    }
    dict.sync().expect("sync");

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let success_count = Arc::new(AtomicUsize::new(0));

    // Spawn many short-lived threads
    let handles: Vec<_> = (0..50)
        .map(|i| {
            let dict_clone = Arc::clone(&shared_dict);
            let success = success_count.clone();

            thread::spawn(move || {
                // Each thread does a few operations then exits
                let dict_guard = dict_clone.read();
                let term = format!("base{:03}", i % 50);
                if dict_guard.contains(&term) {
                    success.fetch_add(1, Ordering::Relaxed);
                }
            })
        })
        .collect();

    for handle in handles {
        handle.join().expect("thread join");
    }

    let successes = success_count.load(Ordering::SeqCst);
    assert_eq!(successes, 50, "All lookups should succeed");
}

// =============================================================================
// Test: Concurrent Opens of Same Dictionary (should fail)
// =============================================================================

#[test]
fn test_concurrent_opens_same_path() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("same_path.part");

    // Create the dictionary
    let _dict: PersistentARTrie<()> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Try to create another dictionary at the same path - should fail
    let result: Result<PersistentARTrie<()>, _> = PersistentARTrie::create(&dict_path);
    assert!(
        result.is_err(),
        "Creating another dictionary at same path should fail"
    );
}

// =============================================================================
// Test: SharedARTrie Shares State
// =============================================================================

#[test]
fn test_shared_artrie_shares_state() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("shared_state.part");

    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Insert via original handle
    let _ = dict.insert_with_value("hello", 42);

    // Wrap in SharedARTrie
    let shared_dict = make_shared(dict);

    // Clone should see the insert
    let dict_clone = Arc::clone(&shared_dict);
    {
        let dict_guard = dict_clone.read();
        assert!(
            dict_guard.contains("hello"),
            "Clone should see original insert"
        );
    }

    // Insert via clone
    {
        let dict_guard = dict_clone.write();
        let _ = dict_guard.insert_with_value("world", 100);
    }

    // Original should see clone's insert
    {
        let dict_guard = shared_dict.read();
        assert!(
            dict_guard.contains("world"),
            "Original should see clone's insert"
        );
    }
}

// =============================================================================
// Test: Sync From Multiple Threads
// =============================================================================

#[test]
fn test_sync_from_multiple_threads() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("multi_sync.part");

    let dict: PersistentARTrie<i32> = PersistentARTrie::create(&dict_path).expect("create dict");

    // Insert some data
    for i in 0..50 {
        let _ = dict.insert_with_value(&format!("sync{:03}", i), i);
    }

    // Wrap in SharedARTrie for thread-safe access
    let shared_dict = make_shared(dict);

    let barrier = Arc::new(Barrier::new(4));
    let sync_errors = Arc::new(AtomicUsize::new(0));

    // Multiple threads calling sync concurrently
    let handles: Vec<_> = (0..4)
        .map(|_| {
            let dict_clone = Arc::clone(&shared_dict);
            let barrier_clone = barrier.clone();
            let errors = sync_errors.clone();

            thread::spawn(move || {
                barrier_clone.wait();

                // Multiple sync calls should be safe
                for _ in 0..5 {
                    let dict_guard = dict_clone.read();
                    if dict_guard.sync().is_err() {
                        errors.fetch_add(1, Ordering::Relaxed);
                    }
                }
            })
        })
        .collect();

    for handle in handles {
        handle.join().expect("thread join");
    }

    let errors = sync_errors.load(Ordering::SeqCst);
    assert_eq!(errors, 0, "All sync calls should succeed");
}

// =============================================================================
// Test: Transducer Queries (if available)
// =============================================================================

// Note: Concurrent transducer tests require the transducer module.
// This is a placeholder for when that integration is needed.
#[test]
#[ignore = "Transducer concurrent tests require transducer module integration"]
fn test_concurrent_transducer_queries() {
    // TODO: Add transducer concurrent query tests when needed
    // This would test multiple threads querying with Levenshtein automata
}

// =============================================================================
// Test: Lock-Free CAS Insert
// =============================================================================

#[test]
fn test_lockfree_insert_cas_basic() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("lockfree_basic.part");

    let mut dict: PersistentARTrie<()> = PersistentARTrie::create(&dict_path).expect("create dict");
    dict.set_durability_policy(DurabilityPolicy::Immediate);

    // Insert some terms using CAS
    assert!(
        dict.insert_cas_durable(b"hello").expect("durable insert"),
        "First insert should succeed"
    );
    assert!(
        !dict.insert_cas_durable(b"hello").expect("durable insert"),
        "Duplicate insert should return false"
    );

    assert!(
        dict.insert_cas_durable(b"world").expect("durable insert"),
        "Second term should succeed"
    );
    assert!(
        dict.insert_cas_durable(b"foo").expect("durable insert"),
        "Third term should succeed"
    );

    // Verify using lock-free contains
    assert!(dict.contains_lockfree(b"hello"), "Should find hello");
    assert!(dict.contains_lockfree(b"world"), "Should find world");
    assert!(dict.contains_lockfree(b"foo"), "Should find foo");
    assert!(!dict.contains_lockfree(b"bar"), "Should not find bar");
}

#[test]
fn test_lockfree_insert_cas_concurrent() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("lockfree_concurrent.part");

    let mut dict: PersistentARTrie<()> = PersistentARTrie::create(&dict_path).expect("create dict");
    dict.set_durability_policy(DurabilityPolicy::Immediate);

    // Wrap in Arc for sharing (no RwLock needed for lock-free ops!)
    let dict = Arc::new(dict);

    let barrier = Arc::new(Barrier::new(NUM_READERS));
    let insert_count = Arc::new(AtomicUsize::new(0));

    // Spawn multiple threads doing concurrent inserts
    let handles: Vec<_> = (0..NUM_READERS)
        .map(|thread_id| {
            let dict_clone = Arc::clone(&dict);
            let barrier_clone = barrier.clone();
            let count = insert_count.clone();

            thread::spawn(move || {
                barrier_clone.wait();

                // Each thread inserts unique terms
                for i in 0..OPS_PER_THREAD {
                    let term = format!("t{}_{:05}", thread_id, i);
                    if dict_clone
                        .insert_cas_durable(term.as_bytes())
                        .expect("durable insert")
                    {
                        count.fetch_add(1, Ordering::Relaxed);
                    }
                }
            })
        })
        .collect();

    for handle in handles {
        handle.join().expect("thread join");
    }

    // All inserts should succeed since each thread uses unique terms
    let total = insert_count.load(Ordering::SeqCst);
    assert_eq!(
        total,
        NUM_READERS * OPS_PER_THREAD,
        "All unique inserts should succeed"
    );

    // Verify all terms are findable
    for thread_id in 0..NUM_READERS {
        for i in 0..OPS_PER_THREAD {
            let term = format!("t{}_{:05}", thread_id, i);
            assert!(
                dict.contains_lockfree(term.as_bytes()),
                "Term should be found: {}",
                term
            );
        }
    }

    // Check CAS retry count (should be low for unique terms)
    let retries = dict.cas_retry_count();
    println!(
        "CAS retries for {} inserts: {} ({:.2}%)",
        NUM_READERS * OPS_PER_THREAD,
        retries,
        100.0 * retries as f64 / (NUM_READERS * OPS_PER_THREAD) as f64
    );
}

#[test]
fn test_lockfree_insert_cas_same_terms() {
    let temp_dir = TempDir::new().expect("create temp dir");
    let dict_path = temp_dir.path().join("lockfree_same.part");

    let mut dict: PersistentARTrie<()> = PersistentARTrie::create(&dict_path).expect("create dict");
    dict.set_durability_policy(DurabilityPolicy::Immediate);

    // Wrap in Arc for sharing
    let dict = Arc::new(dict);

    let barrier = Arc::new(Barrier::new(NUM_READERS));
    let insert_success = Arc::new(AtomicUsize::new(0));

    // Generate a shared list of terms
    let terms: Vec<String> = (0..50).map(|i| format!("shared_{:03}", i)).collect();
    let terms_arc = Arc::new(terms);

    // Spawn multiple threads trying to insert the SAME terms
    let handles: Vec<_> = (0..NUM_READERS)
        .map(|_| {
            let dict_clone = Arc::clone(&dict);
            let barrier_clone = barrier.clone();
            let count = insert_success.clone();
            let terms = terms_arc.clone();

            thread::spawn(move || {
                barrier_clone.wait();

                // Each thread tries to insert the same 50 terms
                for term in terms.iter() {
                    if dict_clone
                        .insert_cas_durable(term.as_bytes())
                        .expect("durable insert")
                    {
                        count.fetch_add(1, Ordering::Relaxed);
                    }
                }
            })
        })
        .collect();

    for handle in handles {
        handle.join().expect("thread join");
    }

    // Only 50 inserts should succeed (one per unique term)
    let total = insert_success.load(Ordering::SeqCst);
    assert_eq!(
        total, 50,
        "Only 50 unique terms should be inserted, got {}",
        total
    );

    // Verify all terms exist
    for term in terms_arc.iter() {
        assert!(
            dict.contains_lockfree(term.as_bytes()),
            "Term should be found: {}",
            term
        );
    }
}