1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385
|
/* massXpert - the true massist's program.
--------------------------------------
Copyright(C) 2006,2007 Filippo Rusconi
http://www.massxpert.org/massXpert
This file is part of the massXpert project.
The massxpert project is the successor to the "GNU polyxmass"
project that is an official GNU project package(see
www.gnu.org). The massXpert project is not endorsed by the GNU
project, although it is released ---in its entirety--- under the
GNU General Public License. A huge part of the code in massXpert
is actually a C++ rewrite of code in GNU polyxmass. As such
massXpert was started at the Centre National de la Recherche
Scientifique(FRANCE), that granted me the formal authorization to
publish it under this Free Software License.
This software is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License version 3, as published by the Free Software Foundation.
This software 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 software; if not, write to the
Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/////////////////////// Local includes
#include "massSearchOligomerTreeViewModel.hpp"
#include "massSearchOligomerTreeViewItem.hpp"
#include "application.hpp"
namespace massXpert
{
MassSearchOligomerTreeViewModel::MassSearchOligomerTreeViewModel
(QList <Oligomer *> *dataList, QObject *parent)
: QAbstractItemModel(parent)
{
QList<QVariant> rootData;
Q_ASSERT(dataList);
Q_ASSERT(parent);
mp_parentDlg = static_cast<MassSearchDlg *>(parent);
rootData << tr("Searched") << tr("Name") << tr("Coordinates")
<< tr("Error")
<< tr("Mono") << tr("Avg") << tr("Modif");
mpa_rootItem = new MassSearchOligomerTreeViewItem(rootData);
mp_list = dataList;
setupModelData(mpa_rootItem);
}
MassSearchOligomerTreeViewModel::~MassSearchOligomerTreeViewModel()
{
delete mpa_rootItem;
}
MassSearchDlg *
MassSearchOligomerTreeViewModel::getParentDlg()
{
return mp_parentDlg;
}
void
MassSearchOligomerTreeViewModel::setTreeView(QTreeView *treeView)
{
Q_ASSERT(treeView);
mp_treeView = treeView;
}
QTreeView *
MassSearchOligomerTreeViewModel::treeView()
{
return mp_treeView;
}
QVariant
MassSearchOligomerTreeViewModel::data(const QModelIndex &index,
int role) const
{
if (!index.isValid())
return QVariant();
if (role != Qt::DisplayRole)
return QVariant();
MassSearchOligomerTreeViewItem *item =
static_cast<MassSearchOligomerTreeViewItem *>(index.internalPointer());
return item->data(index.column());
}
// bool
// MassSearchOligomerTreeViewModel::setData(const QModelIndex & index,
// const QVariant & value,
// int role)
// {
// return true;
// }
QVariant
MassSearchOligomerTreeViewModel::headerData(int section,
Qt::Orientation orientation,
int role) const
{
if (orientation == Qt::Horizontal && role == Qt::DisplayRole)
return mpa_rootItem->data(section);
return QVariant();
}
Qt::ItemFlags
MassSearchOligomerTreeViewModel::flags(const QModelIndex &index) const
{
if (!index.isValid())
return Qt::ItemIsEnabled;
return Qt::ItemIsEnabled | Qt::ItemIsSelectable;
}
QModelIndex
MassSearchOligomerTreeViewModel::index(int row, int column,
const QModelIndex &parent) const
{
MassSearchOligomerTreeViewItem *parentItem = 0;
if (!parent.isValid())
parentItem = mpa_rootItem;
else
parentItem =
static_cast<MassSearchOligomerTreeViewItem *>
(parent.internalPointer());
MassSearchOligomerTreeViewItem *childItem = parentItem->child(row);
if (childItem != 0)
return createIndex(row, column, childItem);
else
return QModelIndex();
}
QModelIndex
MassSearchOligomerTreeViewModel::parent(const QModelIndex &index) const
{
if (!index.isValid())
return QModelIndex();
MassSearchOligomerTreeViewItem *childItem =
static_cast<MassSearchOligomerTreeViewItem *>(index.internalPointer());
MassSearchOligomerTreeViewItem *parentItem = childItem->parent();
if (parentItem == mpa_rootItem)
return QModelIndex();
return createIndex(parentItem->row(), 0, parentItem);
}
int
MassSearchOligomerTreeViewModel::rowCount(const QModelIndex &parent) const
{
MassSearchOligomerTreeViewItem *parentItem;
if (!parent.isValid())
parentItem = mpa_rootItem;
else
parentItem =
static_cast<MassSearchOligomerTreeViewItem *>
(parent.internalPointer());
return parentItem->childCount();
}
int
MassSearchOligomerTreeViewModel::columnCount(const QModelIndex &parent) const
{
if (parent.isValid())
return static_cast<MassSearchOligomerTreeViewItem *>
(parent.internalPointer())->columnCount();
else
return mpa_rootItem->columnCount();
}
void
MassSearchOligomerTreeViewModel::removeAll()
{
int count = rowCount();
// qDebug() << __FILE__ << __LINE__
// << "count items:" << count;
if (!count)
return;
// On WinXP , the following beginRemoveRows crashes when count is 0,
// because last>=first fails, due to having count-1 < than 0. This
// is why we return immediately when count is 0.
beginRemoveRows(QModelIndex(), 0, count - 1);
while(!mp_list->isEmpty())
{
delete(mp_list->takeFirst());
delete(mpa_rootItem->takeChild(0));
}
endRemoveRows();
emit layoutChanged();
}
void
MassSearchOligomerTreeViewModel::addOligomer(Oligomer *oligomer)
{
Q_ASSERT(oligomer);
Application *application = static_cast<Application *>(qApp);
QLocale locale = application->locale();
QList<QVariant> columnData;
Prop *prop = oligomer->prop("SEARCHED_MZ");
Q_ASSERT(prop);
double value = 0;
value = *static_cast<const double *>(prop->data());
QString mzSearched = locale.toString(value, 'f', MXP_OLIGOMER_DEC_PLACES);
prop = oligomer->prop("ERROR_MZ");
Q_ASSERT(prop);
value = *static_cast<const double *>(prop->data());
QString mzError = locale.toString(value, 'f', MXP_OLIGOMER_DEC_PLACES);
QString coordinates(QString("[%1-%2]")
.arg(oligomer->startIndex() + 1)
.arg(oligomer->endIndex() + 1));
// And now convert the masses from double to string, so
// that we can use our conversion system.
QString mono = oligomer->mono(locale, MXP_OLIGOMER_DEC_PLACES);
// locale.toString(oligomer->mono(), 'f', 5);
QString avg = oligomer->avg(locale, MXP_OLIGOMER_DEC_PLACES);
// locale.toString(oligomer->avg(), 'f', 5);
columnData
<< mzSearched << oligomer->name()
<< coordinates << mzError
<< mono << avg
<< oligomer->isModified();
mp_list->append(oligomer);
// Create an item with those columnar strings. The parent of the
// current item is the root item.
MassSearchOligomerTreeViewItem *newItem =
new MassSearchOligomerTreeViewItem(columnData, mpa_rootItem);
newItem->setOligomer(oligomer);
int newRow = rowCount();
mpa_rootItem->appendChild(newItem);
// There is no need to produce a model index for the parent, as we
// know we are going to insert new row in the root of the tree(this
// tree has no branches). Hence the QModelIndex() calls below.
beginInsertRows(QModelIndex(), newRow, newRow);
insertRow(newRow, QModelIndex());
endInsertRows();
emit layoutChanged();
}
bool
MassSearchOligomerTreeViewModel::setupModelData
(MassSearchOligomerTreeViewItem *parent)
{
Application *application = static_cast<Application *>(qApp);
QLocale locale = application->locale();
QList<MassSearchOligomerTreeViewItem *> parents;
MassSearchOligomerTreeViewItem *currentItem = 0;
Q_ASSERT(parent);
// Start with populating the very first item of the treeviewmodel.
parents << parent;
// We have the mp_list pointer that points to a QList<Oligomer*>
// list.
for (int iter = 0; iter < mp_list->size(); ++iter)
{
Oligomer *oligomer = mp_list->at(iter);
QList<QVariant> columnData;
Prop *prop = oligomer->prop("SEARCHED_MZ");
Q_ASSERT(prop);
double value = 0;
value = *static_cast<const double *>(prop->data());
QString mzSearched =
locale.toString(value, 'f', MXP_OLIGOMER_DEC_PLACES);
prop = oligomer->prop("ERROR_MZ");
Q_ASSERT(prop);
value = *static_cast<const double *>(prop->data());
QString mzError =
locale.toString(value, 'f', MXP_OLIGOMER_DEC_PLACES);
QString coordinates(QString("[%1-%2]")
.arg(oligomer->startIndex() + 1)
.arg(oligomer->endIndex() + 1));
// And now convert the masses from double to string, so
// that we can use our conversion system.
QString mono = oligomer->mono(locale, MXP_OLIGOMER_DEC_PLACES);
// locale.toString(oligomer->mono(), 'f', 5);
QString avg = oligomer->avg(locale, MXP_OLIGOMER_DEC_PLACES);
// locale.toString(oligomer->avg(), 'f', 5);
columnData
<< mzSearched << oligomer->name()
<< coordinates << mzError
<< mono << avg
<< oligomer->isModified();
// Create an item with those columnar strings. The parent of the
// current item is parents.
currentItem = new MassSearchOligomerTreeViewItem(columnData,
parents [0]);
currentItem->setOligomer(oligomer);
// We should append that item right now.
parents [0]->appendChild(currentItem);
// At this point we have finished setting up the Model data.
}
return true;
}
} // namespace massXpert
|