function calcToRemove(a, b)
{
	var subLengths = 0;
	for (var i = 0; i < a.table.length; i++)
	{
		subLengths += a.table[i].table.length;
	}
	for (var i = 0; i < b.table.length; i++)
	{
		subLengths += b.table[i].table.length;
	}

	var toRemove = a.table.length + b.table.length;
	return toRemove - (Math.floor((subLengths - 1) / M) + 1);
}
// Returns the extra search steps for E. Refer to the paper.
Returns the extra search steps for E. Refer to the paper.
Returns the extra search steps for E . Refer to the paper .
function calcToRemove(a, b)
{
	var subLengths = 0;
	for (var i = 0; i < a.table.length; i++)
	{
		subLengths += a.table[i].table.length;
	}
	for (var i = 0; i < b.table.length; i++)
	{
		subLengths += b.table[i].table.length;
	}
	var toRemove = a.table.length + b.table.length;
	return toRemove - (Math.floor((subLengths - 1) / M) + 1);
}
function calcToRemove ( a , b ) { var subLengths = 0 ; for ( var i = 0 ; i < a . table . length ; i ++ ) { subLengths += a . table [ i ] . table . length ; } for ( var i = 0 ; i < b . table . length ; i ++ ) { subLengths += b . table [ i ] . table . length ; } var toRemove = a . table . length + b . table . length ; return toRemove - ( Math . floor ( ( subLengths - 1 ) / M ) + 1 ) ; }
Returns the extra search steps for E. Refer to the paper.
Returns the extra search steps for E . Refer to the paper .