derp.rs

fn partition_points(vertices: &Vec<Vertex2>, e: &Edge, s_opt: Option<&Vec<(usize, f32)>>) -> (Vec<(usize, f32)>, Vec<(usize, f32)>) {
    let mut s_right = Vec::<(usize, f32)>::new();
    let mut s_left = Vec::<(usize, f32)>::new();
    
// i did this...
    
    let closure = |i: &usize| {
        if *i == e.origin || *i == e.destination {
            return;
        }
        if let Some(d) = e.intersect_from_ray(vertices, *i) {
            if d >= 0f32 {
                s_right.push((*i, d));
            } else {
                s_left.push((*i, d));
            }
        }
    };
    if let Some(s) = s_opt {
        s.iter().map(|(i, _)| *i).collect::<Vec<_>>().iter().for_each(closure);
    } else {
        (0..vertices.len()).into_iter().collect::<Vec<_>>().iter().for_each(closure);
    }

// to avoid doing this...

    if let Some(s) = s_opt {
        for (i, _) in s {
            if *i == e.origin || *i == e.destination {
                continue;
            }
            if let Some(d) = e.intersect_from_ray(vertices, *i) {
                if d >= 0f32 {
                    s_right.push((*i, d));
                } else {
                    s_left.push((*i, d));
                }
            }
        }
    } else {
        for i in 0..vertices.len() {
            if i == e.origin || i == e.destination {
                continue;
            }
            if let Some(d) = e.intersect_from_ray(vertices, i) {
                if d >= 0f32 {
                    s_right.push((i, d));
                } else {
                    s_left.push((i, d));
                }
            }
        }
    }
    (s_right, s_left)
}