gsathecat
/
lemmy
mirror of https://github.com/LemmyNet/lemmy.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

comment about reverse ordering

federation-send-parallel
phiresky 2024-05-30 12:52:24 +02:00
parent cdff275803
commit 175133f0cd
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
crates/federate/src/send.rs
View File

@ -14,18 +14,19 @@ use std::ops::Deref;
use tokio::{sync::mpsc::UnboundedSender, time::sleep}; use tokio::{sync::mpsc::UnboundedSender, time::sleep};
use tokio_util::sync::CancellationToken; use tokio_util::sync::CancellationToken;
#[derive(Debug, PartialEq, Eq)] #[derive(Debug, Eq)]
pub(crate) struct SendSuccessInfo { pub(crate) struct SendSuccessInfo {
pub activity_id: ActivityId, pub activity_id: ActivityId,
pub published: Option<DateTime<Utc>>, pub published: Option<DateTime<Utc>>,
pub was_skipped: bool, pub was_skipped: bool,
} }
// order backwards by activity_id for the binary heap in the worker /// order backwards by activity_id for the binary heap in the worker
impl PartialEq for SendSuccessInfo { impl PartialEq for SendSuccessInfo {
fn eq(&self, other: &Self) -> bool { fn eq(&self, other: &Self) -> bool {
self.activity_id == other.activity_id self.activity_id == other.activity_id
} }
} }
/// order backwards because the binary heap is a max heap, and we need the smallest element to be on top
impl PartialOrd for SendSuccessInfo { impl PartialOrd for SendSuccessInfo {
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> { fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
other.activity_id.partial_cmp(&self.activity_id) other.activity_id.partial_cmp(&self.activity_id)