bevy_mikktspace 1.0.0

Safe rust implementation of Mikkelsen tangent space algorithm
1
2
3
4
5
6
7
8

//! Implements edge sorting using `[T]::sort`.

use super::Edge;

/// Correctly sorts [`Edge`]s using a built-in sorting algorithm.
pub(super) fn quick_sort_edges(edges: &mut [Edge]) {
    edges.sort_unstable();
}