Added binary build of current version.

LICENSE

@@ -0,0 +1,18 @@
+MIT License
+
+Copyright (c) 2025 xp986
+
+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.

README.md

@@ -0,0 +1,3 @@
+# ReportTruncate-Robinson
+
+Truncates the daily report from the BonAppetit system. Modifications for the Alameda store.

ReportTruncate-Alameda.cpp

@@ -18,7 +18,7 @@ bool find_first_number_in_line(const std::string& s, int& out, const std::regex&
     return false;
 }
 
-// Check if a line contains exactly 24 consecutive '?'
+// Check if a line contains exactly 24 consecutive 'Ä'
 bool has_exactly_24_A(const std::string& s) {
     int count = 0;
     for (size_t i = 0; i <= s.size(); ++i) {
@@ -39,13 +39,14 @@ int main(int argc, char* argv[]) {
         return 1;
     }
 
-    std::ifstream infile(argv[1]);
+    // Read entire file into memory as lines
+    std::ifstream infile(argv[1], std::ios::binary);
     if (!infile) {
         std::cerr << "Error opening input file.\n";
         return 1;
     }
 
-    std::ofstream outfile(argv[2]);
+    std::ofstream outfile(argv[2], std::ios::binary);
     if (!outfile) {
         std::cerr << "Error opening output file.\n";
         return 1;
@@ -54,9 +55,27 @@ int main(int argc, char* argv[]) {
     std::vector<std::string> lines;
     std::string line;
     while (std::getline(infile, line)) {
+        if (!infile.eof()) line += '\n'; // preserve original line endings
         lines.push_back(line);
     }
 
+    // Detect if document should be modified
+    bool has_bbgyro = false;
+    bool has_subs = false;
+    for (const auto& l : lines) {
+        if (!has_bbgyro && l.find("BBGYRO") != std::string::npos) has_bbgyro = true;
+        if (!has_subs && l.find("SUBS") != std::string::npos) has_subs = true;
+        if (has_bbgyro || has_subs) break;
+    }
+
+    // If neither BBGYRO nor SUBS appears, pass file through unmodified
+    if (!has_bbgyro && !has_subs) {
+        infile.clear();
+        infile.seekg(0, std::ios::beg);
+        outfile << infile.rdbuf(); // exact byte-for-byte copy
+        return 0;
+    }
+
     const std::string marker = "F.L.C.M. %";
 
     // === 1) Find marker index ===
@@ -71,7 +90,10 @@ int main(int argc, char* argv[]) {
     }
 
     if (!marker_found) {
-        for (const auto& l : lines) outfile << l << '\n';
+        // Marker not found, write original file unchanged
+        infile.clear();
+        infile.seekg(0, std::ios::beg);
+        outfile << infile.rdbuf();
         return 0;
     }
 
@@ -79,7 +101,7 @@ int main(int argc, char* argv[]) {
     int gyros = 0;
     bool gyros_found = false;
     size_t bbgyro_index = std::string::npos;
-    const std::string bbgyro_token = "BBGYRS";
+    const std::string bbgyro_token = "BBGYRO";
 
     for (size_t i = 0; i < lines.size(); ++i) {
         size_t pos = lines[i].find(bbgyro_token);
@@ -142,18 +164,14 @@ int main(int argc, char* argv[]) {
         size_t ff_pos = l.find('\f');
         if (!inserted && ff_pos != std::string::npos) {
             std::string modified = l.substr(0, ff_pos) + insert_line + l.substr(ff_pos);
-            outfile << modified << '\n';
+            outfile << modified;
             inserted = true;
         }
         else {
-            outfile << l << '\n';
+            outfile << l;
         }
     }
 
-    if (!inserted) {
-        outfile << insert_line << '\n';
-    }
-
     if (inserted) {
         // === 6) Append a form feed to the very end of the truncated document ===
         outfile << '\f';