Skip to content
Permalink
master
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Go to file
 
 
Cannot retrieve contributors at this time
module.exports = {
arrange: function ( data, parameters ) {
var defaultParam = {
maxExec: 2000,
stackHeight: 240,
symmetrical: false
};
var param = Object.assign({}, defaultParam, parameters);
function cellsEmpty( x, y, r ) {
var empty = true;
if ( param.symmetrical ) {
y = centroidY( y, r );
}
for ( var col = x; col < x + r; col++ ) {
for (var row = y; row < y + r; row++ ) {
if ( ! grid[ col ] ) {
grid[ col ] = [];
}
if ( grid[ col ][ row ] ) {
empty = false;
break;
}
}
if ( ! empty ) {
break;
}
}
return empty;
}
function centroidY( y, r ) {
var shift = Math.ceil( y / 2 );
if ( y % 2 ) {
return param.stackHeight / 2 + shift;
} else {
return param.stackHeight / 2 - shift + r;
}
}
function occupyCells( x, y, r ) {
for ( var i = x; i <= x + r; i++ ) {
if ( ! minY[ i ] || minY[ i ] < y ) {
minY[ i ] = y;
}
}
if ( param.symmetrical ) {
y = centroidY( y, r );
}
for ( var col = x; col < x + r; col++ ) {
for ( var row = y; row < y + r; row++ ) {
if ( ! grid[ col ] ) {
grid[ col ] = [];
}
grid[ col ][ row ] = true;
}
}
}
function findMinimalY( xMin, xMax, r ) {
var y = param.stackHeight;
var x = xMin;
var count = 0;
for( var i = xMin; i <= xMax; i++) {
if ( ! minY[ i ] ) {
if ( count >= r ) {
y = 0;
break;
} else {
count++;
}
} else if ( minY[ i ] < y ) {
y = minY[ i ];
x = i;
}
}
if ( y == param.stackHeight ) {
y = 0;
}
return {x: x, y: y};
}
function findOptimalPos( x, y, r, xMin, xMax, stack, item ) {
if ( ! stack ) {
stack = 0;
}
stack++;
if ( cellsEmpty( x, y, r ) || stack >= param.maxExec) {
occupyCells( x, y, r);
if ( param.symmetrical ) {
y = centroidY( y, r );
}
return [ x, y ];
}
if ( x < xMax ) {
return findOptimalPos( x + 1, y, r, xMin, xMax, stack, item );
} else {
return findOptimalPos( xMin, y + 1, r, xMin, xMax, stack, item );
}
}
var grid = [];
var minY = [];
for ( var i = 0; i < data.length; i++ ) {
var x = Math.floor( data[ i ].xMin );
var xMax = Math.ceil( data[ i ].xMax );
var r = Math.ceil( data[ i ].r );
var minYpos = findMinimalY( x, xMax, r );
x = minYpos.x;
var y = minYpos.y;
if ( x ) {
var position = findOptimalPos( x, y, r * 2, x, xMax, 0, data[i] );
data[ i ].x = position[ 0 ];
data[ i ].y = position[ 1 ];
}
}
return data;
}
}