std::cmp::Ordering::Equal; fn sort_by_min_angle(pts: &[(f64, f64)], min: &(f64, f64)) -> Vec<(f64, f64)> { let mut points: Vec<(f64, f64, (f64, f64))> = pts .iter() .map(|x| { fn convex_hull_graham(pts: &[(f64, f64)]) -> Vec<(f64, f64)> { if pts.is_empty() { return vec![]; } let mut stack: Vec<(f64, f64)> = vec![]; let min = pts .iter() o => o, } }) .unwrap(); let points = sort_by_min_angle(pts, min); 2024/3/7 20:44 Rust算法教程 The Algos (algorithms) https://algo.course.rs/print.html 206/270