-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmodel.cpp
More file actions
77 lines (63 loc) · 1.86 KB
/
model.cpp
File metadata and controls
77 lines (63 loc) · 1.86 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/**
* @file model.cpp
* @author Marián Tarageľ (xtarag01)
* @brief Model and RLE encoding
* @date 8.5.2024
*/
#include <vector>
#include <cstdint>
std::vector<uint8_t> diff_model(std::vector<uint8_t> buffer)
{
uint8_t prev = buffer[0];
for (unsigned long int i = 1; i < buffer.size(); i++) {
uint8_t copy = buffer[i];
buffer[i] -= prev;
prev = copy;
}
return buffer;
}
std::vector<uint8_t> rle(std::vector<uint8_t> buffer)
{
std::vector<uint8_t> rle_buffer;
unsigned long int i = 0;
while (i < buffer.size()) {
uint8_t value = buffer[i];
uint8_t count = 1;
if (i + count < buffer.size()) { // check whether we are still in buffer
// while the symbol is the same increase value count
while (buffer[i + count] == value) {
count++;
if ((count == 255) || (i + count == buffer.size())) // maximum possible value count is 255 (8 bits)
break;
}
}
// encode in tuples (count, value)
rle_buffer.push_back(count);
rle_buffer.push_back(value);
i += count;
}
return rle_buffer;
}
std::vector<uint8_t> inverse_diff_model(std::vector<uint8_t> buffer)
{
std::vector<uint8_t> output;
uint8_t prev = buffer[0];
output.push_back(prev);
for (unsigned long int i = 1; i < buffer.size(); i++) {
uint8_t value = buffer[i] + prev;
output.push_back(value);
prev = value;
}
return output;
}
std::vector<uint8_t> inverse_rle(std::vector<uint8_t> buffer)
{
std::vector<uint8_t> output;
for (unsigned long int i = 0; i < buffer.size(); i += 2) {
uint8_t count = buffer[i];
uint8_t value = buffer[i + 1];
for (unsigned long int i = 0; i < count; i++)
output.push_back(value);
}
return output;
}