Function fuzz_test_timed

rust/tests/fuzz_tests.rs:334–424

()

#[test]
#[ignore]
fn fuzz_test_timed() {
    // Parse time duration from environment variable or default to 10 seconds
    let duration_str = env::var("FUZZ_TIME").unwrap_or_else(|_| "10s".to_string());
    let duration = parse_duration(&duration_str).unwrap_or(Duration::from_secs(10));

    println!("Running timed fuzz test for {:?}", duration);

    let start_time = Instant::now();
    let mut total_operations = 0;
    let mut total_keys_inserted = 0;
    let mut max_nodes_reached = 0;

    while start_time.elapsed() < duration {
        // Cycle through different branching factors
        for branching_factor in [4, 5, 7, 8, 10] {
            if start_time.elapsed() >= duration {
                break;
            }

            let mut bplustree = BPlusTreeMap::new(branching_factor).unwrap();
            let mut btree_map = BTreeMap::new();
            let mut operations = Vec::new();

            // Run until we hit time limit or reach a reasonable number of nodes
            let mut key = 1;
            while start_time.elapsed() < duration && bplustree.leaf_count() < 50 {
                let value = key * 10;

                // Record the operation
                operations.push(format!("insert({}, {})", key, value));
                total_operations += 1;

                // Insert into both trees
                let bplus_result = bplustree.insert(key, value);
                let btree_result = btree_map.insert(key, value);

                // Check that insert results match
                if bplus_result != btree_result {
                    println!(
                        "MISMATCH on insert({}, {}) with branching factor {}:",
                        key, value, branching_factor
                    );
                    println!("BPlusTree returned: {:?}", bplus_result);
                    println!("BTreeMap returned: {:?}", btree_result);
                    println!("Recent operations:");
                    for op in operations.iter().rev().take(10) {
                        println!("  {}", op);
                    }
                    panic!("Insert result mismatch!");
                }

                // Periodically verify all keys can be found
                if key % 10 == 0 {
                    for check_key in 1..=key {
                        let bplus_value = bplustree.get(&check_key);
                        let btree_value = btree_map.get(&check_key);

                        if bplus_value != btree_value {