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
|
/*
* vim: ts=4 sw=4 et tw=0 wm=0
*
* libvpsc - A solver for the problem of Variable Placement with
* Separation Constraints.
*
* Copyright (C) 2005-2008 Monash University
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library in the file LICENSE; if not,
* write to the Free Software Foundation, Inc., 59 Temple Place,
* Suite 330, Boston, MA 02111-1307 USA
*
*/
#include <iostream>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <libvpsc/rectangle.h>
#include <libvpsc/variable.h>
#include <libvpsc/constraint.h>
#include <libvpsc/solve_VPSC.h>
using namespace std;
using namespace vpsc;
inline bool approxEquals(const double a, const double b) {
return fabs((double)a-b)<0.0001;
}
void test1() {
cout << "Test 1..." << endl;
vector<Variable*> a;
a.push_back(new Variable(0,0,1));
a.push_back(new Variable(1,1,1));
vector<Constraint*> c;
c.push_back(new Constraint(a[0],a[1],2));
c.push_back(new Constraint(a[1],a[0],2));
double expected[]={1.5,-0.5};
try {
IncSolver vpsc(a,c);
vpsc.solve();
} catch (UnsatisfiableException& e) {
cerr << "Unsatisfiable" << endl;
for(vector<Constraint*>::iterator i=e.path.begin();
i!=e.path.end();i++) {
cout << **i << endl;
}
exit(1);
}
//catch(...) {
//cerr << "Unknown error!" << endl;
//exit(1);
//}
for(size_t i=0;i<a.size();i++) {
assert(approxEquals(a[i]->finalPosition,expected[i]));
}
for_each(a.begin(),a.end(),delete_object());
for_each(c.begin(),c.end(),delete_object());
cout << "Test 1... done." << endl;
}
void test2() {
cout << "Test 2..." << endl;
vector<Variable *> a;
a.push_back(new Variable(0,8,1));
a.push_back(new Variable(1,5,1));
a.push_back(new Variable(2,3,1));
a.push_back(new Variable(3,1,1));
vector<Constraint*> c;
c.push_back(new Constraint(a[0],a[3],3));
c.push_back(new Constraint(a[0],a[1],3));
c.push_back(new Constraint(a[1],a[3],3));
c.push_back(new Constraint(a[1],a[2],3));
c.push_back(new Constraint(a[2],a[3],3));
c.push_back(new Constraint(a[2],a[3],3));
//double expected[]={-3.71429,4,1,-0.714286,2.28571,2.28571,7,5.28571,8.28571,11.2857};
try {
IncSolver vpsc(a,c);
vpsc.solve();
} catch (char const *msg) {
cerr << msg << endl;
exit(1);
}
/*
for(int i=0;i<n;i++) {
assert(approxEquals(a[i]->position(),expected[i]));
}
*/
cout << "Test 2... done." << endl;
for_each(a.begin(),a.end(),delete_object());
for_each(c.begin(),c.end(),delete_object());
}
int main() {
test1();
return 0;
}
|
