Simplified ordering check
This commit is contained in:
parent
3ef76ab9e4
commit
a74702bb5a
|
@ -876,10 +876,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
|
||||||
for e in iter {
|
for e in iter {
|
||||||
let ae = abs(*e);
|
let ae = abs(*e);
|
||||||
|
|
||||||
if let Some(ae_ordering) = ae.partial_cmp(&max) {
|
if ae.partial_cmp(&max) == Some(ordering) {
|
||||||
if ae_ordering == ordering {
|
|
||||||
max = ae;
|
max = ae;
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue