-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbar-lines.inl
126 lines (81 loc) · 3.34 KB
/
bar-lines.inl
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
// Copyright (C) 2025 by Brenton Bostick
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
// associated documentation files (the "Software"), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
// and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do
// so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all copies or substantial
// portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS
// OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#define TAG "bar-lines"
//
// https://bostick.github.io/tabit-file-format/description/tabit-file-format-description.html#bar-lines
//
template <uint8_t VERSION, typename tbt_file_t>
Status
parseBarLinesMap(
std::vector<uint8_t>::const_iterator &it,
const std::vector<uint8_t>::const_iterator &end,
tbt_file_t &out) {
if constexpr (0x70 <= VERSION) {
auto begin = it;
it += out.header.barCount * 6;
CHECK(it <= end, "unhandled");
std::vector<uint8_t> data(begin, it);
std::vector<std::array<uint8_t, 6> > parts;
Status ret = partitionInto<6>(data, parts);
if (ret != OK) {
return ret;
}
out.body.barLinesSpaceCount = 0;
out.body.barLinesMap.clear();
for (const std::array<uint8_t, 6> &part : parts) {
auto space = out.body.barLinesSpaceCount;
//
// stored as 32-bit int, so must be cast
//
out.body.barLinesSpaceCount += static_cast<uint16_t>(parseLE4(part[0], part[1], part[2], part[3]));
out.body.barLinesMap[space] = { part[4], part[5] };
}
return OK;
} else {
uint16_t barLinesSpaceCount;
if constexpr (VERSION == 0x6f) {
barLinesSpaceCount = out.header.spaceCount;
} else {
barLinesSpaceCount = 4000;
}
std::vector<uint8_t> barLinesDeltaListAcc;
uint32_t sqCount = 0;
while (true) {
std::vector<uint8_t> deltaList;
Status ret = parseDeltaListChunk(it, end, deltaList);
if (ret != OK) {
return ret;
}
barLinesDeltaListAcc.insert(barLinesDeltaListAcc.end(), deltaList.cbegin(), deltaList.cend());
ret = computeDeltaListCount(deltaList, &sqCount);
if (ret != OK) {
return ret;
}
CHECK(sqCount <= barLinesSpaceCount, "unhandled");
if (sqCount == barLinesSpaceCount) {
break;
}
}
Status ret = expandDeltaList<1>(barLinesDeltaListAcc, barLinesSpaceCount, 0, out.body.barLinesMap);
if (ret != OK) {
return ret;
}
return OK;
}
}
#undef TAG