eliot/qt/tile_layout.cpp

173 lines
4.3 KiB
C++

/*****************************************************************************
* Eliot
* Copyright (C) 2010 Olivier Teulière
* Authors: Olivier Teulière <ipkiss @@ gmail.com>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
#include <cmath>
#include "tile_layout.h"
#include "tile_widget.h"
#include "qtcommon.h"
using namespace std;
INIT_LOGGER(qt, TileLayout);
TileLayout::TileLayout(int spacing, int nbRows, int nbCols)
: m_dynamicRow(nbRows == 0), m_dynamicCol(nbCols == 0),
m_nbCols(nbCols), m_nbRows(nbRows), m_space(spacing)
{
setContentsMargins(0, 0, 0, 0);
}
TileLayout::~TileLayout()
{
clear();
}
void TileLayout::clear()
{
QLayoutItem *item;
while ((item = takeAt(0)))
{
QtCommon::DestroyObject(item->widget());
delete item;
}
}
QRect TileLayout::getBoardRect() const
{
if (m_items.size() < m_nbCols + 2)
return QRect();
return m_items.at(m_nbCols + 1)->geometry().united(m_items.back()->geometry());
}
int TileLayout::getSquareSize() const
{
if (m_items.empty())
return 0;
return m_items.at(0)->geometry().width();
}
QLayoutItem *TileLayout::takeAt(int index)
{
if (index >= 0 && index < m_items.size())
return m_items.takeAt(index);
else
return 0;
}
QSize TileLayout::minimumSize() const
{
QSize size(m_space, m_space);
if (!m_items.empty())
size += m_items.at(0)->minimumSize();
return size * m_nbCols + QSize(5, 5);
}
void TileLayout::setGeometry(const QRect &rect)
{
QLayout::setGeometry(rect);
doLayout(rect);
}
void TileLayout::doLayout(const QRect &rect)
{
if (m_items.isEmpty())
return;
const int width = rect.width() + m_space;
const int height = rect.height() + m_space;
if (m_dynamicCol && m_dynamicRow)
{
// Dynamic number of columns. The square size is the biggest one
// allowing to place all the tiles in the given rect without scrolling.
// This determines the number of columns.
const int tilesCount = m_items.size();
int bestNbCols = 0;
int bestSquareSize = 0;
for (int nbCols = 1; nbCols <= tilesCount; ++nbCols)
{
const int nbRows = (tilesCount - 1) / nbCols + 1;
int squareSize = std::min(width / nbCols, height / nbRows);
if (squareSize >= bestSquareSize)
{
bestNbCols = nbCols;
bestSquareSize = squareSize;
}
else
{
// Maximum reached
break;
}
}
if (bestNbCols == 0)
{
m_nbCols = (int) sqrt(tilesCount);
m_nbRows = m_nbCols;
}
else
{
m_nbCols = bestNbCols;
m_nbRows = (tilesCount - 1) / m_nbCols + 1;
}
}
else if (m_dynamicCol)
{
m_nbCols = (m_items.size() - 1) / m_nbRows + 1;
}
else if (m_dynamicRow)
{
m_nbRows = (m_items.size() - 1) / m_nbCols + 1;
}
if (m_nbCols == 0)
return;
// Now the number of columns and rows are defined.
// Use that to draw the tiles.
const int squareSize = std::min(width / m_nbCols, height / m_nbRows) - m_space;
int x = 0;
int y = 0;
int nbInRow = 1;
QLayoutItem *item;
foreach (item, m_items)
{
QRect itemRect(QPoint(x, y), QSize(squareSize, squareSize));
item->setGeometry(itemRect);
x += squareSize + m_space;
++nbInRow;
if (nbInRow > m_nbCols)
{
x = 0;
y += squareSize + m_space;
nbInRow = 1;
}
}
}