pub fn into_next_transcripts(self) -> BTreeMap<NiDkgTag, NiDkgTranscript> {
        let mut next_transcripts = self.next_transcripts;
        self.current_transcripts
            .into_iter()
            .map(|(tag, current)| (tag, next_transcripts.remove(&tag).unwrap_or(current)))
            .collect()
    }
/// Return the set of next transcripts for all tags. If for some tag
/// the next transcript is not available, the current transcript is used.
/// This function avoids expensive copying when transcripts are large.
Return the set of next transcripts for all tags. If for some tag
the next transcript is not available, the current transcript is used.
This function avoids expensive copying when transcripts are large.
Return the set of next transcripts for all tags . If for some tag the next transcript is not available the current transcript is used . This function avoids expensive copying when transcripts are large .
pub fn into_next_transcripts(self) -> BTreeMap<NiDkgTag, NiDkgTranscript> {
        let mut next_transcripts = self.next_transcripts;
        self.current_transcripts
            .into_iter()
            .map(|(tag, current)| (tag, next_transcripts.remove(&tag).unwrap_or(current)))
            .collect()
    }
pub fn into_next_transcripts ( self ) -> BTreeMap < NiDkgTag , NiDkgTranscript > { let mut next_transcripts = self . next_transcripts ; self . current_transcripts . into_iter ( ) . map ( | ( tag , current ) | ( tag , next_transcripts . remove ( & tag ) . unwrap_or ( current ) ) ) . collect ( ) }
Return the set of next transcripts for all tags.
Return the set of next transcripts for all tags .
self
self