Optimize cloning/sorting/deduplication of frames

This update modifies the data containers used for storing frames to
adopt binary tree structures. As a result, all frames are sorted at the
time of insertion, eliminating the need for subsequent sorting during
vector collection.

Moreover, instead of returning vectors, the binary tree structure
enables iteration over elements in a sorted order, providing iterators
rather than vectors. This functionality gives the API caller the
flexibility to either clone frames or simply inspect them in an
efficient manner.

puffin-imgui/src/ui.rs

@@ -357,7 +357,7 @@ impl ProfilerUi {
         let view = self.frame_view.lock();
         Frames {
             recent: view.recent_frames().cloned().collect(),
-            slowest: view.slowest_frames_chronological(),
+            slowest: view.slowest_frames_chronological().cloned().collect(),
         }
     }
 
@@ -392,10 +392,17 @@ impl ProfilerUi {
     }
 
     fn all_known_frames(&self) -> Vec<Arc<FrameData>> {
-        let mut all = self.frame_view.lock().all_uniq();
+        let mut all = self
+            .frame_view
+            .lock()
+            .all_uniq()
+            .cloned()
+            .collect::<Vec<_>>();
+
         if let Some(paused) = &self.paused {
             all.append(&mut paused.frames.all_uniq());
         }
+
         all.sort_by_key(|frame| frame.frame_index());
         all.dedup_by_key(|frame| frame.frame_index());
         all

puffin/Cargo.toml

@@ -38,6 +38,7 @@ web = ["instant/wasm-bindgen", "dep:js-sys"]
 byteorder = { version = "1.0" }
 cfg-if = "1.0"
 instant = { version = "0.1" }
+itertools = "0.10"
 once_cell = "1.0"
 
 # Optional: