aboutsummaryrefslogtreecommitdiff
path: root/src/util/crdt/map.rs
diff options
context:
space:
mode:
authorAlex Auvolat <alex@adnab.me>2022-09-13 16:08:00 +0200
committerAlex Auvolat <alex@adnab.me>2022-09-13 16:08:00 +0200
commit38be811b1cd20d9223b481c0ea91cc7e3ee795dc (patch)
tree1d857b13d2137b0cb032a8489e8459390c12ae9a /src/util/crdt/map.rs
parent44733474bb6c9021c92b59e5c349b4b7ef71409a (diff)
downloadgarage-38be811b1cd20d9223b481c0ea91cc7e3ee795dc.tar.gz
garage-38be811b1cd20d9223b481c0ea91cc7e3ee795dc.zip
Fix clippy lint that says we should implement Eq
Diffstat (limited to 'src/util/crdt/map.rs')
-rw-r--r--src/util/crdt/map.rs2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/util/crdt/map.rs b/src/util/crdt/map.rs
index f9ed19b6..5d1e1520 100644
--- a/src/util/crdt/map.rs
+++ b/src/util/crdt/map.rs
@@ -16,7 +16,7 @@ use crate::crdt::crdt::*;
/// However, note that even if we were using a more efficient data structure such as a `BTreeMap`,
/// the serialization cost `O(n)` would still have to be paid at each modification, so we are
/// actually not losing anything here.
-#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]
+#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, Eq)]
pub struct Map<K, V> {
vals: Vec<(K, V)>,
}