Implement Debug for collection types

near-sdk/src/collections/lazy_option.rs

@@ -123,6 +123,21 @@ where
     }
 }
 
+impl<T> std::fmt::Debug for LazyOption<T>
+    where
+        T: std::fmt::Debug + BorshSerialize + BorshDeserialize,
+{
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        if cfg!(feature = "expensive-debug") {
+            self.get().fmt(f)
+        } else {
+            f.debug_struct("LazyOption")
+                .field("storage_key", &self.storage_key)
+                .finish()
+        }
+    }
+}
+
 #[cfg(not(target_arch = "wasm32"))]
 #[cfg(test)]
 mod tests {
@@ -173,4 +188,21 @@ mod tests {
         assert!(a.is_some());
         assert_eq!(a.get(), Some(42));
     }
+
+    #[test]
+    pub fn test_debug() {
+        let mut lazy_option = LazyOption::new(b"m", None);
+        if cfg!(feature = "expensive-debug") {
+            assert_eq!(format!("{:?}", lazy_option), "None");
+        } else {
+            assert_eq!(format!("{:?}", lazy_option), "LazyOption { storage_key: [109] }");
+        }
+
+        lazy_option.set(&1u64);
+        if cfg!(feature = "expensive-debug") {
+            assert_eq!(format!("{:?}", lazy_option), "Some(1)");
+        } else {
+            assert_eq!(format!("{:?}", lazy_option), "LazyOption { storage_key: [109] }");
+        }
+    }
 }

near-sdk/src/collections/lookup_map.rs

@@ -129,6 +129,18 @@ where
     }
 }
 
+impl<K, V> std::fmt::Debug for LookupMap<K, V>
+where
+    K: std::fmt::Debug + BorshSerialize,
+    V: std::fmt::Debug + BorshSerialize + BorshDeserialize,
+{
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("LookupMap")
+            .field("key_prefix", &self.key_prefix)
+            .finish()
+    }
+}
+
 #[cfg(not(target_arch = "wasm32"))]
 #[cfg(test)]
 mod tests {
@@ -284,4 +296,14 @@ mod tests {
             assert_eq!(map.get(&key).unwrap(), value);
         }
     }
+
+    #[test]
+    fn test_debug() {
+        let map: LookupMap<u64, u64> = LookupMap::new(b"m");
+
+        assert_eq!(
+            format!("{:?}", map),
+            format!("LookupMap {{ key_prefix: {:?} }}", map.key_prefix)
+        );
+    }
 }

near-sdk/src/collections/lookup_set.rs

@@ -88,6 +88,17 @@ where
     }
 }
 
+impl<T> std::fmt::Debug for LookupSet<T>
+where
+    T: std::fmt::Debug + BorshSerialize,
+{
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("LookupSet")
+            .field("element_prefix", &self.element_prefix)
+            .finish()
+    }
+}
+
 #[cfg(not(target_arch = "wasm32"))]
 #[cfg(test)]
 mod tests {
@@ -204,4 +215,14 @@ mod tests {
             assert!(set.contains(&key));
         }
     }
+
+    #[test]
+    fn test_debug() {
+        let set: LookupSet<u64> = LookupSet::new(b"m");
+
+        assert_eq!(
+            format!("{:?}", set),
+            format!("LookupSet {{ element_prefix: {:?} }}", set.element_prefix)
+        );
+    }
 }

near-sdk/src/collections/tree_map.rs

@@ -21,7 +21,7 @@ pub struct TreeMap<K, V> {
     tree: Vector<Node<K>>,
 }
 
-#[derive(Clone, BorshSerialize, BorshDeserialize)]
+#[derive(Clone, BorshSerialize, BorshDeserialize, Debug)]
 pub struct Node<K> {
     id: u64,
     key: K,           // key stored in a node
@@ -580,6 +580,19 @@ where
     }
 }
 
+impl<K, V> std::fmt::Debug for TreeMap<K, V>
+where
+    K: std::fmt::Debug + Ord + Clone + BorshSerialize + BorshDeserialize,
+    V: std::fmt::Debug + BorshSerialize + BorshDeserialize,
+{
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("TreeMap")
+            .field("root", &self.root)
+            .field("tree", &self.tree)
+            .finish()
+    }
+}
+
 impl<'a, K, V> IntoIterator for &'a TreeMap<K, V>
 where
     K: Ord + Clone + BorshSerialize + BorshDeserialize,
