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
|
// *************************************************************************
//
// Copyright 2004-2010 Bruno PAGES .
//
// This file is part of the BOUML Uml Toolkit.
//
// This program 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; either version 2 of the License, or
// (at your option) any later version.
//
// 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; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
//
// e-mail : bouml@free.fr
// home : http://bouml.free.fr
//
// *************************************************************************
#include <qlabel.h>
#include <qpopupmenu.h>
#include <qcursor.h>
#include "BrowserView.h"
#include "BrowserNode.h"
#include "SynchroWindow.h"
#define DICT_SIZE 101
BrowserView::BrowserView(QWidget * parent)
: QListView(parent), lbl(0), need_update(FALSE), cant_update(FALSE) {
nodes.resize(DICT_SIZE);
setSorting(-1); // manual sorting
addColumn("browser "); // will be changed
addColumn("Rev.");
addColumn("Modified by");
setColumnWidthMode(0, Maximum);
setColumnWidthMode(1, Maximum);
setColumnWidthMode(2, Maximum);
setColumnAlignment(1, ::Qt::AlignHCenter);
setColumnAlignment(2, ::Qt::AlignHCenter);
setTreeStepSize(18);
connect(this, SIGNAL(selectionChanged(QListViewItem *)),
this, SLOT(select(QListViewItem *)));
}
BrowserView::~BrowserView() {
}
void BrowserView::close() {
if (firstChild() != 0) {
dir.rmdir("all.lock");
clear();
}
}
BrowserNode * BrowserView::get_project() const {
return (BrowserNode *) firstChild();
}
void BrowserView::set_project(QDir di) {
dir = di;
new BrowserNode(this, dir.dirName() + ".prj");
setRootIsDecorated(TRUE/*FALSE*/);
di.cdUp();
setColumnText(0, di.path());
}
void BrowserView::select(QListViewItem * b) {
static bool ongoing = FALSE;
if (!ongoing) {
ongoing = TRUE;
const QList<BrowserView> & l = SynchroWindow::get_browsers();
QListIterator<BrowserView> it(l);
QString fn = ((BrowserNode *) b)->file_name();
for (; it.current(); ++it) {
it.current()->clearSelection();
BrowserNode * bn = it.current()->nodes.find(fn);
if (bn != 0) {
it.current()->ensureItemVisible(bn);
it.current()->QListView::setSelected(bn, TRUE);
}
}
ongoing = FALSE;
}
}
//
void BrowserView::add_node(BrowserNode * bn) {
nodes.insert(bn->file_name(), bn);
}
BrowserNode * BrowserView::get_node(QString f) const {
return nodes.find(f);
}
//
struct Use {
int rev_min;
int rev_max;
int count;
Use(int rev) : rev_min(rev), rev_max(rev), count(1) {}
};
void BrowserView::update(const QList<BrowserView> & lv)
{
QDict<Use> all_nodes(DICT_SIZE);
QListIterator<BrowserView> itv(lv);
all_nodes.setAutoDelete(TRUE);
// look at the revision in each view
for (; itv.current(); ++itv) {
QDictIterator<BrowserNode> itd(itv.current()->nodes);
for (; itd.current(); ++itd) {
BrowserNode * bn = itd.current();
int rev = bn->get_rev();
Use * use = all_nodes.find(itd.currentKey());
if (use == 0)
all_nodes.insert(itd.currentKey(), new Use(rev));
else {
if (rev < use->rev_min)
use->rev_min = rev;
if (rev > use->rev_max)
use->rev_max = rev;
use->count += 1;
}
}
}
// first solve step
// only the package existing in all the view are solved
int nviews = lv.count();
QStringList deleted_or_new;
QDictIterator<Use> itu(all_nodes);
for (; itu.current(); ++itu) {
QString who = itu.currentKey();
Use * use = itu.current();
if (use->count == nviews) {
// exist in all views : solve the state
if (use->rev_min == use->rev_max) {
// up to date in all views
for (itv.toFirst(); itv.current(); ++itv)
itv.current()->nodes.find(who)->set_state(UpToDate);
}
else {
int max = use->rev_max;
for (itv.toFirst(); itv.current(); ++itv) {
BrowserNode * pack = itv.current()->nodes.find(who);
pack->set_state((pack->get_rev() == max) ? Young : Old);
}
}
}
else {
// deleted or new, mark it unknown for this step
deleted_or_new.append(who);
for (itv.toFirst(); itv.current(); ++itv) {
BrowserNode * pack = itv.current()->nodes.find(who);
if (pack != 0)
pack->set_state(Unknown);
}
}
}
all_nodes.clear();
// solve packages marked unknown
// a package is deleted if its parent is never 'Young'
QStringList::Iterator it;
for (it = deleted_or_new.begin(); it != deleted_or_new.end(); ++it) {
QString who = *it;
QList<BrowserNode> images;
bool young = FALSE;
// set the state in each view without looking at the others
for (itv.toFirst(); itv.current(); ++itv) {
BrowserNode * pack = itv.current()->nodes.find(who);
if (pack != 0) {
images.append(pack);
if (pack->solve())
young = TRUE;
}
}
// set the final state if young, else all already marked deleted
if (young) {
BrowserNode * pack;
for (pack = images.first(); pack != 0; pack = images.next())
pack->set_state(Young);
}
}
// force update on views
for (itv.toFirst(); itv.current(); ++itv)
itv.current()->update_it();
}
void BrowserView::update_it() {
if (lbl == 0)
lbl = new QLabel(parentWidget());
int nold = 0;
int ndel = 0;
QDictIterator<BrowserNode> itd(nodes);
for (; itd.current(); ++itd) {
BrowserNode * bn = itd.current();
switch (bn->get_state()) {
case Old:
nold += 1;
break;
case Deleted:
ndel += 1;
break;
default:
break;
}
}
QString s;
if (nold != 0) {
need_update = TRUE;
s = QString::number(nold) + " need update";
if (ndel != 0)
s += ", " + QString::number(ndel) + " deleted";
if (cant_update)
s += ", RO !";
lbl->setText(s);
}
else
lbl->setText("Up to date");
lbl->show();
triggerUpdate();
}
//
void BrowserView::synchronize() {
BrowserNode::synchronize(dir, nodes);
}
|