deba@458
|
1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*-
|
deba@458
|
2 |
*
|
deba@458
|
3 |
* This file is a part of LEMON, a generic C++ optimization library.
|
deba@458
|
4 |
*
|
deba@458
|
5 |
* Copyright (C) 2003-2008
|
deba@458
|
6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
|
deba@458
|
7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES).
|
deba@458
|
8 |
*
|
deba@458
|
9 |
* Permission to use, modify and distribute this software is granted
|
deba@458
|
10 |
* provided that this copyright notice appears in all copies. For
|
deba@458
|
11 |
* precise terms see the accompanying LICENSE file.
|
deba@458
|
12 |
*
|
deba@458
|
13 |
* This software is provided "AS IS" with no warranty of any kind,
|
deba@458
|
14 |
* express or implied, and with no claim as to its suitability for any
|
deba@458
|
15 |
* purpose.
|
deba@458
|
16 |
*
|
deba@458
|
17 |
*/
|
deba@458
|
18 |
|
deba@458
|
19 |
#ifndef LEMON_BITS_LP_SOLVER_ID_H
|
deba@458
|
20 |
#define LEMON_BITS_LP_SOLVER_ID_H
|
deba@458
|
21 |
|
deba@458
|
22 |
namespace lemon {
|
deba@458
|
23 |
|
deba@458
|
24 |
namespace _lp_bits {
|
deba@458
|
25 |
|
deba@458
|
26 |
struct LpIdImpl {
|
deba@458
|
27 |
std::vector<int> index;
|
deba@458
|
28 |
std::vector<int> cross;
|
deba@458
|
29 |
int first_index;
|
deba@458
|
30 |
int first_free;
|
deba@458
|
31 |
};
|
deba@458
|
32 |
|
deba@458
|
33 |
class LpId {
|
deba@458
|
34 |
public:
|
deba@458
|
35 |
|
deba@458
|
36 |
class IdHandler {
|
deba@458
|
37 |
public:
|
deba@458
|
38 |
virtual ~IdHandler() {}
|
deba@458
|
39 |
virtual int addId(LpIdImpl&) = 0;
|
deba@458
|
40 |
virtual void eraseId(LpIdImpl&, int xn) = 0;
|
deba@458
|
41 |
};
|
deba@458
|
42 |
|
deba@458
|
43 |
LpId(int min_index = 0) {
|
deba@458
|
44 |
id_handler = 0;
|
deba@458
|
45 |
impl.first_free = -1;
|
deba@458
|
46 |
impl.first_index = min_index;
|
deba@458
|
47 |
impl.cross.resize(impl.first_index);
|
deba@458
|
48 |
}
|
deba@458
|
49 |
|
deba@458
|
50 |
LpId(const LpId& li) {
|
deba@458
|
51 |
id_handler = 0;
|
deba@458
|
52 |
impl = li.impl;
|
deba@458
|
53 |
}
|
deba@458
|
54 |
|
deba@458
|
55 |
LpId& operator=(const LpId& li) {
|
deba@458
|
56 |
id_handler = 0;
|
deba@458
|
57 |
impl = li.impl;
|
deba@458
|
58 |
return *this;
|
deba@458
|
59 |
}
|
deba@458
|
60 |
|
deba@458
|
61 |
void setIdHandler(IdHandler& ih) {
|
deba@458
|
62 |
id_handler = &ih;
|
deba@458
|
63 |
}
|
deba@458
|
64 |
|
deba@458
|
65 |
int fixId(int fn) const {return impl.cross[fn];}
|
deba@458
|
66 |
int floatingId(int xn) const {return impl.index[xn];}
|
deba@458
|
67 |
|
deba@458
|
68 |
int addId() {
|
deba@458
|
69 |
if (id_handler == 0) {
|
deba@458
|
70 |
int xn, fn = impl.cross.size();
|
deba@458
|
71 |
if (impl.first_free == -1) {
|
deba@458
|
72 |
xn = impl.index.size();
|
deba@458
|
73 |
impl.index.push_back(fn);
|
deba@458
|
74 |
} else {
|
deba@458
|
75 |
xn = impl.first_free;
|
deba@458
|
76 |
impl.first_free = impl.index[impl.first_free];
|
deba@458
|
77 |
impl.index[xn] = fn;
|
deba@458
|
78 |
}
|
deba@458
|
79 |
impl.cross.push_back(xn);
|
deba@458
|
80 |
return xn;
|
deba@458
|
81 |
} else {
|
deba@458
|
82 |
return id_handler->addId(impl);
|
deba@458
|
83 |
}
|
deba@458
|
84 |
}
|
deba@458
|
85 |
|
deba@458
|
86 |
void eraseId(int xn) {
|
deba@458
|
87 |
if (id_handler == 0) {
|
deba@458
|
88 |
int fn = impl.index[xn];
|
deba@458
|
89 |
impl.index[xn] = impl.first_free;
|
deba@458
|
90 |
impl.first_free = xn;
|
deba@458
|
91 |
for(int i = fn + 1; i < int(impl.cross.size()); ++i) {
|
deba@458
|
92 |
impl.cross[i - 1] = impl.cross[i];
|
deba@458
|
93 |
impl.index[impl.cross[i]]--;
|
deba@458
|
94 |
}
|
deba@458
|
95 |
impl.cross.pop_back();
|
deba@458
|
96 |
} else {
|
deba@458
|
97 |
id_handler->eraseId(impl, xn);
|
deba@458
|
98 |
}
|
deba@458
|
99 |
}
|
deba@458
|
100 |
|
deba@458
|
101 |
void firstFloating(int& fn) const {
|
deba@458
|
102 |
fn = impl.first_index;
|
deba@458
|
103 |
if (fn == int(impl.cross.size())) fn = -1;
|
deba@458
|
104 |
}
|
deba@458
|
105 |
|
deba@458
|
106 |
void nextFloating(int& fn) const {
|
deba@458
|
107 |
++fn;
|
deba@458
|
108 |
if (fn == int(impl.cross.size())) fn = -1;
|
deba@458
|
109 |
}
|
deba@458
|
110 |
|
deba@458
|
111 |
void firstFix(int& xn) const {
|
deba@458
|
112 |
int fn;
|
deba@458
|
113 |
firstFloating(fn);
|
deba@458
|
114 |
xn = fn != -1 ? fixId(fn) : -1;
|
deba@458
|
115 |
}
|
deba@458
|
116 |
|
deba@458
|
117 |
void nextFix(int& xn) const {
|
deba@458
|
118 |
int fn = floatingId(xn);
|
deba@458
|
119 |
nextFloating(fn);
|
deba@458
|
120 |
xn = fn != -1 ? fixId(fn) : -1;
|
deba@458
|
121 |
}
|
deba@458
|
122 |
|
deba@458
|
123 |
protected:
|
deba@458
|
124 |
LpIdImpl impl;
|
deba@458
|
125 |
IdHandler *id_handler;
|
deba@458
|
126 |
};
|
deba@458
|
127 |
|
deba@458
|
128 |
class RelocateIdHandler : public LpId::IdHandler {
|
deba@458
|
129 |
public:
|
deba@458
|
130 |
|
deba@458
|
131 |
virtual int addId(LpIdImpl& impl) {
|
deba@458
|
132 |
int xn, fn = impl.cross.size();
|
deba@458
|
133 |
if (impl.first_free == -1) {
|
deba@458
|
134 |
xn = impl.index.size();
|
deba@458
|
135 |
impl.index.push_back(fn);
|
deba@458
|
136 |
} else {
|
deba@458
|
137 |
xn = impl.first_free;
|
deba@458
|
138 |
impl.first_free = impl.index[impl.first_free];
|
deba@458
|
139 |
impl.index[xn] = fn;
|
deba@458
|
140 |
}
|
deba@458
|
141 |
impl.cross.push_back(xn);
|
deba@458
|
142 |
return xn;
|
deba@458
|
143 |
}
|
deba@458
|
144 |
|
deba@458
|
145 |
virtual void eraseId(LpIdImpl& impl, int xn) {
|
deba@458
|
146 |
int fn = impl.index[xn];
|
deba@458
|
147 |
impl.index[xn] = impl.first_free;
|
deba@458
|
148 |
impl.first_free = xn;
|
deba@458
|
149 |
impl.cross[fn] = impl.cross.back();
|
deba@458
|
150 |
impl.index[impl.cross.back()] = fn;
|
deba@458
|
151 |
impl.cross.pop_back();
|
deba@458
|
152 |
}
|
deba@458
|
153 |
};
|
deba@458
|
154 |
}
|
deba@458
|
155 |
}
|
deba@458
|
156 |
|
deba@458
|
157 |
#endif
|