2 files changed, 17 insertions, 12 deletions
diff --git a/Swift/Controllers/Roster/LeastCommonSubsequence.h b/Swift/Controllers/Roster/LeastCommonSubsequence.h
index 8daa20c..7988ee7 100644
--- a/Swift/Controllers/Roster/LeastCommonSubsequence.h
+++ b/Swift/Controllers/Roster/LeastCommonSubsequence.h
@@ -1,11 +1,11 @@
 /*
- * Copyright (c) 2011-2016 Isode Limited.
+ * Copyright (c) 2011-2018 Isode Limited.
  * All rights reserved.
  * See the COPYING file for more information.
  */
 
 #pragma once
 
 #include <vector>
 
 #include <boost/numeric/conversion/cast.hpp>
@@ -26,19 +26,19 @@ namespace Swift {
             }
             for (size_t j = 0; j < height; ++j) {
                 result[j*width] = 0;
             }
 
             // Compute the LCS lengths for subsets
             Predicate predicate;
             for (size_t i = 1; i < width; ++i) {
                 for (size_t j = 1; j < height; ++j) {
-                    result[i + j*width] = predicate(*(xBegin + boost::numeric_cast<long long>(i)-1), *(yBegin + boost::numeric_cast<long long >(j)-1)) ? result[(i-1) + (j-1)*width] + 1 : std::max(result[i + (j-1)*width], result[i-1 + (j*width)]);
+                    result[i + j*width] = predicate(*(xBegin + static_cast<long long>(i)-1), *(yBegin + static_cast<long long>(j)-1)) ? result[(i-1) + (j-1)*width] + 1 : std::max(result[i + (j-1)*width], result[i-1 + (j*width)]);
                 }
             }
         }
     }
 
     template<typename X, typename InsertRemovePredicate, typename UpdatePredicate>
     void computeIndexDiff(const std::vector<X>& x, const std::vector<X>& y, std::vector<size_t>& updates, std::vector<size_t>& postUpdates, std::vector<size_t>& removes, std::vector<size_t>& inserts) {
         InsertRemovePredicate insertRemovePredicate;
         UpdatePredicate updatePredicate;
diff --git a/Swift/Controllers/Roster/TableRoster.cpp b/Swift/Controllers/Roster/TableRoster.cpp
index 713f390..01bf4a6 100644
--- a/Swift/Controllers/Roster/TableRoster.cpp
+++ b/Swift/Controllers/Roster/TableRoster.cpp
@@ -1,11 +1,11 @@
 /*
- * Copyright (c) 2011-2016 Isode Limited.
+ * Copyright (c) 2011-2018 Isode Limited.
  * All rights reserved.
  * See the COPYING file for more information.
  */
 
 #include <Swift/Controllers/Roster/TableRoster.h>
 
 #include <algorithm>
 #include <cassert>
 
@@ -126,27 +126,32 @@ void TableRoster::handleUpdateTimerTick() {
     assert(sectionUpdates.size() == sectionPostUpdates.size());
     for (size_t i = 0; i < sectionUpdates.size(); ++i) {
         assert(sectionUpdates[i] < sections.size());
         assert(sectionPostUpdates[i] < newSections.size());
         std::vector<size_t> itemUpdates;
         std::vector<size_t> itemPostUpdates;
         std::vector<size_t> itemRemoves;
         std::vector<size_t> itemInserts;
         computeIndexDiff<Item, ItemEquals, ItemNeedsUpdate >(sections[sectionUpdates[i]].items, newSections[sectionPostUpdates[i]].items, itemUpdates, itemPostUpdates, itemRemoves, itemInserts);
-        size_t end = update.insertedRows.size();
-        update.insertedRows.resize(update.insertedRows.size() + itemInserts.size());
-        std::transform(itemInserts.begin(), itemInserts.end(), update.insertedRows.begin() + boost::numeric_cast<long long>(end), CreateIndexForSection(sectionPostUpdates[i]));
-        end = update.deletedRows.size();
-        update.deletedRows.resize(update.deletedRows.size() + itemRemoves.size());
-        std::transform(itemRemoves.begin(), itemRemoves.end(), update.deletedRows.begin() + boost::numeric_cast<long long>(end), CreateIndexForSection(sectionUpdates[i]));
-        end = update.updatedRows.size();
-        update.updatedRows.resize(update.updatedRows.size() + itemUpdates.size());
-        std::transform(itemUpdates.begin(), itemUpdates.end(), update.updatedRows.begin() + boost::numeric_cast<long long>(end), CreateIndexForSection(sectionPostUpdates[i]));
+        try {
+            size_t end = update.insertedRows.size();
+            update.insertedRows.resize(update.insertedRows.size() + itemInserts.size());
+            std::transform(itemInserts.begin(), itemInserts.end(), update.insertedRows.begin() + boost::numeric_cast<long long>(end), CreateIndexForSection(sectionPostUpdates[i]));
+            end = update.deletedRows.size();
+            update.deletedRows.resize(update.deletedRows.size() + itemRemoves.size());
+            std::transform(itemRemoves.begin(), itemRemoves.end(), update.deletedRows.begin() + boost::numeric_cast<long long>(end), CreateIndexForSection(sectionUpdates[i]));
+            end = update.updatedRows.size();
+            update.updatedRows.resize(update.updatedRows.size() + itemUpdates.size());
+            std::transform(itemUpdates.begin(), itemUpdates.end(), update.updatedRows.begin() + boost::numeric_cast<long long>(end), CreateIndexForSection(sectionPostUpdates[i]));
+        }
+        catch (const boost::numeric::bad_numeric_cast&) {
+            // If any container claims it has more than long long max items, we have bigger issues, so letting this pass
+        }
     }
 
     // Switch the old model with the new
     sections.swap(newSections);
 
     /*
     std::cerr << "-S: ";
     for (size_t i = 0; i < update.deletedSections.size(); ++i) {
         std::cerr << update.deletedSections[i] << " ";