Struct forest_actor::miner::BitFieldQueue [−][src]
Expand description
Wrapper for working with an AMTChainEpoch*Bitfield functioning as a queue, bucketed by epoch. Keys in the queue are quantized (upwards), modulo some offset, to reduce the cardinality of keys.
Fields
amt: Amt<'db, BitField, BS>
Implementations
impl<'db, BS: BlockStore> BitFieldQueue<'db, BS>
[src]
impl<'db, BS: BlockStore> BitFieldQueue<'db, BS>
[src]pub fn new(
store: &'db BS,
root: &Cid,
quant: QuantSpec
) -> Result<Self, AmtError>
[src]
store: &'db BS,
root: &Cid,
quant: QuantSpec
) -> Result<Self, AmtError>
pub fn add_to_queue(
&mut self,
raw_epoch: ChainEpoch,
values: &BitField
) -> Result<(), Box<dyn StdError>>
[src]
pub fn add_to_queue(
&mut self,
raw_epoch: ChainEpoch,
values: &BitField
) -> Result<(), Box<dyn StdError>>
[src]Adds values to the queue entry for an epoch.
pub fn add_to_queue_values(
&mut self,
epoch: ChainEpoch,
values: &[usize]
) -> Result<(), Box<dyn StdError>>
[src]
&mut self,
epoch: ChainEpoch,
values: &[usize]
) -> Result<(), Box<dyn StdError>>
pub fn cut(&mut self, to_cut: &BitField) -> Result<(), Box<dyn StdError>>
[src]
pub fn cut(&mut self, to_cut: &BitField) -> Result<(), Box<dyn StdError>>
[src]Cut cuts the elements from the bits in the given bitfield out of the queue, shifting other bits down and removing any newly empty entries.
See the docs on BitField::cut
to better understand what it does.
pub fn add_many_to_queue_values(
&mut self,
values: &HashMap<ChainEpoch, Vec<usize>>
) -> Result<(), Box<dyn StdError>>
[src]
&mut self,
values: &HashMap<ChainEpoch, Vec<usize>>
) -> Result<(), Box<dyn StdError>>
Auto Trait Implementations
impl<'db, BS> RefUnwindSafe for BitFieldQueue<'db, BS> where
BS: RefUnwindSafe,
BS: RefUnwindSafe,
impl<'db, BS> Send for BitFieldQueue<'db, BS> where
BS: Sync,
BS: Sync,
impl<'db, BS> !Sync for BitFieldQueue<'db, BS>
impl<'db, BS> Unpin for BitFieldQueue<'db, BS>
impl<'db, BS> UnwindSafe for BitFieldQueue<'db, BS> where
BS: RefUnwindSafe,
BS: RefUnwindSafe,
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> Pointable for T
impl<T> Pointable for T
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,