From 68c6331479f3c347fd6928071edbf11967947a95 Mon Sep 17 00:00:00 2001
From: ZackaryWelch <welch.zackary@gmail.com>
Date: Thu, 15 Jun 2017 16:58:05 -0400
Subject: HTML and Javascript syntax highlighting

---
 .../desktop-utils/lumina-textedit/tests/test.js    | 45 ++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 src-qt5/desktop-utils/lumina-textedit/tests/test.js

(limited to 'src-qt5/desktop-utils/lumina-textedit/tests/test.js')

diff --git a/src-qt5/desktop-utils/lumina-textedit/tests/test.js b/src-qt5/desktop-utils/lumina-textedit/tests/test.js
new file mode 100644
index 00000000..81361577
--- /dev/null
+++ b/src-qt5/desktop-utils/lumina-textedit/tests/test.js
@@ -0,0 +1,45 @@
+import { distance } from "./math.js";
+import { polygonCentroid } from "d3-polygon";
+
+export default function(start, end) {
+  let distances = start.map(p1 => end.map(p2 => squaredDistance(p1, p2))),
+    order = bestOrder(start, end, distances);
+
+  // Don't permute huge array
+  if (start.length > 8) {
+    return start.map((d, i) => i);
+  }
+  return bestOrder(start, end, distances);
+}
+
+export function bestOrder(start, end, distances) {
+  let min = Infinity,
+    best = start.map((d, i) => i);
+
+  function permute(arr, order = [], sum = 0) {
+    for (let i = 0; i < arr.length; i++) {
+      let cur = arr.splice(i, 1),
+        dist = distances[cur[0]][order.length];
+      if (sum + dist < min) {
+        if (arr.length) {
+          permute(arr.slice(), order.concat(cur), sum + dist);
+        } else {
+          min = sum + dist;
+          best = order.concat(cur);
+        }
+      }
+      if (arr.length) {
+        arr.splice(i, 0, cur[0]);
+      }
+    }
+  }
+
+  permute(best);
+  return best;
+}
+
+function squaredDistance(p1, p2) {
+  let d = distance(polygonCentroid(p1), polygonCentroid(p2));
+  return d * d;
+}
+(?:[a-z]+[\.])([a-z])+
-- 
cgit