pub struct TxStore {
    pub main: Tree,
    pub location: Tree,
    pub pending: Tree,
    pub pending_order: Tree,
}
Expand description

The TxStore is a structure representing all sled trees related to storing the blockchain’s transactions information.

Fields§

§main: Tree

Main sled tree, storing all the blockchain’s transactions, where the key is the transaction hash, and the value is the serialized transaction.

§location: Tree

The sled tree storing the location of the blockchain’s transactions locations, where the key is the transaction hash, and the value is a serialized tuple containing the height and the vector index of the block the transaction is included.

§pending: Tree

The sled tree storing all the node pending transactions, where the key is the transaction hash, and the value is the serialized transaction.

§pending_order: Tree

The sled tree storing the order of all the node pending transactions, where the key is an incremental value, and the value is the serialized transaction.

Implementations§

source§

impl TxStore

source

pub fn new(db: &Db) -> Result<Self>

Opens a new or existing TxStore on the given sled database.

source

pub fn insert( &self, transactions: &[Transaction] ) -> Result<Vec<TransactionHash>>

Insert a slice of Transaction into the store’s main tree.

source

pub fn insert_location( &self, txs_hashes: &[TransactionHash], block_height: u32 ) -> Result<()>

Insert a slice of TransactionHash into the store’s location tree.

source

pub fn insert_pending( &self, transactions: &[Transaction] ) -> Result<Vec<TransactionHash>>

Insert a slice of Transaction into the store’s pending txs tree.

source

pub fn insert_pending_order(&self, txs_hashes: &[TransactionHash]) -> Result<()>

Insert a slice of TransactionHash into the store’s pending txs order tree.

source

pub fn insert_batch( &self, transactions: &[Transaction] ) -> (Batch, Vec<TransactionHash>)

Generate the sled batch corresponding to an insert to the main tree, so caller can handle the write operation. The transactions are hashed with BLAKE3 and this hash is used as the key, while the value is the serialized Transaction itself. On success, the function returns the transaction hashes in the same order as the input transactions, along with the corresponding operation batch.

source

pub fn insert_batch_location( &self, txs_hashes: &[TransactionHash], block_height: u32 ) -> Batch

Generate the sled batch corresponding to an insert to the location tree, so caller can handle the write operation. The location tuple is built using the index of each transaction has in the slice, along with the provided block height

source

pub fn insert_batch_pending( &self, transactions: &[Transaction] ) -> (Batch, Vec<TransactionHash>)

Generate the sled batch corresponding to an insert to the pending txs tree, so caller can handle the write operation. The transactions are hashed with BLAKE3 and this hash is used as the key, while the value is the serialized Transaction itself. On success, the function returns the transaction hashes in the same order as the input transactions, along with the corresponding operation batch.

source

pub fn insert_batch_pending_order( &self, tx_hashes: &[TransactionHash] ) -> Result<Batch>

Generate the sled batch corresponding to an insert to the pending txs order tree, so caller can handle the write operation.

source

pub fn contains(&self, tx_hash: &TransactionHash) -> Result<bool>

Check if the store’s main tree contains a given transaction hash.

source

pub fn contains_pending(&self, tx_hash: &TransactionHash) -> Result<bool>

Check if the store’s pending txs tree contains a given transaction hash.

source

pub fn get( &self, tx_hashes: &[TransactionHash], strict: bool ) -> Result<Vec<Option<Transaction>>>

Fetch given tx hashes from the store’s main tree. The resulting vector contains Option, which is Some if the tx was found in the txstore, and otherwise it is None, if it has not. The second parameter is a boolean which tells the function to fail in case at least one tx was not found.

source

pub fn get_location( &self, tx_hashes: &[TransactionHash], strict: bool ) -> Result<Vec<Option<(u64, u16)>>>

Fetch given tx hashes locations from the store’s location tree. The resulting vector contains Option, which is Some if the tx was found in the txstore, and otherwise it is None, if it has not. The second parameter is a boolean which tells the function to fail in case at least one tx was not found.

source

pub fn get_pending( &self, tx_hashes: &[TransactionHash], strict: bool ) -> Result<Vec<Option<Transaction>>>

