fixup! OrderedSet: optimize intersect & fix docs typos

serokell · Nov 7, 2024 · f11c7de · f11c7de
1 parent 2ef4060
commit f11c7de
Showing 1 changed file with 1 addition and 3 deletions.
diff --git a/src/OrderedMap.mo b/src/OrderedMap.mo
@@ -493,11 +493,9 @@ module {
     /// ```
     ///
     /// Cost of mapping all the elements:
-    /// Runtime: `O(n * log(n))`.
+    /// Runtime: `O(n)`.
     /// Space: `O(n)` retained memory
     /// where `n` denotes the number of key-value entries stored in the map.
-    ///
-    /// Note: Creates `O(n * log(n))` temporary objects that will be collected as garbage.
     public func map<V1, V2>(m : Map<K, V1>, f : (K, V1) -> V2) : Map<K, V2>
       = Internal.map(m, f);