-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathClientDataPart.cpp
More file actions
58 lines (40 loc) · 2 KB
/
ClientDataPart.cpp
File metadata and controls
58 lines (40 loc) · 2 KB
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
#include <stdexcept>
using namespace std;
#include "ClientDataPart.hpp"
const uint32_t ClientDataPart::magic;
ClientDataPart::ClientDataPart(const Matrix &matrix): linearEquasions(matrix){}
ClientDataPart::ClientDataPart(Matrix &&matrix): linearEquasions(matrix){}
ClientDataPart::ClientDataPart(const Buffer &binaryContainer): linearEquasions(){
if(binaryContainer.getSize() < additionalInfoSize)
throw runtime_error("Buffer size is less than additionalInfoSize");
uint32_t pos = 0;
if(binaryContainer.get<uint32_t>(pos++) != magic)
throw runtime_error("Magic number does not match");
uint32_t rowCount = binaryContainer.get<uint32_t>(pos++);
uint32_t colCount = binaryContainer.get<uint32_t>(pos++);
if(binaryContainer.getSize() < additionalInfoSize + sizeof(uint32_t) * colCount * rowCount)
throw runtime_error("Container is broken...");
linearEquasions.resize(rowCount, colCount);
for(uint32_t row = 0; row < rowCount; ++row)
for(uint32_t col = 0; col < colCount; ++col)
linearEquasions.get(row, col) = binaryContainer.get<uint32_t>(pos++);
}
ClientDataPart::ClientDataPart(const ClientDataPart &cdp): linearEquasions(cdp.linearEquasions){}
ClientDataPart::ClientDataPart(ClientDataPart &&cdp): linearEquasions(move(cdp.linearEquasions)){}
Buffer ClientDataPart::toBinaryContainer() const{
uint32_t rowCount = linearEquasions.getRowCount();
uint32_t colCount = linearEquasions.getColumnCount();
uint64_t bufferSize = additionalInfoSize + sizeof(uint32_t) * colCount * rowCount;
//структура контейнера: количество уравнений, размер уравнений, полиномы.
Buffer result(bufferSize);
result.write<uint32_t>(magic);
result.write<uint32_t>(rowCount);
result.write<uint32_t>(colCount);
for(uint32_t row = 0; row < rowCount; ++row)
for(uint32_t col = 0; col < colCount; ++col)
result.write<uint32_t>(linearEquasions.get(row, col).getValue());
return result;
}
const Matrix &ClientDataPart::getLinearEquasions() const{
return linearEquasions;
}