You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
136 lines
2.8 KiB
136 lines
2.8 KiB
15 years ago
|
/****************************************************************************
|
||
|
** $Id$
|
||
|
**
|
||
|
** Implementing your own layout: flow example
|
||
|
**
|
||
|
** Copyright (C) 1996 by Trolltech AS. All rights reserved.
|
||
|
**
|
||
|
** This file is part of an example program for Qt. This example
|
||
|
** program may be used, distributed and modified without limitation.
|
||
|
**
|
||
|
*****************************************************************************/
|
||
|
|
||
|
#include "flow.h"
|
||
|
|
||
|
class SimpleFlowIterator :public QGLayoutIterator
|
||
|
{
|
||
|
public:
|
||
|
SimpleFlowIterator( QPtrList<QLayoutItem> *l ) :idx(0), list(l) {}
|
||
|
uint count() const;
|
||
|
QLayoutItem *current();
|
||
|
QLayoutItem *next();
|
||
|
QLayoutItem *takeCurrent();
|
||
|
|
||
|
private:
|
||
|
int idx;
|
||
|
QPtrList<QLayoutItem> *list;
|
||
|
|
||
|
};
|
||
|
|
||
|
uint SimpleFlowIterator::count() const
|
||
|
{
|
||
|
return list->count();
|
||
|
}
|
||
|
|
||
|
QLayoutItem *SimpleFlowIterator::current()
|
||
|
{
|
||
|
return idx < int(count()) ? list->at(idx) : 0;
|
||
|
}
|
||
|
|
||
|
QLayoutItem *SimpleFlowIterator::next()
|
||
|
{
|
||
|
idx++; return current();
|
||
|
}
|
||
|
|
||
|
QLayoutItem *SimpleFlowIterator::takeCurrent()
|
||
|
{
|
||
|
return idx < int(count()) ? list->take( idx ) : 0;
|
||
|
}
|
||
|
|
||
|
SimpleFlow::~SimpleFlow()
|
||
|
{
|
||
|
deleteAllItems();
|
||
|
}
|
||
|
|
||
|
|
||
|
int SimpleFlow::heightForWidth( int w ) const
|
||
|
{
|
||
|
if ( cached_width != w ) {
|
||
|
//Not all C++ compilers support "mutable" yet:
|
||
|
SimpleFlow * mthis = (SimpleFlow*)this;
|
||
|
int h = mthis->doLayout( QRect(0,0,w,0), TRUE );
|
||
|
mthis->cached_hfw = h;
|
||
|
mthis->cached_width = w;
|
||
|
return h;
|
||
|
}
|
||
|
return cached_hfw;
|
||
|
}
|
||
|
|
||
|
void SimpleFlow::addItem( QLayoutItem *item)
|
||
|
{
|
||
|
list.append( item );
|
||
|
}
|
||
|
|
||
|
bool SimpleFlow::hasHeightForWidth() const
|
||
|
{
|
||
|
return TRUE;
|
||
|
}
|
||
|
|
||
|
QSize SimpleFlow::sizeHint() const
|
||
|
{
|
||
|
return minimumSize();
|
||
|
}
|
||
|
|
||
|
QSizePolicy::ExpandData SimpleFlow::expanding() const
|
||
|
{
|
||
|
return QSizePolicy::NoDirection;
|
||
|
}
|
||
|
|
||
|
QLayoutIterator SimpleFlow::iterator()
|
||
|
{
|
||
|
return QLayoutIterator( new SimpleFlowIterator( &list ) );
|
||
|
}
|
||
|
|
||
|
void SimpleFlow::setGeometry( const QRect &r )
|
||
|
{
|
||
|
QLayout::setGeometry( r );
|
||
|
doLayout( r );
|
||
|
}
|
||
|
|
||
|
int SimpleFlow::doLayout( const QRect &r, bool testonly )
|
||
|
{
|
||
|
int x = r.x();
|
||
|
int y = r.y();
|
||
|
int h = 0; //height of this line so far.
|
||
|
QPtrListIterator<QLayoutItem> it(list);
|
||
|
QLayoutItem *o;
|
||
|
while ( (o=it.current()) != 0 ) {
|
||
|
++it;
|
||
|
int nextX = x + o->sizeHint().width() + spacing();
|
||
|
if ( nextX - spacing() > r.right() && h > 0 ) {
|
||
|
x = r.x();
|
||
|
y = y + h + spacing();
|
||
|
nextX = x + o->sizeHint().width() + spacing();
|
||
|
h = 0;
|
||
|
}
|
||
|
if ( !testonly )
|
||
|
o->setGeometry( QRect( QPoint( x, y ), o->sizeHint() ) );
|
||
|
x = nextX;
|
||
|
h = QMAX( h, o->sizeHint().height() );
|
||
|
}
|
||
|
return y + h - r.y();
|
||
|
}
|
||
|
|
||
|
QSize SimpleFlow::minimumSize() const
|
||
|
{
|
||
|
QSize s(0,0);
|
||
|
QPtrListIterator<QLayoutItem> it(list);
|
||
|
QLayoutItem *o;
|
||
|
while ( (o=it.current()) != 0 ) {
|
||
|
++it;
|
||
|
s = s.expandedTo( o->minimumSize() );
|
||
|
}
|
||
|
return s;
|
||
|
}
|
||
|
|