const TileStampVariation &TileStamp::randomVariation() const
{
Q_ASSERT(!d->variations.isEmpty());
RandomPicker<const TileStampVariation *> randomPicker;
for (const TileStampVariation &variation : qAsConst(d->variations))
randomPicker.add(&variation, variation.probability);
return *randomPicker.pick();
}
Map *TileStamp::randomVariation() const
{
if (d->variations.isEmpty())
return 0;
RandomPicker<const TileStampVariation *> randomPicker;
for (const TileStampVariation &variation : d->variations)
randomPicker.add(&variation, variation.probability);
return randomPicker.pick()->map;
}
Cell WangFiller::findFittingCell(const TileLayer &back,
const TileLayer &front,
const QRegion &fillRegion,
QPoint point) const
{
Q_ASSERT(mWangSet);
QList<WangTile> wangTilesList = mWangSet->findMatchingWangTiles(wangIdFromSurroundings(back,
front,
fillRegion,
point));
RandomPicker<WangTile> wangTiles;
for (const WangTile &wangTile : wangTilesList)
wangTiles.add(wangTile, mWangSet->wangTileProbability(wangTile));
WangTile wangTile;
if (!mWangSet->isComplete()) {
// goes through all adjacent, empty tiles and sees if the current wangTile
// allows them to have at least one fill option.
while (!wangTiles.isEmpty()) {
wangTile = wangTiles.take();
bool continueFlag = false;
QPoint adjacentPoints[8];
getSurroundingPoints(point, mStaggeredRenderer, mStaggerAxis, adjacentPoints);
// now goes through and checks adjacents, continuing if any can't be filled
for (int i = 0; i < 8; ++i) {
QPoint adjacentPoint = adjacentPoints[i];
// check if the point is empty, otherwise, continue.
if (!getCell(back, front, fillRegion, adjacentPoint).isEmpty())
continue;
WangId adjacentWangId = wangIdFromSurroundings(back,
front,
fillRegion,
adjacentPoint);
WangId wangId = wangTile.wangId();
adjacentWangId.updateToAdjacent(wangId, (i + 4) % 8);
if (!mWangSet->wildWangIdIsUsed(adjacentWangId)) {
continueFlag = true;
break;
}
}
if (!continueFlag)
break;
}
} else if (!wangTiles.isEmpty()) {
wangTile = wangTiles.pick();
}
return wangTile.makeCell();
}
std::unique_ptr<TileLayer> WangFiller::fillRegion(const TileLayer &back,
const QRegion &fillRegion) const
{
Q_ASSERT(mWangSet);
const QRect boundingRect = fillRegion.boundingRect();
std::unique_ptr<TileLayer> tileLayer { new TileLayer(QString(),
boundingRect.x(),
boundingRect.y(),
boundingRect.width(),
boundingRect.height()) };
QVector<WangId> wangIds(tileLayer->width() * tileLayer->height(), 0);
#if QT_VERSION < 0x050800
const auto rects = fillRegion.rects();
for (const QRect &rect : rects) {
#else
for (const QRect &rect : fillRegion) {
#endif
for (int x = rect.left(); x <= rect.right(); ++x) {
int index = x - tileLayer->x() + (rect.top() - tileLayer->y()) * tileLayer->width();
wangIds[index] = wangIdFromSurroundings(back,
fillRegion,
QPoint(x, rect.top()));
index = x - tileLayer->x() + (rect.bottom() - tileLayer->y()) * tileLayer->width();
wangIds[index] = wangIdFromSurroundings(back,
fillRegion,
QPoint(x, rect.bottom()));
}
for (int y = rect.top() + 1; y < rect.bottom(); ++y) {
int index = rect.left() - tileLayer->x() + (y - tileLayer->y()) * tileLayer->width();
wangIds[index] = wangIdFromSurroundings(back,
fillRegion,
QPoint(rect.left(), y));
index = rect.right() - tileLayer->x() + (y - tileLayer->y()) * tileLayer->width();
wangIds[index] = wangIdFromSurroundings(back,
fillRegion,
QPoint(rect.right(), y));
}
}
#if QT_VERSION < 0x050800
for (const QRect &rect : rects) {
#else
for (const QRect &rect : fillRegion) {
#endif
for (int y = rect.top(); y <= rect.bottom(); ++y) {
for (int x = rect.left(); x <= rect.right(); ++x) {
QPoint currentPoint(x, y);
int currentIndex = (currentPoint.y() - tileLayer->y()) * tileLayer->width() + (currentPoint.x() - tileLayer->x());
QList<WangTile> wangTilesList = mWangSet->findMatchingWangTiles(wangIds[currentIndex]);
RandomPicker<WangTile> wangTiles;
for (const WangTile &wangTile : wangTilesList)
wangTiles.add(wangTile, mWangSet->wangTileProbability(wangTile));
while (!wangTiles.isEmpty()) {
WangTile wangTile = wangTiles.take();
bool fill = true;
if (!mWangSet->isComplete()) {
QPoint adjacentPoints[8];
getSurroundingPoints(currentPoint, mStaggeredRenderer, mStaggerAxis, adjacentPoints);
for (int i = 0; i < 8; ++i) {
QPoint p = adjacentPoints[i];
if (!fillRegion.contains(p) || !tileLayer->cellAt(p - tileLayer->position()).isEmpty())
continue;
p -= tileLayer->position();
int index = p.y() * tileLayer->width() + p.x();
WangId adjacentWangId = wangIds[index];
adjacentWangId.updateToAdjacent(wangTile.wangId(), (i + 4) % 8);
if (!mWangSet->wildWangIdIsUsed(adjacentWangId)) {
fill = wangTiles.isEmpty();
break;
}
}
}
if (fill) {
tileLayer->setCell(currentPoint.x() - tileLayer->x(),
currentPoint.y() - tileLayer->y(),
wangTile.makeCell());
QPoint adjacentPoints[8];
getSurroundingPoints(currentPoint, mStaggeredRenderer, mStaggerAxis, adjacentPoints);
for (int i = 0; i < 8; ++i) {
QPoint p = adjacentPoints[i];
if (!fillRegion.contains(p) || !tileLayer->cellAt(p - tileLayer->position()).isEmpty())
continue;
p -= tileLayer->position();
int index = p.y() * tileLayer->width() + p.x();
wangIds[index].updateToAdjacent(wangTile.wangId(), (i + 4) % 8);
}
break;
}
}
}
}
}
return tileLayer;
}
const Cell &WangFiller::getCell(const TileLayer &back,
const TileLayer &front,
const QRegion &fillRegion,
QPoint point) const
{
if (!fillRegion.contains(point))
return back.cellAt(point);
else
return front.cellAt(point.x() - front.x(), point.y() - front.y());
}
WangId WangFiller::wangIdFromSurroundings(const TileLayer &back,
const TileLayer &front,
const QRegion &fillRegion,
QPoint point) const
{
Cell surroundingCells[8];
QPoint adjacentPoints[8];
getSurroundingPoints(point, mStaggeredRenderer, mStaggerAxis, adjacentPoints);
for (int i = 0; i < 8; ++i)
surroundingCells[i] = getCell(back, front, fillRegion, adjacentPoints[i]);
return mWangSet->wangIdFromSurrounding(surroundingCells);
}
WangId WangFiller::wangIdFromSurroundings(const TileLayer &back,
const QRegion &fillRegion,
QPoint point) const
{
Cell surroundingCells[8];
QPoint adjacentPoints[8];
getSurroundingPoints(point, mStaggeredRenderer, mStaggerAxis, adjacentPoints);
for (int i = 0; i < 8; ++i) {
if (!fillRegion.contains(adjacentPoints[i]))
surroundingCells[i] = back.cellAt(adjacentPoints[i]);
}
return mWangSet->wangIdFromSurrounding(surroundingCells);
}
