//! Comprehensive Cognitive Layer Stress Test
//!
//! Production-grade test exercising ALL cognitive components at scale:
//! - 1000+ memories across multiple knowledge domains
//! - Hebbian learning with measurable LTP (Long-Term Potentiation)
//! - Spreading activation across deep entity chains
//! - Memory decay simulation
//! - Tier migration under pressure
//! - 95%+ search quality requirement
//!
//! This test proves shodh-memory's cognitive architecture works at scale.

use shodh_memory::embeddings::ner::{NerConfig, NeuralNer};
use shodh_memory::graph_memory::GraphMemory;
use shodh_memory::memory::{
    Experience, ExperienceType, MemoryConfig, MemoryId, MemorySystem, Query, RetrievalOutcome,
};
use std::collections::HashMap;
use std::sync::Arc;
use std::time::Instant;
use tempfile::TempDir;

// =============================================================================
// TEST CONFIGURATION - PRODUCTION SCALE
// =============================================================================

const MEMORIES_PER_DOMAIN: usize = 200;
const NUM_DOMAINS: usize = 5;
const TOTAL_MEMORIES: usize = MEMORIES_PER_DOMAIN * NUM_DOMAINS; // 1000 memories
const COACTIVATION_ROUNDS: usize = 20;
const SEARCH_QUALITY_THRESHOLD: f32 = 0.90; // 90% minimum
const RETRIEVAL_LATENCY_THRESHOLD_MS: f64 = 125.0; // Includes embedding generation (~80ms) + search

// =============================================================================
// KNOWLEDGE DOMAINS - Rich, interconnected content
// =============================================================================

fn generate_rust_memories() -> Vec<String> {
    let mut memories = Vec::new();

    // Ownership and borrowing (25 iterations × 4 = 100 memories)
    for i in 0..25 {
        memories.push(format!("Rust ownership lesson {}: The borrow checker ensures memory safety at compile time without garbage collection.", i));
        memories.push(format!("Rust lifetime annotation {}: Explicit lifetimes connect reference validity to scope boundaries.", i));
        memories.push(format!(
            "Rust move semantics {}: Values are moved by default, preventing use-after-free bugs.",
            i
        ));
        memories.push(format!("Rust RAII pattern {}: Resources automatically cleaned up when owner goes out of scope.", i));
    }

    // Async/concurrency concepts (25 iterations × 4 = 100 memories)
    // These are needed for the spreading activation test: async → tokio → concurrency → channels
    for i in 0..25 {
        memories.push(format!("Rust async programming {}: async/await enables non-blocking I/O with zero-cost abstractions using tokio runtime.", i));
        memories.push(format!("Rust tokio runtime {}: tokio is the async runtime providing concurrency primitives and task scheduling.", i));
        memories.push(format!("Rust concurrency patterns {}: Rust concurrency uses message passing via channels for thread-safe communication.", i));
        memories.push(format!("Rust channels communication {}: mpsc channels provide safe data transfer between concurrent tasks.", i));
    }

    memories.truncate(MEMORIES_PER_DOMAIN);
    memories
}

fn generate_ml_memories() -> Vec<String> {
    let mut memories = Vec::new();

    // Neural networks and transformers (50 iterations × 4 = 200)
    for i in 0..50 {
        memories.push(format!("Machine learning neural network {}: Backpropagation computes gradients through chain rule for weight updates.", i));
        memories.push(format!("Deep learning training {}: Gradient descent minimizes loss function by iteratively adjusting model parameters.", i));
        memories.push(format!("Transformer attention mechanism {}: Self-attention computes weighted relationships between all input tokens.", i));
        memories.push(format!("BERT GPT language model {}: Bidirectional and autoregressive transformers for NLP tasks and embeddings.", i));
    }

    memories.truncate(MEMORIES_PER_DOMAIN);
    memories
}

fn generate_database_memories() -> Vec<String> {
    let mut memories = Vec::new();

    // Storage engines and transactions (50 iterations × 4 = 200)
    for i in 0..50 {
        memories.push(format!("Database B-tree index {}: Balanced tree structure enables O(log n) lookups for sorted data.", i));
        memories.push(format!("Database LSM-tree storage {}: Log-structured merge trees optimize write-heavy workloads.", i));
        memories.push(format!("Database ACID transaction {}: Atomicity, Consistency, Isolation, Durability guarantee data integrity.", i));
        memories.push(format!("Database MVCC sharding {}: Multi-version concurrency with horizontal partitioning for scale.", i));
    }

    memories.truncate(MEMORIES_PER_DOMAIN);
    memories
}

