refactor(chain): use apply_update instead of determine_changeset + apply_changeset

This commit is contained in:
Wei Chen 2023-08-24 20:25:14 +08:00
parent fa0bead024
commit c753584379
No known key found for this signature in database

View File

@ -385,9 +385,7 @@ impl<A: Clone + Ord> TxGraph<A> {
0, 0,
), ),
); );
let changeset = self.determine_changeset(update); self.apply_update(update)
self.apply_changeset(changeset.clone());
changeset
} }
/// Inserts the given transaction into [`TxGraph`]. /// Inserts the given transaction into [`TxGraph`].
@ -398,9 +396,7 @@ impl<A: Clone + Ord> TxGraph<A> {
update update
.txs .txs
.insert(tx.txid(), (TxNodeInternal::Whole(tx), BTreeSet::new(), 0)); .insert(tx.txid(), (TxNodeInternal::Whole(tx), BTreeSet::new(), 0));
let changeset = self.determine_changeset(update); self.apply_update(update)
self.apply_changeset(changeset.clone());
changeset
} }
/// Inserts the given `anchor` into [`TxGraph`]. /// Inserts the given `anchor` into [`TxGraph`].
@ -410,9 +406,7 @@ impl<A: Clone + Ord> TxGraph<A> {
pub fn insert_anchor(&mut self, txid: Txid, anchor: A) -> ChangeSet<A> { pub fn insert_anchor(&mut self, txid: Txid, anchor: A) -> ChangeSet<A> {
let mut update = Self::default(); let mut update = Self::default();
update.anchors.insert((anchor, txid)); update.anchors.insert((anchor, txid));
let changeset = self.determine_changeset(update); self.apply_update(update)
self.apply_changeset(changeset.clone());
changeset
} }
/// Inserts the given `seen_at` for `txid` into [`TxGraph`]. /// Inserts the given `seen_at` for `txid` into [`TxGraph`].
@ -422,9 +416,7 @@ impl<A: Clone + Ord> TxGraph<A> {
let mut update = Self::default(); let mut update = Self::default();
let (_, _, update_last_seen) = update.txs.entry(txid).or_default(); let (_, _, update_last_seen) = update.txs.entry(txid).or_default();
*update_last_seen = seen_at; *update_last_seen = seen_at;
let changeset = self.determine_changeset(update); self.apply_update(update)
self.apply_changeset(changeset.clone());
changeset
} }
/// Extends this graph with another so that `self` becomes the union of the two sets of /// Extends this graph with another so that `self` becomes the union of the two sets of