Replace CFX_PtrArray with typesafe CFX_ArrayTemplate, Part 5

xfa/fxbarcode/qrcode/BC_QRFinderPatternFinder.cpp

 // Copyright 2014 PDFium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
 // Original code is licensed as follows:
 /*
  * Copyright 2007 ZXing authors
  *
  * Licensed under the Apache License, Version 2.0 (the "License");
@@ skipping 24 matching lines @@
 const int32_t CBC_QRFinderPatternFinder::MIN_SKIP = 3;
 const int32_t CBC_QRFinderPatternFinder::MAX_MODULES = 57;
 const int32_t CBC_QRFinderPatternFinder::INTEGER_MATH_SHIFT = 8;
 
 CBC_QRFinderPatternFinder::CBC_QRFinderPatternFinder(
     CBC_CommonBitMatrix* image) {
   m_image = image;
   m_crossCheckStateCount.SetSize(5);
   m_hasSkipped = FALSE;
 }
+
 CBC_QRFinderPatternFinder::~CBC_QRFinderPatternFinder() {
-  for (int32_t i = 0; i < m_possibleCenters.GetSize(); i++) {
-    delete (CBC_QRFinderPattern*)m_possibleCenters[i];
-  }
-  m_possibleCenters.RemoveAll();
+  for (int32_t i = 0; i < m_possibleCenters.GetSize(); i++)
+    delete m_possibleCenters[i];
 }
+
 class ClosestToAverageComparator {
  private:
   FX_FLOAT m_averageModuleSize;
 
  public:
   ClosestToAverageComparator(FX_FLOAT averageModuleSize)
       : m_averageModuleSize(averageModuleSize) {}
   int32_t operator()(FinderPattern* a, FinderPattern* b) {
     FX_FLOAT dA =
         (FX_FLOAT)fabs(a->GetEstimatedModuleSize() - m_averageModuleSize);
@@ skipping 12 matching lines @@
   return m_image;
 }
 CFX_Int32Array& CBC_QRFinderPatternFinder::GetCrossCheckStateCount() {
   m_crossCheckStateCount[0] = 0;
   m_crossCheckStateCount[1] = 0;
   m_crossCheckStateCount[2] = 0;
   m_crossCheckStateCount[3] = 0;
   m_crossCheckStateCount[4] = 0;
   return m_crossCheckStateCount;
 }
-CFX_PtrArray* CBC_QRFinderPatternFinder::GetPossibleCenters() {
+
+CFX_ArrayTemplate<CBC_QRFinderPattern*>*
+CBC_QRFinderPatternFinder::GetPossibleCenters() {
   return &m_possibleCenters;
 }
+
 CBC_QRFinderPatternInfo* CBC_QRFinderPatternFinder::Find(int32_t hint,
                                                          int32_t& e) {
   int32_t maxI = m_image->GetHeight();
   int32_t maxJ = m_image->GetWidth();
   int32_t iSkip = (3 * maxI) / (4 * MAX_MODULES);
   if (iSkip < MIN_SKIP || 0) {
     iSkip = MIN_SKIP;
   }
   FX_BOOL done = FALSE;
   CFX_Int32Array stateCount;
@@ skipping 58 matching lines @@
     if (FoundPatternCross(stateCount)) {
       FX_BOOL confirmed = HandlePossibleCenter(stateCount, i, maxJ);
       if (confirmed) {
         iSkip = stateCount[0];
         if (m_hasSkipped) {
           done = HaveMultiplyConfirmedCenters();
         }
       }
     }
   }
-  std::unique_ptr<CFX_PtrArray> patternInfo(SelectBestpatterns(e));
+  std::unique_ptr<CFX_ArrayTemplate<CBC_QRFinderPattern*>> patternInfo(
+      SelectBestpatterns(e));
   BC_EXCEPTION_CHECK_ReturnValue(e, NULL);
   OrderBestPatterns(patternInfo.get());
   return new CBC_QRFinderPatternInfo(patternInfo.get());
 }
-void CBC_QRFinderPatternFinder::OrderBestPatterns(CFX_PtrArray* patterns) {
-  FX_FLOAT abDistance = Distance((CBC_ResultPoint*)(*patterns)[0],
-                                 (CBC_ResultPoint*)(*patterns)[1]);
-  FX_FLOAT bcDistance = Distance((CBC_ResultPoint*)(*patterns)[1],
-                                 (CBC_ResultPoint*)(*patterns)[2]);
-  FX_FLOAT acDistance = Distance((CBC_ResultPoint*)(*patterns)[0],
-                                 (CBC_ResultPoint*)(*patterns)[2]);
-  CBC_QRFinderPattern *topLeft, *topRight, *bottomLeft;
+void CBC_QRFinderPatternFinder::OrderBestPatterns(
+    CFX_ArrayTemplate<CBC_QRFinderPattern*>* patterns) {
+  FX_FLOAT abDistance = Distance((*patterns)[0], (*patterns)[1]);
+  FX_FLOAT bcDistance = Distance((*patterns)[1], (*patterns)[2]);
+  FX_FLOAT acDistance = Distance((*patterns)[0], (*patterns)[2]);
+  CBC_QRFinderPattern* topLeft;
+  CBC_QRFinderPattern* topRight;
+  CBC_QRFinderPattern* bottomLeft;
   if (bcDistance >= abDistance && bcDistance >= acDistance) {
-    topLeft = (CBC_QRFinderPattern*)(*patterns)[0];
-    topRight = (CBC_QRFinderPattern*)(*patterns)[1];
-    bottomLeft = (CBC_QRFinderPattern*)(*patterns)[2];
+    topLeft = (*patterns)[0];
+    topRight = (*patterns)[1];
+    bottomLeft = (*patterns)[2];
   } else if (acDistance >= bcDistance && acDistance >= abDistance) {
-    topLeft = (CBC_QRFinderPattern*)(*patterns)[1];
-    topRight = (CBC_QRFinderPattern*)(*patterns)[0];
-    bottomLeft = (CBC_QRFinderPattern*)(*patterns)[2];
+    topLeft = (*patterns)[1];
+    topRight = (*patterns)[0];
+    bottomLeft = (*patterns)[2];
   } else {
-    topLeft = (CBC_QRFinderPattern*)(*patterns)[2];
-    topRight = (CBC_QRFinderPattern*)(*patterns)[0];
-    bottomLeft = (CBC_QRFinderPattern*)(*patterns)[1];
+    topLeft = (*patterns)[2];
+    topRight = (*patterns)[0];
+    bottomLeft = (*patterns)[1];
   }
   if ((bottomLeft->GetY() - topLeft->GetY()) *
           (topRight->GetX() - topLeft->GetX()) <
       (bottomLeft->GetX() - topLeft->GetX()) *
           (topRight->GetY() - topLeft->GetY())) {
     CBC_QRFinderPattern* temp = topRight;
     topRight = bottomLeft;
     bottomLeft = temp;
   }
   (*patterns)[0] = bottomLeft;
@@ skipping 169 matching lines @@
   FX_FLOAT centerI =
       CrossCheckVertical(i, (int32_t)centerJ, stateCount[2], stateCountTotal);
   if (!FXSYS_isnan(centerI)) {
     centerJ = CrossCheckHorizontal((int32_t)centerJ, (int32_t)centerI,
                                    stateCount[2], stateCountTotal);
     if (!FXSYS_isnan(centerJ)) {
       FX_FLOAT estimatedModuleSize = (FX_FLOAT)stateCountTotal / 7.0f;
       FX_BOOL found = FALSE;
       int32_t max = m_possibleCenters.GetSize();
       for (int32_t index = 0; index < max; index++) {
-        CBC_QRFinderPattern* center =
-            (CBC_QRFinderPattern*)(m_possibleCenters[index]);
+        CBC_QRFinderPattern* center = m_possibleCenters[index];
         if (center->AboutEquals(estimatedModuleSize, centerI, centerJ)) {
           center->IncrementCount();
           found = TRUE;
           break;
         }
       }
       if (!found) {
         m_possibleCenters.Add(
             new CBC_QRFinderPattern(centerJ, centerI, estimatedModuleSize));
       }
       return TRUE;
     }
   }
   return FALSE;
 }
 int32_t CBC_QRFinderPatternFinder::FindRowSkip() {
   int32_t max = m_possibleCenters.GetSize();
   if (max <= 1) {
     return 0;
   }
   FinderPattern* firstConfirmedCenter = NULL;
   for (int32_t i = 0; i < max; i++) {
-    CBC_QRFinderPattern* center = (CBC_QRFinderPattern*)m_possibleCenters[i];
+    CBC_QRFinderPattern* center = m_possibleCenters[i];
     if (center->GetCount() >= CENTER_QUORUM) {
       if (firstConfirmedCenter == NULL) {
         firstConfirmedCenter = center;
       } else {
         m_hasSkipped = TRUE;
         return (int32_t)((fabs(firstConfirmedCenter->GetX() - center->GetX()) -
                           fabs(firstConfirmedCenter->GetY() - center->GetY())) /
                          2);
       }
     }
   }
   return 0;
 }
 FX_BOOL CBC_QRFinderPatternFinder::HaveMultiplyConfirmedCenters() {
   int32_t confirmedCount = 0;
   FX_FLOAT totalModuleSize = 0.0f;
   int32_t max = m_possibleCenters.GetSize();
   int32_t i;
   for (i = 0; i < max; i++) {
-    CBC_QRFinderPattern* pattern = (CBC_QRFinderPattern*)m_possibleCenters[i];
+    CBC_QRFinderPattern* pattern = m_possibleCenters[i];
     if (pattern->GetCount() >= CENTER_QUORUM) {
       confirmedCount++;
       totalModuleSize += pattern->GetEstimatedModuleSize();
     }
   }
   if (confirmedCount < 3) {
     return FALSE;
   }
   FX_FLOAT average = totalModuleSize / (FX_FLOAT)max;
   FX_FLOAT totalDeviation = 0.0f;
   for (i = 0; i < max; i++) {
-    CBC_QRFinderPattern* pattern = (CBC_QRFinderPattern*)m_possibleCenters[i];
+    CBC_QRFinderPattern* pattern = m_possibleCenters[i];
     totalDeviation += fabs(pattern->GetEstimatedModuleSize() - average);
   }
   return totalDeviation <= 0.05f * totalModuleSize;
 }
-inline FX_BOOL centerComparator(void* a, void* b) {
-  return ((CBC_QRFinderPattern*)b)->GetCount() <
-         ((CBC_QRFinderPattern*)a)->GetCount();
-}
-CFX_PtrArray* CBC_QRFinderPatternFinder::SelectBestpatterns(int32_t& e) {
+
+CFX_ArrayTemplate<CBC_QRFinderPattern*>*
+CBC_QRFinderPatternFinder::SelectBestpatterns(int32_t& e) {
   int32_t startSize = m_possibleCenters.GetSize();
   if (m_possibleCenters.GetSize() < 3) {
     e = BCExceptionRead;
     BC_EXCEPTION_CHECK_ReturnValue(e, NULL);
   }
   FX_FLOAT average = 0.0f;
   if (startSize > 3) {
     FX_FLOAT totalModuleSize = 0.0f;
-    for (int32_t i = 0; i < startSize; i++) {
-      totalModuleSize += ((CBC_QRFinderPattern*)m_possibleCenters[i])
-                             ->GetEstimatedModuleSize();
-    }
+    for (int32_t i = 0; i < startSize; i++)
+      totalModuleSize += m_possibleCenters[i]->GetEstimatedModuleSize();
+
     average = totalModuleSize / (FX_FLOAT)startSize;
     for (int32_t j = 0;
          j < m_possibleCenters.GetSize() && m_possibleCenters.GetSize() > 3;
          j++) {
-      CBC_QRFinderPattern* pattern = (CBC_QRFinderPattern*)m_possibleCenters[j];
+      CBC_QRFinderPattern* pattern = m_possibleCenters[j];
       if (fabs(pattern->GetEstimatedModuleSize() - average) > 0.2f * average) {
         delete pattern;
         m_possibleCenters.RemoveAt(j);
         j--;
       }
     }
   }
   if (m_possibleCenters.GetSize() > 3) {
-    BC_FX_PtrArray_Sort(m_possibleCenters, centerComparator);
+    std::sort(m_possibleCenters.GetData(),
+              m_possibleCenters.GetData() + m_possibleCenters.GetSize(),
+              [](const CBC_QRFinderPattern* a, CBC_QRFinderPattern* b) {
+                return a->GetCount() > b->GetCount();  // e.g. Descending.
+              });
   }
-  CFX_PtrArray* vec = new CFX_PtrArray();
+  CFX_ArrayTemplate<CBC_QRFinderPattern*>* vec =
+      new CFX_ArrayTemplate<CBC_QRFinderPattern*>();
   vec->SetSize(3);
-  (*vec)[0] = ((CBC_QRFinderPattern*)m_possibleCenters[0])->Clone();
-  (*vec)[1] = ((CBC_QRFinderPattern*)m_possibleCenters[1])->Clone();
-  (*vec)[2] = ((CBC_QRFinderPattern*)m_possibleCenters[2])->Clone();
+  (*vec)[0] = m_possibleCenters[0]->Clone();
+  (*vec)[1] = m_possibleCenters[1]->Clone();
+  (*vec)[2] = m_possibleCenters[2]->Clone();
   return vec;
 }