index.js
function (node, m, M) {

        var compareMinX = node.leaf ? this.compareMinX : compareNodeMinX,
            compareMinY = node.leaf ? this.compareMinY : compareNodeMinY,
            xMargin = this._allDistMargin(node, m, M, compareMinX),
            yMargin = this._allDistMargin(node, m, M, compareMinY);

        // if total distributions margin value is minimal for x, sort by minX,
        // otherwise it's already sorted by minY
        if (xMargin < yMargin) node.children.sort(compareMinX);
    }
function (node, m, M) {

        var compareMinX = node.leaf ? this.compareMinX : compareNodeMinX,
            compareMinY = node.leaf ? this.compareMinY : compareNodeMinY,
            xMargin = this._allDistMargin(node, m, M, compareMinX),
            yMargin = this._allDistMargin(node, m, M, compareMinY);

        // if total distributions margin value is minimal for x, sort by minX,
        // otherwise it's already sorted by minY
        if (xMargin < yMargin) node.children.sort(compareMinX);
    }
function ( node , m , M ) { var compareMinX = node . leaf ? this . compareMinX : compareNodeMinX , compareMinY = node . leaf ? this . compareMinY : compareNodeMinY , xMargin = this . _allDistMargin ( node , m , M , compareMinX ) , yMargin = this . _allDistMargin ( node , m , M , compareMinY ) ; // if total distributions margin value is minimal for x, sort by minX, // otherwise it's already sorted by minY if ( xMargin < yMargin ) node . children . sort ( compareMinX ) ; }
sorts node children by the best axis for split
sorts node children by the best axis for split