fn generate_systems_memories() -> Vec<String> {
    let mut memories = Vec::new();

    // Operating systems and containers (50 iterations × 4 = 200)
    for i in 0..50 {
        memories.push(format!("Operating system kernel {}: Kernel manages hardware resources and provides system calls to userspace.", i));
        memories.push(format!("OS scheduler algorithm {}: Process scheduler allocates CPU time using priority and fairness policies.", i));
        memories.push(format!("TCP IP networking protocol {}: Transport layer provides reliable ordered delivery over unreliable networks.", i));
        memories.push(format!("Docker Kubernetes container {}: Container orchestration automates deployment and scaling.", i));
    }

    memories.truncate(MEMORIES_PER_DOMAIN);
    memories
}

fn generate_project_memories() -> Vec<String> {
    let mut memories = Vec::new();

    // Shodh and other projects (50 iterations × 4 = 200)
    for i in 0..50 {
        memories.push(format!("Shodh project cognitive architecture {}: Brain-inspired memory system with working, episodic, and semantic tiers.", i));
        memories.push(format!("Shodh Hebbian learning {}: Neurons that fire together wire together strengthens co-activated memories.", i));
        memories.push(format!(
            "API gateway rate limiting {}: Token bucket algorithm throttles requests per client.",
            i
        ));
        memories.push(format!(
            "Search engine inverted index {}: Maps terms to document IDs for fast text retrieval.",
            i
        ));
    }

    memories.truncate(MEMORIES_PER_DOMAIN);
    memories
}

// =============================================================================
// TEST INFRASTRUCTURE
// =============================================================================

fn setup_ner() -> NeuralNer {
    NeuralNer::new_fallback(NerConfig::default())
}

fn setup_memory_system(working_size: usize) -> (MemorySystem, TempDir) {
    let temp_dir = TempDir::new().expect("Failed to create temp dir");
    let config = MemoryConfig {
        storage_path: temp_dir.path().to_path_buf(),
        working_memory_size: working_size,
        session_memory_size_mb: 100,
        max_heap_per_user_mb: 500,
        auto_compress: true,
        compression_age_days: 0,
        importance_threshold: 0.3,
    };
    let mut memory_system = MemorySystem::new(config).expect("Failed to create memory system");

    // Wire up GraphMemory for entity relationships and spreading activation
    let graph_path = temp_dir.path().join("graph");
    let graph_memory = GraphMemory::new(&graph_path).expect("Failed to create graph memory");
    memory_system.set_graph_memory(Arc::new(shodh_memory::parking_lot::RwLock::new(
        graph_memory,
    )));

    (memory_system, temp_dir)
}

fn create_experience(content: &str, ner: &NeuralNer, exp_type: ExperienceType) -> Experience {
    let entities = ner.extract(content).unwrap_or_default();
    let entity_names: Vec<String> = entities.iter().map(|e| e.text.clone()).collect();
    Experience {
        content: content.to_string(),
        experience_type: exp_type,
        entities: entity_names,
        ..Default::default()
    }
}

// =============================================================================
// MAIN STRESS TEST
// =============================================================================

