Skip to content

Commit

Permalink
Bump version.
Browse files Browse the repository at this point in the history
  • Loading branch information
ondrej33 committed Jul 5, 2024
1 parent 1e893fa commit 1434688
Show file tree
Hide file tree
Showing 2 changed files with 8 additions and 8 deletions.
2 changes: 1 addition & 1 deletion Cargo.toml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
[package]
name = "biodivine-hctl-model-checker"
version = "0.2.2"
version = "0.3.0"
authors = ["Ondřej Huvar <[email protected]>", "Samuel Pastva <[email protected]>"]
edition = "2021"
description = "Library for symbolic HCTL model checking on partially defined Boolean networks."
Expand Down
14 changes: 7 additions & 7 deletions src/evaluation/mark_duplicates.rs
Original file line number Diff line number Diff line change
Expand Up @@ -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<Ordering> {
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,
Expand All @@ -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<Ordering> {
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}`).
Expand Down

0 comments on commit 1434688

Please sign in to comment.