| 1 | /* | 
|---|
| 2 | * Project: MoleCuilder | 
|---|
| 3 | * Description: creates and alters molecular systems | 
|---|
| 4 | * Copyright (C)  2013 Frederik Heber. All rights reserved. | 
|---|
| 5 | * | 
|---|
| 6 | * | 
|---|
| 7 | *   This file is part of MoleCuilder. | 
|---|
| 8 | * | 
|---|
| 9 | *    MoleCuilder is free software: you can redistribute it and/or modify | 
|---|
| 10 | *    it under the terms of the GNU General Public License as published by | 
|---|
| 11 | *    the Free Software Foundation, either version 2 of the License, or | 
|---|
| 12 | *    (at your option) any later version. | 
|---|
| 13 | * | 
|---|
| 14 | *    MoleCuilder is distributed in the hope that it will be useful, | 
|---|
| 15 | *    but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|---|
| 16 | *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|---|
| 17 | *    GNU General Public License for more details. | 
|---|
| 18 | * | 
|---|
| 19 | *    You should have received a copy of the GNU General Public License | 
|---|
| 20 | *    along with MoleCuilder.  If not, see <http://www.gnu.org/licenses/>. | 
|---|
| 21 | */ | 
|---|
| 22 |  | 
|---|
| 23 | /* | 
|---|
| 24 | * QtHomologyList.cpp | 
|---|
| 25 | * | 
|---|
| 26 | *  Created on: Jun 24, 2014 | 
|---|
| 27 | *      Author: heber | 
|---|
| 28 | */ | 
|---|
| 29 |  | 
|---|
| 30 | // include config.h | 
|---|
| 31 | #ifdef HAVE_CONFIG_H | 
|---|
| 32 | #include <config.h> | 
|---|
| 33 | #endif | 
|---|
| 34 |  | 
|---|
| 35 | #include "Views/Qt4/QtHomologyList.hpp" | 
|---|
| 36 |  | 
|---|
| 37 | #include <iterator> | 
|---|
| 38 | #include <iostream> | 
|---|
| 39 |  | 
|---|
| 40 | #include <QAbstractItemView> | 
|---|
| 41 |  | 
|---|
| 42 | #include "CodePatterns/MemDebug.hpp" | 
|---|
| 43 |  | 
|---|
| 44 | #include "Fragmentation/Homology/HomologyContainer.hpp" | 
|---|
| 45 | #include "World.hpp" | 
|---|
| 46 |  | 
|---|
| 47 | using namespace std; | 
|---|
| 48 |  | 
|---|
| 49 | const int QtHomologyList::COLUMNCOUNT = COLUMNTYPES_MAX; | 
|---|
| 50 | const char *QtHomologyList::COLUMNNAMES[QtHomologyList::COLUMNCOUNT]={"Number","Nodes","Edges","Occurrence"}; | 
|---|
| 51 |  | 
|---|
| 52 | QtHomologyList::QtHomologyList(QWidget * _parent) : | 
|---|
| 53 | QTreeWidget (_parent), | 
|---|
| 54 | Observer("QtHomologyList") | 
|---|
| 55 | { | 
|---|
| 56 | setColumnCount(COLUMNCOUNT); | 
|---|
| 57 | setSelectionMode(QAbstractItemView::MultiSelection); | 
|---|
| 58 |  | 
|---|
| 59 | QStringList header; | 
|---|
| 60 | for(int i=0; i<COLUMNCOUNT;++i) | 
|---|
| 61 | header << COLUMNNAMES[i]; | 
|---|
| 62 | setHeaderLabels(header); | 
|---|
| 63 |  | 
|---|
| 64 | dirty = true; | 
|---|
| 65 | refill(); | 
|---|
| 66 |  | 
|---|
| 67 | HomologyContainer &homologies = World::getInstance().getHomologies(); | 
|---|
| 68 | homologies.signOn(this); | 
|---|
| 69 |  | 
|---|
| 70 | connect(this,SIGNAL(itemSelectionChanged()),this,SLOT(rowSelected())); | 
|---|
| 71 | connect(this,SIGNAL(changed()),this,SLOT(update())); | 
|---|
| 72 | } | 
|---|
| 73 |  | 
|---|
| 74 | QtHomologyList::~QtHomologyList() | 
|---|
| 75 | { | 
|---|
| 76 | HomologyContainer &homologies = World::getInstance().getHomologies(); | 
|---|
| 77 | homologies.signOff(this); | 
|---|
| 78 | } | 
|---|
| 79 |  | 
|---|
| 80 | void QtHomologyList::update(Observable *publisher) { | 
|---|
| 81 |  | 
|---|
| 82 | dirty = true; | 
|---|
| 83 |  | 
|---|
| 84 | // force an update from Qt... | 
|---|
| 85 | clear(); | 
|---|
| 86 | //emit changed(); doesn't work!?! | 
|---|
| 87 | } | 
|---|
| 88 |  | 
|---|
| 89 | void QtHomologyList::refill() | 
|---|
| 90 | { | 
|---|
| 91 | const HomologyContainer &homologies = World::getInstance().getHomologies(); | 
|---|
| 92 |  | 
|---|
| 93 | // clear everything | 
|---|
| 94 | HomologySelection.clear(); | 
|---|
| 95 | clear(); | 
|---|
| 96 |  | 
|---|
| 97 | size_t count = 0; | 
|---|
| 98 | for (HomologyContainer::const_key_iterator iter = homologies.key_begin(); | 
|---|
| 99 | iter != homologies.key_end(); iter = homologies.getNextKey(iter), ++count) { | 
|---|
| 100 | HomologyContainer::range_t occurences = homologies.getHomologousGraphs(*iter); | 
|---|
| 101 | const HomologyGraph &graph = occurences.first->first; | 
|---|
| 102 | const size_t times = std::distance(occurences.first, occurences.second); | 
|---|
| 103 |  | 
|---|
| 104 | QTreeWidgetItem *treeItem = new QTreeWidgetItem(this); | 
|---|
| 105 | treeItem->setText(NUMBER, QString::number(count)); | 
|---|
| 106 | { | 
|---|
| 107 | std::stringstream output; | 
|---|
| 108 | graph.printNodes(output); | 
|---|
| 109 | treeItem->setText(NODES, QString(output.str().c_str())); | 
|---|
| 110 | } | 
|---|
| 111 | { | 
|---|
| 112 | std::stringstream output; | 
|---|
| 113 | graph.printEdges(output); | 
|---|
| 114 | treeItem->setText(EDGES, QString(output.str().c_str())); | 
|---|
| 115 | } | 
|---|
| 116 | if (times > 0) { | 
|---|
| 117 | treeItem->setText(OCCURRENCE, QString::number(times)); | 
|---|
| 118 | } else { | 
|---|
| 119 | treeItem->setText(OCCURRENCE, "none"); | 
|---|
| 120 | treeItem->setDisabled(true); | 
|---|
| 121 | } | 
|---|
| 122 | HomologySelection.push_back(treeItem->isSelected()); | 
|---|
| 123 | } | 
|---|
| 124 | dirty = false; | 
|---|
| 125 | } | 
|---|
| 126 |  | 
|---|
| 127 | void QtHomologyList::paintEvent(QPaintEvent * event) | 
|---|
| 128 | { | 
|---|
| 129 | if (dirty) | 
|---|
| 130 | refill(); | 
|---|
| 131 | QTreeWidget::paintEvent(event); | 
|---|
| 132 | } | 
|---|
| 133 |  | 
|---|
| 134 | void QtHomologyList::subjectKilled(Observable *publisher) | 
|---|
| 135 | { | 
|---|
| 136 | // as a new instance should always already be present ... just sign on | 
|---|
| 137 | HomologyContainer &homologies = World::getInstance().getHomologies(); | 
|---|
| 138 | homologies.signOn(this); | 
|---|
| 139 | } | 
|---|
| 140 |  | 
|---|
| 141 |  | 
|---|
| 142 | void QtHomologyList::rowSelected() | 
|---|
| 143 | { | 
|---|
| 144 | //std::cout << "rowSelected\n"; | 
|---|
| 145 | for (int i=0;i<topLevelItemCount();i++){ | 
|---|
| 146 | QTreeWidgetItem *item = topLevelItem(i); | 
|---|
| 147 | bool newSelection = item->isSelected(); | 
|---|
| 148 | if (newSelection != HomologySelection[i]){ | 
|---|
| 149 | HomologySelection[i] = newSelection; | 
|---|
| 150 | } | 
|---|
| 151 | } | 
|---|
| 152 | } | 
|---|
| 153 |  | 
|---|