d3_rails 2.8.0 → 2.8.1

data/vendor/assets/javascripts/morris/morris.min.js

@@ -0,0 +1 @@
+((function(){var a,b,c=function(a,b){return function(){return a.apply(b,arguments)}};a=jQuery,b={},b.Line=function(){function d(d){this.updateHilight=c(this.updateHilight,this),this.hilight=c(this.hilight,this),this.updateHover=c(this.updateHover,this),this.transY=c(this.transY,this),this.transX=c(this.transX,this);if(!(this instanceof b.Line))return new b.Line(d);typeof d.element=="string"?this.el=a(document.getElementById(d.element)):this.el=a(d.element),this.options=a.extend({},this.defaults,d);if(this.options.data===void 0||this.options.data.length===0)return;this.el.addClass("graph-initialised"),this.precalc(),this.redraw()}return d.prototype.defaults={lineWidth:3,pointSize:4,lineColors:["#0b62a4","#7A92A3","#4da74d","#afd8f8","#edc240","#cb4b4b","#9440ed"],ymax:"auto",ymin:"auto 0",marginTop:25,marginRight:25,marginBottom:30,marginLeft:25,numLines:5,gridLineColor:"#aaa",gridTextColor:"#888",gridTextSize:12,gridStrokeWidth:.5,hoverPaddingX:10,hoverPaddingY:5,hoverMargin:10,hoverFillColor:"#fff",hoverBorderColor:"#ccc",hoverBorderWidth:2,hoverOpacity:.95,hoverLabelColor:"#444",hoverFontSize:12,smooth:!0,hideHover:!1,parseTime:!0,units:"",dateFormat:function(a){return(new Date(a)).toString()}},d.prototype.precalc=function(){var b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q=this;this.options.data.sort(function(a,b){return(a[q.options.xkey]<b[q.options.xkey])-(b[q.options.xkey]<a[q.options.xkey])}),this.columnLabels=a.map(this.options.data,function(a){return a[q.options.xkey]}),this.seriesLabels=this.options.labels,this.series=[],m=this.options.ykeys;for(h=0,k=m.length;h<k;h++){e=m[h],c=[],n=this.options.data;for(i=0,l=n.length;i<l;i++)b=n[i],c.push(b[e]);this.series.push(c)}return this.options.parseTime?this.xvals=a.map(this.columnLabels,function(a){return q.parseYear(a)}):this.xvals=function(){p=[];for(var a=o=this.columnLabels.length-1;o<=0?a<=0:a>=0;o<=0?a++:a--)p.push(a);return p}.apply(this),this.options.parseTime&&(this.columnLabels=a.map(this.columnLabels,function(a){return typeof a=="number"?q.options.dateFormat(a):a})),this.xmin=Math.min.apply(null,this.xvals),this.xmax=Math.max.apply(null,this.xvals),this.xmin===this.xmax&&(this.xmin-=1,this.xmax+=1),typeof this.options.ymax=="string"&&this.options.ymax.slice(0,4)==="auto"&&(f=Math.max.apply(null,Array.prototype.concat.apply([],this.series)),this.options.ymax.length>5?this.options.ymax=Math.max(parseInt(this.options.ymax.slice(5),10),f):this.options.ymax=f),typeof this.options.ymin=="string"&&this.options.ymin.slice(0,4)==="auto"&&(g=Math.min.apply(null,Array.prototype.concat.apply([],this.series)),this.options.ymin.length>5?this.options.ymin=Math.min(parseInt(this.options.ymin.slice(5),10),g):this.options.ymin=g),this.pointGrow=Raphael.animation({r:this.options.pointSize+3},25,"linear"),this.pointShrink=Raphael.animation({r:this.options.pointSize},25,"linear"),this.elementWidth=null,this.elementHeight=null,this.prevHilight=null,this.el.mousemove(function(a){return q.updateHilight(a.pageX)}),this.options.hideHover&&this.el.mouseout(function(a){return q.hilight(null)}),d=function(a){var b;return b=a.originalEvent.touches[0]||a.originalEvent.changedTouches[0],q.updateHilight(b.pageX),b},this.el.bind("touchstart",d),this.el.bind("touchmove",d),this.el.bind("touchend",d)},d.prototype.calc=function(){var b,c,d,e,f,g,h,i,j=this;e=this.el.width(),b=this.el.height();if(this.elementWidth!==e||this.elementHeight!==b){this.maxYLabelWidth=Math.max(this.measureText(this.options.ymin+this.options.units,this.options.gridTextSize).width,this.measureText(this.options.ymax+this.options.units,this.options.gridTextSize).width),this.left=this.maxYLabelWidth+this.options.marginLeft,this.width=this.el.width()-this.left-this.options.marginRight,this.height=this.el.height()-this.options.marginTop-this.options.marginBottom,this.dx=this.width/(this.xmax-this.xmin),this.dy=this.height/(this.options.ymax-this.options.ymin),this.columns=function(){var a,b,c,d;c=this.xvals,d=[];for(a=0,b=c.length;a<b;a++)f=c[a],d.push(this.transX(f));return d}.call(this),this.seriesCoords=[],i=this.series;for(g=0,h=i.length;g<h;g++)c=i[g],d=[],a.each(c,function(a,b){return b===null?d.push(null):d.push({x:j.columns[a],y:j.transY(b)})}),this.seriesCoords.push(d);return this.hoverMargins=a.map(this.columns.slice(1),function(a,b){return(a+j.columns[b])/2})}},d.prototype.transX=function(a){return this.xvals.length===1?this.left+this.width/2:this.left+(a-this.xmin)*this.dx},d.prototype.transY=function(a){return this.options.marginTop+this.height-(a-this.options.ymin)*this.dy},d.prototype.redraw=function(){return this.el.empty(),this.r=new Raphael(this.el[0]),this.calc(),this.drawGrid(),this.drawSeries(),this.drawHover(),this.hilight(this.options.hideHover?null:0)},d.prototype.drawGrid=function(){var a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p;o=(this.options.ymax-this.options.ymin)/(this.options.numLines-1),a=Math.ceil(this.options.ymin/o)*o,f=Math.floor(this.options.ymax/o)*o;for(g=a;a<=f?g<=f:g>=f;g+=o)i=Math.floor(g),n=this.transY(i),this.r.text(this.left-this.options.marginLeft/2,n,this.commas(i)+this.options.units).attr("font-size",this.options.gridTextSize).attr("fill",this.options.gridTextColor).attr("text-anchor","end"),this.r.path("M"+this.left+","+n+"H"+(this.left+this.width)).attr("stroke",this.options.gridLineColor).attr("stroke-width",this.options.gridStrokeWidth);h=null,l=50,this.options.parseTime?(j=(new Date(this.xmin)).getFullYear(),k=(new Date(this.xmax)).getFullYear()):(j=this.xmin,k=this.xmax),p=[];for(b=j;j<=k?b<=k:b>=k;j<=k?b++:b--){if(this.options.parseTime){m=(new Date(b,0,1)).getTime();if(m<this.xmin)continue}else m=b;e=this.options.parseTime?b:this.columnLabels[this.columnLabels.length-b-1],c=this.r.text(this.transX(m),this.options.marginTop+this.height+this.options.marginBottom/2,e).attr("font-size",this.options.gridTextSize).attr("fill",this.options.gridTextColor),d=c.getBBox(),h===null||h<=d.x?p.push(h=d.x+d.width+l):p.push(c.remove())}return p},d.prototype.drawSeries=function(){var a,b,c,d,e,f,g,h;for(d=f=this.seriesCoords.length-1;f<=0?d<=0:d>=0;f<=0?d++:d--)c=this.seriesCoords[d],c.length>1&&(e=this.createPath(c,this.options.marginTop,this.left,this.options.marginTop+this.height,this.left+this.width),this.r.path(e).attr("stroke",this.options.lineColors[d]).attr("stroke-width",this.options.lineWidth));this.seriesPoints=function(){var a,b;b=[];for(d=0,a=this.seriesCoords.length-1;0<=a?d<=a:d>=a;0<=a?d++:d--)b.push([]);return b}.call(this),h=[];for(d=g=this.seriesCoords.length-1;g<=0?d<=0:d>=0;g<=0?d++:d--)h.push(function(){var c,e,f,g;f=this.seriesCoords[d],g=[];for(c=0,e=f.length;c<e;c++)a=f[c],a===null?b=null:b=this.r.circle(a.x,a.y,this.options.pointSize).attr("fill",this.options.lineColors[d]).attr("stroke-width",1).attr("stroke","#ffffff"),g.push(this.seriesPoints[d].push(b));return g}.call(this));return h},d.prototype.createPath=function(b,c,d,e,f){var g,h,i,j,k,l,m,n,o,p,q,r,s,t;o="",h=a.map(b,function(a){return a});if(this.options.smooth){j=this.gradients(h);for(k=0,t=h.length-1;0<=t?k<=t:k>=t;0<=t?k++:k--)g=h[k],k===0?o+="M"+g.x+","+g.y:(i=j[k],m=h[k-1],n=j[k-1],l=(g.x-m.x)/4,p=m.x+l,r=Math.min(e,m.y+l*n),q=g.x-l,s=Math.min(e,g.y-l*i),o+="C"+p+","+r+","+q+","+s+","+g.x+","+g.y)}else o="M"+a.map(h,function(a){return""+a.x+","+a.y}).join("L");return o},d.prototype.gradients=function(b){return a.map(b,function(a,c){return c===0?(b[1].y-a.y)/(b[1].x-a.x):c===b.length-1?(a.y-b[c-1].y)/(a.x-b[c-1].x):(b[c+1].y-b[c-1].y)/(b[c+1].x-b[c-1].x)})},d.prototype.drawHover=function(){var a,b,c,d;this.hoverHeight=this.options.hoverFontSize*1.5*(this.series.length+1),this.hover=this.r.rect(-10,-this.hoverHeight/2-this.options.hoverPaddingY,20,this.hoverHeight+this.options.hoverPaddingY*2,10).attr("fill",this.options.hoverFillColor).attr("stroke",this.options.hoverBorderColor).attr("stroke-width",this.options.hoverBorderWidth).attr("opacity",this.options.hoverOpacity),this.xLabel=this.r.text(0,this.options.hoverFontSize*.75-this.hoverHeight/2,"").attr("fill",this.options.hoverLabelColor).attr("font-weight","bold").attr("font-size",this.options.hoverFontSize),this.hoverSet=this.r.set(),this.hoverSet.push(this.hover),this.hoverSet.push(this.xLabel),this.yLabels=[],d=[];for(a=0,c=this.series.length-1;0<=c?a<=c:a>=c;0<=c?a++:a--)b=this.r.text(0,this.options.hoverFontSize*1.5*(a+1.5)-this.hoverHeight/2,"").attr("fill",this.options.lineColors[a]).attr("font-size",this.options.hoverFontSize),this.yLabels.push(b),d.push(this.hoverSet.push(b));return d},d.prototype.updateHover=function(b){var c,d,e,f,g,h=this;this.hoverSet.show(),this.xLabel.attr("text",this.columnLabels[b]);for(c=0,g=this.series.length-1;0<=g?c<=g:c>=g;0<=g?c++:c--)this.yLabels[c].attr("text",""+this.seriesLabels[c]+": "+this.commas(this.series[c][b])+this.options.units);return d=Math.max.apply(null,a.map(this.yLabels,function(a){return a.getBBox().width})),d=Math.max(d,this.xLabel.getBBox().width),this.hover.attr("width",d+this.options.hoverPaddingX*2),this.hover.attr("x",-this.options.hoverPaddingX-d/2),f=Math.min.apply(null,a.map(this.series,function(a){return h.transY(a[b])})),f>this.hoverHeight+this.options.hoverPaddingY*2+this.options.hoverMargin+this.options.marginTop?f=f-this.hoverHeight/2-this.options.hoverPaddingY-this.options.hoverMargin:f=f+this.hoverHeight/2+this.options.hoverPaddingY+this.options.hoverMargin,f=Math.max(this.options.marginTop+this.hoverHeight/2+this.options.hoverPaddingY,f),f=Math.min(this.options.marginTop+this.height-this.hoverHeight/2-this.options.hoverPaddingY,f),e=Math.min(this.left+this.width-d/2-this.options.hoverPaddingX,this.columns[b]),e=Math.max(this.left+d/2+this.options.hoverPaddingX,e),this.hoverSet.attr("transform","t"+e+","+f)},d.prototype.hideHover=function(){return this.hoverSet.hide()},d.prototype.hilight=function(a){var b,c,d;if(this.prevHilight!==null&&this.prevHilight!==a)for(b=0,c=this.seriesPoints.length-1;0<=c?b<=c:b>=c;0<=c?b++:b--)this.seriesPoints[b][this.prevHilight]&&this.seriesPoints[b][this.prevHilight].animate(this.pointShrink);if(a!==null&&this.prevHilight!==a){for(b=0,d=this.seriesPoints.length-1;0<=d?b<=d:b>=d;0<=d?b++:b--)this.seriesPoints[b][a]&&this.seriesPoints[b][a].animate(this.pointGrow);this.updateHover(a)}this.prevHilight=a;if(a===null)return this.hideHover()},d.prototype.updateHilight=function(a){var b,c,d;a-=this.el.offset().left,d=[];for(b=c=this.hoverMargins.length;c<=0?b<=0:b>=0;c<=0?b++:b--){if(b===0||this.hoverMargins[b-1]>a){this.hilight(b);break}d.push(void 0)}return d},d.prototype.measureText=function(a,b){var c,d;return b==null&&(b=12),d=this.r.text(100,100,a).attr("font-size",b),c=d.getBBox(),d.remove(),c},d.prototype.parseYear=function(a){var b,c,d,e,f,g,h,i,j,k;return typeof a=="number"?a:(c=a.match(/^(\d+) Q(\d)$/),e=a.match(/^(\d+)-(\d+)$/),f=a.match(/^(\d+)-(\d+)-(\d+)$/),g=a.match(/^(\d+) W(\d+)$/),h=a.match(/^(\d+)-(\d+)-(\d+) (\d+):(\d+)$/),i=a.match(/^(\d+)-(\d+)-(\d+) (\d+):(\d+):(\d+(\.\d+)?)$/),c?(new Date(parseInt(c[1],10),parseInt(c[2],10)*3-1,1)).getTime():e?(new Date(parseInt(e[1],10),parseInt(e[2],10)-1,1)).getTime():f?(new Date(parseInt(f[1],10),parseInt(f[2],10)-1,parseInt(f[3],10))).getTime():g?(j=new Date(parseInt(g[1],10),0,1),j.getDay()!==4&&j.setMonth(0,1+(4-j.getDay()+7)%7),j.getTime()+parseInt(g[2],10)*6048e5):h?(new Date(parseInt(h[1],10),parseInt(h[2],10)-1,parseInt(h[3],10),parseInt(h[4],10),parseInt(h[5],10))).getTime():i?(k=parseFloat(i[6]),b=Math.floor(k),d=Math.floor((k-b)*1e3),(new Date(parseInt(i[1],10),parseInt(i[2],10)-1,parseInt(i[3],10),parseInt(i[4],10),parseInt(i[5],10),b,d)).getTime()):new Date(parseInt(a,10),0,1))},d.prototype.commas=function(a){var b,c,d,e;return a===null?"n/a":(d=a<0?"-":"",b=Math.abs(a),c=Math.floor(b).toFixed(0),d+=c.replace(/(?=(?:\d{3})+$)(?!^)/g,","),e=b.toString(),e.length>c.length&&(d+=e.slice(c.length)),d)},d}(),window.Morris=b})).call(this);

