Allow dataframe to be sorted and searched #42

Author: Bo Peng

src/index.ts

@@ -926,6 +926,83 @@ function registerSoSWidgets(app: JupyterFrontEnd) {
   app.docRegistry.addWidgetExtension("Notebook", new SoSWidgets());
 }
 
+
+(<any>window).filterDataFrame = function(id) {
+  var input = document.getElementById("search_" + id) as HTMLInputElement;;
+  var filter = input.value.toUpperCase();
+  var table = document.getElementById("dataframe_" + id) as HTMLTableElement;
+  var tr = table.getElementsByTagName("tr");
+
+  // Loop through all table rows, and hide those who do not match the search query
+  for (var i = 1; i < tr.length; i++) {
+    for (var j = 0; j < tr[i].cells.length; ++j) {
+      var matched = false;
+      if (tr[i].cells[j].innerHTML.toUpperCase().indexOf(filter) !== -1) {
+        tr[i].style.display = "";
+        matched = true;
+        break;
+      }
+      if (!matched) {
+        tr[i].style.display = "none";
+      }
+    }
+  }
+};
+
+(<any>window).sortDataFrame = function(id, n, dtype) {
+  var table = document.getElementById("dataframe_" + id) as HTMLTableElement;
+
+  var tb = table.tBodies[0]; // use `<tbody>` to ignore `<thead>` and `<tfoot>` rows
+  var tr = Array.prototype.slice.call(tb.rows, 0); // put rows into array
+
+  var fn =
+    dtype === "numeric"
+      ? function(a, b) {
+          return parseFloat(a.cells[n].textContent) <=
+            parseFloat(b.cells[n].textContent)
+            ? -1
+            : 1;
+        }
+      : function(a, b) {
+          var c = a.cells[n].textContent
+            .trim()
+            .localeCompare(b.cells[n].textContent.trim());
+          return c > 0 ? 1 : c < 0 ? -1 : 0;
+        };
+  var isSorted = function(array, fn) {
+    if (array.length < 2) {
+      return 1;
+    }
+    var direction = fn(array[0], array[1]);
+    for (var i = 1; i < array.length - 1; ++i) {
+      var d = fn(array[i], array[i + 1]);
+      if (d === 0) {
+        continue;
+      } else if (direction === 0) {
+        direction = d;
+      } else if (direction !== d) {
+        return 0;
+      }
+    }
+    return direction;
+  };
+
+  var sorted = isSorted(tr, fn);
+  var i;
+
+  if (sorted === 1 || sorted === -1) {
+    // if sorted already, reverse it
+    for (i = tr.length - 1; i >= 0; --i) {
+      tb.appendChild(tr[i]); // append each row in order
+    }
+  } else {
+    tr = tr.sort(fn);
+    for (i = 0; i < tr.length; ++i) {
+      tb.appendChild(tr[i]); // append each row in order
+    }
+  }
+};
+
 /**
  * Initialization data for the sos-extension extension.
  */