tiebreaker.js
function (seedAry, match) {
  var res = $.replicate(seedAry.length, []);
  seedAry.forEach(function (xps, x) {
    // NB: while we are not writing 1-1 from seedAry to res, we are always
    // making sure not to overwrite what we had in previous iterations
    if (xps.indexOf(match.p[0]) < 0) {
      res[x] = res[x].concat(xps);
      return;
    }
    // always tieCompute match because only strict mode has guaranteed non-ties
    var sorted = $.zip(match.p, match.m).sort(Base.compareZip);
    Base.matchTieCompute(sorted, 0, function (p, pos) {
      res[x+pos-1].push(p);
    });
  });
  return res;
}
function (seedAry, match) {
  var res = $.replicate(seedAry.length, []);
  seedAry.forEach(function (xps, x) {
    // NB: while we are not writing 1-1 from seedAry to res, we are always
    // making sure not to overwrite what we had in previous iterations
    if (xps.indexOf(match.p[0]) < 0) {
      res[x] = res[x].concat(xps);
      return;
    }
    // always tieCompute match because only strict mode has guaranteed non-ties
    var sorted = $.zip(match.p, match.m).sort(Base.compareZip);
    Base.matchTieCompute(sorted, 0, function (p, pos) {
      res[x+pos-1].push(p);
    });
  });
  return res;
}
function ( seedAry , match ) { var res = $ . replicate ( seedAry . length , [ ] ) ; seedAry . forEach ( function ( xps , x ) { // NB: while we are not writing 1-1 from seedAry to res, we are always // making sure not to overwrite what we had in previous iterations if ( xps . indexOf ( match . p [ 0 ] ) < 0 ) { res [ x ] = res [ x ] . concat ( xps ) ; return ; } // always tieCompute match because only strict mode has guaranteed non-ties var sorted = $ . zip ( match . p , match . m ) . sort ( Base . compareZip ) ; Base . matchTieCompute ( sorted , 0 , function ( p , pos ) { res [ x + pos - 1 ] . push ( p ) ; } ) ; } ) ; return res ; }
split up the posAry entried cluster found in corresponding within section breakers
split up the posAry entried cluster found in corresponding within section breakers