data/vendor/assets/javascripts/tesseract.js

@@ -0,0 +1 @@
+//= require tesseract/tesseract

data/vendor/assets/javascripts/tesseract/.gitignore

@@ -0,0 +1,2 @@
+.DS_Store
+node_modules

data/vendor/assets/javascripts/tesseract/LICENSE

@@ -0,0 +1,12 @@
+Copyright 2012 Square, Inc.
+
+Licensed under the Apache License, Version 2.0 (the "License"); you may not use
+this file except in compliance with the License. You may obtain a copy of the
+License at
+
+   http://www.apache.org/licenses/LICENSE-2.0
+
+Unless required by applicable law or agreed to in writing, software distributed
+under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
+CONDITIONS OF ANY KIND, either express or implied. See the License for the
+specific language governing permissions and limitations under the License.

data/vendor/assets/javascripts/tesseract/Makefile

@@ -0,0 +1,48 @@
+JS_TESTER = ./node_modules/vows/bin/vows
+JS_COMPILER = ./node_modules/uglify-js/bin/uglifyjs
+
+.PHONY: test benchmark
+
+all: tesseract.min.js package.json
+
+tesseract.js: \
+	src/version.js \
+	src/identity.js \
+	src/permute.js \
+	src/bisect.js \
+	src/heap.js \
+	src/heapselect.js \
+	src/insertionsort.js \
+	src/quicksort.js \
+	src/array.js \
+	src/filter.js \
+	src/null.js \
+	src/zero.js \
+	src/reduce.js \
+	src/tesseract.js \
+	Makefile
+
+%.min.js: %.js Makefile
+	@rm -f $@
+	$(JS_COMPILER) < $< > $@
+
+%.js:
+	@rm -f $@
+	@echo '(function(exports){' > $@
+	cat $(filter %.js,$^) >> $@
+	@echo '})(this);' >> $@
+	@chmod a-w $@
+
+package.json: tesseract.js src/package.js
+	@rm -f $@
+	node src/package.js > $@
+	@chmod a-w $@
+
+clean:
+	rm -f tesseract.js tesseract.min.js package.json
+
+test: all
+	@$(JS_TESTER)
+
+benchmark: all
+	@node test/benchmark.js

