@bunchmark/presentation - npm Package Compare versions

Comparing version 1.0.0-pre-1 to 1.0.0-pre-10

package.json

 {
     "name": "@bunchmark/presentation",
-    "version": "1.0.0-pre-1",
+    "version": "1.0.0-pre-10",
     "description": "The Bunchmark data presentation utilities",
@@ -5,0 +5,0 @@ "type": "module",

presentation.js

@@ -1,4 +0,5 @@
-export { prensentStats } from "./src/text.js"
+export { getBins, getBounds, QNDMedian } from "./src/bins.js"
+export { makeHistograms } from "./src/histogram.js"
 export { getRanks } from "./src/race.js"
-export { getBins } from "./src/bins.js"
-
+export { prensentStats, scientific } from "./src/text.js"
+export { makeTimelines } from "./src/timeline.js"

src/bins.js

@@ -1,10 +0,24 @@
-export {getBins}
+export {getBins, getBounds, QNDMedian}
 
+
+const QNDMedian = ary => {
+  ary.sort((a,b)=>{a-b})
+  if (ary.length % 2) return ary[(ary.length - 1)/2]
+  else return (ary[(ary.length)/2-1] + ary[(ary.length)/2])/2
+}
+const {
+  exp: mexp,
+  floor: mfloor, 
+  log: mlog, 
+  max: mmax,
+  min: mmin, 
+  round: mround,
+} = Math
+
 function getBounds(entries) {
-  const min = Math.min(...entries.map(e => Math.min(...e.workspace)))
-  const max = Math.max(...entries.map(e => Math.max(...e.workspace)))
+  const min = mmin(...entries.map(e => mmin(...e.workspace)))
+  const max = mmax(...entries.map(e => mmax(...e.workspace)))
   return {min, max}
 }
 
-
 function getBins(entries, quantiles, maxN) {
@@ -19,31 +33,35 @@ const {max, min} = getBounds(entries)
     // we work in log space as we do for the rest.
-    const lq1 = Math.log(q.q1)
-    const lq3 = Math.log(q.q3)
+    const lq1 = mlog(q.q1)
+    const lq3 = mlog(q.q3)
     const logIQR = lq3 - lq1
     
-    largestIQR = Math.max(logIQR, largestIQR)
+    largestIQR = mmax(logIQR, largestIQR)
     const scaleFactor = 1.75
-    minHamBound = Math.min(minHamBound, Math.exp(lq1 - scaleFactor * logIQR))
-    maxHamBound = Math.max(maxHamBound, Math.exp(lq3 + scaleFactor * logIQR))
+    minHamBound = mmin(minHamBound, mexp(lq1 - scaleFactor * logIQR))
+    maxHamBound = mmax(maxHamBound, mexp(lq3 + scaleFactor * logIQR))
   })
-  // clamp the bound to the actual data if needed
-  if (maxN < 16){
-    minHamBound = Math.max(minHamBound, min)
-    maxHamBound = Math.min(maxHamBound, max)
-  }
-  // maxN = Math.max(0, (Math.min(600,
-  //  (entries[0].workspace.length)/(largestIQR)*(maxHamBound-minHamBound)|0)
-  // ))
-  //   // p(N, 1/(largestIQR)*(maxHamBound-minHamBound), tasks[0].results.length)
-  //   maxN = 50
-  // // N=Math.min(3,N)
-  
-  
-  // TODO: find a better way to determin the number of bins
-  // take data spread into account. The ratio beween the average 
-  // normaized IQR and the difference between the fastest and 
-  // slowest sound like a good option
-  return addBins(entries, maxN, minHamBound, maxHamBound)
+  const N = entries[0].workspace.length
+  // one bin per 10 points in the IQR
+  // (half of N are, per the IQR definition)
+  const binWidth = largestIQR / mmax(N / 2 / 10, 1)
+  const span = mlog(maxHamBound)-mlog(minHamBound)
+  const numBins = mmin(span / binWidth, maxN)
+
+  return addBins(
+    entries,
+    mround(numBins),
+    // gradually shift from the whole data set
+    // to only the non-spam data points.
+    interpolate(min, minHamBound, N, 30),
+    interpolate(max, maxHamBound, N, 30),
+  )
 }
 
+function interpolate(exact, ham, n, max) {
+  n = mmin(n, max)
+  p = n/max
+  return (1 - p) * exact + p * ham
+}
+
+
 function addBins(entries, N, min, max) {
@@ -74,3 +92,3 @@ const bounds = Array.from({length: N})
     e.workspace.forEach(res => {
-      result.bins2[i][Math.floor((res - min)/amplitude)]++
+      result.bins2[i][mfloor((res - min)/amplitude)]++
     })
@@ -77,0 +95,0 @@ })

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Major refactor

Supply chain risk

Package has recently undergone a major refactor. It may be unstable or indicate significant internal changes. Use caution when updating to versions that include significant changes.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

14380

increased by160.37%

Number of package files

10

increased by42.86%

Lines of code

365

increased by220.18%

Worsened metrics

Number of medium supply chain risk alerts

1

increased byInfinity%

No dependency changes