@@ -733,8 +746,6 @@ mod tests {
     use quickcheck::QuickCheck;
     use std::collections::BTreeMap;
     use std::collections::HashSet;
-    use std::fmt::Formatter;
-    use std::fmt::{Debug, Result};
 
     /// Return height of the tree - number of nodes on the longest path starting from the root node.
     fn height<K, V>(tree: &TreeMap<K, V>) -> u64
@@ -771,34 +782,6 @@ mod tests {
         h.ceil() as u64
     }
 
-    impl<K> Debug for Node<K>
-    where
-        K: Ord + Clone + Debug + BorshSerialize + BorshDeserialize,
-    {
-        fn fmt(&self, f: &mut Formatter<'_>) -> Result {
-            f.debug_struct("Node")
-                .field("id", &self.id)
-                .field("key", &self.key)
-                .field("lft", &self.lft)
-                .field("rgt", &self.rgt)
-                .field("ht", &self.ht)
-                .finish()
-        }
-    }
-
-    impl<K, V> Debug for TreeMap<K, V>
-    where
-        K: Ord + Clone + Debug + BorshSerialize + BorshDeserialize,
-        V: Debug + BorshSerialize + BorshDeserialize,
-    {
-        fn fmt(&self, f: &mut Formatter<'_>) -> Result {
-            f.debug_struct("TreeMap")
-                .field("root", &self.root)
-                .field("tree", &self.tree.iter().collect::<Vec<Node<K>>>())
-                .finish()
-        }
-    }
-
     #[test]
     fn test_empty() {
         let map: TreeMap<u8, u8> = TreeMap::new(b't');
@@ -1682,8 +1665,8 @@ mod tests {
 
     fn is_balanced<K, V>(map: &TreeMap<K, V>, root: u64) -> bool
     where
-        K: Debug + Ord + Clone + BorshSerialize + BorshDeserialize,
-        V: Debug + BorshSerialize + BorshDeserialize,
+        K: std::fmt::Debug + Ord + Clone + BorshSerialize + BorshDeserialize,
+        V: std::fmt::Debug + BorshSerialize + BorshDeserialize,
     {
         let node = map.node(root).unwrap();
         let balance = map.get_balance(&node);
@@ -1777,4 +1760,27 @@ mod tests {
 
         QuickCheck::new().tests(300).quickcheck(prop as Prop);
     }
+
+    #[test]
+    fn test_debug() {
+        let mut map = TreeMap::new(b"m");
+        map.insert(&1, &100);
+        map.insert(&3, &300);
+        map.insert(&2, &200);
+
+        if cfg!(feature = "expensive-debug") {
+            let node1 = "Node { id: 0, key: 1, lft: None, rgt: None, ht: 1 }";
+            let node2 = "Node { id: 2, key: 2, lft: Some(0), rgt: Some(1), ht: 2 }";
+            let node3 = "Node { id: 1, key: 3, lft: None, rgt: None, ht: 1 }";
+            assert_eq!(
+                format!("{:?}", map),
+                format!("TreeMap {{ root: 2, tree: [{}, {}, {}] }}", node1, node3, node2)
+            );
+        } else {
+            assert_eq!(
+                format!("{:?}", map),
+                "TreeMap { root: 2, tree: Vector { len: 3, prefix: [109, 110] } }"
+            );
+        }
+    }
 }

near-sdk/src/collections/unordered_map.rs

@@ -241,6 +241,20 @@ where
     }
 }
 
+impl<K, V> std::fmt::Debug for UnorderedMap<K, V>
+where
+    K: std::fmt::Debug + BorshSerialize + BorshDeserialize,
+    V: std::fmt::Debug + BorshSerialize + BorshDeserialize,
+{
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("UnorderedMap")
+            .field("key_index_prefix", &self.key_index_prefix)
+            .field("keys", &self.keys)
+            .field("values", &self.values)
+            .finish()
+    }
+}
+
 #[cfg(not(target_arch = "wasm32"))]
 #[cfg(test)]
 mod tests {
@@ -442,4 +456,26 @@ mod tests {
         let actual: HashMap<u64, u64> = map.iter().collect();
         assert_eq!(actual, key_to_value);
     }
+
+    #[test]
+    fn test_debug() {
+        let mut map = UnorderedMap::new(b"m");
+        map.insert(&1u64, &100u64);
+        map.insert(&3u64, &300u64);
+        map.insert(&2u64, &200u64);
+
+        if cfg!(feature = "expensive-debug") {
+            assert_eq!(
+                format!("{:?}", map),
+                "UnorderedMap { key_index_prefix: [109, 105], keys: [1, 3, 2], values: [100, 300, 200] }"
+            );
+        } else {
+            assert_eq!(
+                format!("{:?}", map),
+                "UnorderedMap { key_index_prefix: [109, 105], \
+                keys: Vector { len: 3, prefix: [109, 107] }, \
+                values: Vector { len: 3, prefix: [109, 118] } }"
+            );
+        }
+    }
 }

