insilmaril@725: #include <QtGui>
insilmaril@725: 
insilmaril@788: #include "attributeitem.h"
insilmaril@750: #include "branchitem.h"
insilmaril@788: #include "imageitem.h"
insilmaril@725: #include "treeitem.h"
insilmaril@725: #include "treemodel.h"
insilmaril@790: #include "xlinkitem.h"
insilmaril@725: 
insilmaril@725: TreeModel::TreeModel(QObject *parent)
insilmaril@725:     : QAbstractItemModel(parent)
insilmaril@725: {
insilmaril@725:     QList<QVariant> rootData;
insilmaril@790:     rootData << "Heading" << "Type";
insilmaril@791:     rootItem = new BranchItem(rootData);
insilmaril@725: }
insilmaril@725: 
insilmaril@725: TreeModel::~TreeModel()
insilmaril@725: {
insilmaril@847: 	//qDebug()<<"Destr TreeModel  this="<<this;
insilmaril@725:     delete rootItem;
insilmaril@725: }
insilmaril@725: 
insilmaril@725: QVariant TreeModel::data(const QModelIndex &index, int role) const
insilmaril@725: {
insilmaril@725:     if (!index.isValid())
insilmaril@725:         return QVariant();
insilmaril@725: 
insilmaril@848:     TreeItem *item = getItem (index);
insilmaril@848: 
insilmaril@725:     if (role != Qt::DisplayRole)
insilmaril@848: 	{
insilmaril@848: 		if (role == Qt::ForegroundRole ) 
insilmaril@848: 			return item->getHeadingColor();
insilmaril@848: 		return QVariant();
insilmaril@848: 	}	
insilmaril@725: 
insilmaril@725: 
insilmaril@725:     return item->data(index.column());
insilmaril@725: }
insilmaril@725: 
insilmaril@725: Qt::ItemFlags TreeModel::flags(const QModelIndex &index) const
insilmaril@725: {
insilmaril@725:     if (!index.isValid())
insilmaril@791:         return Qt::NoItemFlags;
insilmaril@725: 
insilmaril@725:     return Qt::ItemIsEnabled | Qt::ItemIsSelectable;
insilmaril@725: }
insilmaril@725: 
insilmaril@725: QVariant TreeModel::headerData(int section, Qt::Orientation orientation,
insilmaril@725:                                int role) const
insilmaril@725: {
insilmaril@725:     if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
insilmaril@725:         return rootItem->data(section);
insilmaril@725: 
insilmaril@725:     return QVariant();
insilmaril@725: }
insilmaril@725: 
insilmaril@788: QModelIndex TreeModel::index (TreeItem* ti)
insilmaril@788: {
insilmaril@788: 	if (!ti->parent())
insilmaril@788: 		return QModelIndex();
insilmaril@788: 	else	
insilmaril@791: 		return createIndex (ti->row(),0,ti);
insilmaril@788: }
insilmaril@788: 
insilmaril@725: QModelIndex TreeModel::index(int row, int column, const QModelIndex &parent)
insilmaril@725:             const
insilmaril@725: {
insilmaril@791: 	// Make sure to return invalid index for invalid values (see modeltest)
insilmaril@791: 	if (row<0 || column<0) return QModelIndex();
insilmaril@791: 	if (column!=0) return QModelIndex();
insilmaril@791: 
insilmaril@725:     TreeItem *parentItem;
insilmaril@725: 
insilmaril@725:     if (!parent.isValid())
insilmaril@791: 	{
insilmaril@725:         parentItem = rootItem;
insilmaril@788: 		/*
insilmaril@788: 		cout << "TM::index()  no parent?! xxx\n";
insilmaril@788: 		cout << "   row="<<row<<"  col="<<column<<endl;
insilmaril@788: 		cout << "   parent.internal="<< parent.internalPointer()<<endl;
insilmaril@788: 		*/
insilmaril@788: 		// Somehow index is requested where parentIndex is invalid.
insilmaril@788: 		// what's happening here...?
insilmaril@788: 		// Check if Qt examples also return index of rootIem then...
insilmaril@788: 
insilmaril@788: 	}	
insilmaril@725:     else
insilmaril@745:         parentItem = getItem (parent);
insilmaril@725: 
insilmaril@725:     TreeItem *childItem = parentItem->child(row);
insilmaril@791: 	//cout << "TM::index  parentItem="<<parentItem<<"  childItem="<<childItem<<"  row="<<row<<" col="<<column<<endl;
insilmaril@725:     if (childItem)
insilmaril@725:         return createIndex(row, column, childItem);
insilmaril@725:     else
insilmaril@725:         return QModelIndex();
insilmaril@725: }
insilmaril@725: 
insilmaril@725: QModelIndex TreeModel::parent(const QModelIndex &index) const
insilmaril@725: {
insilmaril@725:     if (!index.isValid())
insilmaril@725:         return QModelIndex();
insilmaril@725: 
insilmaril@788: 	//FIXME-3 cout << "TM::parent  ri="<<rootItem<< "  row="<<index.row()<<"  col="<<index.column()<<endl;
insilmaril@745:     TreeItem *ti= getItem (index);
insilmaril@788: 	//cout << "            ti="<<ti<<endl;
insilmaril@788: 	//cout << "               "<<ti->getHeadingStd()<<endl;
insilmaril@745:     TreeItem *parentItem = ti->parent();
insilmaril@788: 	//cout << "            pi="<<parentItem<<endl;
insilmaril@725: 
insilmaril@745: 	//cout << "TreeModel::parent  ti="<<ti<<" "<<ti->getHeading().toStdString()<<"  pi="<<parentItem<<"  "<<endl;
insilmaril@725:     if (parentItem == rootItem)
insilmaril@725:         return QModelIndex();
insilmaril@725: 
insilmaril@791: /*
insilmaril@745: 	if (!parentItem)
insilmaril@746:         return QModelIndex();	// FIXME-3 do this to avoid segfault, but why?
insilmaril@746: 		                        // see also my question on qt-interest in march
insilmaril@791: */
insilmaril@745:     return createIndex(parentItem->childNumber(), 0, parentItem);
insilmaril@725: }
insilmaril@725: 
insilmaril@725: int TreeModel::rowCount(const QModelIndex &parent) const
insilmaril@725: {
insilmaril@725:     TreeItem *parentItem;
insilmaril@725: 
insilmaril@725:     if (!parent.isValid())
insilmaril@725:         parentItem = rootItem;
insilmaril@725:     else
insilmaril@745:         parentItem = getItem (parent);
insilmaril@725: 
insilmaril@725:     return parentItem->childCount();
insilmaril@725: }
insilmaril@725: 
insilmaril@741: int TreeModel::columnCount(const QModelIndex &parent) const
insilmaril@726: {
insilmaril@791: 	int c;
insilmaril@741:     if (parent.isValid())
insilmaril@791: 	{
insilmaril@791:         c= getItem (parent)->columnCount();
insilmaril@791: 		//cout << "TM::colCount  c="<<c<<"  parent="<<getItem (parent)<<endl;	
insilmaril@791: 	}
insilmaril@741:     else
insilmaril@791: 	{
insilmaril@791:         c= rootItem->columnCount();
insilmaril@791: 		//cout << "TM::colCount  c="<<c<<"  parent=invalid"<<endl;	
insilmaril@791: 	}
insilmaril@791: 	return c;
insilmaril@726: }
insilmaril@726: 
insilmaril@804: BranchItem* TreeModel::nextBranch (BranchItem* &current, BranchItem* &previous, bool deepLevelsFirst, BranchItem *start)	
insilmaril@741: {
insilmaril@741: 	// Walk through map beginning at current with previous==0
insilmaril@741: 	// Start at root, if current==NULL
insilmaril@750: 	if (!current) current=(BranchItem*)rootItem;
insilmaril@741: 
insilmaril@741: 	// Are we just beginning to walk the map?
insilmaril@741: 	if (!previous)
insilmaril@741: 	{
insilmaril@773: 		if (!start) start=current;
insilmaril@741: 		previous=current;
insilmaril@741: 		current=current->getFirstBranch();
insilmaril@741: 		return current;
insilmaril@741: 	}
insilmaril@804: 	if (deepLevelsFirst)
insilmaril@804: 	{
insilmaril@804: 		// Going up or down (deeper)?
insilmaril@804: 		if (current->depth() > previous->depth() )
insilmaril@804: 		{	
insilmaril@804: 			// Coming from above
insilmaril@804: 			// Trying  to go down deeper
insilmaril@804: 			if (current->branchCount() >0 )
insilmaril@804: 			{
insilmaril@804: 				previous=current;
insilmaril@804: 				current=current->getFirstBranch();
insilmaril@804: 				return current;
insilmaril@804: 			}	
insilmaril@804: 			// turn around and go up again
insilmaril@804: 			BranchItem *bi=current;
insilmaril@804: 			current=previous;
insilmaril@804: 			previous=bi;
insilmaril@804: 		}	
insilmaril@741: 
insilmaril@804: 		// Coming from below
insilmaril@804: 		// Trying to go down again to siblings
insilmaril@804: 
insilmaril@804: 		BranchItem *sibling=current->getBranchNum (previous->num()+1);
insilmaril@804: 
insilmaril@804: 		if (sibling)
insilmaril@804: 		{	
insilmaril@804: 			// Found sibling of previous, go there
insilmaril@741: 			previous=current;
insilmaril@804: 			current=sibling;
insilmaril@741: 			return current;
insilmaril@804: 		} 
insilmaril@741: 
insilmaril@804: 		// If we only needed to go through subtree, we are done now
insilmaril@804: 		if (start==current) return NULL;
insilmaril@741: 
insilmaril@804: 		// Go up and try to find siblings of current
insilmaril@804: 		previous=current;
insilmaril@804: 		current=(BranchItem*)current->parent();
insilmaril@741: 
insilmaril@804: 		// Check if we still can go somewhere
insilmaril@804: 		if (!current) return current;
insilmaril@804: 		
insilmaril@804: 		while (current && current->depth() < previous->depth() )
insilmaril@804: 			current=nextBranch (current,previous,true,start);
insilmaril@804: 			
insilmaril@741: 		return current;
insilmaril@741: 
insilmaril@804: 	} else
insilmaril@804: 	{
insilmaril@804: /*FIXME-3
insilmaril@804: 		cout << "TM::nextBranch shallow\n"; 
insilmaril@804: 		std::string ch="()"; if (current) ch=current->getHeadingStd();
insilmaril@804: 		std::string ph="()"; if (previous) ph=previous->getHeadingStd();
insilmaril@804: 		cout << "  cur="<<ch << " prev="<<ph<<endl;
insilmaril@804: */
insilmaril@773: 
insilmaril@804: 		// Try to find sibling with same depth
insilmaril@804: 		BranchItem *sibling=current->parent()->getBranchNum (current->num()+1);
insilmaril@804: 		if (sibling)
insilmaril@804: 		{	
insilmaril@804: 			// Found sibling of previous, go there
insilmaril@804: 			previous=current;
insilmaril@804: 			current=sibling;
insilmaril@804: 			return current;
insilmaril@804: 		}  else
insilmaril@804: 		{	
insilmaril@804: 			// Try to find next branch with same depth or greater
insilmaril@804: 			
insilmaril@741: 
insilmaril@804: 			current=NULL;
insilmaril@804: 			return current;
insilmaril@804: 		}
insilmaril@804: 
insilmaril@804: 
insilmaril@804: 		/*
insilmaril@804: 	while (ix.isValid())
insilmaril@804: 	{
insilmaril@804: 		TreeItem *ti=model->getItem (ix);
insilmaril@804: 		cout << "  level="<<level<<"  ix=";
insilmaril@804: 		if (ti) cout << ti->getHeadingStd();
insilmaril@804: 		row=ix.row();
insilmaril@804: 		col=ix.column();
insilmaril@804: 		if (! treeEditor->isExpanded(ix))
insilmaril@804: 			cout <<"  expand!";
insilmaril@804: 		else	
insilmaril@804: 			cout <<"  is expanded.";
insilmaril@804: 		cout <<endl;
insilmaril@804: 		ix=ix.sibling(row+1,col);
insilmaril@804: 	}
insilmaril@804: 	*/
insilmaril@804: 
insilmaril@804: 	}
insilmaril@741: }
insilmaril@741: 
insilmaril@727: bool TreeModel::removeRows ( int row, int count, const QModelIndex & parent)
insilmaril@727: {
insilmaril@727: 	int last=row+count-1;
insilmaril@794:     TreeItem *pi;
insilmaril@794: 	if (parent.isValid())
insilmaril@794: 		pi=getItem (parent);
insilmaril@794: 	else
insilmaril@794: 		pi=rootItem;
insilmaril@755: 	TreeItem *ti;
insilmaril@727: 
insilmaril@795: 	//cout << "TM::removeRows  pi="<<pi<<"  row="<<row<<"  count="<<count<<endl;
insilmaril@727: 	for (int i=row; i<=last; i++)
insilmaril@727: 	{
insilmaril@755: 		ti=pi->getChildNum (row);
insilmaril@755: 		pi->removeChild (row);	// does not delete object!
insilmaril@791: 		delete ti;
insilmaril@727: 	}
insilmaril@745: 	return true;
insilmaril@745: }
insilmaril@727: 
insilmaril@745: TreeItem *TreeModel::getItem(const QModelIndex &index) const
insilmaril@745: {
insilmaril@745:     if (index.isValid()) {
insilmaril@745: 		TreeItem *item = static_cast<TreeItem*>(index.internalPointer());
insilmaril@745:         if (item) return item;
insilmaril@745:     }
insilmaril@791:     return NULL;
insilmaril@727: }
insilmaril@727: 
insilmaril@793: BranchItem *TreeModel::getRootItem()
insilmaril@754: {
insilmaril@754: 	return rootItem;
insilmaril@754: }
insilmaril@754: