pub struct ProposalTable { /* private fields */ }
Expand description

A Table record proposals set in number-ids pairs

Implementations§

source§

impl ProposalTable

source

pub fn new(proposal_window: ProposalWindow) -> Self

Create new ProposalTable from ProposalWindow

source

pub fn insert( &mut self, number: BlockNumber, ids: HashSet<ProposalShortId> ) -> bool

Inserts a number-ids pair into the table. If the TABLE did not have this number present, true is returned. If the map did have this number present, the proposal set is updated.

source

pub fn remove( &mut self, number: BlockNumber ) -> Option<HashSet<ProposalShortId>>

Removes a proposal set from the table, returning the set at the number if the number was previously in the table

Examples
use ckb_chain_spec::consensus::ProposalWindow;
use ckb_proposal_table::ProposalTable;

let window = ProposalWindow(2, 10);
let mut table = ProposalTable::new(window);
assert_eq!(table.remove(1), None);
source

pub fn all(&self) -> &BTreeMap<BlockNumber, HashSet<ProposalShortId>>

Return referent of internal BTreeMap contains all proposal set

source

pub fn finalize( &mut self, origin: &ProposalView, number: BlockNumber ) -> (HashSet<ProposalShortId>, ProposalView)

Update table by proposal window move froward, drop outdated proposal set Return removed proposal ids set and new ProposalView

Trait Implementations§

source§

impl Clone for ProposalTable

source§

fn clone(&self) -> ProposalTable

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for ProposalTable

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl PartialEq<ProposalTable> for ProposalTable

source§

fn eq(&self, other: &ProposalTable) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Eq for ProposalTable

source§

impl StructuralEq for ProposalTable

source§

impl StructuralPartialEq for ProposalTable

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> AsAny for Twhere T: Any,

§

fn as_any(&self) -> &(dyn Any + 'static)

Cast to trait Any
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V