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
|
/*
* The TaskJuggler Project Management Software
*
* Copyright (c) 2001, 2002, 2003, 2004, 2005 by Chris Schlaeger <cs@kde.org>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of version 2 of the GNU General Public License as
* published by the Free Software Foundation.
*
* $Id$
*/
#include <qstring.h>
#include "TjLineAccounter.h"
TjLineAccounter::~TjLineAccounter()
{
for (std::list<TjLine*>::iterator it = vertLines.begin();
it != vertLines.end(); ++it)
delete *it;
for (std::list<TjLine*>::iterator it = horizLines.begin();
it != horizLines.end(); ++it)
delete *it;
}
void
TjLineAccounter::insertLine(bool vertical, int coord, int start, int end)
{
// Swap start and end in case they are the wrong way round.
if (start > end)
{
int tmp = start;
start = end;
end = tmp;
}
std::list<TjLine*>& list = vertical ? vertLines : horizLines;
TjLine* line = new TjLine(coord, start, end);
std::list<TjLine*>::iterator it = list.begin();
for ( ; it != list.end() &&
((*it)->coord < coord ||
((*it)->coord == coord && (*it)->start < start) ||
((*it)->coord == coord && (*it)->start == start &&
(*it)->end < end)); ++it)
;
list.insert(it, line);
}
bool
TjLineAccounter::collision(bool vertical, int coord, int start, int end)
{
// Swap start and end in case they are the wrong way round.
if (start > end)
{
int tmp = start;
start = end;
end = tmp;
}
std::list<TjLine*>& list = vertical ? vertLines : horizLines;
for (std::list<TjLine*>::iterator it = list.begin(); it != list.end(); ++it)
{
/* Do a fuzzy comparison of the coordinate to achive a minimum
* distance between parallel lines. */
if ((*it)->coord + minDist < coord)
continue;
if ((*it)->coord - minDist > coord)
break;
if ((start > (*it)->start && start < (*it)->end) ||
(end > (*it)->start && end < (*it)->end) ||
((*it)->start > start && (*it)->start < end) ||
((*it)->end > start && (*it)->end < end))
{
return true;
}
}
return false;
}
|