data/vendor/assets/javascripts/tesseract/README.md

@@ -0,0 +1,11 @@
+# Tesseract
+
+Fast *n*-dimensional filtering and grouping of records in JavaScript.
+
+See <http://square.github.com/tesseract/> for an interactive example.
+
+See <https://github.com/square/tesseract/wiki/API-Reference> for documentation.
+
+## Contributing
+
+We'd love for you to participate in the development of Tesseract. Before we can accept your pull request, please sign our [Individual Contributor License Agreement](https://spreadsheets.google.com/spreadsheet/viewform?formkey=dDViT2xzUHAwRkI3X3k5Z0lQM091OGc6MQ&ndplr=1). It's a short form that covers our bases and makes sure you're eligible to contribute. Thank you!

data/vendor/assets/javascripts/tesseract/index.js

@@ -0,0 +1 @@
+module.exports = require("./tesseract").tesseract;

data/vendor/assets/javascripts/tesseract/lib/dart/AUTHORS

@@ -0,0 +1,9 @@
+# Below is a list of people and organizations that have contributed
+# to the Dart project. Names should be added to the list like so:
+#
+#   Name/Organization <email address>
+
+Google Inc.
+
+Ola Martin Bini <ola.bini@gmail.com>
+Michael Haubenwallner <michael.haubenwallner@gmail.com>

