From 5d1c6c7eb4d5261935f865806a731b3373c398e6 Mon Sep 17 00:00:00 2001
From: Qyriad <qyriad@qyriad.me>
Date: Mon, 4 Nov 2024 13:01:57 -0700
Subject: [PATCH] rename PrecomputedSubtrees -> PairComputations

---
 src/merkle/smt/mod.rs | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/merkle/smt/mod.rs b/src/merkle/smt/mod.rs
index bd65f02..1c0d911 100644
--- a/src/merkle/smt/mod.rs
+++ b/src/merkle/smt/mod.rs
@@ -353,8 +353,8 @@ pub(crate) trait SparseMerkleTree<const DEPTH: u8> {
     #[cfg_attr(not(test), allow(dead_code))]
     fn sorted_pairs_to_leaves(
         pairs: Vec<(Self::Key, Self::Value)>,
-    ) -> PrecomputedSubtrees<u64, Self::Leaf> {
-        let mut accumulator: PrecomputedSubtrees<u64, Self::Leaf> = Default::default();
+    ) -> PairComputations<u64, Self::Leaf> {
+        let mut accumulator: PairComputations<u64, Self::Leaf> = Default::default();
 
         // The kv-pairs we've seen so far that correspond to a single leaf.
         let mut current_leaf_buffer: Vec<(Self::Key, Self::Value)> = Default::default();
@@ -634,7 +634,7 @@ impl SubtreeLeaf {
 
 /// Helper struct to organize the return value of [`SparseMerkleTree::sorted_pairs_to_leaves()`].
 #[derive(Debug, Clone, PartialEq, Eq)]
-pub struct PrecomputedSubtrees<K, L> {
+pub(crate) struct PairComputations<K, L> {
     /// Literal leaves to be added to the sparse Merkle tree's internal mapping.
     pub nodes: BTreeMap<K, L>,
     /// "Conceptual" leaves that will be used for computations.
@@ -642,7 +642,7 @@ pub struct PrecomputedSubtrees<K, L> {
 }
 
 // Derive requires `L` to impl Default, even though we don't actually need that.
-impl<K, L> Default for PrecomputedSubtrees<K, L> {
+impl<K, L> Default for PairComputations<K, L> {
     fn default() -> Self {
         Self {
             nodes: Default::default(),