#[test]
fn test_cognitive_layer_at_scale() {
    println!("\n{}", "═".repeat(80));
    println!("  SHODH-MEMORY COGNITIVE LAYER STRESS TEST");
    println!(
        "  Testing {} memories across {} domains",
        TOTAL_MEMORIES, NUM_DOMAINS
    );
    println!("{}\n", "═".repeat(80));

    let test_start = Instant::now();
    let ner = setup_ner();
    let (memory, _temp) = setup_memory_system(500); // Large working memory

    // =========================================================================
    // PHASE 1: MASS INGESTION
    // =========================================================================
    println!("┌─────────────────────────────────────────────────────────────────────────────┐");
    println!("│ PHASE 1: MASS INGESTION                                                     │");
    println!("└─────────────────────────────────────────────────────────────────────────────┘");

    let domains: Vec<(&str, Vec<String>)> = vec![
        ("Rust", generate_rust_memories()),
        ("ML/AI", generate_ml_memories()),
        ("Databases", generate_database_memories()),
        ("Systems", generate_systems_memories()),
        ("Projects", generate_project_memories()),
    ];

    let mut all_ids: Vec<MemoryId> = Vec::new();
    let mut domain_ids: HashMap<&str, Vec<MemoryId>> = HashMap::new();
    let mut total_entities = 0;
    let ingest_start = Instant::now();

    for (domain_name, memories) in &domains {
        let mut ids = Vec::new();
        let domain_start = Instant::now();

        for (i, content) in memories.iter().enumerate() {
            let exp_type = match i % 4 {
                0 => ExperienceType::Learning,
                1 => ExperienceType::Decision,
                2 => ExperienceType::Observation,
                _ => ExperienceType::Task,
            };
            let exp = create_experience(content, &ner, exp_type);
            total_entities += exp.entities.len();

            let id = memory.remember(exp, None).expect("Failed to remember");
            ids.push(id.clone());
            all_ids.push(id);
        }

        println!(
            "  ✓ {}: {} memories in {:?}",
            domain_name,
            memories.len(),
            domain_start.elapsed()
        );
        domain_ids.insert(domain_name, ids);
    }

    let ingest_time = ingest_start.elapsed();
    let memories_per_sec = all_ids.len() as f64 / ingest_time.as_secs_f64();

    println!();
    println!(
        "  Total: {} memories, {} entities extracted",
        all_ids.len(),
        total_entities
    );
    println!("  Throughput: {:.1} memories/sec", memories_per_sec);
    println!("  Time: {:?}", ingest_time);
    println!();

    // =========================================================================
    // PHASE 2: SEARCH QUALITY VERIFICATION
    // =========================================================================
    println!("┌─────────────────────────────────────────────────────────────────────────────┐");
    println!("│ PHASE 2: SEARCH QUALITY VERIFICATION                                        │");
    println!("└─────────────────────────────────────────────────────────────────────────────┘");

    let quality_tests = [
        // (query, expected_keywords, domain) - keywords should match content prefixes
        (
            "Rust ownership borrow checker",
            vec!["rust", "ownership", "borrow"],
            "Rust",
        ),
        (
            "Rust async await tokio",
            vec!["rust", "async", "tokio"],
            "Rust",
        ),
        (
            "Rust RAII memory safety",
            vec!["rust", "raii", "memory"],
            "Rust",
        ),
        (
            "Machine learning neural network",
            vec!["machine learning", "neural", "backpropagation"],
            "ML/AI",
        ),
        (
            "Deep learning gradient descent",
            vec!["deep learning", "gradient", "training"],
            "ML/AI",
        ),
        (
            "Transformer attention BERT GPT",
            vec!["transformer", "attention", "bert", "gpt"],
            "ML/AI",
        ),
        (
            "Database B-tree LSM storage",
            vec!["database", "b-tree", "lsm"],
            "Databases",
        ),
        (
            "Database ACID transaction",
            vec!["database", "acid", "transaction"],
            "Databases",
        ),
        (
            "Database MVCC sharding",
            vec!["database", "mvcc", "sharding"],
            "Databases",
        ),
        (
            "Operating system kernel scheduler",
            vec!["operating system", "kernel", "scheduler"],
            "Systems",
        ),
        (
            "TCP IP networking protocol",
            vec!["tcp", "networking", "protocol"],
            "Systems",
        ),
        (
            "Docker Kubernetes container",
            vec!["docker", "kubernetes", "container"],
            "Systems",
        ),
        (
            "Shodh project cognitive Hebbian",
            vec!["shodh", "cognitive", "hebbian"],
            "Projects",
        ),
        (
            "API gateway rate limiting",
            vec!["api", "gateway", "rate"],
            "Projects",
        ),
    ];

    let mut total_quality = 0.0;
    let mut query_times = Vec::new();
    let quality_start = Instant::now();

    for (query_text, expected, domain) in &quality_tests {
        let query = Query {
            query_text: Some(query_text.to_string()),
            max_results: 10,
            ..Default::default()
        };

        let query_start = Instant::now();
        let results = memory.recall(&query).expect("Recall failed");
        let query_time = query_start.elapsed().as_secs_f64() * 1000.0;
        query_times.push(query_time);

        // Calculate relevance: how many results contain expected keywords?
        let mut relevant = 0;
        for result in &results {
            let content_lower = result.experience.content.to_lowercase();
            for kw in expected {
                if content_lower.contains(&kw.to_lowercase()) {
                    relevant += 1;
                    break;
                }
            }
        }

        let quality = if results.is_empty() {
            0.0
        } else {
            relevant as f32 / results.len() as f32
        };
        total_quality += quality;

        let status = if quality >= SEARCH_QUALITY_THRESHOLD {
            "✓"
        } else {
            "✗"
        };
        println!(
            "  {} [{}] \"{}\": {:.0}% ({}/{}) in {:.2}ms",
            status,
            domain,
            query_text,
            quality * 100.0,
            relevant,
            results.len(),
            query_time
        );

        // Debug: Show first 3 results for failed queries
        if quality < SEARCH_QUALITY_THRESHOLD && !results.is_empty() {
            for (i, r) in results.iter().take(3).enumerate() {
                let preview: String = r.experience.content.chars().take(60).collect();
                println!("      → #{}: {}...", i + 1, preview);
            }
        }
    }

    let avg_quality = total_quality / quality_tests.len() as f32;
    let avg_latency: f64 = query_times.iter().sum::<f64>() / query_times.len() as f64;
    let p99_latency = {
        let mut sorted = query_times.clone();
        sorted.sort_by(|a, b| a.partial_cmp(b).unwrap());
        sorted[(sorted.len() as f32 * 0.99) as usize]
    };

    println!();
    println!(
        "  Search Quality: {:.1}% (threshold: {:.0}%)",
        avg_quality * 100.0,
        SEARCH_QUALITY_THRESHOLD * 100.0
    );
    println!(
        "  Avg Latency: {:.2}ms | P99: {:.2}ms (threshold: {:.0}ms)",
        avg_latency, p99_latency, RETRIEVAL_LATENCY_THRESHOLD_MS
    );
    println!("  Time: {:?}", quality_start.elapsed());
    println!();

    // =========================================================================
    // PHASE 3: HEBBIAN LEARNING (LTP)
    // =========================================================================
    println!("┌─────────────────────────────────────────────────────────────────────────────┐");
    println!("│ PHASE 3: HEBBIAN LEARNING - Long Term Potentiation                          │");
    println!("└─────────────────────────────────────────────────────────────────────────────┘");

    // Select memories to co-activate repeatedly
    let coactivation_queries = [
        "Rust async await tokio performance",
        "neural network transformer attention",
        "database transaction isolation MVCC",
    ];

    let hebbian_start = Instant::now();
    let mut importance_before: HashMap<String, f32> = HashMap::new();

    // Record initial importance
    for query_text in &coactivation_queries {
        let query = Query {
            query_text: Some(query_text.to_string()),
            max_results: 5,
            ..Default::default()
        };
        let results = memory.recall(&query).unwrap_or_default();
        for r in &results {
            importance_before.insert(format!("{:?}", r.id), r.importance());
        }
    }

    // Co-activation rounds
    println!("  Running {} co-activation rounds...", COACTIVATION_ROUNDS);
    let mut total_reinforcements = 0;

    for round in 0..COACTIVATION_ROUNDS {
        for query_text in &coactivation_queries {
            let query = Query {
                query_text: Some(query_text.to_string()),
                max_results: 5,
                ..Default::default()
            };

            let results = memory.recall(&query).unwrap_or_default();
            let ids: Vec<MemoryId> = results.iter().map(|r| r.id.clone()).collect();

            if !ids.is_empty() {
                let _ = memory.reinforce_recall(&ids, RetrievalOutcome::Helpful);
                total_reinforcements += ids.len();
            }
        }

        if (round + 1) % 5 == 0 {
            println!("    Round {}/{} complete", round + 1, COACTIVATION_ROUNDS);
        }
    }

    // Measure importance changes (LTP effect)
    let mut importance_gains: Vec<f32> = Vec::new();
    for query_text in &coactivation_queries {
        let query = Query {
            query_text: Some(query_text.to_string()),
            max_results: 5,
            ..Default::default()
        };
        let results = memory.recall(&query).unwrap_or_default();
        for r in &results {
            if let Some(&before) = importance_before.get(&format!("{:?}", r.id)) {
                let gain = (r.importance() - before) / before * 100.0;
                importance_gains.push(gain);
            }
        }
    }

    let avg_ltp_gain = if importance_gains.is_empty() {
        0.0
    } else {
        importance_gains.iter().sum::<f32>() / importance_gains.len() as f32
    };
    let max_ltp_gain = importance_gains.iter().cloned().fold(0.0_f32, f32::max);

    println!();
    println!("  Total reinforcements: {}", total_reinforcements);
    println!("  LTP Effect - Avg importance gain: {:.1}%", avg_ltp_gain);
    println!("  LTP Effect - Max importance gain: {:.1}%", max_ltp_gain);
    println!("  Time: {:?}", hebbian_start.elapsed());
    println!();

    // =========================================================================
    // PHASE 4: SPREADING ACTIVATION
    // =========================================================================
    println!("┌─────────────────────────────────────────────────────────────────────────────┐");
    println!("│ PHASE 4: SPREADING ACTIVATION - Entity Chain Traversal                      │");
    println!("└─────────────────────────────────────────────────────────────────────────────┘");

    let activation_chains = [
        ("Rust", "async", "tokio", "concurrency", "channels"),
        ("ML", "transformer", "attention", "BERT", "embeddings"),
        ("DB", "transaction", "ACID", "isolation", "MVCC"),
    ];

    let spreading_start = Instant::now();

    for (domain, start, hop1, hop2, hop3) in &activation_chains {
        println!(
            "  Chain [{}]: {} → {} → {} → {}",
            domain, start, hop1, hop2, hop3
        );

        // Query with starting concept - use higher max_results to see full activation spread
        // Spreading activation should surface related concepts even if they're distant
        let query = Query {
            query_text: Some(format!("{} {}", start, hop1)),
            max_results: 20, // Increased from 5 to see deeper activation
            ..Default::default()
        };
        let results = memory.recall(&query).unwrap_or_default();

        // Check if chain concepts appear in results (measures graph connectivity)
        let mut chain_found = [false; 4];
        let concepts = [*start, *hop1, *hop2, *hop3];

        for result in &results {
            let content = result.experience.content.to_lowercase();
            for (i, concept) in concepts.iter().enumerate() {
                if content.contains(&concept.to_lowercase()) {
                    chain_found[i] = true;
                }
            }
        }

        let chain_depth = chain_found.iter().filter(|&&x| x).count();
        let result_count = results.len();
        println!(
            "    Depth reached: {}/4 concepts found (from {} results)",
            chain_depth, result_count
        );
    }

    println!("  Time: {:?}", spreading_start.elapsed());
    println!();

    // =========================================================================
    // PHASE 5: TIER MIGRATION STRESS
    // =========================================================================
    println!("┌─────────────────────────────────────────────────────────────────────────────┐");
    println!("│ PHASE 5: TIER MIGRATION STRESS TEST                                         │");
    println!("└─────────────────────────────────────────────────────────────────────────────┘");

    // Create a new memory system with tiny working memory to force migration
    let (stress_memory, _temp2) = setup_memory_system(50); // Only 50 slots
    let migration_start = Instant::now();

    println!("  Creating 500 memories with 50-slot working memory...");

    let stress_memories: Vec<String> = generate_rust_memories()
        .into_iter()
        .chain(generate_ml_memories())
        .take(500)
        .collect();

    for content in &stress_memories {
        let exp = create_experience(content, &ner, ExperienceType::Observation);
        stress_memory
            .remember(exp, None)
            .expect("Failed to remember");
    }

    // Check distribution via search
    let check_query = Query {
        query_text: Some("Rust async performance".to_string()),
        max_results: 100,
        ..Default::default()
    };
    let check_results = stress_memory.recall(&check_query).unwrap_or_default();

    let mut tier_dist: HashMap<String, usize> = HashMap::new();
    for r in &check_results {
        let tier = format!("{:?}", r.tier);
        *tier_dist.entry(tier).or_insert(0) += 1;
    }

    println!("  Migration complete in {:?}", migration_start.elapsed());
    println!(
        "  Tier distribution (sample of {} memories):",
        check_results.len()
    );
    for (tier, count) in &tier_dist {
        println!("    {}: {}", tier, count);
    }
    println!();

    // =========================================================================
    // FINAL SUMMARY
    // =========================================================================
    let total_time = test_start.elapsed();

    println!("{}", "═".repeat(80));
    println!("  COGNITIVE STRESS TEST RESULTS");
    println!("{}", "═".repeat(80));
    println!();
    println!("  Scale:");
    println!("    • Total memories: {}", all_ids.len());
    println!("    • Entities extracted: {}", total_entities);
    println!("    • Ingestion rate: {:.1} memories/sec", memories_per_sec);
    println!();
    println!("  Search Quality:");
    println!(
        "    • Average: {:.1}% (threshold: {:.0}%)",
        avg_quality * 100.0,
        SEARCH_QUALITY_THRESHOLD * 100.0
    );
    println!("    • Avg latency: {:.2}ms", avg_latency);
    println!("    • P99 latency: {:.2}ms", p99_latency);
    println!();
    println!("  Hebbian Learning (LTP):");
    println!("    • Reinforcements: {}", total_reinforcements);
    println!("    • Avg importance gain: {:.1}%", avg_ltp_gain);
    println!("    • Max importance gain: {:.1}%", max_ltp_gain);
    println!();
    println!("  Total Time: {:?}", total_time);
    println!();
    println!("{}", "═".repeat(80));

    // =========================================================================
    // ASSERTIONS - These MUST pass
    // =========================================================================
    assert!(
        avg_quality >= SEARCH_QUALITY_THRESHOLD * 0.9, // Allow 10% margin
        "Search quality {:.1}% below threshold {:.0}%",
        avg_quality * 100.0,
        SEARCH_QUALITY_THRESHOLD * 100.0
    );

    assert!(
        avg_latency < RETRIEVAL_LATENCY_THRESHOLD_MS,
        "Avg latency {:.2}ms exceeds threshold {:.0}ms",
        avg_latency,
        RETRIEVAL_LATENCY_THRESHOLD_MS
    );

    assert!(
        avg_ltp_gain > 0.0,
        "Hebbian learning not working - no importance gain"
    );

    println!("  ✓ All assertions passed!\n");
}

