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
|
/**
* $Id: mxCellStatePreview.js,v 1.6 2012-10-26 07:19:11 gaudenz Exp $
* Copyright (c) 2006-2010, JGraph Ltd
*/
/**
*
* Class: mxCellStatePreview
*
* Implements a live preview for moving cells.
*
* Constructor: mxCellStatePreview
*
* Constructs a move preview for the given graph.
*
* Parameters:
*
* graph - Reference to the enclosing <mxGraph>.
*/
function mxCellStatePreview(graph)
{
this.graph = graph;
this.deltas = new Object();
};
/**
* Variable: graph
*
* Reference to the enclosing <mxGraph>.
*/
mxCellStatePreview.prototype.graph = null;
/**
* Variable: deltas
*
* Reference to the enclosing <mxGraph>.
*/
mxCellStatePreview.prototype.deltas = null;
/**
* Variable: count
*
* Contains the number of entries in the map.
*/
mxCellStatePreview.prototype.count = 0;
/**
* Function: isEmpty
*
* Returns true if this contains no entries.
*/
mxCellStatePreview.prototype.isEmpty = function()
{
return this.count == 0;
};
/**
* Function: moveState
*/
mxCellStatePreview.prototype.moveState = function(state, dx, dy, add, includeEdges)
{
add = (add != null) ? add : true;
includeEdges = (includeEdges != null) ? includeEdges : true;
var id = mxCellPath.create(state.cell);
var delta = this.deltas[id];
if (delta == null)
{
delta = new mxPoint(dx, dy);
this.deltas[id] = delta;
this.count++;
}
else
{
if (add)
{
delta.X += dx;
delta.Y += dy;
}
else
{
delta.X = dx;
delta.Y = dy;
}
}
if (includeEdges)
{
this.addEdges(state);
}
return delta;
};
/**
* Function: show
*/
mxCellStatePreview.prototype.show = function(visitor)
{
var model = this.graph.getModel();
var root = model.getRoot();
// Translates the states in step
for (var id in this.deltas)
{
var cell = mxCellPath.resolve(root, id);
var state = this.graph.view.getState(cell);
var delta = this.deltas[id];
var parentState = this.graph.view.getState(
model.getParent(cell));
this.translateState(parentState, state, delta.x, delta.y);
}
// Revalidates the states in step
for (var id in this.deltas)
{
var cell = mxCellPath.resolve(root, id);
var state = this.graph.view.getState(cell);
var delta = this.deltas[id];
var parentState = this.graph.view.getState(
model.getParent(cell));
this.revalidateState(parentState, state, delta.x, delta.y, visitor);
}
};
/**
* Function: translateState
*/
mxCellStatePreview.prototype.translateState = function(parentState, state, dx, dy)
{
if (state != null)
{
var model = this.graph.getModel();
if (model.isVertex(state.cell))
{
// LATER: Use hashtable to store initial state bounds
state.invalid = true;
this.graph.view.validateBounds(parentState, state.cell);
var geo = model.getGeometry(state.cell);
var id = mxCellPath.create(state.cell);
// Moves selection cells and non-relative vertices in
// the first phase so that edge terminal points will
// be updated in the second phase
if ((dx != 0 || dy != 0) && geo != null &&
(!geo.relative || this.deltas[id] != null))
{
state.x += dx;
state.y += dy;
}
}
var childCount = model.getChildCount(state.cell);
for (var i = 0; i < childCount; i++)
{
this.translateState(state, this.graph.view.getState(
model.getChildAt(state.cell, i)), dx, dy);
}
}
};
/**
* Function: revalidateState
*/
mxCellStatePreview.prototype.revalidateState = function(parentState, state, dx, dy, visitor)
{
if (state != null)
{
// Updates the edge terminal points and restores the
// (relative) positions of any (relative) children
state.invalid = true;
this.graph.view.validatePoints(parentState, state.cell);
// Moves selection vertices which are relative
var id = mxCellPath.create(state.cell);
var model = this.graph.getModel();
var geo = this.graph.getCellGeometry(state.cell);
if ((dx != 0 || dy != 0) && geo != null && geo.relative &&
model.isVertex(state.cell) && (parentState == null ||
model.isVertex(parentState.cell) || this.deltas[id] != null))
{
state.x += dx;
state.y += dy;
this.graph.cellRenderer.redraw(state);
}
// Invokes the visitor on the given state
if (visitor != null)
{
visitor(state);
}
var childCount = model.getChildCount(state.cell);
for (var i = 0; i < childCount; i++)
{
this.revalidateState(state, this.graph.view.getState(model.getChildAt(
state.cell, i)), dx, dy, visitor);
}
}
};
/**
* Function: addEdges
*/
mxCellStatePreview.prototype.addEdges = function(state)
{
var model = this.graph.getModel();
var edgeCount = model.getEdgeCount(state.cell);
for (var i = 0; i < edgeCount; i++)
{
var s = this.graph.view.getState(model.getEdgeAt(state.cell, i));
if (s != null)
{
this.moveState(s, 0, 0);
}
}
};
|
