From 1434688c1a79de61f067f4255d5445cad961c06e Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Ond=C5=99ej=20Huvar?= <492849@mail.muni.cz> Date: Fri, 5 Jul 2024 08:34:07 +0200 Subject: [PATCH] Bump version. --- Cargo.toml | 2 +- src/evaluation/mark_duplicates.rs | 14 +++++++------- 2 files changed, 8 insertions(+), 8 deletions(-) diff --git a/Cargo.toml b/Cargo.toml index c544f14..d0957ad 100644 --- a/Cargo.toml +++ b/Cargo.toml @@ -1,6 +1,6 @@ [package] name = "biodivine-hctl-model-checker" -version = "0.2.2" +version = "0.3.0" authors = ["Ondřej Huvar ", "Samuel Pastva "] edition = "2021" description = "Library for symbolic HCTL model checking on partially defined Boolean networks." diff --git a/src/evaluation/mark_duplicates.rs b/src/evaluation/mark_duplicates.rs index 0009356..f279f18 100644 --- a/src/evaluation/mark_duplicates.rs +++ b/src/evaluation/mark_duplicates.rs @@ -34,13 +34,6 @@ impl NodeWithDomains<'_> { } } -/// Nodes are ordered by their height, with atomic propositions being the "smallest". -impl PartialOrd for NodeWithDomains<'_> { - fn partial_cmp(&self, other: &Self) -> Option { - self.subtree.height.partial_cmp(&other.subtree.height) - } -} - /// Nodes are ordered by their height, with atomic propositions being the "smallest". /// /// Note that while this sort is "total" in the sense that every pair of nodes can be compared, @@ -51,6 +44,13 @@ impl Ord for NodeWithDomains<'_> { } } +/// Nodes are ordered by their height, with atomic propositions being the "smallest". +impl PartialOrd for NodeWithDomains<'_> { + fn partial_cmp(&self, other: &Self) -> Option { + Some(self.cmp(other)) + } +} + /// Check if there are some duplicate subtrees in a given formula syntax tree. /// This function uses canonization and thus recognizes duplicates with differently named /// variables (e.g., `AX {y}` and `AX {z}`).