clockface 1.0.0.beta

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: bf5aca788ece95fd88581328494f6e939e5062c7
+  data.tar.gz: 3a3eb9ee32ac3836669f894d77b963186474ff8b
+SHA512:
+  metadata.gz: 5e12ad767b216e35779e7dbcbb2ec7f07a0dbc22c4deb8383fcdd1a9d30da6164807e7353fa8fc607bd3ce7384d56e7aea7085b5f53d51eb4d2c173c75eb62f7
+  data.tar.gz: 462ad552339d748a366ad714e4394467a14ecb3b9d04421f0a643be2f6efa0eeca0c6f05b5b65da90c0716776d818fc1a6e72a2e467d1c2e5f0ed7aec0e53388

data/MIT-LICENSE

@@ -0,0 +1,20 @@
+Copyright 2017 Abhishek Chandrasekhar
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+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 OR COPYRIGHT HOLDERS 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.

data/README.md

@@ -0,0 +1,210 @@
+# Clockface
+
+[![Build Status](https://gitlab.com/abhchand/clockface/badges/master/build.svg)](https://gitlab.com/abhchand/clockface/pipelines)
+
+A lightweight UI for the [Clockwork gem](https://github.com/Rykian/clockwork) to easily schedule and manage background jobs. It's built as a [Rails Engine](http://guides.rubyonrails.org/engines.html) to extend the functionality of your Rails Application
+
+![Clockface](https://gitlab.com/abhchand/clockface/raw/master/meta/screenshot.png)
+
+Clockface serves as a **complete UI wrapper** on top of clockwork -
+
+- It includes and configures clockwork directly so you only have to worry about configuring one thing - Clockface
+- It doesn't add any new functionality on top of clockwork. It simply adds a UI for management and execution
+
+##### Multi Tenancy
+
+Clockface also supports schema-based multi-tenancy!
+
+See the [Multi Tenancy section](#multi_tenancy) below.
+
+### Have a Question?
+
+Find us on StackOverflow! Just [ask a question](https://stackoverflow.com/questions/ask) and include the [`clockface`](https://stackoverflow.com/questions/tagged/clockface) tag.
+
+
+## Quickstart (In 3 Easy Steps)
+
+#### A. Add Clockface
+
+Add the Clockface gem. Remove the `clockwork` gem if you're already using it - Clockface takes care of including and invoking it.
+
+```ruby
+gem "clockface"
+```
+
+```diff
+- gem "clockwork"
+```
+
+Clockface uses DB tables to store your scheduled events, so you'll need to create them in your application
+
+```ruby
+rake clockface:install:migrations
+rake db:migrate
+```
+
+#### B. Configure Clockface
+
+Mount the Clockface engine in your `routes.rb` files
+
+```ruby
+mount Clockface::Engine => "/clockface"
+```
+
+Create an initializer under `config/initializers/clockface.rb` and configure Clockface options. For more options - including multi tenancy configuration options - see [Configuration Options](#configuration_options) below
+
+```ruby
+Clockface::Engine.configure do |app|
+  app.config.clockface.time_zone = "Pacific Time (US & Canada)"
+end
+```
+
+#### C. Define `clock.rb`
+
+Create a `clock.rb` file in your application's root, or replace your existing `clock.rb` file if you're already using the `clockwork` gem
+
+```ruby
+# /clock.rb
+require_relative "./config/boot"
+require_relative "./config/environment"
+
+require "clockface"
+
+Clockface.sync_database_events(every: 10.seconds) do |event|
+  # An Event is a scheduled instance of a particular Task.
+  #
+  # You will define new Tasks and Events in the UI
+  # The `Event` DB record will be yielded to your application here
+  #
+  # You're free to do anything you like with this yielded record. Specifically,
+  # the `command` field exists to store any relevant job execution information.
+  #
+  # For example: we might use the `command` field to store the class of the
+  # job we wish to schedule with Sidekiq.
+  #
+  #  > command: "{\"class\":\"MyHardWorker\"}"
+
+  klass = JSON.parse(event.command)["class"]
+  klass.constantize.perform_async
+end
+```
+
+That's it! Clockface is now accessible in your application under the mounted route (e.g. `/clockface`)
+
+
+## <a name="configuration_options"></a>Configuration Options
+
+```ruby
+# Specify a timezone for display purposes. Because humans don't work in UTC.
+#   default: `Rails.application.config.time_zone` (your application time zone)
+app.config.clockface.time_zone = "Pacific Time (US & Canada)"
+
+# Specify a logger for Clockface to use
+#   default: `Rails.logger` (your application's logger)
+app.config.clockface.logger = [Rails.logger, Logger.new(Rails.root.join("log", "clockface.log"))]
+
+#
+# (Multi Tenant Options)
+#
+
+# You can use any gem library to manage your multi tenant schemas.
+# The `apartment` gem is quite popular, so the examples below reference configuration using that gem
+
+# Tell clockface what your tenant/schema names are
+#   default: []
+app.config.clockface.tenant_list = %w[tenant1 tenant2]
+
+# Tell Clockface how to get the current tenant/schema context
+#   A callable proc that returns the current schema context
+#   default: nil (must be specified by you)
+app.config.clockface.current_tenant_proc = proc { Apartment::Tenant.current }
+
+# Tell Clockface how to execute commands within the context of some tenant/schema
+#   A callable proc that takes arguments for tenant name, another proc to
+#   execute, and arguments for the proc to be executed
+#   default: nil (mst be specified by you)
+app.config.clockface.execute_in_tenant_proc =
+  proc do |tenant_name, some_proc, proc_args|
+    Apartment::Tenant.switch(tenant_name) { some_proc.call(*proc_args) }
+  end
+```
+
+## Running Locally
+
+Clone, build, install, and seed the local database with the inbuilt script.
+
+```
+git clone https://gitlab.com/abhchand/clockface
+cd clockface/
+```
+
+Seed the database with the in-built script
+
+```
+bin/setup
+```
+
+Run the application with
+
+```
+bundle exec rails server
+```
+
+You can now visit the app at [http://localhost:3000/clockface](http://localhost:3000/clockface)
+
+#### Running in Multi-Tenant mode
+
+By default the app runs as a single tenant application. The app can also be run in multi tenant mode locally to test or develop any multi tenant features
+
+Clone, build, install, and seed the local database with the inbuilt script.
+
+```
+git clone https://gitlab.com/abhchand/clockface
+cd clockface/
+```
+
+Seed the database with the in-built script
+
+```
+bin/setup-multi-tenant
+```
+
+Run the application with
+
+```
+bundle exec rails server -b lvh.me
+```
+
+
+Note:
+1. By default the above process seeds two tenants - "earth" and "mars" - that run on different subdomains
+
+2. Since `localhost` does not support subdomains, we use `lvh.me` (a loopback domain) when running locally
+
+
+You can now visit the "earth" tenant at [http://earth.lvh.me:3000/clockface](http://earth.lvh.me:3000/clockface)
+
+
+#### Running Background Jobs
+
+
+The above `rails server` commands only start the web server, which **does not start the job processing queue or run any scheduled events**.
+
+To actually run any scheduled events you'll need to start the Sidekiq server (which the dummy app uses for job scheduling) and the Clock process.
+
+The [foreman gem](https://github.com/ddollar/foreman) can be used to easily start all processes at once (as defined in the [Procfile](./spec/dummy/Procfile))
+
+```
+bundle exec foreman start -f spec/dummy/Procfile
+```
+
+## Contributing
+
+All are welcome to contribute.
+
+If you're a newbie or consider yourself inexperienced, don't hesitate to contribute 🙂. That's how you learn!
+
+> **NOTE**: This project only takes contributions on [Gitlab](https://gitlab.com/abhchand/clockface).
+
+1. Open a Gitlab issue for this project [here](https://gitlab.com/abhchand/clockface/issues/new). Please include a description fo the changes / fixes you'd like to make.
+2. If any project owner approves the idea, please open a new pull request agains the `master` branch.

data/Rakefile

@@ -0,0 +1,22 @@
+begin
+  require "bundler/setup"
+rescue LoadError
+  puts "You must `gem install bundler` and `bundle install` to run rake tasks"
+end
+
+require "rdoc/task"
+
+RDoc::Task.new(:rdoc) do |rdoc|
+  rdoc.rdoc_dir = "rdoc"
+  rdoc.title    = "Clockface"
+  rdoc.options << "--line-numbers"
+  rdoc.rdoc_files.include("README.md")
+  rdoc.rdoc_files.include("lib/**/*.rb")
+end
+
+APP_RAKEFILE = File.expand_path("spec/dummy/Rakefile", __dir__)
+load "rails/tasks/engine.rake"
+
+load "rails/tasks/statistics.rake"
+
+require "bundler/gem_tasks"

data/app/assets/config/clockface_manifest.js

@@ -0,0 +1,2 @@
+//= link_directory ../javascripts/clockface .js
+//= link_directory ../stylesheets/clockface .css

data/app/assets/images/clockface/clockface.svg

@@ -0,0 +1,34 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<svg width="128px" height="128px" viewBox="0 0 128 128" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+    <!-- Generator: Sketch 43.2 (39069) - http://www.bohemiancoding.com/sketch -->
+    <title>Group</title>
+    <desc>Created with Sketch.</desc>
+    <defs></defs>
+    <g id="Page-1" stroke="none" stroke-width="1" fill="none" fill-rule="evenodd">
+        <g id="Group" transform="translate(-8.000000, -8.000000)">
+            <circle id="face" fill="#BD0000" cx="72" cy="72" r="64"></circle>
+            <circle id="base" stroke="#FF1919" fill="#BDBDCF" cx="72" cy="72" r="56"></circle>
+            <g id="numbers3" transform="translate(72.000000, 72.000000) rotate(60.000000) translate(-72.000000, -72.000000) translate(20.000000, 20.000000)" fill="#417505">
+                <circle id="clock-12" cx="52" cy="2" r="2"></circle>
+                <circle id="clock-06" cx="52" cy="102" r="2"></circle>
+                <circle id="clock-03" cx="102" cy="52" r="2"></circle>
+                <circle id="clock-09" cx="2" cy="52" r="2"></circle>
+            </g>
+            <g id="numbers2" transform="translate(72.000000, 72.000000) rotate(30.000000) translate(-72.000000, -72.000000) translate(20.000000, 20.000000)" fill="#417505">
+                <circle id="clock-12" cx="52" cy="2" r="2"></circle>
+                <circle id="clock-06" cx="52" cy="102" r="2"></circle>
+                <circle id="clock-03" cx="102" cy="52" r="2"></circle>
+                <circle id="clock-09" cx="2" cy="52" r="2"></circle>
+            </g>
+            <g id="numbers1" transform="translate(20.000000, 20.000000)" fill="#417505">
+                <circle id="clock-12" cx="52" cy="2" r="2"></circle>
+                <circle id="clock-06" cx="52" cy="102" r="2"></circle>
+                <circle id="clock-03" cx="102" cy="52" r="2"></circle>
+                <circle id="clock-09" cx="2" cy="52" r="2"></circle>
+            </g>
+            <rect id="second" fill="#E0E0E0" transform="translate(88.043485, 56.243467) rotate(45.000000) translate(-88.043485, -56.243467) " x="87.5434853" y="33.743467" width="1" height="45"></rect>
+            <rect id="minute" fill="#000000" x="71.5" y="27" width="1" height="45"></rect>
+            <rect id="hour" fill="#000000" transform="translate(55.000000, 72.000000) rotate(270.000000) translate(-55.000000, -72.000000) " x="54.5" y="54.5" width="1" height="35"></rect>
+        </g>
+    </g>
+</svg>

data/app/assets/javascripts/clockface/application.js

@@ -0,0 +1,17 @@
+// This is a manifest file that'll be compiled into application.js, which will include all the files
+// listed below.
+//
+// Any JavaScript/Coffee file within this directory, lib/assets/javascripts, vendor/assets/javascripts,
+// or any plugin's vendor/assets/javascripts directory can be referenced here using a relative path.
+//
+// It's not advisable to add code directly here, but if you do, it'll appear at the bottom of the
+// compiled file. JavaScript code in this file should be added after the last require_* statement.
+//
+// Read Sprockets README (https://github.com/rails/sprockets#sprockets-directives) for details
+// about supported directives.
+//
+//= require ./flash
+//= require ./sorttable
+//= require_tree .
+
+window.onload = flashClose;

data/app/assets/javascripts/clockface/flash.js

@@ -0,0 +1,7 @@
+function flashClose() {
+  document.querySelectorAll(".flash .close").forEach(function(e) {
+    e.addEventListener("click", function(){
+      this.parentElement.classList.remove("active");
+    })
+  })
+}

data/app/assets/javascripts/clockface/sorttable.js

@@ -0,0 +1,494 @@
+/*
+  SortTable
+  version 2
+  7th April 2007
+  Stuart Langridge, http://www.kryogenix.org/code/browser/sorttable/
+
+  Instructions:
+  Download this file
+  Add <script src="sorttable.js"></script> to your HTML
+  Add class="sortable" to any table you'd like to make sortable
+  Click on the headers to sort
+
+  Thanks to many, many people for contributions and suggestions.
+  Licenced as X11: http://www.kryogenix.org/code/browser/licence.html
+  This basically means: do what you want with it.
+*/
+
+
+var stIsIE = /*@cc_on!@*/false;
+
+sorttable = {
+  init: function() {
+    // quit if this function has already been called
+    if (arguments.callee.done) return;
+    // flag this function so we don't do the same thing twice
+    arguments.callee.done = true;
+    // kill the timer
+    if (_timer) clearInterval(_timer);
+
+    if (!document.createElement || !document.getElementsByTagName) return;
+
+    sorttable.DATE_RE = /^(\d\d?)[\/\.-](\d\d?)[\/\.-]((\d\d)?\d\d)$/;
+
+    forEach(document.getElementsByTagName('table'), function(table) {
+      if (table.className.search(/\bsortable\b/) != -1) {
+        sorttable.makeSortable(table);
+      }
+    });
+
+  },
+
+  makeSortable: function(table) {
+    if (table.getElementsByTagName('thead').length == 0) {
+      // table doesn't have a tHead. Since it should have, create one and
+      // put the first table row in it.
+      the = document.createElement('thead');
+      the.appendChild(table.rows[0]);
+      table.insertBefore(the,table.firstChild);
+    }
+    // Safari doesn't support table.tHead, sigh
+    if (table.tHead == null) table.tHead = table.getElementsByTagName('thead')[0];
+
+    if (table.tHead.rows.length != 1) return; // can't cope with two header rows
+
+    // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
+    // "total" rows, for example). This is B&R, since what you're supposed
+    // to do is put them in a tfoot. So, if there are sortbottom rows,
+    // for backwards compatibility, move them to tfoot (creating it if needed).
+    sortbottomrows = [];
+    for (var i=0; i<table.rows.length; i++) {
+      if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
+        sortbottomrows[sortbottomrows.length] = table.rows[i];
+      }
+    }
+    if (sortbottomrows) {
+      if (table.tFoot == null) {
+        // table doesn't have a tfoot. Create one.
+        tfo = document.createElement('tfoot');
+        table.appendChild(tfo);
+      }
+      for (var i=0; i<sortbottomrows.length; i++) {
+        tfo.appendChild(sortbottomrows[i]);
+      }
+      delete sortbottomrows;
+    }
+
+    // work through each column and calculate its type
+    headrow = table.tHead.rows[0].cells;
+    for (var i=0; i<headrow.length; i++) {
+      // manually override the type with a sorttable_type attribute
+      if (!headrow[i].className.match(/\bsorttable_nosort\b/)) { // skip this col
+        mtch = headrow[i].className.match(/\bsorttable_([a-z0-9]+)\b/);
+        if (mtch) { override = mtch[1]; }
+        if (mtch && typeof sorttable["sort_"+override] == 'function') {
+          headrow[i].sorttable_sortfunction = sorttable["sort_"+override];
+        } else {
+          headrow[i].sorttable_sortfunction = sorttable.guessType(table,i);
+        }
+        // make it clickable to sort
+        headrow[i].sorttable_columnindex = i;
+        headrow[i].sorttable_tbody = table.tBodies[0];
+        dean_addEvent(headrow[i],"click", sorttable.innerSortFunction = function(e) {
+
+          if (this.className.search(/\bsorttable_sorted\b/) != -1) {
+            // if we're already sorted by this column, just
+            // reverse the table, which is quicker
+            sorttable.reverse(this.sorttable_tbody);
+            this.className = this.className.replace('sorttable_sorted',
+                                                    'sorttable_sorted_reverse');
+            this.removeChild(document.getElementById('sorttable_sortfwdind'));
+            sortrevind = document.createElement('span');
+            sortrevind.id = "sorttable_sortrevind";
+            sortrevind.innerHTML = stIsIE ? '&nbsp<font face="webdings">5</font>' : '&nbsp;&#x25B4;';
+            this.appendChild(sortrevind);
+            return;
+          }
+          if (this.className.search(/\bsorttable_sorted_reverse\b/) != -1) {
+            // if we're already sorted by this column in reverse, just
+            // re-reverse the table, which is quicker
+            sorttable.reverse(this.sorttable_tbody);
+            this.className = this.className.replace('sorttable_sorted_reverse',
+                                                    'sorttable_sorted');
+            this.removeChild(document.getElementById('sorttable_sortrevind'));
+            sortfwdind = document.createElement('span');
+            sortfwdind.id = "sorttable_sortfwdind";
+            sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
+            this.appendChild(sortfwdind);
+            return;
+          }
+
+          // remove sorttable_sorted classes
+          theadrow = this.parentNode;
+          forEach(theadrow.childNodes, function(cell) {
+            if (cell.nodeType == 1) { // an element
+              cell.className = cell.className.replace('sorttable_sorted_reverse','');
+              cell.className = cell.className.replace('sorttable_sorted','');
+            }
+          });
+          sortfwdind = document.getElementById('sorttable_sortfwdind');
+          if (sortfwdind) { sortfwdind.parentNode.removeChild(sortfwdind); }
+          sortrevind = document.getElementById('sorttable_sortrevind');
+          if (sortrevind) { sortrevind.parentNode.removeChild(sortrevind); }
+
+          this.className += ' sorttable_sorted';
+          sortfwdind = document.createElement('span');
+          sortfwdind.id = "sorttable_sortfwdind";
+          sortfwdind.innerHTML = stIsIE ? '&nbsp<font face="webdings">6</font>' : '&nbsp;&#x25BE;';
+          this.appendChild(sortfwdind);
+
+          // build an array to sort. This is a Schwartzian transform thing,
+          // i.e., we "decorate" each row with the actual sort key,
+          // sort based on the sort keys, and then put the rows back in order
+          // which is a lot faster because you only do getInnerText once per row
+          row_array = [];
+          col = this.sorttable_columnindex;
+          rows = this.sorttable_tbody.rows;
+          for (var j=0; j<rows.length; j++) {
+            row_array[row_array.length] = [sorttable.getInnerText(rows[j].cells[col]), rows[j]];
+          }
+          /* If you want a stable sort, uncomment the following line */
+          //sorttable.shaker_sort(row_array, this.sorttable_sortfunction);
+          /* and comment out this one */
+          row_array.sort(this.sorttable_sortfunction);
+
+          tb = this.sorttable_tbody;
+          for (var j=0; j<row_array.length; j++) {
+            tb.appendChild(row_array[j][1]);
+          }
+
+          delete row_array;
+        });
+      }
+    }
+  },
+
+  guessType: function(table, column) {
+    // guess the type of a column based on its first non-blank row
+    sortfn = sorttable.sort_alpha;
+    for (var i=0; i<table.tBodies[0].rows.length; i++) {
+      text = sorttable.getInnerText(table.tBodies[0].rows[i].cells[column]);
+      if (text != '') {
+        if (text.match(/^-?[£$¤]?[\d,.]+%?$/)) {
+          return sorttable.sort_numeric;
+        }
+        // check for a date: dd/mm/yyyy or dd/mm/yy
+        // can have / or . or - as separator
+        // can be mm/dd as well
+        possdate = text.match(sorttable.DATE_RE)
+        if (possdate) {
+          // looks like a date
+          first = parseInt(possdate[1]);
+          second = parseInt(possdate[2]);
+          if (first > 12) {
+            // definitely dd/mm
+            return sorttable.sort_ddmm;
+          } else if (second > 12) {
+            return sorttable.sort_mmdd;
+          } else {
+            // looks like a date, but we can't tell which, so assume
+            // that it's dd/mm (English imperialism!) and keep looking
+            sortfn = sorttable.sort_ddmm;
+          }
+        }
+      }
+    }
+    return sortfn;
+  },
+
+  getInnerText: function(node) {
+    // gets the text we want to use for sorting for a cell.
+    // strips leading and trailing whitespace.
+    // this is *not* a generic getInnerText function; it's special to sorttable.
+    // for example, you can override the cell text with a customkey attribute.
+    // it also gets .value for <input> fields.
+
+    if (!node) return "";
+
+    hasInputs = (typeof node.getElementsByTagName == 'function') &&
+                 node.getElementsByTagName('input').length;
+
+    if (node.getAttribute("sorttable_customkey") != null) {
+      return node.getAttribute("sorttable_customkey");
+    }
+    else if (typeof node.textContent != 'undefined' && !hasInputs) {
+      return node.textContent.replace(/^\s+|\s+$/g, '');
+    }
+    else if (typeof node.innerText != 'undefined' && !hasInputs) {
+      return node.innerText.replace(/^\s+|\s+$/g, '');
+    }
+    else if (typeof node.text != 'undefined' && !hasInputs) {
+      return node.text.replace(/^\s+|\s+$/g, '');
+    }
+    else {
+      switch (node.nodeType) {
+        case 3:
+          if (node.nodeName.toLowerCase() == 'input') {
+            return node.value.replace(/^\s+|\s+$/g, '');
+          }
+        case 4:
+          return node.nodeValue.replace(/^\s+|\s+$/g, '');
+          break;
+        case 1:
+        case 11:
+          var innerText = '';
+          for (var i = 0; i < node.childNodes.length; i++) {
+            innerText += sorttable.getInnerText(node.childNodes[i]);
+          }
+          return innerText.replace(/^\s+|\s+$/g, '');
+          break;
+        default:
+          return '';
+      }
+    }
+  },
+
+  reverse: function(tbody) {
+    // reverse the rows in a tbody
+    newrows = [];
+    for (var i=0; i<tbody.rows.length; i++) {
+      newrows[newrows.length] = tbody.rows[i];
+    }
+    for (var i=newrows.length-1; i>=0; i--) {
+       tbody.appendChild(newrows[i]);
+    }
+    delete newrows;
+  },
+
+  /* sort functions
+     each sort function takes two parameters, a and b
+     you are comparing a[0] and b[0] */
+  sort_numeric: function(a,b) {
+    aa = parseFloat(a[0].replace(/[^0-9.-]/g,''));
+    if (isNaN(aa)) aa = 0;
+    bb = parseFloat(b[0].replace(/[^0-9.-]/g,''));
+    if (isNaN(bb)) bb = 0;
+    return aa-bb;
+  },
+  sort_alpha: function(a,b) {
+    if (a[0]==b[0]) return 0;
+    if (a[0]<b[0]) return -1;
+    return 1;
+  },
+  sort_ddmm: function(a,b) {
+    mtch = a[0].match(sorttable.DATE_RE);
+    y = mtch[3]; m = mtch[2]; d = mtch[1];
+    if (m.length == 1) m = '0'+m;
+    if (d.length == 1) d = '0'+d;
+    dt1 = y+m+d;
+    mtch = b[0].match(sorttable.DATE_RE);
+    y = mtch[3]; m = mtch[2]; d = mtch[1];
+    if (m.length == 1) m = '0'+m;
+    if (d.length == 1) d = '0'+d;
+    dt2 = y+m+d;
+    if (dt1==dt2) return 0;
+    if (dt1<dt2) return -1;
+    return 1;
+  },
+  sort_mmdd: function(a,b) {
+    mtch = a[0].match(sorttable.DATE_RE);
+    y = mtch[3]; d = mtch[2]; m = mtch[1];
+    if (m.length == 1) m = '0'+m;
+    if (d.length == 1) d = '0'+d;
+    dt1 = y+m+d;
+    mtch = b[0].match(sorttable.DATE_RE);
+    y = mtch[3]; d = mtch[2]; m = mtch[1];
+    if (m.length == 1) m = '0'+m;
+    if (d.length == 1) d = '0'+d;
+    dt2 = y+m+d;
+    if (dt1==dt2) return 0;
+    if (dt1<dt2) return -1;
+    return 1;
+  },
+
+  shaker_sort: function(list, comp_func) {
+    // A stable sort function to allow multi-level sorting of data
+    // see: http://en.wikipedia.org/wiki/Cocktail_sort
+    // thanks to Joseph Nahmias
+    var b = 0;
+    var t = list.length - 1;
+    var swap = true;
+
+    while(swap) {
+        swap = false;
+        for(var i = b; i < t; ++i) {
+            if ( comp_func(list[i], list[i+1]) > 0 ) {
+                var q = list[i]; list[i] = list[i+1]; list[i+1] = q;
+                swap = true;
+            }
+        } // for
+        t--;
+
+        if (!swap) break;
+
+        for(var i = t; i > b; --i) {
+            if ( comp_func(list[i], list[i-1]) < 0 ) {
+                var q = list[i]; list[i] = list[i-1]; list[i-1] = q;
+                swap = true;
+            }
+        } // for
+        b++;
+
+    } // while(swap)
+  }
+}
+
+/* ******************************************************************
+   Supporting functions: bundled here to avoid depending on a library
+   ****************************************************************** */
+
+// Dean Edwards/Matthias Miller/John Resig
+
+/* for Mozilla/Opera9 */
+if (document.addEventListener) {
+    document.addEventListener("DOMContentLoaded", sorttable.init, false);
+}
+
+/* for Internet Explorer */
+/*@cc_on @*/
+/*@if (@_win32)
+    document.write("<script id=__ie_onload defer src=javascript:void(0)><\/script>");
+    var script = document.getElementById("__ie_onload");
+    script.onreadystatechange = function() {
+        if (this.readyState == "complete") {
+            sorttable.init(); // call the onload handler
+        }
+    };
+/*@end @*/
+
+/* for Safari */
+if (/WebKit/i.test(navigator.userAgent)) { // sniff
+    var _timer = setInterval(function() {
+        if (/loaded|complete/.test(document.readyState)) {
+            sorttable.init(); // call the onload handler
+        }
+    }, 10);
+}
+
+/* for other browsers */
+window.onload = sorttable.init;
+
+// written by Dean Edwards, 2005
+// with input from Tino Zijdel, Matthias Miller, Diego Perini
+
+// http://dean.edwards.name/weblog/2005/10/add-event/
+
+function dean_addEvent(element, type, handler) {
+  if (element.addEventListener) {
+    element.addEventListener(type, handler, false);
+  } else {
+    // assign each event handler a unique ID
+    if (!handler.$$guid) handler.$$guid = dean_addEvent.guid++;
+    // create a hash table of event types for the element
+    if (!element.events) element.events = {};
+    // create a hash table of event handlers for each element/event pair
+    var handlers = element.events[type];
+    if (!handlers) {
+      handlers = element.events[type] = {};
+      // store the existing event handler (if there is one)
+      if (element["on" + type]) {
+        handlers[0] = element["on" + type];
+      }
+    }
+    // store the event handler in the hash table
+    handlers[handler.$$guid] = handler;
+    // assign a global event handler to do all the work
+    element["on" + type] = handleEvent;
+  }
+};
+// a counter used to create unique IDs
+dean_addEvent.guid = 1;
+
+function removeEvent(element, type, handler) {
+  if (element.removeEventListener) {
+    element.removeEventListener(type, handler, false);
+  } else {
+    // delete the event handler from the hash table
+    if (element.events && element.events[type]) {
+      delete element.events[type][handler.$$guid];
+    }
+  }
+};
+
+function handleEvent(event) {
+  var returnValue = true;
+  // grab the event object (IE uses a global event object)
+  event = event || fixEvent(((this.ownerDocument || this.document || this).parentWindow || window).event);
+  // get a reference to the hash table of event handlers
+  var handlers = this.events[event.type];
+  // execute each event handler
+  for (var i in handlers) {
+    this.$$handleEvent = handlers[i];
+    if (this.$$handleEvent(event) === false) {
+      returnValue = false;
+    }
+  }
+  return returnValue;
+};
+
+function fixEvent(event) {
+  // add W3C standard event methods
+  event.preventDefault = fixEvent.preventDefault;
+  event.stopPropagation = fixEvent.stopPropagation;
+  return event;
+};
+fixEvent.preventDefault = function() {
+  this.returnValue = false;
+};
+fixEvent.stopPropagation = function() {
+  this.cancelBubble = true;
+}
+
+// Dean's forEach: http://dean.edwards.name/base/forEach.js
+/*
+  forEach, version 1.0
+  Copyright 2006, Dean Edwards
+  License: http://www.opensource.org/licenses/mit-license.php
+*/
+
+// array-like enumeration
+if (!Array.forEach) { // mozilla already supports this
+  Array.forEach = function(array, block, context) {
+    for (var i = 0; i < array.length; i++) {
+      block.call(context, array[i], i, array);
+    }
+  };
+}
+
+// generic enumeration
+Function.prototype.forEach = function(object, block, context) {
+  for (var key in object) {
+    if (typeof this.prototype[key] == "undefined") {
+      block.call(context, object[key], key, object);
+    }
+  }
+};
+
+// character enumeration
+String.forEach = function(string, block, context) {
+  Array.forEach(string.split(""), function(chr, index) {
+    block.call(context, chr, index, string);
+  });
+};
+
+// globally resolve forEach enumeration
+var forEach = function(object, block, context) {
+  if (object) {
+    var resolve = Object; // default
+    if (object instanceof Function) {
+      // functions have a "length" property
+      resolve = Function;
+    } else if (object.forEach instanceof Function) {
+      // the object implements a custom forEach method so use that
+      object.forEach(block, context);
+      return;
+    } else if (typeof object == "string") {
+      // the object is a string
+      resolve = String;
+    } else if (typeof object.length == "number") {
+      // the object is array-like
+      resolve = Array;
+    }
+    resolve.forEach(object, block, context);
+  }
+};