Fetch given tx hashes from the store’s pending txs tree. The resulting vector contains Option, which is Some if the tx was found in the pending tx store, and otherwise it is None, if it has not. The second parameter is a boolean which tells the function to fail in case at least one tx was not found.

source

pub fn get_all(&self) -> Result<Vec<(TransactionHash, Transaction)>>

Retrieve all transactions from the store’s main tree in the form of a tuple (tx_hash, tx). Be careful as this will try to load everything in memory.

source

pub fn get_all_location(&self) -> Result<Vec<(TransactionHash, (u32, u16))>>

Retrieve all transactions locations from the store’s location tree in the form of a tuple (tx_hash, (block_height, index)). Be careful as this will try to load everything in memory.

source

pub fn get_all_pending(&self) -> Result<HashMap<TransactionHash, Transaction>>

Retrieve all transactions from the store’s pending txs tree in the form of a HashMap with key the transaction hash and value the transaction itself. Be careful as this will try to load everything in memory.

source

pub fn get_all_pending_order(&self) -> Result<Vec<(u64, TransactionHash)>>

Retrieve all transactions from the store’s pending txs order tree in the form of a tuple (u64, TransactionHash). Be careful as this will try to load everything in memory.

source

pub fn get_after_pending( &self, order: u64, n: usize ) -> Result<(u64, Vec<Transaction>)>

Fetch n transactions after given order([order..order+n)). In the iteration, if a transaction order is not found, the iteration stops and the function returns what it has found so far in the store’s pending order tree.

source

pub fn len(&self) -> usize

Retrieve records count of the store’s main tree.

source

pub fn is_empty(&self) -> bool

Check if the store’s main tree is empty.

source

pub fn remove_pending(&self, txs_hashes: &[TransactionHash]) -> Result<()>

Remove a slice of TransactionHash from the store’s pending txs tree.

source

pub fn remove_pending_order(&self, indexes: &[u64]) -> Result<()>

Remove a slice of u64 from the store’s pending txs order tree.

source

pub fn remove_batch_pending(&self, txs_hashes: &[TransactionHash]) -> Batch

Generate the sled batch corresponding to a remove from the store’s pending txs tree, so caller can handle the write operation.

source

pub fn remove_batch_pending_order(&self, indexes: &[u64]) -> Batch

Generate the sled batch corresponding to a remove from the store’s pending txs order tree, so caller can handle the write operation.

Trait Implementations§

source§

impl Clone for TxStore

source§

fn clone(&self) -> TxStore

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

Auto Trait Implementations§

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T> ArchivePointee for T

§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
§

impl<'a, T, E> AsTaggedExplicit<'a, E> for T
where T: 'a,

§

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

§

impl<'a, T, E> AsTaggedImplicit<'a, E> for T
where T: 'a,

§

fn implicit( self, class: Class, constructed: bool, tag: u32 ) -> TaggedParser<'a, Implicit, Self, E>

source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
§

impl<T> Conv for T

§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
§

impl<F, W, T, D> Deserialize<With<T, W>, D> for F
where W: DeserializeWith<F, T, D>, D: Fallible + ?Sized, F: ?Sized,

§

fn deserialize( &self, deserializer: &mut D ) -> Result<With<T, W>, <D as Fallible>::Error>

Deserializes using the given deserializer
§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

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

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

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

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> DynClone for T
where T: Clone,

§

impl<T> FmtForward for T

§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where 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> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> LayoutRaw for T

§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Gets the layout of the type.
§

impl<T> Pipe for T
where T: ?Sized,

§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
§

impl<T> Pointee for T

§

type Metadata = ()

The type for metadata in pointers and references to Self.
source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<T> Tap for T

§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
source§

impl<T> ToOwned for T
where 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
§

impl<T> TryConv for T

§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. Read more
source§

impl<T, U> TryFrom<U> for T
where 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 T
where 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<T> Upcastable for T
where T: Any + Send + Sync + 'static,

§

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

upcast ref
§

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

upcast mut ref
§

fn upcast_any_box(self: Box<T>) -> Box<dyn Any>

upcast boxed dyn
§

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

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a [WithDispatch] wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a [WithDispatch] wrapper. Read more