Add a script to generate the list of releases

The idea is to map the current Git for Windows' Pacman repository to a
set of releases in https://github.com/git-for-windows/pacman-repo.

Sadly, this set of releases can _not_ serve as the new Pacman repository
for Git for Windows, because Pacman repositories have a flat directory
structure: the database file needs to live in the same "directory" as
the packages. In other words, if the database lives in

  https://github.com/git-for-windows/pacman-repo/releases/download/latest-git-for-windows.db

then the packages need to live in the same GitHub release. I do not want
that, though, as it would be wasteful to replicate the package files
every time the Pacman repository is updated, as opposed to uploading
only the files for the updated package to the releases.

However, for transparency reasons, it is a good idea to upload the
package files (even historical versions) to GitHub releases. That allows
investigators (or: interested Git for Windows users) to inspect what
package versions had been used in Git for Windows at various stages.

To prepare for that, here is a node.js script that parses the
just-downloaded JSON reflecting what has been uploaded at various times
to Git for Windows' Pacman repository. It then outputs a list of
timestamps and sets of files that should be turned into GitHub releases
and assets.

This will finally disentangle Git for Windows' Pacman repository from my
personal Azure account, as it should have been in the first place.

Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>

Author: dscho

make-list.js

@@ -0,0 +1,48 @@
+#!/usr/bin/env node
+
+module.exports = () => {
+  const fs = require("fs")
+  l = ["i686", "x86-64", "aarch64", "sources"]
+    .reduce((a, e) => {
+      return [
+          ...a,
+          ...JSON.parse(fs.readFileSync(`${e}-list.txt`))
+      ]
+    }, [])
+
+  let lastUpdate = -1
+  return l.map(e => {
+      return {
+      name: `${e.container}/${e.name}`,
+      date: e.properties.lastModified,
+      size: e.properties.contentLength
+      }
+    })
+    .sort((a, b) => Date.parse(a.date) - Date.parse(b.date))
+    .reduce((a, e) => {
+      let last = a.pop() || { date: e.date, start: e.date, names: [], totalSize: 0 }
+      if (Date.parse(last.date) + 10 * 60 * 1000 < Date.parse(e.date)) {
+      a.push(last)
+      last = { start: e.date, names: [], totalSize: 0 }
+      }
+      last.date = e.date
+      last.names.push(e.name)
+      last.totalSize += e.size
+      a.push(last)
+      return a
+    }, [])
+    .map(e => {
+      const secondsBetweenUpdates = lastUpdate < 0 ? undefined : (Date.parse(e.date) - lastUpdate) / 1000
+      lastUpdate = Date.parse(e.date)
+      return {
+        ...e,
+        duration: (Date.parse(e.date) - Date.parse(e.start)) / 1000,
+        secondsBetweenUpdates,
+        date: new Date(e.date)
+      }
+    })
+}
+
+if (require.main === module) {
+  console.log(JSON.stringify(module.exports(), null, 2))
+}