QMdi::MinOverlapPlacer Class Reference

#include <qmdiarea_p.h>

Inheritance diagram for QMdi::MinOverlapPlacer:

Private Functions
QPoint	place (const QSize &size, const QList< QRect > &rects, const QRect &domain) const
	Places the rectangle defined by 'size' relative to 'rects' and 'domain' so that it overlaps 'rects' as little as possible and 'domain' as much as possible. More...

Static Private Functions
static int	accumulatedOverlap (const QRect &source, const QList< QRect > &rects)
	Calculates the accumulated overlap (intersection area) between 'source' and 'rects'. More...
static QPoint	findBestPlacement (const QRect &domain, const QList< QRect > &rects, QList< QRect > &source)
	Finds among the rectangles in 'source' the best placement. More...
static void	findMaxOverlappers (const QRect &domain, const QList< QRect > &source, QList< QRect > &result)
	Finds all rectangles in 'source' that overlaps 'domain' by the maximum overlap area between 'domain' and any rectangle in 'source'. More...
static QRect	findMinOverlapRect (const QList< QRect > &source, const QList< QRect > &rects)
	Finds among 'source' the rectangle with the minimum accumulated overlap with the rectangles in 'rects'. More...
static void	findNonInsiders (const QRect &domain, QList< QRect > &source, QList< QRect > &result)
	Finds all rectangles in 'source' not completely inside 'domain'. More...
static void	getCandidatePlacements (const QSize &size, const QList< QRect > &rects, const QRect &domain, QList< QRect > &candidates)
	Gets candidates for the final placement. More...

Additional Inherited Members
Public Functions inherited from QMdi::Placer
virtual	~Placer ()

Detailed Description

Definition at line 123 of file qmdiarea_p.h.

Functions

accumulatedOverlap()

int MinOverlapPlacer::accumulatedOverlap ( const QRect &  source, const QList< QRect > &  rects  )

staticprivate

Calculates the accumulated overlap (intersection area) between 'source' and 'rects'.

Warning

This function is not part of the public interface.

Definition at line 434 of file qmdiarea.cpp.

{
    int accOverlap = 0;
    foreach (const QRect &rect, rects) {
        QRect intersection = source.intersected(rect);
        accOverlap += intersection.width() * intersection.height();
    }
    return accOverlap;
}

findBestPlacement()

QPoint MinOverlapPlacer::findBestPlacement ( const QRect &  domain, const QList< QRect > &  rects, QList< QRect > &  source  )

staticprivate

Finds among the rectangles in 'source' the best placement.

Warning

This function is not part of the public interface. Here, 'best' means the placement that overlaps the rectangles in 'rects' as little as possible while at the same time being as much as possible inside 'domain'.

Definition at line 553 of file qmdiarea.cpp.

{
    QList<QRect> nonInsiders;
    findNonInsiders(domain, source, nonInsiders);

    if (!source.empty())
        return findMinOverlapRect(source, rects).topLeft();

    QList<QRect> maxOverlappers;
    findMaxOverlappers(domain, nonInsiders, maxOverlappers);
    return findMinOverlapRect(maxOverlappers, rects).topLeft();
}

findMaxOverlappers()

void MinOverlapPlacer::findMaxOverlappers ( const QRect &  domain, const QList< QRect > &  source, QList< QRect > &  result  )

staticprivate

Finds all rectangles in 'source' that overlaps 'domain' by the maximum overlap area between 'domain' and any rectangle in 'source'.

Warning

This function is not part of the public interface. The result is stored in 'result'.

Definition at line 527 of file qmdiarea.cpp.

{
    int maxOverlap = -1;
    foreach (const QRect &srcRect, source) {
        QRect intersection = domain.intersected(srcRect);
        const int overlap = intersection.width() * intersection.height();
        if (overlap >= maxOverlap || maxOverlap == -1) {
            if (overlap > maxOverlap) {
                maxOverlap = overlap;
                result.clear();
            }
            result << srcRect;
        }
    }
}

findMinOverlapRect()

QRect MinOverlapPlacer::findMinOverlapRect ( const QList< QRect > &  source, const QList< QRect > &  rects  )

staticprivate

Finds among 'source' the rectangle with the minimum accumulated overlap with the rectangles in 'rects'.

Warning

This function is not part of the public interface.

Definition at line 453 of file qmdiarea.cpp.

{
    int minAccOverlap = -1;
    QRect minAccOverlapRect;
    foreach (const QRect &srcRect, source) {
        const int accOverlap = accumulatedOverlap(srcRect, rects);
        if (accOverlap < minAccOverlap || minAccOverlap == -1) {
            minAccOverlap = accOverlap;
            minAccOverlapRect = srcRect;
        }
    }
    return minAccOverlapRect;
}

findNonInsiders()

void MinOverlapPlacer::findNonInsiders ( const QRect &  domain, QList< QRect > &  source, QList< QRect > &  result  )

staticprivate

Finds all rectangles in 'source' not completely inside 'domain'.

Warning

This function is not part of the public interface. The result is stored in 'result' and also removed from 'source'.

Definition at line 506 of file qmdiarea.cpp.

{
    QMutableListIterator<QRect> it(source);
    while (it.hasNext()) {
        const QRect srcRect = it.next();
        if (!domain.contains(srcRect)) {
            result << srcRect;
            it.remove();
        }
    }
}

getCandidatePlacements()

void MinOverlapPlacer::getCandidatePlacements ( const QSize &  size, const QList< QRect > &  rects, const QRect &  domain, QList< QRect > &  candidates  )

staticprivate

Gets candidates for the final placement.

Warning

This function is not part of the public interface.

Definition at line 474 of file qmdiarea.cpp.

{
    QSet<int> xset;
    QSet<int> yset;
    xset << domain.left() << domain.right() - size.width() + 1;
    yset << domain.top();
    if (domain.bottom() - size.height() + 1 >= 0)
        yset << domain.bottom() - size.height() + 1;
    foreach (const QRect &rect, rects) {
        xset << rect.right() + 1;
        yset << rect.bottom() + 1;
    }

    QList<int> xlist = xset.values();
    qSort(xlist.begin(), xlist.end());
    QList<int> ylist = yset.values();
    qSort(ylist.begin(), ylist.end());

    foreach (int y, ylist)
        foreach (int x, xlist)
            candidates << QRect(QPoint(x, y), size);
}

place()

QPoint MinOverlapPlacer::place ( const QSize &  size, const QList< QRect > &  rects, const QRect &  domain  ) const

privatevirtual

Places the rectangle defined by 'size' relative to 'rects' and 'domain' so that it overlaps 'rects' as little as possible and 'domain' as much as possible.

Warning

This function is not part of the public interface.

Returns the position of the resulting rectangle.

Implements QMdi::Placer.

Definition at line 577 of file qmdiarea.cpp.

{
    if (size.isEmpty() || !domain.isValid())
        return QPoint();
    foreach (const QRect &rect, rects) {
        if (!rect.isValid())
            return QPoint();
    }

    QList<QRect> candidates;
    getCandidatePlacements(size, rects, domain, candidates);
    return findBestPlacement(domain, rects, candidates);
}

---

The documentation for this class was generated from the following files:

• /src/gui/widgets/qmdiarea_p.h
• /src/gui/widgets/qmdiarea.cpp