Gracefully handle floating-point precision errors in the EQT metric.

tracing/tracing/extras/chrome/estimated_input_latency.html

Index: tracing/tracing/extras/chrome/estimated_input_latency.html
diff --git a/tracing/tracing/extras/chrome/estimated_input_latency.html b/tracing/tracing/extras/chrome/estimated_input_latency.html
index 01e12528d5340020b3f1dcb9f11c980456f87dc9..34be38a3a1fb895a2b0f516d818977267fb569ba 100644
--- a/tracing/tracing/extras/chrome/estimated_input_latency.html
+++ b/tracing/tracing/extras/chrome/estimated_input_latency.html
@@ -313,14 +313,21 @@ tr.exportTo('tr.e.chrome', function() {
     for (let i = 1; i < sortedTasks.length; i++) {
       // Due to floating-point precision errors it might happen that the end
       // of the previous task is larger than the start of the current task.
-      // Here is an example from a real trace of system-health benchmark:
-      // Task 1: start=1932.0179090499878 end=1932.070909049988.
-      // Task 2: start=1932.0709090232850 end=1932.118909023285.
+      // Here is an example from a real trace:
+      // Task 1: start=25851.0181016922 end=25851.0481016922
+      // Task 2: start=25851.0251016616 end=34496.0291013717.
       // To account for precision errors we consider tasks as overlapping
       // if the overlap is sufficiently large.
-      if (sortedTasks[i - 1].end > sortedTasks[i].start + 1e-3) {
+      const PRECISION_MS = 0.1;
+      if (sortedTasks[i - 1].end > sortedTasks[i].start + PRECISION_MS) {
         throw Error('Tasks must not overlap');
       }
+      // Ensure that the previous task finishes not later than the current task.
+      if (sortedTasks[i - 1].end > sortedTasks[i].start) {
+        const midpoint = (sortedTasks[i - 1].end + sortedTasks[i].start) / 2;
+        sortedTasks[i - 1].end = midpoint;
+        sortedTasks[i].start = midpoint;
+      }
     }
 
     // Collect all time points that the sliding window needs to stop at.