Struct ckb_proposal_table::ProposalTable [−][src]
A Table record proposals set in number-ids pairs
Implementations
impl ProposalTable
[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]
&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.
pub fn remove(
&mut self,
number: BlockNumber
) -> Option<HashSet<ProposalShortId>>
[src]
&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);
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]
&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
impl Clone for ProposalTable
[src]
fn clone(&self) -> ProposalTable
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for ProposalTable
[src]
impl Eq for ProposalTable
[src]
impl PartialEq<ProposalTable> for ProposalTable
[src]
fn eq(&self, other: &ProposalTable) -> bool
[src]
fn ne(&self, other: &ProposalTable) -> bool
[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> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> AsAny for T where
T: Any,
T: Any,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,