Add comment about iteration complexity

Electricks94 · Electricks94 · commit c076be7eee27 · 2025-09-26T11:34:49.000+02:00
diff --git a/DataFormats/Common/interface/MultiSpan.h b/DataFormats/Common/interface/MultiSpan.h
@@ -21,6 +21,7 @@ namespace edm {
 * or merging them into a single container.
 *
 * To find a span that corresponds to a global index, a binary search is used, making the access time logarithmic in the number of spans.
+* This means when iterating over the elements the binary search over spans is repeated for every element.
 *
 */
   template <typename T>

Original file line number	Diff line number	Diff line change
`@@ -21,6 +21,7 @@ namespace edm {`
`21`	`21`	`* or merging them into a single container.`
`22`	`22`	`*`
`23`	`23`	`* To find a span that corresponds to a global index, a binary search is used, making the access time logarithmic in the number of spans.`
	`24`	`+* This means when iterating over the elements the binary search over spans is repeated for every element.`
`24`	`25`	`*`
`25`	`26`	`*/`
`26`	`27`	`template <typename T>`