oncoprintjs 6.1.2 → 6.1.4

package/.turbo/turbo-build.log

@@ -1,13 +1,13 @@
 
-> oncoprintjs@6.1.2 build /home/runner/work/cbioportal-frontend/cbioportal-frontend/packages/oncoprintjs
+> oncoprintjs@6.1.4 build /home/runner/work/cbioportal-frontend/cbioportal-frontend/packages/oncoprintjs
 > cross-env NODE_ENV=production NODE_OPTIONS=--max-old-space-size=2048 pnpm run rollup
 
 
-> oncoprintjs@6.1.2 rollup /home/runner/work/cbioportal-frontend/cbioportal-frontend/packages/oncoprintjs
+> oncoprintjs@6.1.4 rollup /home/runner/work/cbioportal-frontend/cbioportal-frontend/packages/oncoprintjs
 > rollup -c rollup.config.ts
 
 
 src/index.tsx → dist/index.js, dist/index.es.js...
 (!) Circular dependency
 src/js/oncoprinttrackoptionsview.ts -> src/js/oncoprintheaderview.ts -> src/js/oncoprinttrackoptionsview.ts
-created dist/index.js, dist/index.es.js in 20.2s
+created dist/index.js, dist/index.es.js in 19.4s

package/dist/index.es.js

@@ -2852,18 +2852,36 @@ var OncoprintModel = /** @class */ (function () {
             if (nearest_id_index === -1) {
                 return null;
             }
-            // Next, see if it's in a track
+            // Next, see if it's in a track.
+            // Try binary search first for performance, but fall back to linear
+            // scan if the result is invalid. cell_tops may not be monotonically
+            // ordered relative to the tracks array during async clustering
+            // transitions, which causes binary search to return wrong results.
             var tracks = this.getTracks();
             var cell_tops = this.getCellTops();
+            var nearest_track;
             var nearest_track_index = binarysearch(tracks, y, function (track) {
                 return cell_tops[track];
             }, true);
-            if (nearest_track_index === -1) {
-                return null;
+            if (nearest_track_index !== -1) {
+                var candidate = tracks[nearest_track_index];
+                if (y >= cell_tops[candidate] &&
+                    y < cell_tops[candidate] + this.getCellHeight(candidate)) {
+                    nearest_track = candidate;
+                }
+            }
+            if (nearest_track === undefined) {
+                // Binary search failed (tracks out of order) - linear fallback
+                for (var t = 0; t < tracks.length; t++) {
+                    var top_1 = cell_tops[tracks[t]];
+                    if (y >= top_1 &&
+                        y < top_1 + this.getCellHeight(tracks[t])) {
+                        nearest_track = tracks[t];
+                        break;
+                    }
+                }
             }
-            var nearest_track = tracks[nearest_track_index];
-            if (y >= cell_tops[nearest_track] + this.getCellHeight(nearest_track)) {
-                // we know y is past the top of the track (>= cell_tops[nearest_track]), so this checks if y is past the bottom of the track
+            if (nearest_track === undefined) {
                 return null;
             }
             // At this point, we know y is inside a track