Struct FragSet 

pub struct FragSet {
    pub list: CommunityList,
    pub created_at: BTreeMap<usize, u64>,
    pub declared: usize,
    pub read_frags: BTreeMap<usize, FragList>,
}

What a fragment fetch found: the unioned list, and each index’s created_at so the next write to that fragment can exceed it.

Fields

list: CommunityList

created_at: BTreeMap<usize, u64>

declared: usize

frags as declared by the newest fragment seen.

read_frags: BTreeMap<usize, FragList>

The winning parsed fragment per index — what the relays currently hold, so a rewrite can skip publishing byte-identical fragments.

Implementations

impl FragSet

pub fn is_complete(&self) -> bool

Coverage, not agreement: we hold every index below declared, whatever their individual ages. A short read is read-only, never a write.