/// The effect of `insert` depends on whether a height already exists. If it doesn't the
/// `block_id` we inserted and all pre-existing blocks higher than it will be re-inserted after
/// it. If the height already existed and has a conflicting block hash then it will be purged
- /// along with all block followin it. The returned chain will have a tip of the `block_id`
+ /// along with all block following it. The returned chain will have a tip of the `block_id`
/// passed in. Of course, if the `block_id` was already present then this just returns `self`.
#[must_use]
pub fn insert(self, block_id: BlockId) -> Self {
use alloc::{sync::Arc, vec::Vec};
use bitcoin::{OutPoint, Transaction, TxOut, Txid};
-/// Data object used to communicate updates about relevant transactions from some chain data soruce
+/// Data object used to communicate updates about relevant transactions from some chain data source
/// to the core model (usually a `bdk_chain::TxGraph`).
#[derive(Debug, Clone)]
pub struct TxUpdate<A = ()> {
}
}
- /// Get a mutable reference of the staged [`ChangeSet`] that is yet to be commited (if any).
+ /// Get a mutable reference of the staged [`ChangeSet`] that is yet to be committed (if any).
pub fn staged_mut(&mut self) -> Option<&mut ChangeSet> {
if self.stage.is_empty() {
None