treemap.cpp Source File

kcachegrind

 /* This file is part of KCachegrind.
    Copyright (C) 2002, 2003 Josef Weidendorfer <Josef.Weidendorfer@gmx.de>
 
    KCachegrind 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, version 2.
 
    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; see the file COPYING.  If not, write to
    the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
    Boston, MA 02110-1301, USA.
 */
 
 /*
  * A Widget for visualizing hierarchical metrics as areas.
  * The API is similar to QListView.
  */
 
 #include "treemap.h"
 
 #include <math.h>
 #include <QAction>
 #include <QMenu>
 #include <QApplication>
 #include <QDebug>
 #include <QPainter>
 #include <QStyle>
 #include <QPixmap>
 #include <QPaintEvent>
 #include <QKeyEvent>
 #include <QShowEvent>
 #include <QContextMenuEvent>
 #include <QMouseEvent>
 #include <QToolTip>
 #include <QStylePainter>
 #include <QStyleOptionFocusRect>
 
 
 // set this to 1 to enable debug output
 #define DEBUG_DRAWING 0
 #define MAX_FIELD 12
 
 
 //
 // StoredDrawParams
 //
 StoredDrawParams::StoredDrawParams()
 {
   _selected = false;
   _current = false;
   _shaded = true;
   _rotated = false;
   _drawFrame = true;
 
   _backColor = Qt::white;
 
   // field array has size 0
 }
 
 StoredDrawParams::StoredDrawParams(const QColor& c,
                                    bool selected, bool current)
 {
   _backColor = c;
 
   _selected = selected;
   _current = current;
   _shaded = true;
   _rotated = false;
   _drawFrame = true;
 
   // field array has size 0
 }
 
 QString StoredDrawParams::text(int f) const
 {
   if ((f<0) || (f >= (int)_field.size()))
     return QString();
 
   return _field[f].text;
 }
 
 QPixmap StoredDrawParams::pixmap(int f) const
 {
   if ((f<0) || (f >= (int)_field.size()))
     return QPixmap();
 
   return _field[f].pix;
 }
 
 DrawParams::Position StoredDrawParams::position(int f) const
 {
   if ((f<0) || (f >= (int)_field.size()))
     return Default;
 
   return _field[f].pos;
 }
 
 int StoredDrawParams::maxLines(int f) const
 {
   if ((f<0) || (f >= (int)_field.size()))
     return 0;
 
   return _field[f].maxLines;
 }
 
 const QFont& StoredDrawParams::font() const
 {
   static QFont* f = 0;
   if (!f) f = new QFont(QApplication::font());
 
   return *f;
 }
 
 void StoredDrawParams::ensureField(int f)
 {
   if (f<0 || f>=MAX_FIELD) return;
 
   if ((int)_field.size() < f+1) {
     int oldSize = _field.size();
     _field.resize(f+1);
     while(oldSize < f+1) {
       _field[oldSize].pos = Default;
       _field[oldSize].maxLines = 0;
       oldSize++;
     }
   }
 }
 
 
 void StoredDrawParams::setField(int f, const QString& t, const QPixmap& pm,
                            Position p, int maxLines)
 {
   if (f<0 || f>=MAX_FIELD) return;
   ensureField(f);
 
   _field[f].text = t;
   _field[f].pix  = pm;
   _field[f].pos  = p;
   _field[f].maxLines = maxLines;
 }
 
 void StoredDrawParams::setText(int f, const QString& t)
 {
   if (f<0 || f>=MAX_FIELD) return;
   ensureField(f);
 
   _field[f].text = t;
 }
 
 void StoredDrawParams::setPixmap(int f, const QPixmap& pm)
 {
   if (f<0 || f>=MAX_FIELD) return;
   ensureField(f);
 
   _field[f].pix = pm;
 }
 
 void StoredDrawParams::setPosition(int f, Position p)
 {
   if (f<0 || f>=MAX_FIELD) return;
   ensureField(f);
 
   _field[f].pos = p;
 }
 
 void StoredDrawParams::setMaxLines(int f, int m)
 {
   if (f<0 || f>=MAX_FIELD) return;
   ensureField(f);
 
   _field[f].maxLines = m;
 }
 
 
 
 //
 // RectDrawing
 //
 
 RectDrawing::RectDrawing(const QRect& r)
 {
   _fm = 0;
   _dp = 0;
   setRect(r);
 }
 
 
 RectDrawing::~RectDrawing()
 {
   delete _fm;
   delete _dp;
 }
 
 DrawParams* RectDrawing::drawParams()
 {
   if (!_dp)
     _dp = new StoredDrawParams();
 
   return _dp;
 }
 
 
 void RectDrawing::setDrawParams(DrawParams* dp)
 {
   delete _dp;
   _dp = dp;
 }
 
 void RectDrawing::setRect(const QRect& r)
 {
   _rect = r;
 
   _usedTopLeft = 0;
   _usedTopCenter = 0;
   _usedTopRight = 0;
   _usedBottomLeft = 0;
   _usedBottomCenter = 0;
   _usedBottomRight = 0;
 
   _fontHeight = 0;
 }
 
 QRect RectDrawing::remainingRect(DrawParams* dp)
 {
   if (!dp) dp = drawParams();
 
   if ((_usedTopLeft >0) ||
       (_usedTopCenter >0) ||
       (_usedTopRight >0)) {
     if (dp->rotated())
       _rect.setLeft(_rect.left() + _fontHeight);
     else
       _rect.setTop(_rect.top() + _fontHeight);
   }
 
   if ((_usedBottomLeft >0) ||
       (_usedBottomCenter >0) ||
       (_usedBottomRight >0)) {
     if (dp->rotated())
       _rect.setRight(_rect.right() - _fontHeight);
     else
       _rect.setBottom(_rect.bottom() - _fontHeight);
   }
   return _rect;
 }
 
 
 void RectDrawing::drawBack(QPainter* p, DrawParams* dp)
 {
   if (!dp) dp = drawParams();
   if (_rect.width()<=0 || _rect.height()<=0) return;
 
   QRect r = _rect;
   QColor normal = dp->backColor();
   if (dp->selected()) normal = normal.light();
   bool isCurrent = dp->current();
 
   if (dp->drawFrame() || isCurrent) {
     // 3D raised/sunken frame effect...
     QColor high = normal.light();
     QColor low = normal.dark();
     p->setPen( isCurrent ? low:high);
     p->drawLine(r.left(), r.top(), r.right(), r.top());
     p->drawLine(r.left(), r.top(), r.left(), r.bottom());
     p->setPen( isCurrent ? high:low);
     p->drawLine(r.right(), r.top(), r.right(), r.bottom());
     p->drawLine(r.left(), r.bottom(), r.right(), r.bottom());
     r.setRect(r.x()+1, r.y()+1, r.width()-2, r.height()-2);
   }
   if (r.width()<=0 || r.height()<=0) return;
 
   if (dp->shaded() && (r.width()>0 && r.height()>0)) {
     // adjustment for drawRect semantic in Qt4: decrement height/width
     r.setRect(r.x(), r.y(), r.width()-1, r.height()-1);
 
     // some shading
     bool goDark = qGray(normal.rgb())>128;
     int rBase, gBase, bBase;
     normal.getRgb(&rBase, &gBase, &bBase);
     p->setBrush(Qt::NoBrush);
 
     // shade parameters:
     int d = 7;
     float factor = 0.1, forth=0.7, back1 =0.9, toBack2 = .7, back2 = 0.97;
 
     // coefficient corrections because of rectangle size
     int s = r.width();
     if (s > r.height()) s = r.height();
     if (s<100) {
       forth -= .3  * (100-s)/100;
       back1 -= .2  * (100-s)/100;
       back2 -= .02 * (100-s)/100;
     }
 
 
     // maximal color difference
     int rDiff = goDark ? -rBase/d : (255-rBase)/d;
     int gDiff = goDark ? -gBase/d : (255-gBase)/d;
     int bDiff = goDark ? -bBase/d : (255-bBase)/d;
 
     QColor shadeColor;
     while (factor<.95 && (r.width()>=0 && r.height()>=0)) {
       shadeColor.setRgb((int)(rBase+factor*rDiff+.5),
                         (int)(gBase+factor*gDiff+.5),
                         (int)(bBase+factor*bDiff+.5));
       p->setPen(shadeColor);
       p->drawRect(r);
       r.setRect(r.x()+1, r.y()+1, r.width()-2, r.height()-2);
       factor = 1.0 - ((1.0 - factor) * forth);
     }
 
     // and back (1st half)
     while (factor>toBack2 && (r.width()>=0 && r.height()>=0)) {
       shadeColor.setRgb((int)(rBase+factor*rDiff+.5),
                         (int)(gBase+factor*gDiff+.5),
                         (int)(bBase+factor*bDiff+.5));
       p->setPen(shadeColor);
       p->drawRect(r);
       r.setRect(r.x()+1, r.y()+1, r.width()-2, r.height()-2);
       factor = 1.0 - ((1.0 - factor) / back1);
     }
 
     // and back (2nd half)
     while (factor>.01 && (r.width()>=0 && r.height()>=0)) {
       shadeColor.setRgb((int)(rBase+factor*rDiff+.5),
                         (int)(gBase+factor*gDiff+.5),
                         (int)(bBase+factor*bDiff+.5));
       p->setPen(shadeColor);
       p->drawRect(r);
       r.setRect(r.x()+1, r.y()+1, r.width()-2, r.height()-2);
       factor = factor * back2;
     }
 
     normal = shadeColor;
     // for filling, width and height has to be incremented again
     r.setRect(r.x(), r.y(), r.width()+1, r.height()+1);
   }
 
   // fill inside
   p->fillRect(r, normal);
 }
 
 
 /* Helper for drawField
  * Find a line break position in a string, given a font and maximum width
  *
  * Returns the actually used width, and sets <breakPos>
  */
 static
 int findBreak(int& breakPos, QString text, QFontMetrics* fm, int maxWidth)
 {
     int usedWidth;
 
     // does full text fit?
     breakPos = text.length();
     usedWidth = fm->width(text);
     if (usedWidth < maxWidth)
         return usedWidth;
 
     // binary search for best break position in [bottomPos,breakPos].
     // We want the result of the binary search to be a bit too large
     int bottomPos = 0;
     while(1) {
         int halfPos = (bottomPos + breakPos)/2;
         int halfWidth = fm->width(text, halfPos);
         if (halfWidth < maxWidth) {
             bottomPos = halfPos+1;
             continue;
         }
         breakPos = halfPos;
         usedWidth = halfWidth;
         if (breakPos - bottomPos <3) break;
     }
 
     // final position by taking break boundaries into account.
     // possible break boundaries are changing char categories,
     // but not middle of "Aa"
     QChar::Category lastCat, cat;
     int pos = breakPos;
     lastCat = text[pos-1].category();
     // at minimum 2 chars before break
     while (pos > 2) {
         pos--;
         cat = text[pos-1].category();
         if (cat == lastCat) continue;
 
         // "Aa" has not a possible break inbetween
         if ((cat == QChar::Letter_Uppercase) &&
                 (lastCat == QChar::Letter_Lowercase)) {
             lastCat = cat;
             continue;
         }
         lastCat = cat;
 
         breakPos = pos;
         usedWidth = fm->width(text, breakPos);
         if (usedWidth < maxWidth) break;
     }
     return usedWidth;
 }
 
 
 /* Helper for drawField
  * Find last line break position in a string from backwards,
  * given a font and maximum width
  *
  * Returns the actually used width, and sets <breakPos>
  */
 static
 int findBreakBackwards(int& breakPos, QString text, QFontMetrics* fm, int maxWidth)
 {
     int usedWidth;
 
     // does full text fit?
     breakPos = 0;
     usedWidth = fm->width(text);
     if (usedWidth < maxWidth)
         return usedWidth;
 
     // binary search for best break position in [breakPos,topPos].
     // We want the result of the binary search to be a bit too small
     int topPos = text.length();
     while(1) {
         int halfPos = (breakPos + topPos)/2;
         int halfWidth = fm->width(text.mid(halfPos));
         if (halfWidth > maxWidth) {
             topPos = halfPos-1;
             continue;
         }
         breakPos = halfPos;
         usedWidth = halfWidth;
         if (topPos - breakPos <3) break;
     }
 
     // final position by taking break boundaries into account.
     // possible break boundaries are changing char categories but not middle of "Aa"
     QChar::Category lastCat, cat;
     int pos = breakPos;
     lastCat = text[pos].category();
     // at minimum 2 chars before break
     while (pos < text.length()-2) {
         pos++;
         cat = text[pos].category();
         if (cat == lastCat) continue;
 
         // "Aa" has not a possible break inbetween
         if ((lastCat == QChar::Letter_Uppercase) &&
                 (cat == QChar::Letter_Lowercase)) {
             lastCat = cat;
             continue;
         }
         lastCat = cat;
 
         breakPos = pos;
         usedWidth = fm->width(text.mid(breakPos));
         if (usedWidth < maxWidth) break;
     }
     return usedWidth;
 }
 
 
 
 bool RectDrawing::drawField(QPainter* p, int f, DrawParams* dp)
 {
   if (!dp) dp = drawParams();
 
   if (!_fm) {
     _fm = new QFontMetrics(dp->font());
     _fontHeight = _fm->height();
   }
 
   QRect r = _rect;
 
   if (0) qDebug() << "DrawField: Rect " << r.x() << "/" << r.y()
                << " - " << r.width() << "x" << r.height();
 
   int h = _fontHeight;
   bool rotate = dp->rotated();
   int width   = (rotate ? r.height() : r.width()) -4;
   int height  = (rotate ? r.width() : r.height());
   int lines   = height / h;
 
   // stop if there is no space available
   if (lines<1) return false;
 
   // calculate free space in first line (<unused>)
   int pos = dp->position(f);
   if (pos == DrawParams::Default) {
     switch(f%4) {
     case 0: pos = DrawParams::TopLeft; break;
     case 1: pos = DrawParams::TopRight; break;
     case 2: pos = DrawParams::BottomRight; break;
     case 3: pos = DrawParams::BottomLeft; break;
     }
   }
 
   int unused = 0;
   bool isBottom = false;
   bool isCenter = false;
   bool isRight = false;
   int* used = 0;
   switch(pos) {
   case DrawParams::TopLeft:
     used = &_usedTopLeft;
     if (_usedTopLeft == 0) {
       if (_usedTopCenter)
         unused = (width - _usedTopCenter)/2;
       else
         unused = width - _usedTopRight;
     }
     break;
 
   case DrawParams::TopCenter:
     isCenter = true;
     used = &_usedTopCenter;
     if (_usedTopCenter == 0) {
       if (_usedTopLeft > _usedTopRight)
         unused = width - 2 * _usedTopLeft;
       else
         unused = width - 2 * _usedTopRight;
     }
     break;
 
   case DrawParams::TopRight:
     isRight = true;
     used = &_usedTopRight;
     if (_usedTopRight == 0) {
       if (_usedTopCenter)
         unused = (width - _usedTopCenter)/2;
       else
         unused = width - _usedTopLeft;
     }
     break;
 
   case DrawParams::BottomLeft:
     isBottom = true;
     used = &_usedBottomLeft;
     if (_usedBottomLeft == 0) {
       if (_usedBottomCenter)
         unused = (width - _usedBottomCenter)/2;
       else
         unused = width - _usedBottomRight;
     }
     break;
 
   case DrawParams::BottomCenter:
     isCenter = true;
     isBottom = true;
     used = &_usedBottomCenter;
     if (_usedBottomCenter == 0) {
       if (_usedBottomLeft > _usedBottomRight)
         unused = width - 2 * _usedBottomLeft;
       else
         unused = width - 2 * _usedBottomRight;
     }
     break;
 
   case DrawParams::BottomRight:
     isRight = true;
     isBottom = true;
     used = &_usedBottomRight;
     if (_usedBottomRight == 0) {
       if (_usedBottomCenter)
         unused = (width - _usedBottomCenter)/2;
       else
         unused = width - _usedBottomLeft;
     }
     break;
   }
 
   if (isBottom) {
     if ((_usedTopLeft >0) ||
         (_usedTopCenter >0) ||
         (_usedTopRight >0))
       lines--;
   }
   else if (!isBottom) {
     if ((_usedBottomLeft >0) ||
         (_usedBottomCenter >0) ||
         (_usedBottomRight >0))
       lines--;
   }
   if (lines<1) return false;
 
 
   int y = isBottom ? height - h : 0;
 
   if (unused < 0) unused = 0;
   if (unused == 0) {
     // no space available in last line at this position
     y = isBottom ? (y-h) : (y+h);
     lines--;
 
     if (lines<1) return false;
 
     // new line: reset used space
     if (isBottom)
       _usedBottomLeft = _usedBottomCenter = _usedBottomRight = 0;
     else
       _usedTopLeft = _usedTopCenter = _usedTopRight = 0;
 
     unused = width;
   }
 
   // stop as soon as possible when there is no space for "..."
   static int dotW = 0;
   if (!dotW) dotW = _fm->width("...");
   if (width < dotW) return false;
 
   // get text and pixmap now, only if we need to, because it is possible
   // that they are calculated on demand (and this can take some time)
   QString name = dp->text(f);
   if (name.isEmpty()) return 0;
   QPixmap pix = dp->pixmap(f);
 
   // check if pixmap can be drawn
   int pixW = pix.width();
   int pixH = pix.height();
   int pixY = 0;
   bool pixDrawn = true;
   if (pixW>0) {
     pixW += 2; // X distance from pix
     if ((width < pixW + dotW) || (height < pixH)) {
       // do not draw
       pixW = 0;
     }
     else
       pixDrawn = false;
   }
 
   // width of text and pixmap to be drawn
   int w = pixW + _fm->width(name);
 
   if (0) qDebug() << "  For '" << name << "': Unused " << unused
            << ", StrW " << w << ", Width " << width;
 
   // if we have limited space at 1st line:
   // use it only if whole name does fit in last line...
   if ((unused < width) && (w > unused)) {
     y = isBottom ? (y-h) : (y+h);
     lines--;
 
     if (lines<1) return false;
 
     // new line: reset used space
     if (isBottom)
       _usedBottomLeft = _usedBottomCenter = _usedBottomRight = 0;
     else
       _usedTopLeft = _usedTopCenter = _usedTopRight = 0;
   }
 
   p->save();
   p->setPen( (qGray(dp->backColor().rgb())>100) ? Qt::black : Qt::white);
   p->setFont(dp->font());
   if (rotate) {
     //p->translate(r.x()+2, r.y()+r.height());
     p->translate(r.x(), r.y()+r.height()-2);
     p->rotate(270);
   }
   else
     p->translate(r.x()+2, r.y());
 
 
   // adjust available lines according to maxLines
   int max = dp->maxLines(f);
   if ((max > 0) && (lines>max)) lines = max;
 
   /* loop over name parts to break up string depending on available width.
    * every char category change is supposed a possible break,
    * with the exception Uppercase=>Lowercase.
    * It is good enough for numbers, Symbols...
    *
    * If the text is to be written at the bottom, we start with the
    * end of the string (so everything is reverted)
    */
   QString remaining;
   int origLines = lines;
   while (lines>0) {
 
     // more than one line: search for line break
     if (w>width && lines>1) {
         int breakPos;
 
         if (!isBottom) {
             w = pixW + findBreak(breakPos, name, _fm, width - pixW);
 
             remaining = name.mid(breakPos);
             // remove space on break point
             if (name[breakPos-1].category() == QChar::Separator_Space)
                 name = name.left(breakPos-1);
             else
                 name = name.left(breakPos);
         }
         else { // bottom
             w = pixW + findBreakBackwards(breakPos, name, _fm, width - pixW);
 
             remaining = name.left(breakPos);
             // remove space on break point
             if (name[breakPos].category() == QChar::Separator_Space)
                 name = name.mid(breakPos+1);
             else
                 name = name.mid(breakPos);
         }
     }
     else
         remaining = QString();
 
     /* truncate and add ... if needed */
     if (w > width) {
         name = _fm->elidedText(name, Qt::ElideRight, width - pixW);
         w = _fm->width(name) + pixW;
     }
 
     int x = 0;
     if (isCenter)
       x = (width - w)/2;
     else if (isRight)
       x = width - w;
 
     if (!pixDrawn) {
         pixY = y+(h-pixH)/2; // default: center vertically
         if (pixH > h) pixY = isBottom ? y-(pixH-h) : y;
 
     p->drawPixmap( x, pixY, pix);
 
         // for distance to next text
     pixY = isBottom ? (pixY - h - 2) : (pixY + pixH + 2);
     pixDrawn = true;
     }
 
 
     if (0) qDebug() << "  Drawing '" << name << "' at "
              << x+pixW << "/" << y;
 
     p->drawText( x+pixW, y,
          width - pixW, h,
          Qt::AlignLeft, name);
     y = isBottom ? (y-h) : (y+h);
     lines--;
 
     if (remaining.isEmpty()) break;
     name = remaining;
     w = pixW + _fm->width(name);
   }
 
   // make sure the pix stays visible
   if (pixDrawn && (pixY>0)) {
     if (isBottom && (pixY<y)) y = pixY;
     if (!isBottom && (pixY>y)) y = pixY;
   }
 
   if (origLines > lines) {
     // if only 1 line written, do not reset _used* vars
     if (lines - origLines >1) {
       if (isBottom)
         _usedBottomLeft = _usedBottomCenter = _usedBottomRight = 0;
       else
         _usedTopLeft = _usedTopCenter = _usedTopRight = 0;
     }
 
     // take back one line
     y = isBottom ? (y+h) : (y-h);
     if (used) *used = w;
   }
 
   // update free space
   if (!isBottom) {
     if (rotate)
       _rect.setRect(r.x()+y, r.y(), r.width()-y, r.height());
     else
       _rect.setRect(r.x(), r.y()+y, r.width(), r.height()-y);
   }
   else {
     if (rotate)
       _rect.setRect(r.x(), r.y(), y+h, r.height());
     else
       _rect.setRect(r.x(), r.y(), r.width(), y+h);
   }
 
   p->restore();
 
   return true;
 }
 
 
 
 
 
 
 //
 // TreeMapItemList
 //
 
 
 TreeMapItem* TreeMapItemList::commonParent()
 {
   if (isEmpty()) return 0;
 
   TreeMapItem* parent = first();
   for(int i = 1; parent && i<size(); i++)
       parent = parent->commonParent(at(i));
 
   return parent;
 }
 
 class TreeMapItemLessThan
 {
 public:
     bool operator()(const TreeMapItem* i1, const TreeMapItem* i2) const
     {
     TreeMapItem* p = i1->parent();
     // should not happen
     if (!p) return false;
 
     bool ascending;
     bool result;
     int textNo = p->sorting(&ascending);
     if (textNo < 0)
         result = i1->value() < i2->value();
     else
         result = i1->text(textNo) < i2->text(textNo);
 
     return ascending ? result : !result;
     }
 };
 
 TreeMapItemLessThan treeMapItemLessThan;
 
 // TreeMapItem
 
 TreeMapItem::TreeMapItem(TreeMapItem* parent, double value)
 {
   _value = value;
   _parent = parent;
 
   _sum = 0;
   _children = 0;
   _widget = 0;
   _index = -1;
   _depth = -1; // not set
   _unused_self = 0;
 
   if (_parent) {
     // take sorting from parent
     _sortTextNo = _parent->sorting(&_sortAscending);
     _parent->addItem(this);
   }
   else {
     _sortAscending = false;
     _sortTextNo = -1; // default: no sorting
   }
 }
 
 
 TreeMapItem::TreeMapItem(TreeMapItem* parent, double value,
                          const QString& text1, const QString& text2,
                          const QString& text3, const QString& text4)
 {
   _value = value;
   _parent = parent;
 
   // this resizes the text vector only if needed
   if (!text4.isEmpty()) setText(3, text4);
   if (!text3.isEmpty()) setText(2, text3);
   if (!text2.isEmpty()) setText(1, text2);
   setText(0, text1);
 
   _sum = 0;
   _children = 0;
   _widget = 0;
   _index = -1;
   _depth = -1; // not set
   _unused_self = 0;
 
   if (_parent) _parent->addItem(this);
 }
 
 TreeMapItem::~TreeMapItem()
 {
     if (_children) {
     qDeleteAll(*_children);
     delete _children;
     _children = 0;
     }
 
   // finally, notify widget about deletion
   if (_widget) _widget->deletingItem(this);
 }
 
 void TreeMapItem::setParent(TreeMapItem* p)
 {
   _parent = p;
   if (p) _widget = p->_widget;
 }
 
 bool TreeMapItem::isChildOf(TreeMapItem* item)
 {
   if (!item) return false;
 
   TreeMapItem* i = this;
   while (i) {
     if (item == i) return true;
     i = i->_parent;
   }
   return false;
 }
 
 TreeMapItem* TreeMapItem::commonParent(TreeMapItem* item)
 {
   while (item && !isChildOf(item)) {
     item = item->parent();
   }
   return item;
 }
 
 void TreeMapItem::redraw()
 {
   if (_widget)
     _widget->redraw(this);
 }
 
 void TreeMapItem::clear()
 {
   if (_children) {
     // delete selected items below this item from selection
     if (_widget) _widget->clearSelection(this);
 
     qDeleteAll(*_children);
     delete _children;
     _children = 0;
   }
 }
 
 
 // invalidates current children and forces redraw
 // this is only useful when children are created on demand in items()
 void TreeMapItem::refresh()
 {
   clear();
   redraw();
 }
 
 
 QStringList TreeMapItem::path(int textNo) const
 {
   QStringList list(text(textNo));
 
   TreeMapItem* i = _parent;
   while (i) {
     QString text = i->text(textNo);
     if (!text.isEmpty())
         list.prepend(i->text(textNo));
     i = i->_parent;
   }
   return list;
 }
 
 int TreeMapItem::depth() const
 {
   if (_depth>0) return _depth;
 
   if (_parent)
     return _parent->depth() + 1;
   return 1;
 }
 
 
 bool TreeMapItem::initialized()
 {
   if (!_children) {
     _children = new TreeMapItemList;
     return false;
   }
   return true;
 }
 
 void TreeMapItem::addItem(TreeMapItem* i)
 {
   if (!i) return;
 
   if (!_children)
     _children = new TreeMapItemList;
 
   i->setParent(this);
 
   _children->append(i); // preserve insertion order
   if (sorting(0) != -1)
     qSort(_children->begin(), _children->end(), treeMapItemLessThan);
 }
 
 
 // default implementations of virtual functions
 
 double TreeMapItem::value() const
 {
   return _value;
 }
 
 double TreeMapItem::sum() const
 {
   return _sum;
 }
 
 DrawParams::Position TreeMapItem::position(int f) const
 {
   Position p = StoredDrawParams::position(f);
   if (_widget && (p == Default))
     p = _widget->fieldPosition(f);
 
   return p;
 }
 
 // use widget font
 const QFont& TreeMapItem::font() const
 {
   return _widget->currentFont();
 }
 
 
 bool TreeMapItem::isMarked(int) const
 {
     return false;
 }
 
 
 int TreeMapItem::borderWidth() const
 {
   if (_widget)
     return _widget->borderWidth();
 
   return 2;
 }
 
 int TreeMapItem::sorting(bool* ascending) const
 {
   if (ascending) *ascending = _sortAscending;
   return _sortTextNo;
 }
 
 // do *not* set sorting recursively
 void TreeMapItem::setSorting(int textNo, bool ascending)
 {
     if (_sortTextNo == textNo) {
     if(_sortAscending == ascending) return;
     if (textNo == -1) {
         // when no sorting is done, order change does not do anything
         _sortAscending = ascending;
         return;
     }
     }
     _sortAscending = ascending;
     _sortTextNo = textNo;
 
     if (_children && _sortTextNo != -1)
     qSort(_children->begin(), _children->end(), treeMapItemLessThan);
 }
 
 void TreeMapItem::resort(bool recursive)
 {
   if (!_children) return;
 
   if (_sortTextNo != -1)
       qSort(_children->begin(), _children->end(), treeMapItemLessThan);
 
   if (recursive)
     foreach(TreeMapItem* i, *_children)
       i->resort(recursive);
 }
 
 
 TreeMapItem::SplitMode TreeMapItem::splitMode() const
 {
   if (_widget)
     return _widget->splitMode();
 
   return Best;
 }
 
 int TreeMapItem::rtti() const
 {
   return 0;
 }
 
 TreeMapItemList* TreeMapItem::children()
 {
   if (!_children)
     _children = new TreeMapItemList;
 
   return _children;
 }
 
 void TreeMapItem::clearItemRect()
 {
     _rect = QRect();
     clearFreeRects();
 }
 
 void TreeMapItem::clearFreeRects()
 {
     _freeRects.clear();
 }
 
 void TreeMapItem::addFreeRect(const QRect& r)
 {
     // do not add invalid rects
     if ((r.width() < 1) || (r.height() < 1)) return;
 
     if (0) qDebug() << "addFree(" << path(0).join("/") << ", "
              << r.x() << "/" << r.y() << "-"
              << r.width() << "x" << r.height() << ")";
 
     if (_freeRects.isEmpty()) {
     _freeRects.append(r);
     return;
     }
 
     // join rect with last rect if possible
     // this saves memory and does not make the tooltip flicker
     QRect& last = _freeRects.last();
     bool replaced = false;
     if ((last.left() == r.left()) && (last.width() == r.width())) {
     if ((last.bottom()+1 == r.top()) || (r.bottom()+1 == last.top())) {
         last |= r;
         replaced = true;
     }
     }
     else if ((last.top() == r.top()) && (last.height() == r.height())) {
     if ((last.right()+1 == r.left()) || (r.right()+1 == last.left())) {
         last |= r;
         replaced = true;
     }
     }
 
     if (!replaced) {
     _freeRects.append(r);
     return;
     }
 
     if (0) qDebug() << "  united with last to ("
              << last.x() << "/" << last.y() << "-"
              << last.width() << "x" << last.height() << ")";
 }
 
 
 
 // TreeMapWidget
 
 TreeMapWidget::TreeMapWidget(TreeMapItem* base,
                  QWidget* parent)
     : QWidget(parent)
 {
     _base = base;
     _base->setWidget(this);
 
     _font = font();
     _fontHeight = fontMetrics().height();
 
 
   // default behaviour
   _selectionMode = Single;
   _splitMode = TreeMapItem::AlwaysBest;
   _visibleWidth = 2;
   _reuseSpace = false;
   _skipIncorrectBorder = false;
   _drawSeparators = false;
   _allowRotation = true;
   _borderWidth = 2;
   _shading = true; // beautiful is default!
   _maxSelectDepth = -1; // unlimited
   _maxDrawingDepth = -1; // unlimited
   _minimalArea = -1; // unlimited
   _markNo = 0;
 
   for(int i=0;i<4;i++) {
     _drawFrame[i] = true;
     _transparent[i] = false;
   }
 
   // _stopAtText will be unset on resizing (per default)
   // _textVisible will be true on resizing (per default)
   // _forceText will be false on resizing (per default)
 
   // start state: _selection is an empty list
   _current = 0;
   _oldCurrent = 0;
   _pressed = 0;
   _lastOver = 0;
   _needsRefresh = _base;
 
   setAttribute(Qt::WA_NoSystemBackground, true);
   setFocusPolicy(Qt::StrongFocus);
 }
 
 TreeMapWidget::~TreeMapWidget()
 {
   delete _base;
 }
 
 const QFont& TreeMapWidget::currentFont() const
 {
   return _font;
 }
 
 void TreeMapWidget::setSplitMode(TreeMapItem::SplitMode m)
 {
   if (_splitMode == m) return;
 
   _splitMode = m;
   redraw();
 }
 
 TreeMapItem::SplitMode TreeMapWidget::splitMode() const
 {
   return _splitMode;
 }
 
 bool TreeMapWidget::setSplitMode(const QString& mode)
 {
   if (mode == "Bisection") setSplitMode(TreeMapItem::Bisection);
   else if (mode == "Columns") setSplitMode(TreeMapItem::Columns);
   else if (mode == "Rows") setSplitMode(TreeMapItem::Rows);
   else if (mode == "AlwaysBest") setSplitMode(TreeMapItem::AlwaysBest);
   else if (mode == "Best")       setSplitMode(TreeMapItem::Best);
   else if (mode == "HAlternate") setSplitMode(TreeMapItem::HAlternate);
   else if (mode == "VAlternate") setSplitMode(TreeMapItem::VAlternate);
   else if (mode == "Horizontal") setSplitMode(TreeMapItem::Horizontal);
   else if (mode == "Vertical")   setSplitMode(TreeMapItem::Vertical);
   else return false;
 
   return true;
 }
 
 QString TreeMapWidget::splitModeString() const
 {
   QString mode;
   switch(splitMode()) {
     case TreeMapItem::Bisection:  mode = "Bisection"; break;
     case TreeMapItem::Columns:    mode = "Columns"; break;
     case TreeMapItem::Rows:       mode = "Rows"; break;
     case TreeMapItem::AlwaysBest: mode = "AlwaysBest"; break;
     case TreeMapItem::Best:       mode = "Best"; break;
     case TreeMapItem::HAlternate: mode = "HAlternate"; break;
     case TreeMapItem::VAlternate: mode = "VAlternate"; break;
     case TreeMapItem::Horizontal: mode = "Horizontal"; break;
     case TreeMapItem::Vertical:   mode = "Vertical"; break;
     default: mode = "Unknown"; break;
   }
   return mode;
 }
 
 
 void TreeMapWidget::setShadingEnabled(bool s)
 {
   if (_shading == s) return;
 
   _shading = s;
   redraw();
 }
 
 void TreeMapWidget::drawFrame(int d, bool b)
 {
   if ((d<0) || (d>=4) || (_drawFrame[d]==b)) return;
 
   _drawFrame[d] = b;
   redraw();
 }
 
 void TreeMapWidget::setTransparent(int d, bool b)
 {
   if ((d<0) || (d>=4) || (_transparent[d]==b)) return;
 
   _transparent[d] = b;
   redraw();
 }
 
 void TreeMapWidget::setAllowRotation(bool enable)
 {
   if (_allowRotation == enable) return;
 
   _allowRotation = enable;
   redraw();
 }
 
 void TreeMapWidget::setVisibleWidth(int width, bool reuseSpace)
 {
   if (_visibleWidth == width && _reuseSpace == reuseSpace) return;
 
   _visibleWidth = width;
   _reuseSpace = reuseSpace;
   redraw();
 }
 
 void TreeMapWidget::setSkipIncorrectBorder(bool enable)
 {
   if (_skipIncorrectBorder == enable) return;
 
   _skipIncorrectBorder = enable;
   redraw();
 }
 
 void TreeMapWidget::setBorderWidth(int w)
 {
   if (_borderWidth == w) return;
 
   _borderWidth = w;
   redraw();
 }
 
 void TreeMapWidget::setMaxDrawingDepth(int d)
 {
   if (_maxDrawingDepth == d) return;
 
   _maxDrawingDepth = d;
   redraw();
 }
 
 QString TreeMapWidget::defaultFieldType(int f) const
 {
     return tr("Text %1").arg(f+1);
 }
 
 QString TreeMapWidget::defaultFieldStop(int) const
 {
   return QString();
 }
 
 bool TreeMapWidget::defaultFieldVisible(int f) const
 {
   return (f<2);
 }
 
 bool TreeMapWidget::defaultFieldForced(int) const
 {
   return false;
 }
 
 DrawParams::Position TreeMapWidget::defaultFieldPosition(int f) const
 {
   switch(f%4) {
   case 0: return DrawParams::TopLeft;
   case 1: return DrawParams::TopRight;
   case 2: return DrawParams::BottomRight;
   case 3: return DrawParams::BottomLeft;
   default:break;
   }
   return DrawParams::TopLeft;
 }
 
 bool TreeMapWidget::resizeAttr(int size)
 {
   if (size<0 || size>=MAX_FIELD) return false;
 
   if (size>(int)_attr.size()) {
     int oldSize = _attr.size();
     _attr.resize(size);
     while (oldSize<size) {
       _attr[oldSize].type    = defaultFieldType(oldSize);
       _attr[oldSize].stop    = defaultFieldStop(oldSize);
       _attr[oldSize].visible = defaultFieldVisible(oldSize);
       _attr[oldSize].forced  = defaultFieldForced(oldSize);
       _attr[oldSize].pos     = defaultFieldPosition(oldSize);
       oldSize++;
     }
   }
   return true;
 }
 
 void TreeMapWidget::setFieldType(int f, const QString& type)
 {
   if (((int)_attr.size() < f+1) &&
       (type == defaultFieldType(f))) return;
   if (resizeAttr(f+1)) _attr[f].type = type;
 
   // no need to redraw: the type string is not visible in the TreeMap
 }
 
 QString TreeMapWidget::fieldType(int f) const
 {
   if (f<0 || (int)_attr.size()<f+1) return defaultFieldType(f);
   return _attr[f].type;
 }
 
 void TreeMapWidget::setFieldStop(int f, const QString& stop)
 {
   if (((int)_attr.size() < f+1) &&
       (stop == defaultFieldStop(f))) return;
   if (resizeAttr(f+1)) {
     _attr[f].stop = stop;
     redraw();
   }
 }
 
 QString TreeMapWidget::fieldStop(int f) const
 {
   if (f<0 || (int)_attr.size()<f+1) return defaultFieldStop(f);
   return _attr[f].stop;
 }
 
 void TreeMapWidget::setFieldVisible(int f, bool enable)
 {
   if (((int)_attr.size() < f+1) &&
       (enable == defaultFieldVisible(f))) return;
 
   if (resizeAttr(f+1)) {
     _attr[f].visible = enable;
     redraw();
   }
 }
 
 bool TreeMapWidget::fieldVisible(int f) const
 {
   if (f<0 || (int)_attr.size()<f+1)
     return defaultFieldVisible(f);
 
   return _attr[f].visible;
 }
 
 void TreeMapWidget::setFieldForced(int f, bool enable)
 {
   if (((int)_attr.size() < f+1) &&
       (enable == defaultFieldForced(f))) return;
 
   if (resizeAttr(f+1)) {
     _attr[f].forced = enable;
     if (_attr[f].visible) redraw();
   }
 }
 
 bool TreeMapWidget::fieldForced(int f) const
 {
   if (f<0 || (int)_attr.size()<f+1)
     return defaultFieldForced(f);
 
   return _attr[f].forced;
 }
 
 void TreeMapWidget::setFieldPosition(int f, TreeMapItem::Position pos)
 {
   if (((int)_attr.size() < f+1) &&
       (pos == defaultFieldPosition(f))) return;
 
   if (resizeAttr(f+1)) {
     _attr[f].pos = pos;
     if (_attr[f].visible) redraw();
   }
 }
 
 DrawParams::Position TreeMapWidget::fieldPosition(int f) const
 {
   if (f<0 || (int)_attr.size()<f+1)
     return defaultFieldPosition(f);
 
   return _attr[f].pos;
 }
 
 void TreeMapWidget::setFieldPosition(int f, const QString& pos)
 {
   if (pos == "TopLeft")
     setFieldPosition(f, DrawParams::TopLeft);
   else if (pos == "TopCenter")
     setFieldPosition(f, DrawParams::TopCenter);
   else if (pos == "TopRight")
     setFieldPosition(f, DrawParams::TopRight);
   else if (pos == "BottomLeft")
     setFieldPosition(f, DrawParams::BottomLeft);
   else if (pos == "BottomCenter")
     setFieldPosition(f, DrawParams::BottomCenter);
   else if (pos == "BottomRight")
     setFieldPosition(f, DrawParams::BottomRight);
   else if (pos == "Default")
     setFieldPosition(f, DrawParams::Default);
 }
 
 QString TreeMapWidget::fieldPositionString(int f) const
 {
   TreeMapItem::Position pos = fieldPosition(f);
   if (pos == DrawParams::TopLeft) return QString("TopLeft");
   if (pos == DrawParams::TopCenter) return QString("TopCenter");
   if (pos == DrawParams::TopRight) return QString("TopRight");
   if (pos == DrawParams::BottomLeft) return QString("BottomLeft");
   if (pos == DrawParams::BottomCenter) return QString("BottomCenter");
   if (pos == DrawParams::BottomRight) return QString("BottomRight");
   if (pos == DrawParams::Default) return QString("Default");
   return QString("unknown");
 }
 
 void TreeMapWidget::setMinimalArea(int area)
 {
   if (_minimalArea == area) return;
 
   _minimalArea = area;
   redraw();
 }
 
 
 void TreeMapWidget::deletingItem(TreeMapItem* i)
 {
   // remove any references to the item to be deleted
   _selection.removeAll(i);
   _tmpSelection.removeAll(i);
 
   if (_current == i) _current = 0;
   if (_oldCurrent == i) _oldCurrent = 0;
   if (_pressed == i) _pressed = 0;
   if (_lastOver == i) _lastOver = 0;
 
   // do not redraw a deleted item
   if (_needsRefresh == i) {
     // we can safely redraw the parent, as deleting order is
     // from child to parent; i.e. i->parent() is existing.
     _needsRefresh = i->parent();
   }
 }
 
 
 QString TreeMapWidget::tipString(TreeMapItem* i) const
 {
   QString tip, itemTip;
 
   while (i) {
     if (!i->text(0).isEmpty()) {
       itemTip = i->text(0);
       if (!i->text(1).isEmpty())
         itemTip += " (" + i->text(1) + ')';
 
       if (!tip.isEmpty())
         tip += '\n';
 
       tip += itemTip;
     }
     i = i->parent();
   }
   return tip;
 }
 
 TreeMapItem* TreeMapWidget::item(int x, int y) const
 {
 
   if (!rect().contains(x, y)) return 0;
   if (DEBUG_DRAWING) qDebug() << "item(" << x << "," << y << "):";
 
   TreeMapItem* p = _base;
   TreeMapItem* i;
   while (1) {
     TreeMapItemList* list = p->children();
     i = 0;
     if (list) {
       int idx;
       for (idx=0; idx<list->size(); idx++) {
     i = list->at(idx);
 
         if (DEBUG_DRAWING)
         qDebug() << "  Checking " << i->path(0).join("/") << " ("
               << i->itemRect().x() << "/" << i->itemRect().y()
               << "-" << i->itemRect().width()
               << "x" << i->itemRect().height() << ")";
 
         if (i->itemRect().contains(x, y)) {
 
         if (DEBUG_DRAWING) qDebug() << "  .. Got. Index " << idx;
 
         p->setIndex(idx);
         break;
         }
       }
       if (idx == list->size()) i = 0; // not contained in child
     }
 
     if (!i) {
       static TreeMapItem* last = 0;
       if (p != last) {
         last = p;
 
         if (DEBUG_DRAWING)
         qDebug() << "item(" << x << "," << y << "): Got "
               << p->path(0).join("/") << " (Size "
               << p->itemRect().width() << "x" << p->itemRect().height()
               << ", Val " << p->value() << ")";
       }
 
       return p;
     }
     p = i;
   }
   return 0;
 }
 
 TreeMapItem* TreeMapWidget::possibleSelection(TreeMapItem* i) const
 {
   if (i) {
     if (_maxSelectDepth>=0) {
       int depth = i->depth();
       while(i && depth > _maxSelectDepth) {
         i = i->parent();
         depth--;
       }
     }
   }
   return i;
 }
 
 TreeMapItem* TreeMapWidget::visibleItem(TreeMapItem* i) const
 {
   if (i) {
     /* Must have a visible area */
     while(i && ((i->itemRect().width() <1) ||
                 (i->itemRect().height() <1))) {
       TreeMapItem* p = i->parent();
       if (!p) break;
       int idx = p->children()->indexOf(i);
       idx--;
       if (idx<0)
         i = p;
       else
         i = p->children()->at(idx);
     }
   }
   return i;
 }
 
 void TreeMapWidget::setSelected(TreeMapItem* item, bool selected)
 {
     if (!item) return;
     item = possibleSelection(item);
     setCurrent(item);
 
     TreeMapItem* changed = setTmpSelected(item, selected);
     if (!changed) return;
 
     _selection = _tmpSelection;
     if (_selectionMode == Single)
       emit selectionChanged(item);
     emit selectionChanged();
     redraw(changed);
 
     if (0) qDebug() << (selected ? "S":"Des") << "elected Item "
              << (item ? item->path(0).join("") : QString("(null)"))
              << " (depth " << (item ? item->depth() : -1)
              << ")";
 }
 
 void TreeMapWidget::setMarked(int markNo, bool redrawWidget)
 {
     // if there is no marking, return
     if ((_markNo == 0) && (markNo == 0)) return;
 
     _markNo = markNo;
     if (!clearSelection() && redrawWidget) redraw();
 }
 
 /* Returns all items which appear only in one of the given lists */
 TreeMapItemList TreeMapWidget::diff(TreeMapItemList& l1,
                     TreeMapItemList& l2)
 {
   TreeMapItemList l;
 
   foreach(TreeMapItem* i, l1)
     if (!l2.contains(i))
       l.append(i);
 
   foreach(TreeMapItem* i, l2)
     if (!l1.contains(i))
       l.append(i);
 
   return l;
 }
 
 /* Only modifies _tmpSelection.
  * Returns 0 when no change happened, otherwise the TreeMapItem that has
  * to be redrawn for all changes.
  */
 TreeMapItem* TreeMapWidget::setTmpSelected(TreeMapItem* item, bool selected)
 {
   if (!item) return 0;
   if (_selectionMode == NoSelection) return 0;
 
   TreeMapItemList old = _tmpSelection;
 
   if (_selectionMode == Single) {
     _tmpSelection.clear();
     if (selected) _tmpSelection.append(item);
   }
   else {
     if (selected) {
     // first remove any selection which is parent or child of <item>
     foreach(TreeMapItem* i, _tmpSelection)
         if (i->isChildOf(item) || item->isChildOf(i))
         _tmpSelection.removeAll(i);
 
     _tmpSelection.append(item);
     }
     else
       _tmpSelection.removeAll(item);
   }
 
   return diff(old, _tmpSelection).commonParent();
 }
 
 
 bool TreeMapWidget::clearSelection(TreeMapItem* parent)
 {
   TreeMapItemList old = _selection;
 
   // remove any selection which is child of <parent>
   foreach(TreeMapItem* i, _selection)
       if (i->isChildOf(parent))
       _selection.removeAll(i);
 
   TreeMapItem* changed = diff(old, _selection).commonParent();
   if (changed) {
     changed->redraw();
     emit selectionChanged();
   }
   return (changed != 0);
 }
 
 bool TreeMapWidget::isSelected(TreeMapItem* i) const
 {
     if (!i) return false;
     return _selection.contains(i);
 }
 
 bool TreeMapWidget::isTmpSelected(TreeMapItem* i)
 {
     if (!i) return false;
     return _tmpSelection.contains(i);
 }
 
 
 void TreeMapWidget::setCurrent(TreeMapItem* i, bool kbd)
 {
     TreeMapItem* old = _current;
     _current = i;
 
     if (_markNo >0) {
     // remove mark
     _markNo = 0;
 
         if (i) qDebug() << "setCurrent(" << i->path(0).join("/")
              << ") - mark removed";
 
     // always complete redraw needed to remove mark
     redraw();
 
     if (old == _current) return;
     }
     else {
     if (old == _current) return;
 
     if (old) old->redraw();
     if (i) i->redraw();
     }
 
     //qDebug() << "Current Item " << (i ? qPrintable(i->path()) : "(null)");
 
     emit currentChanged(i, kbd);
 }
 
 void TreeMapWidget::setRangeSelection(TreeMapItem* i1,
                       TreeMapItem* i2, bool selected)
 {
   i1 = possibleSelection(i1);
   i2 = possibleSelection(i2);
   setCurrent(i2);
 
   TreeMapItem* changed = setTmpRangeSelection(i1, i2, selected);
   if (!changed) return;
 
   _selection = _tmpSelection;
   if (_selectionMode == Single)
     emit selectionChanged(i2);
   emit selectionChanged();
   redraw(changed);
 }
 
 TreeMapItem* TreeMapWidget::setTmpRangeSelection(TreeMapItem* i1,
                          TreeMapItem* i2,
                          bool selected)
 {
   if ((i1 == 0) && (i2 == 0)) return 0;
   if ((i1 == 0) || i1->isChildOf(i2)) return setTmpSelected(i2, selected);
   if ((i2 == 0) || i2->isChildOf(i1)) return setTmpSelected(i1, selected);
 
   TreeMapItem* changed = setTmpSelected(i1, selected);
   TreeMapItem* changed2 = setTmpSelected(i2, selected);
   if (changed2) changed = changed2->commonParent(changed);
 
   TreeMapItem* commonParent = i1;
   while (commonParent && !i2->isChildOf(commonParent)) {
     i1 = commonParent;
     commonParent = commonParent->parent();
   }
   if (!commonParent) return changed;
   while (i2 && i2->parent() != commonParent)
     i2 = i2->parent();
   if (!i2) return changed;
 
   TreeMapItemList* list = commonParent->children();
   if (!list) return changed;
 
   bool between = false;
   foreach(TreeMapItem* i, *list) {
     if (between) {
       if (i==i1 || i==i2) break;
       changed2 = setTmpSelected(i, selected);
       if (changed2) changed = changed2->commonParent(changed);
     }
     else if (i==i1 || i==i2)
       between = true;
   }
 
   return changed;
 }
 
 void TreeMapWidget::contextMenuEvent( QContextMenuEvent* e )
 {
   //qDebug() << "TreeMapWidget::contextMenuEvent";
 
   if ( receivers( SIGNAL(contextMenuRequested(TreeMapItem*, const QPoint &)) ) )
     e->accept();
 
   if ( e->reason() == QContextMenuEvent::Keyboard ) {
     QRect r = (_current) ? _current->itemRect() : _base->itemRect();
     QPoint p = QPoint(r.left() + r.width()/2, r.top() + r.height()/2);
     emit contextMenuRequested(_current, p);
   }
   else {
     TreeMapItem* i = item(e->x(), e->y());
     emit contextMenuRequested(i, e->pos());
   }
 }
 
 
 void TreeMapWidget::mousePressEvent( QMouseEvent* e )
 {
   //qDebug() << "TreeMapWidget::mousePressEvent";
 
   _oldCurrent = _current;
 
   TreeMapItem* i = item(e->x(), e->y());
 
   _pressed = i;
 
   _inShiftDrag = e->modifiers() & Qt::ShiftModifier;
   _inControlDrag = e->modifiers() & Qt::ControlModifier;
   _lastOver = _pressed;
 
   TreeMapItem* changed = 0;
   TreeMapItem* item = possibleSelection(_pressed);
 
   switch(_selectionMode) {
   case Single:
     changed = setTmpSelected(item, true);
     break;
   case Multi:
     changed = setTmpSelected(item, !isTmpSelected(item));
     break;
   case Extended:
     if (_inControlDrag)
       changed = setTmpSelected(item, !isTmpSelected(item));
     else if (_inShiftDrag) {
       TreeMapItem* sCurrent = possibleSelection(_current);
       changed = setTmpRangeSelection(sCurrent, item,
                                      !isTmpSelected(item));
     }
     else {
       _selectionMode = Single;
       changed = setTmpSelected(item, true);
       _selectionMode = Extended;
     }
     break;
   default:
     break;
   }
 
   // item under mouse always selected on right button press
   if (e->button() == Qt::RightButton) {
     TreeMapItem* changed2 = setTmpSelected(item, true);
     if (changed2) changed = changed2->commonParent(changed);
   }
 
   setCurrent(_pressed);
 
   if (changed)
     redraw(changed);
 
   if (e->button() == Qt::RightButton) {
 
     // emit selection change
     if (! (_tmpSelection == _selection)) {
       _selection = _tmpSelection;
       if (_selectionMode == Single)
     emit selectionChanged(_lastOver);
       emit selectionChanged();
     }
     _pressed = 0;
     _lastOver = 0;
     emit rightButtonPressed(i, e->pos());
   }
 }
 
 void TreeMapWidget::mouseMoveEvent( QMouseEvent* e )
 {
   //qDebug() << "TreeMapWidget::mouseMoveEvent";
 
   if (!_pressed) return;
   TreeMapItem* over = item(e->x(), e->y());
   if (_lastOver == over) return;
 
   setCurrent(over);
   if (over == 0) {
     _lastOver = 0;
     return;
   }
 
   TreeMapItem* changed = 0;
   TreeMapItem* item = possibleSelection(over);
 
   switch(_selectionMode) {
   case Single:
     changed = setTmpSelected(item, true);
     break;
   case Multi:
     changed = setTmpSelected(item, !isTmpSelected(item));
     break;
   case Extended:
     if (_inControlDrag)
       changed = setTmpSelected(item, !isTmpSelected(item));
     else {
       TreeMapItem* sLast = possibleSelection(_lastOver);
       changed = setTmpRangeSelection(sLast, item, true);
     }
     break;
 
   default:
     break;
   }
 
   _lastOver = over;
 
   if (changed)
     redraw(changed);
 }
 
 void TreeMapWidget::mouseReleaseEvent( QMouseEvent* )
 {
   //qDebug() << "TreeMapWidget::mouseReleaseEvent";
 
   if (!_pressed) return;
 
   if (!_lastOver) {
     // take back
     setCurrent(_oldCurrent);
     TreeMapItem* changed = diff(_tmpSelection, _selection).commonParent();
     _tmpSelection = _selection;
     if (changed)
       redraw(changed);
   }
   else {
     if (! (_tmpSelection == _selection)) {
       _selection = _tmpSelection;
       if (_selectionMode == Single)
         emit selectionChanged(_lastOver);
       emit selectionChanged();
     }
     if (!_inControlDrag && !_inShiftDrag && (_pressed == _lastOver))
       emit clicked(_lastOver);
   }
 
   _pressed = 0;
   _lastOver = 0;
 }
 
 
 void TreeMapWidget::mouseDoubleClickEvent( QMouseEvent* e )
 {
   TreeMapItem* over = item(e->x(), e->y());
 
   emit doubleClicked(over);
 }
 
 
 /* returns -1 if nothing visible found */
 int nextVisible(TreeMapItem* i)
 {
   TreeMapItem* p = i->parent();
   if (!p || p->itemRect().isEmpty()) return -1;
 
   int idx = p->children()->indexOf(i);
   if (idx<0) return -1;
 
   while (idx < (int)p->children()->count()-1) {
     idx++;
     QRect r = p->children()->at(idx)->itemRect();
     if (r.width()>1 && r.height()>1)
       return idx;
   }
   return -1;
 }
 
 /* returns -1 if nothing visible found */
 int prevVisible(TreeMapItem* i)
 {
   TreeMapItem* p = i->parent();
   if (!p || p->itemRect().isEmpty()) return -1;
 
   int idx = p->children()->indexOf(i);
   if (idx<0) return -1;
 
   while (idx > 0) {
     idx--;
     QRect r = p->children()->at(idx)->itemRect();
     if (r.width()>1 && r.height()>1)
       return idx;
   }
   return -1;
 }
 
 
 
 
 void TreeMapWidget::keyPressEvent( QKeyEvent* e )
 {
   if (e->key() == Qt::Key_Escape && _pressed) {
 
     // take back
     if (_oldCurrent != _lastOver)
       setCurrent(_oldCurrent);
     if (! (_tmpSelection == _selection)) {
       TreeMapItem* changed = diff(_tmpSelection, _selection).commonParent();
       _tmpSelection = _selection;
       if (changed)
     redraw(changed);
     }
     _pressed = 0;
     _lastOver = 0;
   }
 
   if ((e->key() == Qt::Key_Space) ||
       (e->key() == Qt::Key_Return)) {
 
     switch(_selectionMode) {
     case NoSelection:
       break;
     case Single:
       setSelected(_current, true);
       break;
     case Multi:
       setSelected(_current, !isSelected(_current));
       break;
     case Extended:
       if ((e->modifiers() & Qt::ControlModifier) ||
           (e->modifiers() & Qt::ShiftModifier))
         setSelected(_current, !isSelected(_current));
       else {
         _selectionMode = Single;
         setSelected(_current, true);
         _selectionMode = Extended;
       }
     }
 
     if (_current && (e->key() == Qt::Key_Return))
       emit returnPressed(_current);
 
     return;
   }
 
   if (!_current) {
     if (e->key() == Qt::Key_Down) {
       setCurrent(_base, true);
     }
     return;
   }
 
   TreeMapItem* old = _current,  *newItem;
   TreeMapItem* p = _current->parent();
 
   bool goBack;
   if (_current->sorting(&goBack) == -1) {
     // noSorting
     goBack = false;
   }
 
 
   if ((e->key() == Qt::Key_Backspace) ||
       (e->key() == Qt::Key_Up)) {
     newItem = visibleItem(p);
     setCurrent(newItem, true);
   }
   else if (e->key() == Qt::Key_Left) {
     int newIdx = goBack ? nextVisible(_current) : prevVisible(_current);
     if (p && newIdx>=0) {
       p->setIndex(newIdx);
       setCurrent(p->children()->at(newIdx), true);
     }
   }
   else if (e->key() == Qt::Key_Right) {
     int newIdx = goBack ? prevVisible(_current) : nextVisible(_current);
     if (p && newIdx>=0) {
       p->setIndex(newIdx);
       setCurrent(p->children()->at(newIdx), true);
     }
   }
   else if (e->key() == Qt::Key_Down) {
     if (_current->children() && _current->children()->count()>0) {
       int newIdx = _current->index();
       if (newIdx<0)
         newIdx = goBack ? (_current->children()->count()-1) : 0;
       if (newIdx>=(int)_current->children()->count())
         newIdx = _current->children()->count()-1;
       newItem = visibleItem(_current->children()->at(newIdx));
       setCurrent(newItem, true);
     }
   }
 
   if (old == _current) return;
   if (! (e->modifiers() & Qt::ControlModifier)) return;
   if (! (e->modifiers() & Qt::ShiftModifier)) return;
 
   switch(_selectionMode) {
   case NoSelection:
     break;
   case Single:
     setSelected(_current, true);
     break;
   case Multi:
     setSelected(_current, !isSelected(_current));
     break;
   case Extended:
     if (e->modifiers() & Qt::ControlModifier)
       setSelected(_current, !isSelected(_current));
     else
       setSelected(_current, isSelected(old));
   }
 }
 
 void TreeMapWidget::fontChange( const QFont& )
 {
   redraw();
 }
 
 // react on tooltip events
 bool TreeMapWidget::event(QEvent *event)
 {
     if (event->type() == QEvent::ToolTip) {
     QHelpEvent *helpEvent = static_cast<QHelpEvent *>(event);
     TreeMapItem* i = item(helpEvent->pos().x(), helpEvent->pos().y());
     bool hasTip = false;
     if (i) {
         const QList<QRect>& rList = i->freeRects();
         foreach(const QRect& r, rList) {
         if (r.contains(helpEvent->pos())) {
             hasTip = true;
             break;
         }
         }
     }
     if (hasTip)
         QToolTip::showText(helpEvent->globalPos(), tipString(i));
     else
         QToolTip::hideText();
     }
     return QWidget::event(event);
 }
 
 void TreeMapWidget::paintEvent( QPaintEvent * )
 {
   drawTreeMap();
 }
 
 // Updates screen from shadow buffer,
 // but redraws before if needed
 void TreeMapWidget::drawTreeMap()
 {
   // no need to draw if hidden
   if (!isVisible()) return;
 
   if (_pixmap.size() != size())
     _needsRefresh = _base;
 
   if (_needsRefresh) {
 
     if (DEBUG_DRAWING)
       qDebug() << "Redrawing " << _needsRefresh->path(0).join("/");
 
     if (_needsRefresh == _base) {
       // redraw whole widget
       _pixmap = QPixmap(size());
       _pixmap.fill(palette().color(backgroundRole()));
     }
     QPainter p(&_pixmap);
     if (_needsRefresh == _base) {
       p.setPen(Qt::black);
       p.drawRect(QRect(2, 2, QWidget::width()-5, QWidget::height()-5));
       _base->setItemRect(QRect(3, 3, QWidget::width()-6, QWidget::height()-6));
     }
     else {
       // only subitem
       if (!_needsRefresh->itemRect().isValid()) return;
     }
 
     // reset cached font object; it could have been changed
     _font = font();
     _fontHeight = fontMetrics().height();
 
     drawItems(&p, _needsRefresh);
     _needsRefresh = 0;
   }
 
   QPainter p(this);
   p.drawPixmap(0, 0, _pixmap, 0, 0,
                QWidget::width(), QWidget::height());
 
   if (hasFocus()) {
     QStylePainter p(this);
     QStyleOptionFocusRect opt;
     opt.rect = rect();
     opt.palette = palette();
     opt.state = QStyle::State_None;
     p.drawPrimitive( QStyle::PE_FrameFocusRect, opt );
   }
 }
 
 
 
 void TreeMapWidget::redraw(TreeMapItem* i)
 {
   if (!i) return;
 
   if (!_needsRefresh)
     _needsRefresh = i;
   else {
     if (!i->isChildOf(_needsRefresh))
       _needsRefresh = _needsRefresh->commonParent(i);
   }
 
   if (isVisible()) {
     // delayed drawing if we have multiple redraw requests
     update();
   }
 }
 
 void TreeMapWidget::drawItem(QPainter* p,
                              TreeMapItem* item)
 {
     bool isSelected = false;
 
     if (_markNo>0) {
     for(TreeMapItem* i = item; i; i=i->parent()) {
         if (i->isMarked(_markNo)) {
         isSelected = true;
         break;
         }
     }
     }
     else {
     foreach(TreeMapItem* i, _tmpSelection) {
         if (item->isChildOf(i)) {
         isSelected = true;
         break;
         }
     }
     }
 
     bool isCurrent = _current && item->isChildOf(_current);
     int dd = item->depth();
     if (isTransparent(dd)) return;
 
     RectDrawing d(item->itemRect());
     item->setSelected(isSelected);
     item->setCurrent(isCurrent);
     item->setShaded(_shading);
     item->drawFrame(drawFrame(dd));
     d.drawBack(p, item);
 }
 
 
 bool TreeMapWidget::horizontal(TreeMapItem* i, const QRect& r)
 {
   switch(i->splitMode()) {
   case TreeMapItem::HAlternate:
     return (i->depth()%2)==1;
   case TreeMapItem::VAlternate:
     return (i->depth()%2)==0;
   case TreeMapItem::Horizontal:
     return true;
   case TreeMapItem::Vertical:
     return false;
   default:
     return r.width() > r.height();
   }
   return false;
 }
 
 
 void TreeMapWidget::drawItems(QPainter* p,
                               TreeMapItem* item)
 {
     if (DEBUG_DRAWING)
     qDebug() << "+drawItems(" << item->path(0).join("/") << ", "
           << item->itemRect().x() << "/" << item->itemRect().y()
           << "-" << item->itemRect().width() << "x"
           << item->itemRect().height() << "), Val " << item->value()
           << ", Sum " << item->sum();
 
   drawItem(p, item);
   item->clearFreeRects();
 
   QRect origRect = item->itemRect();
   int bw = item->borderWidth();
   QRect r = QRect(origRect.x()+bw, origRect.y()+bw,
                   origRect.width()-2*bw, origRect.height()-2*bw);
 
   TreeMapItemList* list = item->children();
 
   bool stopDrawing = false;
 
   // only subdivide if there are children
   if (!list || list->count()==0)
     stopDrawing = true;
 
   // only subdivide if there is enough space
   if (!stopDrawing && (r.width()<=0 || r.height()<=0))
     stopDrawing = true;
 
   // stop drawing if maximum depth is reached
   if (!stopDrawing &&
       (_maxDrawingDepth>=0 && item->depth()>=_maxDrawingDepth))
     stopDrawing = true;
 
   // stop drawing if stopAtText is reached
   if (!stopDrawing)
     for (int no=0;no<(int)_attr.size();no++) {
       QString stopAt = fieldStop(no);
       if (!stopAt.isEmpty() && (item->text(no) == stopAt)) {
         stopDrawing = true;
         break;
       }
     }
 
   // area size is checked later...
 #if 0
   // stop drawing if minimal area size is reached
   if (!stopDrawing &&
       (_minimalArea > 0) &&
       (r.width() * r.height() < _minimalArea)) stopDrawing = true;
 #endif
 
   if (stopDrawing) {
     if (list) {
       // invalidate rects
       foreach(TreeMapItem* i, *list)
         i->clearItemRect();
     }
     // tooltip appears on whole item rect
     item->addFreeRect(item->itemRect());
 
     // if we have space for text...
     if ((r.height() < _fontHeight) || (r.width() < _fontHeight)) return;
 
     RectDrawing d(r);
     item->setRotated(_allowRotation && (r.height() > r.width()));
     for (int no=0;no<(int)_attr.size();no++) {
       if (!fieldVisible(no)) continue;
       d.drawField(p, no, item);
     }
     r = d.remainingRect(item);
 
     if (DEBUG_DRAWING)
     qDebug() << "-drawItems(" << item->path(0).join("/") << ")";
     return;
   }
 
   double user_sum, child_sum, self;
 
   // user supplied sum
   user_sum = item->sum();
 
   // own sum
   child_sum = 0;
   foreach(TreeMapItem* i, *list) {
     child_sum += i->value();
     if (DEBUG_DRAWING)
       qDebug() << "  child: " << i->text(0) << ", value "
             << i->value();
   }
 
   QRect orig = r;
 
   // if we have space for text...
   if ((r.height() >= _fontHeight) && (r.width() >= _fontHeight)) {
 
     RectDrawing d(r);
     item->setRotated(_allowRotation && (r.height() > r.width()));
     for (int no=0;no<(int)_attr.size();no++) {
       if (!fieldVisible(no)) continue;
       if (!fieldForced(no)) continue;
       d.drawField(p, no, item);
     }
     r = d.remainingRect(item);
   }
 
   if (orig.x() == r.x()) {
     // Strings on top
     item->addFreeRect(QRect(orig.x(), orig.y(),
                 orig.width(), orig.height()-r.height()));
   }
   else {
     // Strings on the left
     item->addFreeRect(QRect(orig.x(), orig.y(),
                 orig.width()-r.width(), orig.height()));
   }
 
   if (user_sum == 0) {
     // user did not supply any sum
     user_sum = child_sum;
     self = 0;
   }
   else {
     self = user_sum - child_sum;
 
     if (user_sum < child_sum) {
       //qDebug() << "TreeMWidget " <<
       //       item->path() << ": User sum " << user_sum << " < Child Items sum " << child_sum;
 
       // invalid user supplied sum: ignore and use calculate sum
       user_sum = child_sum;
       self = 0.0;
     }
     else {
       // Try to put the border waste in self
       // percent of wasted space on border...
       float borderArea = origRect.width() * origRect.height();
       borderArea = (borderArea - r.width()*r.height())/borderArea;
       unsigned borderValue = (unsigned)(borderArea * user_sum);
 
       if (borderValue > self) {
         if (_skipIncorrectBorder) {
           r = origRect;
           // should add my self to nested self and set my self =0
         }
         else
           self = 0.0;
       }
       else
         self -= borderValue;
 
       user_sum = child_sum + self;
     }
   }
 
   bool rotate = (_allowRotation && (r.height() > r.width()));
   int self_length = (int)( ((rotate) ? r.width() : r.height()) *
                self / user_sum + .5);
   if (self_length > 0) {
     // take space for self cost
     QRect sr = r;
     if (rotate) {
       sr.setWidth( self_length );
       r.setRect(r.x()+sr.width(), r.y(), r.width()-sr.width(), r.height());
     }
     else {
       sr.setHeight( self_length );
       r.setRect(r.x(), r.y()+sr.height(), r.width(), r.height()-sr.height());
     }
 
     // set selfRect (not occupied by children) for tooltip
     item->addFreeRect(sr);
 
     if (0) qDebug() << "Item " << item->path(0).join("/") << ": SelfR "
              << sr.x() << "/" << sr.y() << "-" << sr.width()
              << "/" << sr.height() << ", self " << self << "/"
              << user_sum;
 
     if ((sr.height() >= _fontHeight) && (sr.width() >= _fontHeight)) {
 
       RectDrawing d(sr);
       item->setRotated(_allowRotation && (r.height() > r.width()));
       for (int no=0;no<(int)_attr.size();no++) {
     if (!fieldVisible(no)) continue;
     if (fieldForced(no)) continue;
     d.drawField(p, no, item);
       }
     }
 
     user_sum -= self;
   }
 
   bool goBack;
   if (item->sorting(&goBack) == -1) {
     // noSorting
     goBack = false;
   }
 
   int idx = goBack ? (list->size()-1) : 0;
 
   if (item->splitMode() == TreeMapItem::Columns) {
     int len = list->count();
     bool drawDetails = true;
 
     while (len>0 && user_sum>0) {
       int firstIdx = idx;
       double valSum = 0;
       int lenLeft = len;
       int columns = (int)(sqrt((double)len * r.width()/r.height())+.5);
       if (columns==0) columns = 1; //should never be needed
 
       while (lenLeft>0 && ((double)valSum*(len-lenLeft) <
                            (double)len*user_sum/columns/columns)) {
     valSum += list->at(idx)->value();
     if (goBack) --idx; else ++idx;
         lenLeft--;
       }
 
       // we always split horizontally
       int nextPos = (int)((double)r.width() * valSum / user_sum);
       QRect firstRect = QRect(r.x(), r.y(), nextPos, r.height());
 
       if (nextPos < _visibleWidth) {
       if (item->sorting(0) == -1) {
           // fill current rect with hash pattern
           drawFill(item, p, firstRect);
       }
       else {
           // fill rest with hash pattern
           drawFill(item, p, r, list, firstIdx, len, goBack);
           break;
       }
       }
       else {
         drawDetails = drawItemArray(p, item, firstRect,
                     valSum, list, firstIdx, len-lenLeft, goBack);
       }
       r.setRect(r.x()+nextPos, r.y(), r.width()-nextPos, r.height());
       user_sum -= valSum;
       len = lenLeft;
 
       if (!drawDetails) {
         if (item->sorting(0) == -1)
           drawDetails = true;
         else {
       drawFill(item, p, r, list, idx, len, goBack);
           break;
         }
       }
     }
   }
   else if (item->splitMode() == TreeMapItem::Rows) {
     int len = list->count();
     bool drawDetails = true;
 
     while (len>0 && user_sum>0) {
       int firstIdx = idx;
       double valSum = 0;
       int lenLeft = len;
       int rows = (int)(sqrt((double)len * r.height()/r.width())+.5);
       if (rows==0) rows = 1; //should never be needed
 
       while (lenLeft>0 && ((double)valSum*(len-lenLeft) <
                            (double)len*user_sum/rows/rows)) {
     valSum += list->at(idx)->value();
     if (goBack) --idx; else ++idx;
         lenLeft--;
       }
 
       // we always split horizontally
       int nextPos = (int)((double)r.height() * valSum / user_sum);
       QRect firstRect = QRect(r.x(), r.y(), r.width(), nextPos);
 
       if (nextPos < _visibleWidth) {
         if (item->sorting(0) == -1) {
         drawFill(item, p, firstRect);
         }
         else {
         drawFill(item, p, r, list, firstIdx, len, goBack);
         break;
         }
       }
       else {
         drawDetails = drawItemArray(p, item, firstRect,
                     valSum, list, firstIdx, len-lenLeft, goBack);
       }
       r.setRect(r.x(), r.y()+nextPos, r.width(), r.height()-nextPos);
       user_sum -= valSum;
       len = lenLeft;
 
       if (!drawDetails) {
         if (item->sorting(0) == -1)
           drawDetails = true;
         else {
       drawFill(item, p, r, list, idx, len, goBack);
           break;
         }
       }
     }
   }
   else
     drawItemArray(p, item, r, user_sum, list, idx, list->count(), goBack);
 
   if (DEBUG_DRAWING)
       qDebug() << "-drawItems(" << item->path(0).join("/") << ")";
 }
 
 // fills area with a pattern if to small to draw children
 void TreeMapWidget::drawFill(TreeMapItem* i, QPainter* p, const QRect& r)
 {
   p->setBrush(Qt::Dense4Pattern);
   p->setPen(Qt::NoPen);
   p->drawRect(QRect(r.x(), r.y(), r.width()-1, r.height()-1));
   i->addFreeRect(r);
 }
 
 // fills area with a pattern if to small to draw children
 void TreeMapWidget::drawFill(TreeMapItem* i, QPainter* p, const QRect& r,
                  TreeMapItemList* list, int idx, int len, bool goBack)
 {
   if (DEBUG_DRAWING)
       qDebug() << "  +drawFill(" << r.x() << "/" << r.y()
         << "-" << r.width() << "x" << r.height()
         << ", len " << len << ")";
 
   p->setBrush(Qt::Dense4Pattern);
   p->setPen(Qt::NoPen);
   p->drawRect(QRect(r.x(), r.y(), r.width()-1, r.height()-1));
   i->addFreeRect(r);
 
   // reset rects
   while (len>0 && (i=list->value(idx))) {
 
       if (DEBUG_DRAWING)
       qDebug() << "   Reset Rect " << i->path(0).join("/");
 
       i->clearItemRect();
       if (goBack) --idx; else ++idx;
       len--;
   }
   if (DEBUG_DRAWING)
       qDebug() << "  -drawFill(" << r.x() << "/" << r.y()
         << "-" << r.width() << "x" << r.height()
         << ", len " << len << ")";
 }
 
 // returns false if rect gets to small
 bool TreeMapWidget::drawItemArray(QPainter* p, TreeMapItem* item,
                                   const QRect& r, double user_sum,
                   TreeMapItemList* list, int idx, int len,
                   bool goBack)
 {
   if (user_sum == 0) return false;
 
   static bool b2t = true;
 
   // stop recursive bisection for small rectangles
   if (((r.height() < _visibleWidth) &&
        (r.width() < _visibleWidth)) ||
       ((_minimalArea > 0) &&
        (r.width() * r.height() < _minimalArea))) {
 
     drawFill(item, p, r, list, idx, len, goBack);
     return false;
   }
 
   if (DEBUG_DRAWING)
       qDebug() << " +drawItemArray(" << item->path(0).join("/")
         << ", " << r.x() << "/" << r.y() << "-" << r.width()
         << "x" << r.height() << ")";
 
   if (len>2 && (item->splitMode() == TreeMapItem::Bisection)) {
 
     int firstIdx = idx;
     double valSum = 0;
     int lenLeft = len;
     //while (lenLeft>0 && valSum<user_sum/2) {
     while (lenLeft>len/2) {
       valSum += list->at(idx)->value();
       if (goBack) --idx; else ++idx;
       lenLeft--;
     }
 
     // draw first half...
     bool drawOn;
     QRect secondRect;
 
     if (r.width() > r.height()) {
       int halfPos = (int)((double)r.width() * valSum / user_sum);
       QRect firstRect = QRect(r.x(), r.y(), halfPos, r.height());
       drawOn = drawItemArray(p, item, firstRect,
                  valSum, list, firstIdx, len-lenLeft, goBack);
       secondRect.setRect(r.x()+halfPos, r.y(), r.width()-halfPos, r.height());
     }
     else {
       int halfPos = (int)((double)r.height() * valSum / user_sum);
       QRect firstRect = QRect(r.x(), r.y(), r.width(), halfPos);
       drawOn = drawItemArray(p, item, firstRect,
                  valSum, list, firstIdx, len-lenLeft, goBack);
       secondRect.setRect(r.x(), r.y()+halfPos, r.width(), r.height()-halfPos);
     }
 
     // if no sorting, do not stop drawing
     if (item->sorting(0) == -1) drawOn = true;
 
     // second half
     if (drawOn)
       drawOn = drawItemArray(p, item, secondRect, user_sum - valSum,
                  list, idx, lenLeft, goBack);
     else {
       drawFill(item, p, secondRect, list, idx, len, goBack);
     }
 
     if (DEBUG_DRAWING)
     qDebug() << " -drawItemArray(" << item->path(0).join("/")
           << ")";
 
     return drawOn;
   }
 
   bool hor = horizontal(item,r);
 
   TreeMapItem* i;
   QRect fullRect = r;
   while (len>0) {
     i = list->at(idx);
     if (user_sum <= 0) {
 
       if (DEBUG_DRAWING)
       qDebug() << "drawItemArray: Reset " << i->path(0).join("/");
 
       i->clearItemRect();
       if (goBack) --idx; else ++idx;
       len--;
       continue;
     }
 
     // stop drawing for small rectangles
     if (((fullRect.height() < _visibleWidth) &&
          (fullRect.width() < _visibleWidth)) ||
         ((_minimalArea > 0) &&
          (fullRect.width() * fullRect.height() < _minimalArea))) {
 
       drawFill(item, p, fullRect, list, idx, len, goBack);
       if (DEBUG_DRAWING)
       qDebug() << " -drawItemArray(" << item->path(0).join("/")
             << "): Stop";
       return false;
     }
 
     if (i->splitMode() == TreeMapItem::AlwaysBest)
       hor = fullRect.width() > fullRect.height();
 
     int lastPos = hor ? fullRect.width() : fullRect.height();
     double val = i->value();
     int nextPos = (user_sum <= 0.0) ? 0: (int)(lastPos * val / user_sum +.5);
     if (nextPos>lastPos) nextPos = lastPos;
 
     if ((item->sorting(0) != -1) && (nextPos < _visibleWidth)) {
       drawFill(item, p, fullRect, list, idx, len, goBack);
       if (DEBUG_DRAWING)
       qDebug() << " -drawItemArray(" << item->path(0).join("/")
             << "): Stop";
       return false;
     }
 
     QRect currRect = fullRect;
 
     if (hor)
       currRect.setWidth(nextPos);
     else {
       if (b2t)
         currRect.setRect(fullRect.x(), fullRect.bottom()-nextPos+1, fullRect.width(), nextPos);
       else
         currRect.setHeight(nextPos);
     }
 
     // do not draw very small rectangles:
     if (nextPos >= _visibleWidth) {
     i->setItemRect(currRect);
     drawItems(p, i);
     }
     else {
     i->clearItemRect();
     drawFill(item, p, currRect);
     }
 
     // draw Separator
     if (_drawSeparators && (nextPos<lastPos)) {
       p->setPen(Qt::black);
       if (hor) {
         if (fullRect.top() <= fullRect.bottom())
           p->drawLine(fullRect.x() + nextPos, fullRect.top(), fullRect.x() + nextPos, fullRect.bottom());
       }
       else {
         if (fullRect.left() <= fullRect.right())
         p->drawLine(fullRect.left(), fullRect.y() + nextPos, fullRect.right(), fullRect.y() + nextPos);
       }
       nextPos++;
     }
 
     if (hor)
     fullRect.setRect(fullRect.x() + nextPos, fullRect.y(),
                      lastPos - nextPos, fullRect.height());
     else {
     if (b2t)
         fullRect.setRect(fullRect.x(), fullRect.y(),
                  fullRect.width(), lastPos-nextPos);
     else
         fullRect.setRect(fullRect.x(), fullRect.y() + nextPos,
                  fullRect.width(), lastPos-nextPos);
     }
 
     user_sum -= val;
     if (goBack) --idx; else ++idx;
     len--;
   }
 
   if (DEBUG_DRAWING)
       qDebug() << " -drawItemArray(" << item->path(0).join("/")
         << "): Continue";
 
   return true;
 }
 
 
 /*----------------------------------------------------------------
  * Popup menus for option setting
  */
 
 void TreeMapWidget::splitActivated(QAction* a)
 {
     setSplitMode( (TreeMapItem::SplitMode) a->data().toInt());
 }
 
 void TreeMapWidget::addSplitAction(QMenu* m, const QString& s, int v)
 {
     QAction* a = m->addAction(s);
     a->setData(v);
     a->setCheckable(true);
     a->setChecked(splitMode() == v);
 }
 
 void TreeMapWidget::addSplitDirectionItems(QMenu* m)
 {
     connect(m, SIGNAL(triggered(QAction*)),
         this, SLOT(splitActivated(QAction*)) );
 
     addSplitAction(m, tr("Recursive Bisection"), TreeMapItem::Bisection);
     addSplitAction(m, tr("Columns"), TreeMapItem::Columns);
     addSplitAction(m, tr("Rows"), TreeMapItem::Rows);
     addSplitAction(m, tr("Always Best"), TreeMapItem::AlwaysBest);
     addSplitAction(m, tr("Best"), TreeMapItem::Best);
     addSplitAction(m, tr("Alternate (V)"), TreeMapItem::VAlternate);
     addSplitAction(m, tr("Alternate (H)"), TreeMapItem::HAlternate);
     addSplitAction(m, tr("Horizontal"), TreeMapItem::Horizontal);
     addSplitAction(m, tr("Vertical"), TreeMapItem::Vertical);
 }
 
 
 #include "treemap.moc"
KDE's Doxygen guidelines are available online.
kcachegrind

kcachegrind

kdesdk API Reference

Search
