Function lyon_algorithms::winding::compute_winding

pub fn compute_winding<Iter>(path: &mut Iter) -> Option<Winding>where
    Iter: Iterator<Item = PathEvent>,

Compute the winding of the next sub-path.

The sub-path is expected to have a non-null area and no self-intersections, otherwise the result is unspecified.

The iterator is advanced so that compute_winding can be called multiple times to process the successive sub-paths of a path.

Returns None if there is no more sub-path or if the the iterator is malformed.