|
| 1 | +/* |
| 2 | + * This file is part of Poedit (https://poedit.net) |
| 3 | + * |
| 4 | + * Copyright (C) 2000-2025 Vaclav Slavik |
| 5 | + * |
| 6 | + * Permission is hereby granted, free of charge, to any person obtaining a |
| 7 | + * copy of this software and associated documentation files (the "Software"), |
| 8 | + * to deal in the Software without restriction, including without limitation |
| 9 | + * the rights to use, copy, modify, merge, publish, distribute, sublicense, |
| 10 | + * and/or sell copies of the Software, and to permit persons to whom the |
| 11 | + * Software is furnished to do so, subject to the following conditions: |
| 12 | + * |
| 13 | + * The above copyright notice and this permission notice shall be included in |
| 14 | + * all copies or substantial portions of the Software. |
| 15 | + * |
| 16 | + * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 17 | + * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| 18 | + * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| 19 | + * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| 20 | + * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING |
| 21 | + * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER |
| 22 | + * DEALINGS IN THE SOFTWARE. |
| 23 | + * |
| 24 | + */ |
| 25 | + |
| 26 | +#include "cat_operations.h" |
| 27 | + |
| 28 | +#include "catalog_po.h" |
| 29 | +#include "concurrency.h" |
| 30 | +#include "progress.h" |
| 31 | + |
| 32 | +#include <set> |
| 33 | + |
| 34 | + |
| 35 | +namespace |
| 36 | +{ |
| 37 | + |
| 38 | +inline wxString ItemMergeSummary(const CatalogItemPtr& item) |
| 39 | +{ |
| 40 | + wxString s = item->GetRawString(); |
| 41 | + if ( item->HasPlural() ) |
| 42 | + s += " | " + item->GetRawPluralString(); |
| 43 | + if ( item->HasContext() ) |
| 44 | + s += wxString::Format(" [%s]", item->GetContext()); |
| 45 | + |
| 46 | + return s; |
| 47 | +} |
| 48 | + |
| 49 | +} // anonymous namespace |
| 50 | + |
| 51 | + |
| 52 | +void ComputeMergeStats(MergeStats& r, CatalogPtr po, CatalogPtr refcat) |
| 53 | +{ |
| 54 | + Progress progress(2); |
| 55 | + |
| 56 | + r.added.clear(); |
| 57 | + r.removed.clear(); |
| 58 | + |
| 59 | + // First collect all strings from both sides, then diff the sets. |
| 60 | + // Run the two sides in parallel for speed up on large files. |
| 61 | + |
| 62 | + std::set<wxString> strsThis, strsRef; |
| 63 | + |
| 64 | + auto collect1 = dispatch::async([&] |
| 65 | + { |
| 66 | + for (auto& i: po->items()) |
| 67 | + strsThis.insert(ItemMergeSummary(i)); |
| 68 | + }); |
| 69 | + |
| 70 | + auto collect2 = dispatch::async([&] |
| 71 | + { |
| 72 | + for (auto& i: refcat->items()) |
| 73 | + strsRef.insert(ItemMergeSummary(i)); |
| 74 | + }); |
| 75 | + |
| 76 | + collect1.get(); |
| 77 | + collect2.get(); |
| 78 | + progress.increment(); |
| 79 | + |
| 80 | + auto add1 = dispatch::async([&] |
| 81 | + { |
| 82 | + for (auto& i: strsThis) |
| 83 | + { |
| 84 | + if (strsRef.find(i) == strsRef.end()) |
| 85 | + r.removed.push_back(i); |
| 86 | + } |
| 87 | + }); |
| 88 | + |
| 89 | + auto add2 = dispatch::async([&] |
| 90 | + { |
| 91 | + for (auto& i: strsRef) |
| 92 | + { |
| 93 | + if (strsThis.find(i) == strsThis.end()) |
| 94 | + r.added.push_back(i); |
| 95 | + } |
| 96 | + }); |
| 97 | + |
| 98 | + add1.get(); |
| 99 | + add2.get(); |
| 100 | + progress.increment(); |
| 101 | +} |
| 102 | + |
| 103 | + |
| 104 | +MergeResult MergeCatalogWithReference(CatalogPtr catalog, CatalogPtr reference) |
| 105 | +{ |
| 106 | + auto po_catalog = std::dynamic_pointer_cast<POCatalog>(catalog); |
| 107 | + auto po_ref = std::dynamic_pointer_cast<POCatalog>(reference); |
| 108 | + if (!po_catalog || !po_ref) |
| 109 | + return {}; |
| 110 | + |
| 111 | + if (!po_catalog->UpdateFromPOT(po_ref)) |
| 112 | + return {}; |
| 113 | + |
| 114 | + return {po_catalog}; |
| 115 | +} |
0 commit comments