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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
| #define MAT_TEMPLATE template <class T>
# include <iostream>
# include <string>
# define max(a,b) (((a) > (b)) ? (a) : (b))
# define min(a,b) (((a) < (b)) ? (a) : (b))
#if !defined(_NO_TEMPLATE)
# define MAT_TEMPLATE template <class T>
# define matrixT matrix<T>
#else
# define MAT_TEMPLATE
# define matrixT matrix
# ifdef MATRIX_TYPE
typedef MATRIX_TYPE T;
# else
typedef double T;
# endif
#endif
//template <class T>
MAT_TEMPLATE
class matrix
{
public:
// Constructors
matrix (size_t row = 6, size_t col = 6);
// Destructor
~matrix ();
// Assignment operators
matrixT& operator = (const matrixT& m);// _NO_THROW;
// Value extraction method
size_t RowNo () const { return _m->Row; }
size_t ColNo () const { return _m->Col; }
// Combined assignment - calculation operators
matrixT& operator += (const matrixT& m);// _THROW_MATRIX_ERROR;
matrixT& operator -= (const matrixT& m);// _THROW_MATRIX_ERROR;
matrixT& operator *= (const matrixT& m) ;//_THROW_MATRIX_ERROR;
matrixT& operator *= (const T& c) ;//_NO_THROW;
matrixT& operator /= (const T& c) ;//_NO_THROW;
matrixT& operator ^= (const size_t& pow);// _THROW_MATRIX_ERROR;
void SetSize(size_t row, size_t col);// _NO_THROW;
void SetElement (size_t row, size_t col,T value);
private:
struct base_mat
{
T** Val;
size_t Row, Col, RowSiz, ColSiz;
int Refcnt;
base_mat(size_t row, size_t col, T** v)
{
Row = row;
RowSiz = row;
Col = col; ColSiz = col;
Refcnt = 1;
Val = new T * [row];
size_t rowlen = col * sizeof(T);
for (size_t i = 0; i < row; i++)
{
Val[i] = new T[col];
if (v) memcpy(Val[i], v[i], rowlen);
}
} ~base_mat()
{
for (size_t i = 0; i < RowSiz; i++)
delete[] Val[i];
delete[] Val;
}
};
base_mat* _m;
void clone();
void realloc(size_t row, size_t col);
int pivot(size_t row);
};
#if defined(_MSC_VER) && _MSC_VER <= 1020
# undef _NO_THROW // MSVC++ 4.0/4.2 does not support
# undef _THROW_MATRIX_ERROR // exception specification in
definition
# define _NO_THROW
# define _THROW_MATRIX_ERROR
#endif
// constructor
MAT_TEMPLATE inline
matrixT::matrix (size_t row, size_t col)
{
_m = new base_mat( row, col, 0);
}
// combined power and assignment operator
MAT_TEMPLATE inline matrixT&
matrixT::operator ^= (const size_t& pow)
//_THROW_MATRIX_ERROR
{
matrixT temp(*this);
for (size_t i = 2; i <= pow; i++)
*this = *this * temp;
return *this;
}
// binary addition operator
MAT_TEMPLATE inline matrixT
operator + (const matrixT& m1, const matrixT& m2)
//HROW_MATRIX_ERROR
{
matrixT temp = m1;
temp += m2;
return temp;
}
// binary subtraction operator
MAT_TEMPLATE inline matrixT
operator - (const matrixT& m1, const matrixT& m2)
//HROW_MATRIX_ERROR
{
matrixT temp = m1;
temp -= m2;
return temp;
}
// binary scalar multiplication operator
MAT_TEMPLATE inline matrixT
operator * (const matrixT& m, const T& no) //O_THROW
{
matrixT temp = m;
temp *= no;
return temp;
}
// binary scalar multiplication operator
MAT_TEMPLATE inline matrixT
operator * (const T& no, const matrixT& m) //O_THROW
{
return (m * no);
}
// binary matrix multiplication operator
MAT_TEMPLATE inline matrixT
operator * (const matrixT& m1, const matrixT& m2)
//HROW_MATRIX_ERROR
{
matrixT temp = m1;
temp *= m2;
return temp;
}
// binary scalar division operator
MAT_TEMPLATE inline matrixT
operator / (const matrixT& m, const T& no) //O_THROW
{
return (m * (T(1) / no));
}
// binary scalar division operator
MAT_TEMPLATE inline matrixT
operator / (const T& no, const matrixT& m)
//_THROW_MATRIX_ERROR
{
return (!m * no);
}
// binary matrix division operator
MAT_TEMPLATE inline matrixT
operator / (const matrixT& m1, const matrixT& m2)
//_THROW_MATRIX_ERROR
{
return (m1 * !m2);
}
// binary power operator
MAT_TEMPLATE inline matrixT
operator ^ (const matrixT& m, const size_t& pow)
//_THROW_MATRIX_ERROR
{
matrixT temp = m;
temp ^= pow;
return temp;
}
// unary transpose operator
MAT_TEMPLATE inline matrixT
operator ~ (const matrixT& m) //_NO_THROW
{
matrixT temp(m.ColNo(),m.RowNo());
for (size_t i = 0; i < m.RowNo(); i++)
for (size_t j = 0; j < m.ColNo(); j++)
{
T x = m(i, j);
temp(j, i) = x;
}
return temp;
}
// unary inversion operator
MAT_TEMPLATE inline matrixT
operator ! (const matrixT m) //_THROW_MATRIX_ERROR
{
matrixT temp = m;
return temp.Inv();
}
// inversion function
/**MAT_TEMPLATE inline matrixT
matrixT::Inv () //_THROW_MATRIX_ERROR
{
size_t i,j,k;
T a1,a2,*rowptr;
if (_m->Row != _m->Col)
REPORT_ERROR("matrixT::operator!: Inversion of a nonsquare matrix");
matrixT temp(_m->Row, _m->Col);
if (_m->Refcnt > 1) clone();
temp.Unit();
for (k = 0; k < _m->Row; k++)
{
int indx = pivot(k);
if (indx == -1)
REPORT_ERROR("matrixT::operator!: Inversion of a singular matrix");
if (indx != 0)
{
rowptr = temp._m->Val[k];
temp._m->Val[k] = temp._m->Val[indx];
temp._m->Val[indx] = rowptr;
}
a1 = _m->Val[k][k];
for (j = 0; j < _m->Row; j++)
{
_m->Val[k][j] /= a1;
temp._m->Val[k][j] /= a1;
}
for (i = 0; i < _m->Row; i++)
if (i != k)
{
a2 = _m->Val[i][k];
for (j = 0; j < _m->Row; j++)
{
_m->Val[i][j] -= a2 * _m->Val[k][j];
temp._m->Val[i][j] -= a2 * temp._m->Val[k][j];
}
}
}
return temp;
}
Unit1.cpp – головний модуль сервера
Функція обробки вхідних повідомлень
void __fastcall TForm1::MyServerClientRead(TObject* Sender, TCustomWinSocket* Socket)
{
AnsiString TextIn;
int iIndex;
TextIn = Socket->ReceiveText();
TStringList* TMess = new TStringList();
TMess->Text = TextIn;
iIndex = ConnectedList->IndexOfObject(Socket);
if (iIndex == -1)
return;
if (TMess->Strings[0] == "PRO")
{
LogMemo->Lines->Add("Received message from " + TMess > Strings[1]);
if (TMess->Strings[2] == "_findb")
{
LogMemo->Lines->Add("b vector:");
GetMatrixFromMSG(3, TMess, T2);
LogMemo->Lines->Add(GetMatrixString(T2));
}
else
if (TMess->Strings[2] == "_findC2")
{
LogMemo->Lines->Add("C2 matrix:");
GetMatrixFromMSG(3, TMess, T1);
LogMemo->Lines->Add(GetMatrixString(T1));
}
else
if (TMess->Strings[2] == "_sum")
{
switch (InputStage)
{
case 6:
{
Done++;
if (Done == 2)
{
NextButton->Enabled = true; Done = 0;
}
if (TMess->Strings[1] == ConnectedList->Strings[0])
{
LogMemo->Lines->Add("after b1+4*c1:");
GetMatrixFromMSG(3, TMess, T1);
LogMemo->Lines->Add(GetMatrixString(T1));
}
else
if (TMess->Strings[1] == ConnectedList->Strings[1])
{
LogMemo->Lines->Add("after B2+C2:");
GetMatrixFromMSG(3, TMess, T2);
LogMemo->Lines->Add(GetMatrixString(T2));
}
} //case
break;
case 10:
if (TMess->Strings[1]==ConnectedList->Strings[0])
{
LogMemo->Lines->Add("after Y3 x y1 + Y3^2 x y2:");
GetMatrixFromMSG(3,TMess, TT2);
LogMemo->Lines->Add(GetMatrixString (TT2));
}
break;
case 11:
if (TMess->Strings[1] == ConnectedList->Strings[0])
{
LogMemo->Lines->Add("after Y3 x y1 + Y3^2 x y2 + (y2~ x y1)(Y3 x y1):");
GetMatrixFromMSG(3, TMess, TT1);
LogMemo->Lines->Add(GetMatrixString(TT1));
TT1 = ~TT1;
LogMemo->Lines->Add("transponovana matrix");
LogMemo->Lines->Add(GetMatrixString(TT1));
}
break;
} //switch
}else
{ }//end sum
if (TMess->Strings[2]=="_mul")
{
switch (InputStage)
{
case 6:
if (TMess->Strings[1]==ConnectedList->Strings[2])
{
LogMemo->Lines->Add("after A*b:");
GetMatrixFromMSG(3,TMess, T3);
LogMemo->Lines->Add(GetMatrixString (T3));
}
break;
case 7:
if (TMess->Strings[1]==ConnectedList->Strings[0])
{
LogMemo->Lines->Add("after y2=A1*(5*b1-c1):");
GetMatrixFromMSG(3,TMess, T1);
LogMemo->Lines->Add(GetMatrixString (T1));
TTT1=T1;
T1=~T1;
LogMemo->Lines->Add("transponovana y2");
LogMemo->Lines->Add(GetMatrixString (T1));
}
if (TMess->Strings[1]==ConnectedList->Strings[1])
{
LogMemo->Lines->Add("after Y3=A2*(B2+10*С2):");
GetMatrixFromMSG(3,TMess, T2);
LogMemo->Lines->Add(GetMatrixString (T2));
}
break;
case 8:
if (TMess->Strings[1] == ConnectedList->Strings[0])
{
LogMemo->Lines->Add("after y2~ x y1:");
GetMatrixFromMSG(3, TMess, TT1);
LogMemo->Lines->Add(GetMatrixString(TT1));
}
if (TMess->Strings[1] == ConnectedList->Strings[1])
{
LogMemo->Lines->Add("after Y3^2");
GetMatrixFromMSG(3, TMess, TT2);
LogMemo->Lines->Add(GetMatrixString(TT2)); }
if (TMess->Strings[1] == ConnectedList->Strings[2])
{
LogMemo->Lines->Add("after Y3 x y1:");
GetMatrixFromMSG(3, TMess, T3);
LogMemo->Lines->Add(GetMatrixString(T3));
}
break;
case 9:
if (TMess->Strings[1] == ConnectedList->Strings[0])
{
LogMemo->Lines->Add("after (y2~ x y1)(Y3 x y1):");
etMatrixFromMSG(3, TMess, TT1);
LogMemo->Lines->Add(GetMatrixString(TT1));
}
if (TMess->Strings[1] == ConnectedList->Strings[1])
{
LogMemo->Lines->Add("after Y3^2 x y2");
GetMatrixFromMSG(3, TMess, TT2);
LogMemo->Lines->Add(GetMatrixString(TT2));
}
break;
case 12:
if (TMess->Strings[1] == ConnectedList->Strings[0])
{
LogMemo->Lines->Add("Result:");
GetMatrixFromMSG(3, TMess, TT1);
LogMemo->Lines->Add(GetMatrixString(TT1));
}
break;
} //switch
}//case
}
}
} |
(