data/vendor/assets/javascripts/tesseract/lib/dart/LICENSE

@@ -0,0 +1,25 @@
+Copyright 2012, the Dart project authors. All rights reserved. Redistribution
+and use in source and binary forms, with or without modification, are permitted
+provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright notice, this
+    list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright notice,
+    this list of conditions and the following disclaimer in the documentation
+    and/or other materials provided with the distribution.
+
+  * Neither the name of Google Inc. nor the names of its contributors may be
+    used to endorse or promote products derived from this software without
+    specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/vendor/assets/javascripts/tesseract/lib/dart/dual_pivot_quicksort.dart

@@ -0,0 +1,342 @@
+// Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/**
+ * Dual-Pivot Quicksort algorithm.
+ *
+ * This class implements the dual-pivot quicksort algorithm as presented in
+ * Vladimir Yaroslavskiy's paper.
+ *
+ * Some improvements have been copied from Android's implementation.
+ */
+class DualPivotQuicksort {
+  // When a list has less then [:_INSERTION_SORT_THRESHOLD:] elements it will
+  // be sorted by an insertion sort.
+  static final int _INSERTION_SORT_THRESHOLD = 32;
+
+  /**
+   * Sorts all elements of the given list [:a:] according to the given
+   * [:compare:] function.
+   *
+   * The [:compare:] function takes two arguments [:x:] and [:y:] and returns
+   *  -1 if [:x < y:],
+   *   0 if [:x == y:], and
+   *   1 if [:x > y:].
+   *
+   * The function's behavior must be consistent. It must not return different
+   * results for the same values.
+   */
+  static void sort(List a, int compare(a, b)) {
+    _doSort(a, 0, a.length - 1, compare);
+  }
+
+  /**
+   * Sorts all elements in the range [:from:] (inclusive) to [:to:] (exclusive)
+   * of the given list [:a:].
+   *
+   * If the given range is invalid an "OutOfRange" error is raised.
+   * TODO(floitsch): do we want an error?
+   *
+   * See [:sort:] for requirements of the [:compare:] function.
+   */
+  static void sortRange(List a, int from, int to, int compare(a, b)) {
+    if ((from < 0) || (to > a.length) || (to < from)) {
+      throw "OutOfRange";
+    }
+    _doSort(a, from, to - 1, compare);
+  }
+
+  /**
+   * Sorts the list in the interval [:left:] to [:right:] (both inclusive).
+   */
+  static void _doSort(List a, int left, int right, int compare(a, b)) {
+    if ((right - left) <= _INSERTION_SORT_THRESHOLD) {
+      insertionSort_(a, left, right, compare);
+    } else {
+      _dualPivotQuicksort(a, left, right, compare);
+    }
+  }
+
+  static void insertionSort_(List a, int left, int right, int compare(a, b)) {
+    for (int i = left + 1; i <= right; i++) {
+      var el = a[i];
+      int j = i;
+      while ((j > left) && (compare(a[j - 1], el) > 0)) {
+        a[j] = a[j - 1];
+        j--;
+      }
+      a[j] = el;
+    }
+  }
+
+  static void _dualPivotQuicksort(List a,
+                                  int left, int right,
+                                  int compare(a, b)) {
+    assert(right - left > _INSERTION_SORT_THRESHOLD);
+
+    // Compute the two pivots by looking at 5 elements.
+    int sixth = (right - left + 1) ~/ 6;
+    int index1 = left + sixth;
+    int index5 = right - sixth;
+    int index3 = (left + right) ~/ 2;  // The midpoint.
+    int index2 = index3 - sixth;
+    int index4 = index3 + sixth;
+
+    var el1 = a[index1];
+    var el2 = a[index2];
+    var el3 = a[index3];
+    var el4 = a[index4];
+    var el5 = a[index5];
+
+    // Sort the selected 5 elements using a sorting network.
+    if (compare(el1, el2) > 0) { var t = el1; el1 = el2; el2 = t; }
+    if (compare(el4, el5) > 0) { var t = el4; el4 = el5; el5 = t; }
+    if (compare(el1, el3) > 0) { var t = el1; el1 = el3; el3 = t; }
+    if (compare(el2, el3) > 0) { var t = el2; el2 = el3; el3 = t; }
+    if (compare(el1, el4) > 0) { var t = el1; el1 = el4; el4 = t; }
+    if (compare(el3, el4) > 0) { var t = el3; el3 = el4; el4 = t; }
+    if (compare(el2, el5) > 0) { var t = el2; el2 = el5; el5 = t; }
+    if (compare(el2, el3) > 0) { var t = el2; el2 = el3; el3 = t; }
+    if (compare(el4, el5) > 0) { var t = el4; el4 = el5; el5 = t; }
+
+    var pivot1 = el2;
+    var pivot2 = el4;
+
+    // el2 and el4 have been saved in the pivot variables. They will be written
+    // back, once the partioning is finished.
+    a[index1] = el1;
+    a[index3] = el3;
+    a[index5] = el5;
+
+    a[index2] = a[left];
+    a[index4] = a[right];
+
+    int less = left + 1;    // First element in the middle partition.
+    int great = right - 1;  // Last element in the middle partition.
+
+    bool pivots_are_equal = (compare(pivot1, pivot2) == 0);
+    if (pivots_are_equal) {
+      var pivot = pivot1;
+      // Degenerated case where the partioning becomes a dutch national flag
+      // problem.
+      //
+      // [ |  < pivot  | == pivot | unpartitioned | > pivot  | ]
+      //  ^             ^          ^             ^            ^
+      // left         less         k           great         right
+      //
+      // a[left] and a[right] are undefined and are filled after the
+      // partitioning.
+      //
+      // Invariants:
+      //   1) for x in ]left, less[ : x < pivot.
+      //   2) for x in [less, k[ : x == pivot.
+      //   3) for x in ]great, right[ : x > pivot.
+      for (int k = less; k <= great; k++) {
+        var ak = a[k];
+        int comp = compare(ak, pivot);
+        if (comp == 0) continue;
+        if (comp < 0) {
+          if (k != less) {
+            a[k] = a[less];
+            a[less] = ak;
+          }
+          less++;
+        } else {
+          // comp > 0.
+          //
+          // Find the first element <= pivot in the range [k - 1, great] and
+          // put [:ak:] there. We know that such an element must exist:
+          // When k == less, then el3 (which is equal to pivot) lies in the
+          // interval. Otherwise a[k - 1] == pivot and the search stops at k-1.
+          // Note that in the latter case invariant 2 will be violated for a
+          // short amount of time. The invariant will be restored when the
+          // pivots are put into their final positions.
+          while (true) {
+            comp = compare(a[great], pivot);
+            if (comp > 0) {
+              great--;
+              // This is the only location in the while-loop where a new
+              // iteration is started.
+              continue;
+            } else if (comp < 0) {
+              // Triple exchange.
+              a[k] = a[less];
+              a[less++] = a[great];
+              a[great--] = ak;
+              break;
+            } else {
+              // comp == 0;
+              a[k] = a[great];
+              a[great--] = ak;
+              // Note: if great < k then we will exit the outer loop and fix
+              // invariant 2 (which we just violated).
+              break;
+            }
+          }
+        }
+      }
+    } else {
+      // We partition the list into three parts:
+      //  1. < pivot1
+      //  2. >= pivot1 && <= pivot2
+      //  3. > pivot2
+      //
+      // During the loop we have:
+      // [ | < pivot1 | >= pivot1 && <= pivot2 | unpartitioned  | > pivot2  | ]
+      //  ^            ^                        ^              ^             ^
+      // left         less                     k              great        right
+      //
+      // a[left] and a[right] are undefined and are filled after the
+      // partitioning.
+      //
+      // Invariants:
+      //   1. for x in ]left, less[ : x < pivot1
+      //   2. for x in [less, k[ : pivot1 <= x && x <= pivot2
+      //   3. for x in ]great, right[ : x > pivot2
+      for (int k = less; k <= great; k++) {
+        var ak = a[k];
+        int comp_pivot1 = compare(ak, pivot1);
+        if (comp_pivot1 < 0) {
+          if (k != less) {
+            a[k] = a[less];
+            a[less] = ak;
+          }
+          less++;
+        } else {
+          int comp_pivot2 = compare(ak, pivot2);
+          if (comp_pivot2 > 0) {
+            while (true) {
+              int comp = compare(a[great], pivot2);
+              if (comp > 0) {
+                great--;
+                if (great < k) break;
+                // This is the only location inside the loop where a new
+                // iteration is started.
+                continue;
+              } else {
+                // a[great] <= pivot2.
+                comp = compare(a[great], pivot1);
+                if (comp < 0) {
+                  // Triple exchange.
+                  a[k] = a[less];
+                  a[less++] = a[great];
+                  a[great--] = ak;
+                } else {
+                  // a[great] >= pivot1.
+                  a[k] = a[great];
+                  a[great--] = ak;
+                }
+                break;
+              }
+            }
+          }
+        }
+      }
+    }
+
+    // Move pivots into their final positions.
+    // We shrunk the list from both sides (a[left] and a[right] have
+    // meaningless values in them) and now we move elements from the first
+    // and third partition into these locations so that we can store the
+    // pivots.
+    a[left] = a[less - 1];
+    a[less - 1] = pivot1;
+    a[right] = a[great + 1];
+    a[great + 1] = pivot2;
+
+    // The list is now partitioned into three partitions:
+    // [ < pivot1   | >= pivot1 && <= pivot2   |  > pivot2   ]
+    //  ^            ^                        ^             ^
+    // left         less                     great        right
+
+    // Recursive descent. (Don't include the pivot values.)
+    _doSort(a, left, less - 2, compare);
+    _doSort(a, great + 2, right, compare);
+
+    if (pivots_are_equal) {
+      // All elements in the second partition are equal to the pivot. No
+      // need to sort them.
+      return;
+    }
+
+    // In theory it should be enough to call _doSort recursively on the second
+    // partition.
+    // The Android source however removes the pivot elements from the recursive
+    // call if the second partition is too large (more than 2/3 of the list).
+    if (less < index1 && great > index5) {
+      while (compare(a[less], pivot1) == 0) { less++; }
+      while (compare(a[great], pivot2) == 0) { great--; }
+
+      // Copy paste of the previous 3-way partitioning with adaptions.
+      //
+      // We partition the list into three parts:
+      //  1. == pivot1
+      //  2. > pivot1 && < pivot2
+      //  3. == pivot2
+      //
+      // During the loop we have:
+      // [ == pivot1 | > pivot1 && < pivot2 | unpartitioned  | == pivot2 ]
+      //              ^                      ^              ^
+      //            less                     k              great
+      //
+      // Invariants:
+      //   1. for x in [ *, less[ : x == pivot1
+      //   2. for x in [less, k[ : pivot1 < x && x < pivot2
+      //   3. for x in ]great, * ] : x == pivot2
+      for (int k = less; k <= great; k++) {
+        var ak = a[k];
+        int comp_pivot1 = compare(ak, pivot1);
+        if (comp_pivot1 == 0) {
+          if (k != less) {
+            a[k] = a[less];
+            a[less] = ak;
+          }
+          less++;
+        } else {
+          int comp_pivot2 = compare(ak, pivot2);
+          if (comp_pivot2 == 0) {
+            while (true) {
+              int comp = compare(a[great], pivot2);
+              if (comp == 0) {
+                great--;
+                if (great < k) break;
+                // This is the only location inside the loop where a new
+                // iteration is started.
+                continue;
+              } else {
+                // a[great] < pivot2.
+                comp = compare(a[great], pivot1);
+                if (comp < 0) {
+                  // Triple exchange.
+                  a[k] = a[less];
+                  a[less++] = a[great];
+                  a[great--] = ak;
+                } else {
+                  // a[great] == pivot1.
+                  a[k] = a[great];
+                  a[great--] = ak;
+                }
+                break;
+              }
+            }
+          }
+        }
+      }
+      // The second partition has now been cleared of pivot elements and looks
+      // as follows:
+      // [  *  |  > pivot1 && < pivot2  | * ]
+      //        ^                      ^
+      //       less                  great
+      // Sort the second partition using recursive descent.
+      _doSort(a, less, great, compare);
+    } else {
+      // The second partition looks as follows:
+      // [  *  |  >= pivot1 && <= pivot2  | * ]
+      //        ^                        ^
+      //       less                    great
+      // Simply sort it by recursive descent.
+      _doSort(a, less, great, compare);
+    }
+  }
+}