From d77b7d0d97a4d698f801b92ce3b7ae5135908fdf Mon Sep 17 00:00:00 2001
From: Daniel Baumann <daniel.baumann@progress-linux.org>
Date: Thu, 2 Feb 2023 16:19:36 +0100
Subject: Adding upstream version 1.6.0+20221231.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
---
 sortable.js | 125 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 125 insertions(+)
 create mode 100755 sortable.js

(limited to 'sortable.js')

diff --git a/sortable.js b/sortable.js
new file mode 100755
index 0000000..62d9090
--- /dev/null
+++ b/sortable.js
@@ -0,0 +1,125 @@
+/**
+ * sortable 1.6.0 (or something, I always forget to update this)
+ *
+ * Makes html tables sortable, ie9+
+ *
+ * Styling is done in css.
+ *
+ * Copyleft 2017 Jonas Earendel
+ *
+ * This is free and unencumbered software released into the public domain.
+ *
+ * Anyone is free to copy, modify, publish, use, compile, sell, or
+ * distribute this software, either in source code form or as a compiled
+ * binary, for any purpose, commercial or non-commercial, and by any
+ * means.
+ *
+ * In jurisdictions that recognize copyright laws, the author or authors
+ * of this software dedicate any and all copyright interest in the
+ * software to the public domain. We make this dedication for the benefit
+ * of the public at large and to the detriment of our heirs and
+ * successors. We intend this dedication to be an overt act of
+ * relinquishment in perpetuity of all present and future rights to this
+ * software under copyright law.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ * IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR
+ * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
+ * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+ * OTHER DEALINGS IN THE SOFTWARE.
+ *
+ * For more information, please refer to <http://unlicense.org>
+ *
+ */
+
+document.addEventListener('click', function (e) {
+  try {
+    // allows for elements inside TH
+    function findElementRecursive(element, tag) {
+      return element.nodeName === tag ? element : findElementRecursive(element.parentNode, tag)
+    }
+
+    var descending_th_class = ' dir-d '
+    var ascending_th_class = ' dir-u '
+    var ascending_table_sort_class = 'asc'
+    var regex_dir = / dir-(u|d) /
+    var regex_table = /\bsortable\b/
+    var alt_sort = e.shiftKey || e.altKey
+    var element = findElementRecursive(e.target, 'TH')
+    var tr = findElementRecursive(element, 'TR')
+    var table = findElementRecursive(tr, 'TABLE')
+
+    function reClassify(element, dir) {
+      element.className = element.className.replace(regex_dir, '') + dir
+    }
+
+    function getValue(element) {
+      // If you aren't using data-sort and want to make it just the tiniest bit smaller/faster
+      // comment this line and uncomment the next one
+      var value =
+        (alt_sort && element.getAttribute('data-sort-alt')) || element.getAttribute('data-sort') || element.innerText
+      return value
+      // return element.innerText
+    }
+    if (regex_table.test(table.className)) {
+      var column_index
+      var nodes = tr.cells
+
+      // Reset thead cells and get column index
+      for (var i = 0; i < nodes.length; i++) {
+        if (nodes[i] === element) {
+          column_index = element.getAttribute('data-sort-col') || i
+        } else {
+          reClassify(nodes[i], '')
+        }
+      }
+
+      var dir = descending_th_class
+
+      // Check if we're sorting ascending or descending
+      if (
+        element.className.indexOf(descending_th_class) !== -1 ||
+        (table.className.indexOf(ascending_table_sort_class) !== -1 &&
+          element.className.indexOf(ascending_th_class) == -1)
+      ) {
+        dir = ascending_th_class
+      }
+
+      // Update the `th` class accordingly
+      reClassify(element, dir)
+
+      // loop through all tbodies and sort them
+      for (var i = 0; i < table.tBodies.length; i++) {
+        const org_tbody = table.tBodies[i]
+
+        // Get the array rows in an array, so we can sort them...
+        var rows = [].slice.call(org_tbody.rows, 0)
+
+        var reverse = dir === ascending_th_class
+
+        // Sort them using Array.prototype.sort()
+        rows.sort(function (a, b) {
+          var x = getValue((reverse ? a : b).cells[column_index])
+          var y = getValue((reverse ? b : a).cells[column_index])
+          var bool = x.length && y.length && !isNaN(x - y) ? x - y : x.localeCompare(y)
+          return bool
+        })
+
+        // Make a clone without content
+        var clone_tbody = org_tbody.cloneNode()
+
+        // Fill it with the sorted values
+        while (rows.length) {
+          clone_tbody.appendChild(rows.splice(0, 1)[0])
+        }
+
+        // And finally replace the unsorted table with the sorted one
+        table.replaceChild(clone_tbody, org_tbody)
+      }
+    }
+  } catch (error) {
+    // console.log(error)
+  }
+})
-- 
cgit v1.2.3