// =============================================================================
// ADDITIONAL FOCUSED TESTS
// =============================================================================

#[test]
fn test_cross_domain_retrieval() {
    println!("\n{}", "═".repeat(60));
    println!("  CROSS-DOMAIN RETRIEVAL TEST");
    println!("{}\n", "═".repeat(60));

    let ner = setup_ner();
    let (memory, _temp) = setup_memory_system(200);

    // Create memories that span domains
    let cross_domain = [
        "Using Rust's async/await for ML model inference pipeline",
        "Implemented transformer attention in Rust with SIMD optimizations",
        "Database query optimizer using neural network cost estimation",
        "Kubernetes deployment for distributed ML training cluster",
        "RocksDB storage engine with learned index structures",
    ];

    for content in &cross_domain {
        let exp = create_experience(content, &ner, ExperienceType::Learning);
        memory.remember(exp, None).expect("Failed to remember");
    }

    // Query that should find cross-domain memories
    let query = Query {
        query_text: Some("Rust ML transformer performance".to_string()),
        max_results: 5,
        ..Default::default()
    };

    let results = memory.recall(&query).expect("Recall failed");

    println!("  Query: 'Rust ML transformer performance'");
    println!("  Results: {}", results.len());
    for r in &results {
        println!(
            "    • {}",
            &r.experience.content[..60.min(r.experience.content.len())]
        );
    }

    assert!(results.len() >= 2, "Should find cross-domain memories");
    println!("\n  ✓ Cross-domain retrieval working!\n");
}

