Struct forest_actor::miner::BitFieldQueue [−][src]
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]
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]
&mut self,
raw_epoch: ChainEpoch,
values: &BitField
) -> Result<(), Box<dyn StdError>>
Adds values to the queue entry for an epoch.
pub fn add_to_queue_values(
&mut self,
epoch: ChainEpoch,
values: &[u64]
) -> Result<(), Box<dyn StdError>>
[src]
&mut self,
epoch: ChainEpoch,
values: &[u64]
) -> Result<(), Box<dyn StdError>>
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<u64>>
) -> Result<(), Box<dyn StdError>>
[src]
&mut self,
values: &HashMap<ChainEpoch, Vec<u64>>
) -> Result<(), Box<dyn StdError>>
pub fn pop_until(
&mut self,
until: ChainEpoch
) -> Result<(BitField, bool), Box<dyn StdError>>
[src]
&mut self,
until: ChainEpoch
) -> Result<(BitField, bool), Box<dyn StdError>>
Removes and returns all values with keys less than or equal to until. Modified return value indicates whether this structure has been changed by the call.
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> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
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> Pointable for T
pub const ALIGN: usize
type Init = T
The type for initializers.
pub unsafe fn init(init: <T as Pointable>::Init) -> usize
pub unsafe fn deref<'a>(ptr: usize) -> &'a T
pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T
pub unsafe fn drop(ptr: usize)
impl<T> Same<T> for T
type Output = T
Should always be Self
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>,