sort by dtc

Author: niklasf

src/op1.rs

@@ -1,13 +1,12 @@
-use std::collections::HashMap;
+use std::{collections::HashMap, time::Duration};
 
 use serde::{Deserialize, Serialize};
 use shakmaty::{
     fen::Fen, uci::UciMove, variant::VariantPosition, ByColor, ByRole, Chess, EnPassantMode,
     Position,
 };
-use std::time::Duration;
 
-#[derive(Debug, Serialize, Deserialize, Clone, Copy, PartialEq, Eq)]
+#[derive(Debug, Serialize, Deserialize, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
 pub struct Dtc(pub i32);
 
 impl Dtc {

src/tablebases.rs

@@ -169,18 +169,18 @@ impl Tablebases {
                     .unwrap_or(MaybeRounded::Precise(Dtz(0)))
                     .is_negative()
                 {
-                    Reverse(m.pos.dtm.or(m.pos.dtw))
+                    Reverse((m.pos.dtm.or(m.pos.dtw), m.pos.dtc))
                 } else {
-                    Reverse(None)
+                    Reverse((None, None))
                 },
                 if m.pos
                     .dtz
                     .unwrap_or(MaybeRounded::Precise(Dtz(0)))
                     .is_positive()
                 {
-                    m.pos.dtm.or(m.pos.dtw).map(Reverse)
+                    (m.pos.dtm.or(m.pos.dtw).map(Reverse), m.pos.dtc.map(Reverse))
                 } else {
-                    None
+                    (None, None)
                 },
                 m.zeroing
                     ^ !m.pos