1
////////////////////////////////////////////////////////////////////////////////
3
// This file is part of Toolkit for Conceptual Modeling (TCM).
4
// (c) copyright 1995, Vrije Universiteit Amsterdam.
5
// Author: Frank Dehne (frank@cs.vu.nl).
7
// TCM is free software; you can redistribute it and/or modify
8
// it under the terms of the GNU General Public License as published by
9
// the Free Software Foundation; either version 2 of the License, or
10
// (at your option) any later version.
12
// TCM is distributed in the hope that it will be useful,
13
// but WITHOUT ANY WARRANTY; without even the implied warranty of
14
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15
// GNU General Public License for more details.
17
// You should have received a copy of the GNU General Public License
18
// along with TCM; if not, write to the Free Software
19
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
21
////////////////////////////////////////////////////////////////////////////////
22
#include "reindexcmd.h"
24
#include "diagramviewer.h"
26
#include "nodeshape.h"
28
ReindexCmd::ReindexCmd(ShapeView *v, List<Node *> *n):
29
Command(v->GetViewer()->GetDiagram(), v->GetViewer()) {
30
for (n->first(); !n->done(); n->next()) {
31
Diagram *d = v->GetViewer()->GetDiagram();
32
if (d->HasIndexNode(n->cur()->GetClassType()) &&
33
*n->cur()->GetIndex() != "")
37
nodes.cur()->GetParentIndex(&parent);
39
Node *node = nodes.cur();
40
string *s = new string(*node->GetIndex());
42
} while (nodes.next());
46
ReindexCmd::~ReindexCmd() {
50
void ReindexCmd::Execute() {
51
// avoid index clashes.
52
for (nodes.first(); !nodes.done(); nodes.next()) {
54
nodes.cur()->SetIndex(&empty);
57
for (nodes.first(); !nodes.done(); nodes.next()) {
59
Node *node = nodes.cur();
66
GetDocument()->IncChanges();
71
void ReindexCmd::SetIndex(Node *node, const string *index) {
72
List<GShape *> shapes;
73
((DiagramViewer *)GetViewer())->GetShapes(node, &shapes);
74
Subject::NameErrType err = node->Node::SetIndex(index);
75
if (err == Subject::OK) {
76
for (shapes.first(); !shapes.done(); shapes.next()) {
77
NodeShape *t = (NodeShape *)shapes.cur();
78
if (((DiagramViewer *)GetViewer())->IsShowIndexes())
79
t->UpdateIndexLabel(index);
82
t->UpdateIndexLabel(&empty);
85
if (!shapes.first()) {
86
error("%s, line %d: shape does not exist\n",
93
void ReindexCmd::UnExecute() {
94
// avoid index clashes.
95
for (nodes.first(); !nodes.done(); nodes.next()) {
97
nodes.cur()->SetIndex(&empty);
99
if (oldIndexes.first() && nodes.first()) {
101
Node *node = nodes.cur();
102
string s = *oldIndexes.cur();
104
} while (oldIndexes.next() && nodes.next());
106
GetDocument()->DecChanges();