Commit | Line | Data |
---|---|---|
73005152 | 1 | /********************************************************************** |
df0b8ff4 BH |
2 | * Copyright (c) 2005, 2008 IBM Corporation and others. |
3 | * Copyright (c) 2011, 2012 Ericsson. | |
4 | * | |
73005152 BH |
5 | * All rights reserved. This program and the accompanying materials |
6 | * are made available under the terms of the Eclipse Public License v1.0 | |
7 | * which accompanies this distribution, and is available at | |
8 | * http://www.eclipse.org/legal/epl-v10.html | |
73005152 BH |
9 | * |
10 | * Contributors: | |
11 | * IBM - Initial API and implementation | |
12 | * Bernd Hufmann - Updated for TMF | |
13 | **********************************************************************/ | |
14 | package org.eclipse.linuxtools.tmf.ui.views.uml2sd.core; | |
15 | ||
16 | import java.util.ArrayList; | |
17 | import java.util.Iterator; | |
18 | import java.util.List; | |
19 | ||
4df4581d | 20 | import org.eclipse.linuxtools.tmf.core.event.ITmfTimestamp; |
6c13869b | 21 | import org.eclipse.linuxtools.tmf.core.event.TmfTimestamp; |
73005152 | 22 | import org.eclipse.linuxtools.tmf.ui.views.uml2sd.drawings.IGC; |
df0b8ff4 | 23 | import org.eclipse.linuxtools.tmf.ui.views.uml2sd.preferences.ISDPreferences; |
73005152 BH |
24 | import org.eclipse.linuxtools.tmf.ui.views.uml2sd.preferences.SDViewPref; |
25 | ||
26 | /** | |
27 | * The Frame class is the base sequence diagram graph nodes container.<br> | |
28 | * For instance, only one frame can be drawn in the View.<br> | |
29 | * Lifelines, Messages and Stop which are supposed to represent a Sequence diagram are drawn in a Frame.<br> | |
30 | * Only the graph node added to their representing list will be drawn. | |
31 | * | |
32 | * The lifelines are appended along the X axsis when added in a frame.<br> | |
33 | * The syncMessages are ordered along the Y axsis depending on the event occurrence they are attached to.<br> | |
34 | * | |
35 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.Lifeline Lifeline for more event occurence details | |
36 | * @author sveyrier | |
37 | * @version 1.0 | |
38 | */ | |
39 | public class BasicFrame extends GraphNode { | |
40 | ||
df0b8ff4 BH |
41 | // ------------------------------------------------------------------------ |
42 | // Attributes | |
43 | // ------------------------------------------------------------------------ | |
3145ec83 | 44 | |
73005152 BH |
45 | /** |
46 | * Contains the max elapsed time between two consecutive messages in the whole frame | |
47 | */ | |
eb63f5ff | 48 | protected ITmfTimestamp fMaxTime = new TmfTimestamp(0); |
73005152 BH |
49 | /** |
50 | * Contains the min elapsed time between two consecutive messages in the whole frame | |
51 | */ | |
eb63f5ff | 52 | protected ITmfTimestamp fMinTime = new TmfTimestamp(0); |
73005152 BH |
53 | /** |
54 | * Indicate if the min and max elapsed time between two consecutive messages in the whole frame need to be computed | |
55 | */ | |
eb63f5ff | 56 | protected boolean fComputeMinMax = true; |
73005152 BH |
57 | /** |
58 | * Store the preference set by the user regarding the external time. This flag is used determine if the min and max | |
59 | * need to be recomputed in case this preference is changed. | |
60 | */ | |
eb63f5ff | 61 | protected boolean fLastExternalTimePref = SDViewPref.getInstance().excludeExternalTime(); |
73005152 BH |
62 | /** |
63 | * The greater event occurrence created on graph nodes drawn in this Frame This directly impact the Frame height | |
64 | */ | |
eb63f5ff | 65 | protected int fVerticalIndex = 0; |
73005152 BH |
66 | /** |
67 | * The index along the x axis where the next lifeline will is drawn This directly impact the Frame width | |
68 | */ | |
eb63f5ff | 69 | protected int fHorizontalIndex = 0; |
df0b8ff4 | 70 | /** |
eb63f5ff | 71 | * The time information flag. |
df0b8ff4 | 72 | */ |
eb63f5ff | 73 | protected boolean fHasTimeInfo = false; |
73005152 | 74 | /** |
df0b8ff4 | 75 | * The current Frame visible area - x coordinates |
73005152 | 76 | */ |
eb63f5ff | 77 | protected int fVisibleAreaX; |
df0b8ff4 BH |
78 | /** |
79 | * The current Frame visible area - y coordinates | |
80 | */ | |
eb63f5ff | 81 | protected int fVisibleAreaY; |
df0b8ff4 BH |
82 | /** |
83 | * The current Frame visible area - width | |
84 | */ | |
eb63f5ff | 85 | protected int fVisibleAreaWidth; |
df0b8ff4 BH |
86 | /** |
87 | * The current Frame visible area - height | |
88 | */ | |
eb63f5ff | 89 | protected int fVisibleAreaHeight; |
df0b8ff4 BH |
90 | /** |
91 | * The event occurrence spacing (-1 for none) | |
92 | */ | |
eb63f5ff | 93 | protected int fForceEventOccurrenceSpacing = -1; |
df0b8ff4 BH |
94 | /** |
95 | * Flag to indicate customized minumum and maximum. | |
96 | */ | |
eb63f5ff | 97 | protected boolean fCustomMinMax = false; |
df0b8ff4 BH |
98 | /** |
99 | * The minimum time between messages of the sequence diagram frame. | |
100 | */ | |
eb63f5ff | 101 | protected ITmfTimestamp fMinSDTime = new TmfTimestamp(); |
df0b8ff4 BH |
102 | /** |
103 | * The maximum time between messages of the sequence diagram frame. | |
104 | */ | |
eb63f5ff | 105 | protected ITmfTimestamp fMaxSDTime = new TmfTimestamp(); |
df0b8ff4 BH |
106 | /** |
107 | * Flag to indicate that initial minimum has to be computed. | |
108 | */ | |
eb63f5ff | 109 | protected boolean fInitSDMin = true; |
73005152 | 110 | |
df0b8ff4 BH |
111 | // ------------------------------------------------------------------------ |
112 | // Constructors | |
113 | // ------------------------------------------------------------------------ | |
114 | ||
73005152 BH |
115 | /** |
116 | * Creates an empty frame. | |
117 | */ | |
118 | public BasicFrame() { | |
eb63f5ff | 119 | Metrics.setForcedEventSpacing(fForceEventOccurrenceSpacing); |
73005152 BH |
120 | } |
121 | ||
df0b8ff4 BH |
122 | // ------------------------------------------------------------------------ |
123 | // Methods | |
124 | // ------------------------------------------------------------------------ | |
125 | ||
73005152 BH |
126 | /** |
127 | * | |
128 | * Returns the greater event occurence known by the Frame | |
129 | * | |
130 | * @return the greater event occurrence | |
131 | */ | |
132 | protected int getMaxEventOccurrence() { | |
eb63f5ff | 133 | return fVerticalIndex; |
73005152 BH |
134 | } |
135 | ||
136 | /** | |
137 | * Set the greater event occurrence created in GraphNodes included in the frame | |
138 | * | |
139 | * @param eventOccurrence the new greater event occurrence | |
140 | */ | |
141 | protected void setMaxEventOccurrence(int eventOccurrence) { | |
eb63f5ff | 142 | fVerticalIndex = eventOccurrence; |
73005152 BH |
143 | } |
144 | ||
145 | /** | |
146 | * This method increase the lifeline place holder The return value is usually assign to a lifeline. This can be used | |
147 | * to set the lifelines drawing order. Also, calling this method two times and assigning only the last given index | |
148 | * to a lifeline will increase this lifeline draw spacing (2 times the default spacing) from the last added | |
149 | * lifeline. | |
150 | * | |
151 | * @return a new lifeline index | |
152 | */ | |
153 | protected int getNewHorizontalIndex() { | |
eb63f5ff | 154 | return ++fHorizontalIndex; |
73005152 BH |
155 | } |
156 | ||
157 | /** | |
158 | * Returns the current horizontal index | |
159 | * | |
160 | * @return the current horizontal index | |
161 | * @see Frame#getNewHorizontalIndex() for horizontal index description | |
162 | */ | |
163 | protected int getHorizontalIndex() { | |
eb63f5ff | 164 | return fHorizontalIndex; |
73005152 BH |
165 | } |
166 | ||
df0b8ff4 BH |
167 | /* |
168 | * (non-Javadoc) | |
169 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#addNode(org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode) | |
73005152 BH |
170 | */ |
171 | @Override | |
172 | public void addNode(GraphNode nodeToAdd) { | |
eb63f5ff | 173 | fComputeMinMax = true; |
73005152 BH |
174 | super.addNode(nodeToAdd); |
175 | } | |
176 | ||
df0b8ff4 BH |
177 | /* |
178 | * (non-Javadoc) | |
73005152 BH |
179 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#getX() |
180 | */ | |
181 | @Override | |
182 | public int getX() { | |
183 | return Metrics.FRAME_H_MARGIN; | |
184 | } | |
185 | ||
df0b8ff4 BH |
186 | |
187 | /* | |
188 | * (non-Javadoc) | |
189 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#getY() | |
73005152 BH |
190 | */ |
191 | @Override | |
192 | public int getY() { | |
193 | return Metrics.FRAME_V_MARGIN; | |
194 | } | |
195 | ||
df0b8ff4 BH |
196 | /* |
197 | * (non-Javadoc) | |
73005152 BH |
198 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#getWidth() |
199 | */ | |
200 | @Override | |
201 | public int getWidth() { | |
eb63f5ff | 202 | if (fHorizontalIndex == 0) { |
73005152 | 203 | return 3 * Metrics.swimmingLaneWidth() + Metrics.LIFELINE_H_MAGIN * 2 - Metrics.FRAME_H_MARGIN - Metrics.LIFELINE_SPACING / 2; |
df0b8ff4 | 204 | } else { |
eb63f5ff | 205 | return fHorizontalIndex * Metrics.swimmingLaneWidth() + Metrics.LIFELINE_H_MAGIN * 2 + 1 - Metrics.LIFELINE_SPACING; |
df0b8ff4 | 206 | } |
73005152 BH |
207 | } |
208 | ||
df0b8ff4 BH |
209 | /* |
210 | * (non-Javadoc) | |
73005152 BH |
211 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#getHeight() |
212 | */ | |
213 | @Override | |
214 | public int getHeight() { | |
df0b8ff4 | 215 | // The Frame height depends on the maximum number of messages added to a lifeline |
eb63f5ff | 216 | if (fVerticalIndex == 0) { |
73005152 BH |
217 | return 5 * (Metrics.getMessagesSpacing() + Metrics.getMessageFontHeigth()) + Metrics.LIFELINE_NAME_H_MARGIN + Metrics.FRAME_NAME_H_MARGIN + Metrics.getFrameFontHeigth() + Metrics.LIFELINE_VT_MAGIN + Metrics.LIFELINE_VB_MAGIN |
218 | + Metrics.LIFELINE_NAME_H_MARGIN + Metrics.FRAME_NAME_H_MARGIN + Metrics.getLifelineFontHeigth() * 2; | |
df0b8ff4 | 219 | } |
eb63f5ff BH |
220 | if (fForceEventOccurrenceSpacing >= 0) { |
221 | Metrics.setForcedEventSpacing(fForceEventOccurrenceSpacing); | |
df0b8ff4 | 222 | } |
eb63f5ff | 223 | return fVerticalIndex * (Metrics.getMessagesSpacing() + Metrics.getMessageFontHeigth()) + Metrics.LIFELINE_NAME_H_MARGIN + Metrics.FRAME_NAME_H_MARGIN + Metrics.getFrameFontHeigth() + Metrics.LIFELINE_VT_MAGIN + Metrics.LIFELINE_VB_MAGIN |
73005152 BH |
224 | + Metrics.LIFELINE_NAME_H_MARGIN + Metrics.FRAME_NAME_H_MARGIN + Metrics.getLifelineFontHeigth() * 2; |
225 | } | |
226 | ||
227 | /** | |
228 | * Returns the graph node which contains the point given in parameter for the given graph node list and starting the | |
229 | * iteration at the given index<br> | |
230 | * WARNING: Only graph nodes with smaller coordinates than the current visible area can be returned.<br> | |
231 | * | |
232 | * @param x the x coordinate of the point to test | |
233 | * @param y the y coordinate of the point to test | |
234 | * @param list the list to search in | |
235 | * @param fromIndex list browsing starting point | |
236 | * @return the graph node containing the point given in parameter, null otherwise | |
df0b8ff4 BH |
237 | * |
238 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#getNodeFromListAt(int, int, java.util.List, int) | |
73005152 BH |
239 | */ |
240 | @Override | |
241 | protected GraphNode getNodeFromListAt(int x, int y, List<GraphNode> list, int fromIndex) { | |
df0b8ff4 | 242 | if (list == null) { |
73005152 | 243 | return null; |
df0b8ff4 | 244 | } |
73005152 BH |
245 | for (int i = fromIndex; i < list.size(); i++) { |
246 | GraphNode node = (GraphNode) list.get(i); | |
247 | // only lifeline list is x ordered | |
248 | // Stop browsing the list if the node is outside the visible area | |
249 | // all others nodes will be not visible | |
eb63f5ff | 250 | if ((node instanceof Lifeline) && (node.getX() > fVisibleAreaX + fVisibleAreaWidth)) { |
73005152 | 251 | break; |
df0b8ff4 | 252 | } |
73005152 | 253 | if (node.getHeight() < 0) { |
eb63f5ff | 254 | if (node.getY() + node.getHeight() > fVisibleAreaY + fVisibleAreaHeight) { |
73005152 | 255 | break; |
df0b8ff4 | 256 | } |
73005152 | 257 | } else { |
eb63f5ff | 258 | if (node.getY() > fVisibleAreaY + fVisibleAreaHeight) { |
73005152 | 259 | break; |
df0b8ff4 | 260 | } |
73005152 | 261 | } |
df0b8ff4 | 262 | if (node.contains(x, y)) { |
73005152 | 263 | return node; |
df0b8ff4 | 264 | } |
73005152 BH |
265 | } |
266 | return null; | |
267 | } | |
268 | ||
269 | /** | |
270 | * Draw the Frame rectangle | |
271 | * | |
272 | * @param context the context to draw to | |
273 | */ | |
274 | protected void drawFrame(IGC context) { | |
3145ec83 BH |
275 | |
276 | ISDPreferences pref = SDViewPref.getInstance(); | |
277 | ||
278 | context.setBackground(pref.getBackGroundColor(ISDPreferences.PREF_FRAME)); | |
279 | context.setForeground(pref.getForeGroundColor(ISDPreferences.PREF_FRAME)); | |
73005152 BH |
280 | |
281 | int x = getX(); | |
282 | int y = getY(); | |
283 | int w = getWidth(); | |
284 | int h = getHeight(); | |
285 | ||
286 | // Draw the frame main rectangle | |
287 | context.fillRectangle(x, y, w, h); | |
288 | context.drawRectangle(x, y, w, h); | |
289 | ||
3145ec83 BH |
290 | context.setBackground(pref.getBackGroundColor(ISDPreferences.PREF_FRAME_NAME)); |
291 | context.setForeground(pref.getForeGroundColor(ISDPreferences.PREF_FRAME_NAME)); | |
292 | context.setFont(pref.getFont(ISDPreferences.PREF_FRAME_NAME)); | |
73005152 BH |
293 | |
294 | int nameWidth = context.textExtent(getName()) + 2 * Metrics.FRAME_NAME_V_MARGIN; | |
295 | int nameHeight = Metrics.getFrameFontHeigth() + +Metrics.FRAME_NAME_H_MARGIN * 2; | |
296 | ||
297 | // Draw the frame name area | |
df0b8ff4 | 298 | if (nameWidth > w) { |
73005152 | 299 | nameWidth = w; |
df0b8ff4 | 300 | } |
73005152 BH |
301 | |
302 | int[] points = { x, y, x + nameWidth, y, x + nameWidth, y - 11 + nameHeight, x - 11 + nameWidth, y + nameHeight, x, y + nameHeight, x, y + nameHeight }; | |
303 | context.fillPolygon(points); | |
304 | context.drawPolygon(points); | |
305 | context.drawLine(x, y, x, y + nameHeight); | |
306 | ||
3145ec83 | 307 | context.setForeground(pref.getFontColor(ISDPreferences.PREF_FRAME_NAME)); |
73005152 BH |
308 | context.drawTextTruncatedCentred(getName(), x, y, nameWidth - 11, nameHeight, false); |
309 | ||
3145ec83 BH |
310 | context.setBackground(pref.getBackGroundColor(ISDPreferences.PREF_FRAME)); |
311 | context.setForeground(pref.getForeGroundColor(ISDPreferences.PREF_FRAME)); | |
73005152 BH |
312 | } |
313 | ||
df0b8ff4 BH |
314 | /* |
315 | * (non-Javadoc) | |
316 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#draw(org.eclipse.linuxtools.tmf.ui.views.uml2sd.drawings.IGC) | |
73005152 BH |
317 | */ |
318 | @Override | |
319 | public void draw(IGC context) { | |
320 | draw(context, true); | |
321 | } | |
322 | ||
323 | /** | |
324 | * Draws the Frame on the given context.<br> | |
325 | * This method start width GraphNodes ordering if needed.<br> | |
326 | * After, depending on the visible area, only visible GraphNodes are drawn.<br> | |
327 | * | |
328 | * @param context the context to draw to | |
329 | * @param drawFrame indicate if the frame rectangle need to be redrawn | |
330 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#draw(IGC) | |
331 | */ | |
332 | protected void draw(IGC context, boolean drawFrame) { | |
eb63f5ff BH |
333 | fVisibleAreaHeight = context.getVisibleHeight(); |
334 | fVisibleAreaWidth = context.getVisibleWidth(); | |
335 | fVisibleAreaX = context.getContentsX(); | |
336 | fVisibleAreaY = context.getContentsY(); | |
73005152 | 337 | |
eb63f5ff BH |
338 | if (fForceEventOccurrenceSpacing >= 0) { |
339 | Metrics.setForcedEventSpacing(fForceEventOccurrenceSpacing); | |
df0b8ff4 | 340 | } else { |
73005152 | 341 | Metrics.setForcedEventSpacing(-1); |
df0b8ff4 | 342 | } |
73005152 | 343 | |
3145ec83 | 344 | super.drawChildenNodes(context); |
73005152 BH |
345 | } |
346 | ||
df0b8ff4 BH |
347 | /** |
348 | * Sets the event occurrence spacing (-1 for none) | |
349 | * | |
350 | * @param space A spacing to set. | |
351 | */ | |
73005152 | 352 | public void forceEventOccurrenceSpacing(int space) { |
eb63f5ff | 353 | fForceEventOccurrenceSpacing = space; |
73005152 BH |
354 | } |
355 | ||
356 | /** | |
357 | * Return the X coordinates of the frame visible area | |
358 | * | |
359 | * @return the X coordinates of the frame visible area | |
360 | */ | |
361 | public int getVisibleAreaX() { | |
eb63f5ff | 362 | return fVisibleAreaX; |
73005152 BH |
363 | } |
364 | ||
365 | /** | |
366 | * Return the frame visible area width | |
367 | * | |
368 | * @return the frame visible area width | |
369 | */ | |
370 | public int getVisibleAreaWidth() { | |
eb63f5ff | 371 | return fVisibleAreaWidth; |
73005152 BH |
372 | } |
373 | ||
374 | /** | |
375 | * Return the frame visible area height | |
376 | * | |
377 | * @return the frame visible area height | |
378 | */ | |
379 | public int getVisibleAreaHeight() { | |
eb63f5ff | 380 | return fVisibleAreaHeight; |
73005152 BH |
381 | } |
382 | ||
383 | /** | |
384 | * Return the X coordinates of the frame visible area | |
385 | * | |
386 | * @return the X coordinates of the frame visible area | |
387 | */ | |
388 | public int getVisibleAreaY() { | |
eb63f5ff | 389 | return fVisibleAreaY; |
73005152 BH |
390 | } |
391 | ||
392 | /** | |
393 | * Return the minimum time stored in the frame taking all GraphNodes into account | |
394 | * | |
395 | * @return the minimum GraphNode time | |
396 | */ | |
4df4581d | 397 | public ITmfTimestamp getMinTime() { |
eb63f5ff BH |
398 | if (fLastExternalTimePref != SDViewPref.getInstance().excludeExternalTime()) { |
399 | fLastExternalTimePref = SDViewPref.getInstance().excludeExternalTime(); | |
400 | fComputeMinMax = true; | |
73005152 | 401 | } |
eb63f5ff | 402 | if ((fComputeMinMax) && (!fCustomMinMax)) { |
73005152 | 403 | computeMinMax(); |
eb63f5ff | 404 | fComputeMinMax = false; |
73005152 | 405 | } |
eb63f5ff | 406 | return fMinTime; |
73005152 BH |
407 | } |
408 | ||
d7dbf09a | 409 | public void setMin(ITmfTimestamp min) { |
eb63f5ff BH |
410 | fMinTime = min; |
411 | fCustomMinMax = true; | |
73005152 BH |
412 | } |
413 | ||
d7dbf09a | 414 | public void setMax(ITmfTimestamp max) { |
eb63f5ff BH |
415 | fMaxTime = max; |
416 | fCustomMinMax = true; | |
73005152 BH |
417 | } |
418 | ||
419 | public void resetCustomMinMax() { | |
eb63f5ff BH |
420 | fCustomMinMax = false; |
421 | fComputeMinMax = true; | |
73005152 BH |
422 | } |
423 | ||
424 | /** | |
425 | * Return the maximum time stored in the frame taking all GraphNodes into account | |
426 | * | |
427 | * @return the maximum GraphNode time | |
428 | */ | |
4df4581d | 429 | public ITmfTimestamp getMaxTime() { |
eb63f5ff BH |
430 | if (fLastExternalTimePref != SDViewPref.getInstance().excludeExternalTime()) { |
431 | fLastExternalTimePref = SDViewPref.getInstance().excludeExternalTime(); | |
432 | fComputeMinMax = true; | |
73005152 | 433 | } |
eb63f5ff | 434 | if (fComputeMinMax) { |
73005152 | 435 | computeMinMax(); |
eb63f5ff | 436 | fComputeMinMax = false; |
73005152 | 437 | } |
eb63f5ff | 438 | return fMaxTime; |
73005152 BH |
439 | } |
440 | ||
df0b8ff4 BH |
441 | /** |
442 | * Computes the minimum and maximum time between consecutive messages within the frame. | |
443 | */ | |
73005152 | 444 | protected void computeMaxMinTime() { |
eb63f5ff | 445 | if (!fInitSDMin) { |
73005152 | 446 | return; |
df0b8ff4 | 447 | } |
73005152 BH |
448 | |
449 | List<SDTimeEvent> timeArray = buildTimeArray(); | |
3145ec83 BH |
450 | |
451 | if ((timeArray == null) || timeArray.isEmpty()) { | |
73005152 | 452 | return; |
df0b8ff4 | 453 | } |
73005152 BH |
454 | for (int i = 0; i < timeArray.size(); i++) { |
455 | SDTimeEvent m = (SDTimeEvent) timeArray.get(i); | |
456 | ||
eb63f5ff BH |
457 | if (m.getTime().compareTo(fMaxSDTime, true) > 0) { |
458 | fMaxSDTime = m.getTime(); | |
73005152 BH |
459 | } |
460 | ||
eb63f5ff BH |
461 | if ((m.getTime().compareTo(fMinSDTime, true) < 0) || fInitSDMin) { |
462 | fMinSDTime = m.getTime(); | |
463 | fInitSDMin = false; | |
73005152 BH |
464 | } |
465 | } | |
466 | } | |
467 | ||
df0b8ff4 BH |
468 | /** |
469 | * Returns the minimum time between consecutive messages. | |
470 | * | |
471 | * @return the minimum time between consecutive messages | |
472 | */ | |
4df4581d | 473 | public ITmfTimestamp getSDMinTime() { |
73005152 | 474 | computeMaxMinTime(); |
eb63f5ff | 475 | return fMinSDTime; |
73005152 BH |
476 | } |
477 | ||
df0b8ff4 BH |
478 | /** |
479 | * Returns the maximum time between consecutive messages. | |
480 | * | |
481 | * @return the maximum time between consecutive messages | |
482 | */ | |
4df4581d | 483 | public ITmfTimestamp getSDMaxTime() { |
73005152 | 484 | computeMaxMinTime(); |
eb63f5ff | 485 | return fMaxSDTime; |
73005152 BH |
486 | } |
487 | ||
488 | /** | |
489 | * Browse all the GraphNode to compute the min and max times store in the Frame | |
490 | */ | |
491 | protected void computeMinMax() { | |
492 | List<SDTimeEvent> timeArray = buildTimeArray(); | |
3145ec83 BH |
493 | |
494 | if ((timeArray == null) || timeArray.isEmpty()) { | |
73005152 | 495 | return; |
df0b8ff4 | 496 | } |
73005152 BH |
497 | for (int i = 0; i < timeArray.size() - 1; i++) { |
498 | SDTimeEvent m1 = (SDTimeEvent) timeArray.get(i); | |
499 | SDTimeEvent m2 = (SDTimeEvent) timeArray.get(i + 1); | |
500 | ||
501 | updateMinMax(m1, m2); | |
73005152 BH |
502 | } |
503 | } | |
504 | ||
df0b8ff4 BH |
505 | /** |
506 | * Updates the minimum and maximum time between consecutive message within the frame based on the given values. | |
507 | * | |
508 | * @param m1 A first SD time event. | |
509 | * @param m2 A second SD time event. | |
510 | */ | |
73005152 | 511 | protected void updateMinMax(SDTimeEvent m1, SDTimeEvent m2) { |
4df4581d | 512 | ITmfTimestamp delta = m2.getTime().getDelta(m1.getTime()); |
eb63f5ff BH |
513 | if (fComputeMinMax) { |
514 | fMinTime = delta.clone(); | |
515 | if (fMinTime.compareTo(TmfTimestamp.ZERO, false) < 0) { | |
516 | fMinTime = new TmfTimestamp(0, m1.getTime().getScale(), m1.getTime().getPrecision()); | |
73005152 | 517 | } |
eb63f5ff BH |
518 | fMaxTime = fMinTime.clone(); |
519 | fComputeMinMax = false; | |
73005152 BH |
520 | } |
521 | ||
eb63f5ff BH |
522 | if ((delta.compareTo(fMinTime, true) < 0) && (delta.compareTo(TmfTimestamp.ZERO, false) > 0)) { |
523 | fMinTime = delta.clone(); | |
73005152 BH |
524 | } |
525 | ||
eb63f5ff BH |
526 | if ((delta.compareTo(fMaxTime, true) > 0) && (delta.compareTo(TmfTimestamp.ZERO, false) > 0)) { |
527 | fMaxTime = delta.clone(); | |
73005152 BH |
528 | } |
529 | } | |
530 | ||
df0b8ff4 BH |
531 | /** |
532 | * Builds the time array based on the list of graph nodes. | |
533 | * | |
3145ec83 | 534 | * @return the time array else empty list. |
df0b8ff4 | 535 | */ |
73005152 | 536 | protected List<SDTimeEvent> buildTimeArray() { |
eb63f5ff | 537 | if (!fHasChilden) { |
3145ec83 | 538 | return new ArrayList<SDTimeEvent>(); |
df0b8ff4 | 539 | } |
73005152 | 540 | |
eb63f5ff | 541 | Iterator<String> it = fForwardSort.keySet().iterator(); |
73005152 BH |
542 | List<SDTimeEvent> timeArray = new ArrayList<SDTimeEvent>(); |
543 | while (it.hasNext()) { | |
544 | String nodeType = it.next(); | |
eb63f5ff | 545 | List<GraphNode> list = (List<GraphNode>) fNodes.get(nodeType); |
73005152 BH |
546 | for (int i = 0; i < list.size(); i++) { |
547 | Object timedNode = list.get(i); | |
548 | if ((timedNode instanceof ITimeRange) && ((ITimeRange) timedNode).hasTimeInfo()) { | |
549 | int event = ((GraphNode) list.get(i)).getStartOccurrence(); | |
4df4581d | 550 | ITmfTimestamp time = ((ITimeRange) list.get(i)).getStartTime(); |
73005152 BH |
551 | SDTimeEvent f = new SDTimeEvent(time, event, (ITimeRange) list.get(i)); |
552 | timeArray.add(f); | |
553 | if (event != ((GraphNode) list.get(i)).getEndOccurrence()) { | |
554 | event = ((AsyncMessage) list.get(i)).getEndOccurrence(); | |
555 | time = ((ITimeRange) list.get(i)).getEndTime(); | |
556 | f = new SDTimeEvent(time, event, (ITimeRange) list.get(i)); | |
557 | timeArray.add(f); | |
558 | } | |
559 | } | |
560 | } | |
561 | } | |
562 | return timeArray; | |
563 | } | |
564 | ||
565 | /* | |
566 | * (non-Javadoc) | |
567 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#getArrayId() | |
568 | */ | |
569 | @Override | |
570 | public String getArrayId() { | |
571 | return null; | |
572 | } | |
573 | ||
574 | /* | |
575 | * (non-Javadoc) | |
576 | * @see org.eclipse.linuxtools.tmf.ui.views.uml2sd.core.GraphNode#contains(int, int) | |
577 | */ | |
578 | @Override | |
579 | public boolean contains(int x, int y) { | |
580 | return false; | |
581 | } | |
582 | } |