near-sdk/src/collections/unordered_set.rs

@@ -171,6 +171,18 @@ where
     }
 }
 
+impl<T> std::fmt::Debug for UnorderedSet<T>
+where
+    T: std::fmt::Debug + BorshSerialize + BorshDeserialize,
+{
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("UnorderedSet")
+            .field("element_index_prefix", &self.element_index_prefix)
+            .field("elements", &self.elements)
+            .finish()
+    }
+}
+
 #[cfg(not(target_arch = "wasm32"))]
 #[cfg(test)]
 mod tests {
@@ -330,4 +342,24 @@ mod tests {
         let actual: HashSet<u64> = set.iter().collect();
         assert_eq!(actual, keys);
     }
+
+    #[test]
+    fn test_debug() {
+        let mut set = UnorderedSet::new(b"m");
+        set.insert(&1u64);
+        set.insert(&3u64);
+        set.insert(&2u64);
+
+        if cfg!(feature = "expensive-debug") {
+            assert_eq!(
+                format!("{:?}", set),
+                "UnorderedSet { element_index_prefix: [109, 105], elements: [1, 3, 2] }"
+            );
+        } else {
+            assert_eq!(
+                format!("{:?}", set),
+                "UnorderedSet { element_index_prefix: [109, 105], elements: Vector { len: 3, prefix: [109, 101] } }"
+            );
+        }
+    }
 }

near-sdk/src/collections/vector.rs

@@ -21,7 +21,6 @@ fn expect_consistent_state<T>(val: Option<T>) -> T {
 /// An iterable implementation of vector that stores its content on the trie.
 /// Uses the following map: index -> element.
 #[derive(BorshSerialize, BorshDeserialize)]
-#[cfg_attr(not(feature = "expensive-debug"), derive(Debug))]
 pub struct Vector<T> {
     len: u64,
     prefix: Vec<u8>,
@@ -236,6 +235,16 @@ impl<T: std::fmt::Debug + BorshDeserialize> std::fmt::Debug for Vector<T> {
     }
 }
 
+#[cfg(not(feature = "expensive-debug"))]
+impl<T: std::fmt::Debug + BorshDeserialize> std::fmt::Debug for Vector<T> {
+    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
+        f.debug_struct("Vector")
+            .field("len", &self.len)
+            .field("prefix", &self.prefix)
+            .finish()
+    }
+}
+
 /// An iterator over raw serialized bytes of each element in the [`Vector`].
 pub struct RawIter<'a, T> {
     vec: &'a Vector<T>,
@@ -474,7 +483,7 @@ mod tests {
         } else {
             assert_eq!(
                 format!("{:?}", vec),
-                format!("Vector {{ len: 5, prefix: {:?}, el: PhantomData }}", vec.prefix)
+                format!("Vector {{ len: 5, prefix: {:?} }}", vec.prefix)
             );
         }
 
@@ -490,7 +499,7 @@ mod tests {
             assert_eq!(
                 format!("{:?}", deserialize_only_vec),
                 format!(
-                    "Vector {{ len: 5, prefix: {:?}, el: PhantomData }}",
+                    "Vector {{ len: 5, prefix: {:?} }}",
                     deserialize_only_vec.prefix
                 )
             );