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
|
/*-----------------------------------------------------------------------------
| Copyright (c) 2013-2017, Nucleic Development Team.
|
| Distributed under the terms of the Modified BSD License.
|
| The full license is in the file COPYING.txt, distributed with this software.
|----------------------------------------------------------------------------*/
#pragma once
#include "maptype.h"
#include "symbol.h"
#include "util.h"
namespace kiwi
{
namespace impl
{
class Row
{
public:
typedef MapType<Symbol, double>::Type CellMap;
Row() : m_constant( 0.0 ) {}
Row( double constant ) : m_constant( constant ) {}
Row( const Row& other ) :
m_cells( other.m_cells ), m_constant( other.m_constant ) {}
~Row() {}
const CellMap& cells() const
{
return m_cells;
}
double constant() const
{
return m_constant;
}
/* Add a constant value to the row constant.
The new value of the constant is returned.
*/
double add( double value )
{
return m_constant += value;
}
/* Insert a symbol into the row with a given coefficient.
If the symbol already exists in the row, the coefficient will be
added to the existing coefficient. If the resulting coefficient
is zero, the symbol will be removed from the row.
*/
void insert( const Symbol& symbol, double coefficient = 1.0 )
{
if( nearZero( m_cells[ symbol ] += coefficient ) )
m_cells.erase( symbol );
}
/* Insert a row into this row with a given coefficient.
The constant and the cells of the other row will be multiplied by
the coefficient and added to this row. Any cell with a resulting
coefficient of zero will be removed from the row.
*/
void insert( const Row& other, double coefficient = 1.0 )
{
typedef CellMap::const_iterator iter_t;
m_constant += other.m_constant * coefficient;
iter_t end = other.m_cells.end();
for( iter_t it = other.m_cells.begin(); it != end; ++it )
{
double coeff = it->second * coefficient;
if( nearZero( m_cells[ it->first ] += coeff ) )
m_cells.erase( it->first );
}
}
/* Remove the given symbol from the row.
*/
void remove( const Symbol& symbol )
{
CellMap::iterator it = m_cells.find( symbol );
if( it != m_cells.end() )
m_cells.erase( it );
}
/* Reverse the sign of the constant and all cells in the row.
*/
void reverseSign()
{
typedef CellMap::iterator iter_t;
m_constant = -m_constant;
iter_t end = m_cells.end();
for( iter_t it = m_cells.begin(); it != end; ++it )
it->second = -it->second;
}
/* Solve the row for the given symbol.
This method assumes the row is of the form a * x + b * y + c = 0
and (assuming solve for x) will modify the row to represent the
right hand side of x = -b/a * y - c / a. The target symbol will
be removed from the row, and the constant and other cells will
be multiplied by the negative inverse of the target coefficient.
The given symbol *must* exist in the row.
*/
void solveFor( const Symbol& symbol )
{
typedef CellMap::iterator iter_t;
double coeff = -1.0 / m_cells[ symbol ];
m_cells.erase( symbol );
m_constant *= coeff;
iter_t end = m_cells.end();
for( iter_t it = m_cells.begin(); it != end; ++it )
it->second *= coeff;
}
/* Solve the row for the given symbols.
This method assumes the row is of the form x = b * y + c and will
solve the row such that y = x / b - c / b. The rhs symbol will be
removed from the row, the lhs added, and the result divided by the
negative inverse of the rhs coefficient.
The lhs symbol *must not* exist in the row, and the rhs symbol
*must* exist in the row.
*/
void solveFor( const Symbol& lhs, const Symbol& rhs )
{
insert( lhs, -1.0 );
solveFor( rhs );
}
/* Get the coefficient for the given symbol.
If the symbol does not exist in the row, zero will be returned.
*/
double coefficientFor( const Symbol& symbol ) const
{
CellMap::const_iterator it = m_cells.find( symbol );
if( it == m_cells.end() )
return 0.0;
return it->second;
}
/* Substitute a symbol with the data from another row.
Given a row of the form a * x + b and a substitution of the
form x = 3 * y + c the row will be updated to reflect the
expression 3 * a * y + a * c + b.
If the symbol does not exist in the row, this is a no-op.
*/
void substitute( const Symbol& symbol, const Row& row )
{
typedef CellMap::iterator iter_t;
iter_t it = m_cells.find( symbol );
if( it != m_cells.end() )
{
double coefficient = it->second;
m_cells.erase( it );
insert( row, coefficient );
}
}
private:
CellMap m_cells;
double m_constant;
};
} // namespace impl
} // namespace
|
