From b06e8819437b4eed7e635a3359c8d38effb85574 Mon Sep 17 00:00:00 2001
From: Maksym Arutyunyan <maksym.arutyunyan@dfinity.org>
Date: Thu, 31 Jul 2025 13:57:43 +0200
Subject: [PATCH] cleanup!: remove deprecated iter_upper_bound

---
 src/btreemap.rs | 13 -------------
 1 file changed, 13 deletions(-)

diff --git a/src/btreemap.rs b/src/btreemap.rs
index 19ad8780..96426815 100644
--- a/src/btreemap.rs
+++ b/src/btreemap.rs
@@ -1203,19 +1203,6 @@ where
         }
     }
 
-    /// **Deprecated**: use `iter_from_prev_key` instead.
-    ///
-    /// The name `iter_upper_bound` was misleading — it suggested an inclusive
-    /// upper bound. In reality, it starts from the largest key strictly less
-    /// than the given bound.
-    ///
-    /// The new name, `iter_from_prev_key`, better reflects this behavior and
-    /// improves code clarity.
-    #[deprecated(note = "use `iter_from_prev_key` instead")]
-    pub fn iter_upper_bound(&self, bound: &K) -> Iter<'_, K, V, M> {
-        self.iter_from_prev_key(bound)
-    }
-
     /// Returns an iterator over the keys of the map.
     pub fn keys(&self) -> KeysIter<'_, K, V, M> {
         self.iter_internal().into()