rez-next-solver 0.3.0

Intelligent dependency resolution with A* heuristic algorithms and 3-5x performance improvement
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110

//! Integration tests for heuristic functions with A* search

use super::astar_search::AStarSearch;
use super::heuristics::{
    AdaptiveHeuristic, CompositeHeuristic, DependencyHeuristic, HeuristicConfig, HeuristicFactory,
};
use super::search_state::SearchState;
use crate::SolverConfig;
use rez_next_package::PackageRequirement;
use rez_next_repository::simple_repository::RepositoryManager;
use std::sync::Arc;
use std::time::Duration;

#[tokio::test]
async fn test_heuristic_integration_empty_requirements() {
    let repo_manager = Arc::new(RepositoryManager::new());
    let config = SolverConfig::default();
    let mut search = AStarSearch::new(repo_manager, config, Duration::from_secs(30), 1000);

    let heuristic = CompositeHeuristic::new_fast();
    let heuristic_fn = |state: &SearchState| heuristic.calculate(state);

    let result = search.search(vec![], heuristic_fn).await;
    assert!(
        result.is_ok(),
        "Search with empty requirements should succeed"
    );
    assert!(result.unwrap().is_some(), "Should find a goal immediately");
}

#[tokio::test]
async fn test_heuristic_integration_unsatisfiable() {
    let repo_manager = Arc::new(RepositoryManager::new());
    let config = SolverConfig::default();
    let mut search = AStarSearch::new(repo_manager, config, Duration::from_secs(5), 100);

    // No packages in repo, so this requirement can't be satisfied
    let requirements = vec![PackageRequirement::new("missing_package".to_string())];

    let heuristic = CompositeHeuristic::new_fast();
    let heuristic_fn = |state: &SearchState| heuristic.calculate(state);

    let result = search.search(requirements, heuristic_fn).await;
    // Either returns Ok(None) or an error — both are valid when no solution exists
    match result {
        Ok(None) => {} // No solution found — expected
        Ok(Some(_)) => panic!("Should not find a solution for a missing package"),
        Err(_) => {} // Timeout/limit — acceptable
    }
}

#[tokio::test]
async fn test_adaptive_heuristic_integration() {
    let repo_manager = Arc::new(RepositoryManager::new());
    let config = SolverConfig::default();
    let mut search = AStarSearch::new(repo_manager, config, Duration::from_secs(30), 1000);

    let mut adaptive_heuristic = AdaptiveHeuristic::new(HeuristicConfig::default());
    adaptive_heuristic.update_stats(50, 3, 8.0, 5);

    let heuristic_fn = |state: &SearchState| adaptive_heuristic.calculate(state);
    let result = search.search(vec![], heuristic_fn).await;
    assert!(result.is_ok());
}

#[tokio::test]
async fn test_heuristic_factory_complexity_levels() {
    let repo_manager = Arc::new(RepositoryManager::new());
    let config = SolverConfig::default();

    for &complexity in &[5usize, 30, 100] {
        let mut search = AStarSearch::new(
            repo_manager.clone(),
            config.clone(),
            Duration::from_secs(5),
            200,
        );
        let heuristic = HeuristicFactory::create_for_complexity(complexity);
        let heuristic_fn = |state: &SearchState| heuristic.calculate(state);
        let result = search.search(vec![], heuristic_fn).await;
        assert!(
            result.is_ok(),
            "complexity={} should not error on empty reqs",
            complexity
        );
    }
}

#[tokio::test]
async fn test_scenario_heuristics_fast_thorough_conflict_heavy() {
    let repo_manager = Arc::new(RepositoryManager::new());
    let config = SolverConfig::default();

    for scenario in &["fast", "thorough", "conflict_heavy", "unknown"] {
        let mut search = AStarSearch::new(
            repo_manager.clone(),
            config.clone(),
            Duration::from_secs(5),
            200,
        );
        let heuristic = HeuristicFactory::create_for_scenario(scenario);
        let heuristic_fn = |state: &SearchState| heuristic.calculate(state);
        let result = search.search(vec![], heuristic_fn).await;
        assert!(
            result.is_ok(),
            "scenario={} should not error on empty reqs",
            scenario
        );
    }
}