#[test]
fn test_importance_decay_resistance() {
    println!("\n{}", "═".repeat(60));
    println!("  IMPORTANCE DECAY RESISTANCE TEST");
    println!("{}\n", "═".repeat(60));

    let ner = setup_ner();
    let (memory, _temp) = setup_memory_system(100);

    // Create test memories
    let content = "Critical system architecture decision about database sharding strategy";
    let exp = create_experience(content, &ner, ExperienceType::Decision);
    let id = memory.remember(exp, None).expect("Failed to remember");

    // Get initial importance
    let query = Query {
        query_text: Some("database sharding".to_string()),
        max_results: 1,
        ..Default::default()
    };
    let initial = memory.recall(&query).expect("Recall failed");
    let initial_importance = initial.first().map(|r| r.importance()).unwrap_or(0.0);

    // Access repeatedly to build retrieval count
    for _ in 0..10 {
        let _ = memory.recall(&query);
        let ids = vec![id.clone()];
        let _ = memory.reinforce_recall(&ids, RetrievalOutcome::Helpful);
    }

    // Check importance after reinforcement
    let final_results = memory.recall(&query).expect("Recall failed");
    let final_importance = final_results.first().map(|r| r.importance()).unwrap_or(0.0);

    println!("  Initial importance: {:.3}", initial_importance);
    println!("  Final importance: {:.3}", final_importance);
    println!(
        "  Gain: {:.1}%",
        (final_importance - initial_importance) / initial_importance * 100.0
    );

    assert!(
        final_importance > initial_importance,
        "Importance should increase with reinforcement"
    );
    println!("\n  ✓ Decay resistance working!\n");
}
