Struct ckb_proposal_table::ProposalTable [−][src]
pub struct ProposalTable { /* fields omitted */ }
Expand description
A Table record proposals set in number-ids pairs
Implementations
impl ProposalTable
[src]
impl ProposalTable
[src]pub fn new(proposal_window: ProposalWindow) -> Self
[src]
pub fn new(proposal_window: ProposalWindow) -> Self
[src]Create new ProposalTable from ProposalWindow
pub fn insert(
&mut self,
number: BlockNumber,
ids: HashSet<ProposalShortId>
) -> bool
[src]
pub fn insert(
&mut self,
number: BlockNumber,
ids: HashSet<ProposalShortId>
) -> bool
[src]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.
pub fn remove(
&mut self,
number: BlockNumber
) -> Option<HashSet<ProposalShortId>>
[src]
pub fn remove(
&mut self,
number: BlockNumber
) -> Option<HashSet<ProposalShortId>>
[src]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);
pub fn all(&self) -> &BTreeMap<BlockNumber, HashSet<ProposalShortId>>
[src]
pub fn all(&self) -> &BTreeMap<BlockNumber, HashSet<ProposalShortId>>
[src]Return referent of internal BTreeMap contains all proposal set
pub fn finalize(
&mut self,
origin: &ProposalView,
number: BlockNumber
) -> (HashSet<ProposalShortId>, ProposalView)
[src]
pub fn finalize(
&mut self,
origin: &ProposalView,
number: BlockNumber
) -> (HashSet<ProposalShortId>, ProposalView)
[src]Update table by proposal window move froward, drop outdated proposal set Return removed proposal ids set and new ProposalView
Trait Implementations
impl Clone for ProposalTable
[src]
impl Clone for ProposalTable
[src]fn clone(&self) -> ProposalTable
[src]
fn clone(&self) -> ProposalTable
[src]Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]Performs copy-assignment from source
. Read more
impl Debug for ProposalTable
[src]
impl Debug for ProposalTable
[src]impl PartialEq<ProposalTable> for ProposalTable
[src]
impl PartialEq<ProposalTable> for ProposalTable
[src]fn eq(&self, other: &ProposalTable) -> bool
[src]
fn eq(&self, other: &ProposalTable) -> bool
[src]This method tests for self
and other
values to be equal, and is used
by ==
. Read more
fn ne(&self, other: &ProposalTable) -> bool
[src]
fn ne(&self, other: &ProposalTable) -> bool
[src]This method tests for !=
.
impl Eq for ProposalTable
[src]
impl StructuralEq for ProposalTable
[src]
impl StructuralPartialEq for ProposalTable
[src]
Auto Trait Implementations
impl RefUnwindSafe for ProposalTable
impl Send for ProposalTable
impl Sync for ProposalTable
impl Unpin for ProposalTable
impl UnwindSafe for ProposalTable
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,