-
Notifications
You must be signed in to change notification settings - Fork 8
/
alignXywh.cpp
140 lines (116 loc) · 2.89 KB
/
alignXywh.cpp
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
//
// Programmer: Craig Stuart Sapp <craig@ccrma.stanford.edu>
// Creation Date: Sat Apr 29 16:34:41 PDT 2023
// Last Modified: Sat Apr 29 16:34:44 PDT 2023
// Filename: cli/alignXywh.cpp
// URL: https://github.com/craigsapp/humlib/blob/master/cli/alignXywh.cpp
// Syntax: C++11
// vim: ts=3 noexpandtab nowrap
//
// Description: Align xywh interpretations (for IIIF bounding boxes)
// on single lines if they are in adjacent tandem
// interpretations with nothing else in other spines.
//
#include "humlib.h"
#include <iostream>
using namespace hum;
using namespace std;
void processFile (HumdrumFile& infile, Options& options);
void mergeLines (HumdrumFile& infile, int index, int count);
bool listQ = false;
///////////////////////////////////////////////////////////////////////////
int main(int argc, char** argv) {
Options options;
options.define("l|list=b", "Only list files that will be processed.");
options.process(argc, argv);
listQ = options.getBoolean("list");
HumdrumFileStream instream(options);
HumdrumFile infile;
while (instream.read(infile)) {
processFile(infile, options);
}
return 0;
}
//////////////////////////////
//
// processFile --
//
void processFile(HumdrumFile& infile, Options& options) {
vector<bool> xywh(infile.getLineCount(), false);
for (int i=0; i<infile.getLineCount(); i++) {
if (!infile[i].isInterpretation()) {
continue;
}
HumRegex hre;
bool hasXywh = false;
bool hasOther = false;
for (int j=0; j<infile[i].getFieldCount(); j++) {
HTp token = infile.token(i, j);
if (*token == "*") {
continue;
}
if (hre.search(token, R"(^\*xywh-)")) {
hasXywh = true;
} else {
hasOther = true;
break;
}
}
if (hasOther) {
continue;
}
if (hasXywh) {
xywh[i] = true;
}
}
bool hasMerger = false;
vector<int> mergers(infile.getLineCount(), 0);
for (int i=0; i<infile.getLineCount(); i++) {
if (!xywh[i]) {
continue;
}
if (mergers[i] < 0) {
continue;
}
mergers[i] = 1;
for (int j=i+1; j<infile.getLineCount(); j++) {
if (!xywh[j]) {
break;
}
mergers[i]++;
hasMerger = true;
mergers[j] = -1;
}
}
if (listQ && hasMerger) {
cout << "MERGER " << infile.getFilename() << endl;
return;
}
for (int i=0; i<(int)mergers.size(); i++) {
if (mergers[i] > 1) {
mergeLines(infile, i, mergers[i]);
}
}
infile.generateLinesFromTokens();
for (int i=0; i<infile.getLineCount(); i++) {
if (mergers[i] >= 0) {
cout << infile[i] << endl;
}
}
}
//////////////////////////////
//
// mergeLines --
//
void mergeLines(HumdrumFile& infile, int index, int count) {
for (int i=1; i<count; i++) {
for (int j=0; j<infile[index+i].getFieldCount(); j++) {
HTp stok = infile.token(index+i, j);
if (*stok == "*") {
continue;
}
HTp ttok = infile.token(index, j);
ttok->setText(stok->getText());
}
}
}