OCCT

// Copyright (c) 2025 OPEN CASCADE SAS
//
// This file is part of Open CASCADE Technology software library.
//
// This library is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License version 2.1 as published
// by the Free Software Foundation, with special exception defined in the file
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
// distribution for complete text of the license and disclaimer of any warranty.
//
// Alternatively, this file may be used under the terms of Open CASCADE
// commercial license or contractual agreement.

#include <NCollection_Array2.hxx>
#include <Standard_Integer.hxx>

#include <gtest/gtest.h>
#include <algorithm>
#include <numeric>
#include <vector>

// --- Constructor Tests ---

TEST(NCollection_Array2Test, DefaultConstructor)
{
  NCollection_Array2<int> anArray;
  EXPECT_EQ(0, anArray.Length());
  EXPECT_EQ(0, anArray.NbRows());
  EXPECT_EQ(0, anArray.NbColumns());
}

TEST(NCollection_Array2Test, ConstructorWithBounds)
{
  NCollection_Array2<int> anArray(1, 5, 1, 10);
  EXPECT_EQ(50, anArray.Length());
  EXPECT_EQ(5, anArray.NbRows());
  EXPECT_EQ(10, anArray.NbColumns());
  EXPECT_EQ(1, anArray.LowerRow());
  EXPECT_EQ(5, anArray.UpperRow());
  EXPECT_EQ(1, anArray.LowerCol());
  EXPECT_EQ(10, anArray.UpperCol());
}

TEST(NCollection_Array2Test, ConstructorWithNegativeBounds)
{
  NCollection_Array2<int> anArray(-2, 2, -5, 5); // 5 rows, 11 cols
  EXPECT_EQ(55, anArray.Length());
  EXPECT_EQ(5, anArray.NbRows());
  EXPECT_EQ(11, anArray.NbColumns());
  EXPECT_EQ(-2, anArray.LowerRow());
  EXPECT_EQ(2, anArray.UpperRow());
  EXPECT_EQ(-5, anArray.LowerCol());
  EXPECT_EQ(5, anArray.UpperCol());
}

// --- Data Access and Manipulation ---

TEST(NCollection_Array2Test, ValueAccess)
{
  NCollection_Array2<int> anArray(1, 3, 1, 4);
  for (int aRowIter = anArray.LowerRow(); aRowIter <= anArray.UpperRow(); ++aRowIter)
  {
    for (int aColIter = anArray.LowerCol(); aColIter <= anArray.UpperCol(); ++aColIter)
    {
      anArray.SetValue(aRowIter, aColIter, aRowIter * 100 + aColIter);
    }
  }

  for (int aRowIter = anArray.LowerRow(); aRowIter <= anArray.UpperRow(); ++aRowIter)
  {
    for (int aColIter = anArray.LowerCol(); aColIter <= anArray.UpperCol(); ++aColIter)
    {
      EXPECT_EQ(aRowIter * 100 + aColIter, anArray.Value(aRowIter, aColIter));
      EXPECT_EQ(aRowIter * 100 + aColIter, anArray(aRowIter, aColIter)); // Using operator()
    }
  }
}

TEST(NCollection_Array2Test, ChangeValueAccess)
{
  NCollection_Array2<int> anArray(0, 2, 0, 3);
  for (int aRowIter = anArray.LowerRow(); aRowIter <= anArray.UpperRow(); ++aRowIter)
  {
    for (int aColIter = anArray.LowerCol(); aColIter <= anArray.UpperCol(); ++aColIter)
    {
      anArray.ChangeValue(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  // Verify initial values
  EXPECT_EQ(102, anArray(1, 2));

  // Modify a value
  anArray.ChangeValue(1, 2) = 999;
  EXPECT_EQ(999, anArray(1, 2));
}

TEST(NCollection_Array2Test, Init)
{
  NCollection_Array2<int> anArray(1, 5, 1, 5);
  anArray.Init(42);
  for (int aRowIter = anArray.LowerRow(); aRowIter <= anArray.UpperRow(); ++aRowIter)
  {
    for (int aColIter = anArray.LowerCol(); aColIter <= anArray.UpperCol(); ++aColIter)
    {
      EXPECT_EQ(42, anArray(aRowIter, aColIter));
    }
  }
}

// --- Copy and Move Semantics ---

TEST(NCollection_Array2Test, CopyConstructor)
{
  NCollection_Array2<int> anArray1(1, 3, 1, 4);
  anArray1.Init(123);

  NCollection_Array2<int> anArray2(anArray1);

  // Verify dimensions and data are copied
  EXPECT_EQ(anArray1.Length(), anArray2.Length());
  EXPECT_EQ(anArray1.NbRows(), anArray2.NbRows());
  EXPECT_EQ(anArray1.NbColumns(), anArray2.NbColumns());
  EXPECT_EQ(anArray1(2, 3), anArray2(2, 3));

  // Modify original to ensure it was a deep copy
  anArray1.SetValue(2, 3, 999);
  EXPECT_EQ(123, anArray2(2, 3));
  EXPECT_NE(anArray1(2, 3), anArray2(2, 3));
}

TEST(NCollection_Array2Test, AssignmentOperator)
{
  NCollection_Array2<int> anArray1(5, 7, 10, 13);
  for (int aRowIter = anArray1.LowerRow(); aRowIter <= anArray1.UpperRow(); ++aRowIter)
  {
    for (int aColIter = anArray1.LowerCol(); aColIter <= anArray1.UpperCol(); ++aColIter)
    {
      anArray1(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  NCollection_Array2<int> anArray2(1, 1, 1, 1);
  anArray2.Init(0);

  anArray2 = anArray1; // Assign

  // Verify dimensions and data are copied
  EXPECT_EQ(anArray1.NbRows(), anArray2.NbRows());
  EXPECT_EQ(anArray1.NbColumns(), anArray2.NbColumns());
  EXPECT_EQ(anArray1.LowerRow(), anArray2.LowerRow());
  EXPECT_EQ(anArray1.LowerCol(), anArray2.LowerCol());
  EXPECT_EQ(612, anArray2(6, 12));

  // Modify original to ensure it was a deep copy
  anArray1.SetValue(6, 12, 999);
  EXPECT_EQ(612, anArray2(6, 12));
}

TEST(NCollection_Array2Test, AssignmentOperatorReusesSameSizeOwnedStorage)
{
  NCollection_Array2<int> anArray(1, 3, 1, 4);
  int*                    anInitialPointer = &anArray.ChangeFirst();

  NCollection_Array2<int> aSource(10, 12, 20, 23);
  for (int aRowIter = aSource.LowerRow(); aRowIter <= aSource.UpperRow(); ++aRowIter)
  {
    for (int aColIter = aSource.LowerCol(); aColIter <= aSource.UpperCol(); ++aColIter)
    {
      aSource(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  anArray = aSource;

  EXPECT_EQ(anInitialPointer, &anArray.ChangeFirst());
  EXPECT_EQ(10, anArray.LowerRow());
  EXPECT_EQ(12, anArray.UpperRow());
  EXPECT_EQ(20, anArray.LowerCol());
  EXPECT_EQ(23, anArray.UpperCol());
  EXPECT_EQ(1122, anArray(11, 22));
}

TEST(NCollection_Array2Test, AssignmentOperatorReusesSameSizeExternalBuffer)
{
  int aBuffer[4] = {0, 0, 0, 0};

  NCollection_Array2<int> anArray(aBuffer, 2, 2);
  NCollection_Array2<int> aSource(5, 6, 7, 8);
  for (int aRowIter = aSource.LowerRow(); aRowIter <= aSource.UpperRow(); ++aRowIter)
  {
    for (int aColIter = aSource.LowerCol(); aColIter <= aSource.UpperCol(); ++aColIter)
    {
      aSource(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  anArray = aSource;

  EXPECT_FALSE(anArray.IsDeletable());
  EXPECT_EQ(5, anArray.LowerRow());
  EXPECT_EQ(7, anArray.LowerCol());
  EXPECT_EQ(507, aBuffer[0]);
  EXPECT_EQ(508, aBuffer[1]);
  EXPECT_EQ(607, aBuffer[2]);
  EXPECT_EQ(608, aBuffer[3]);
}

TEST(NCollection_Array2Test, AssignmentOperatorDetachesDifferentSizeExternalBuffer)
{
  int aBuffer[4] = {1, 2, 3, 4};

  NCollection_Array2<int> anArray(aBuffer, 2, 2);
  NCollection_Array2<int> aSource(5, 6, 7, 9);
  for (int aRowIter = aSource.LowerRow(); aRowIter <= aSource.UpperRow(); ++aRowIter)
  {
    for (int aColIter = aSource.LowerCol(); aColIter <= aSource.UpperCol(); ++aColIter)
    {
      aSource(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  anArray = aSource;

  EXPECT_TRUE(anArray.IsDeletable());
  EXPECT_NE(aBuffer, &anArray.ChangeFirst());
  EXPECT_EQ(2, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());
  EXPECT_EQ(5, anArray.LowerRow());
  EXPECT_EQ(7, anArray.LowerCol());
  EXPECT_EQ(1, aBuffer[0]);
  EXPECT_EQ(2, aBuffer[1]);
  EXPECT_EQ(3, aBuffer[2]);
  EXPECT_EQ(4, aBuffer[3]);
  EXPECT_EQ(608, anArray(6, 8));
}

TEST(NCollection_Array2Test, CopyValuesPreservesBounds)
{
  NCollection_Array2<int> aSource(5, 6, 7, 9);
  for (int aRowIter = aSource.LowerRow(); aRowIter <= aSource.UpperRow(); ++aRowIter)
  {
    for (int aColIter = aSource.LowerCol(); aColIter <= aSource.UpperCol(); ++aColIter)
    {
      aSource(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  NCollection_Array2<int> anArray(1, 2, 1, 3);
  anArray.CopyValues(aSource);

  EXPECT_EQ(1, anArray.LowerRow());
  EXPECT_EQ(2, anArray.UpperRow());
  EXPECT_EQ(1, anArray.LowerCol());
  EXPECT_EQ(3, anArray.UpperCol());
  EXPECT_EQ(507, anArray(1, 1));
  EXPECT_EQ(609, anArray(2, 3));
}

TEST(NCollection_Array2Test, CopyValuesDifferentDimensions)
{
  [[maybe_unused]] NCollection_Array2<int> anArray(1, 2, 1, 3);
  [[maybe_unused]] NCollection_Array2<int> aSource(1, 3, 1, 2);
#ifndef No_Exception
  EXPECT_THROW(anArray.CopyValues(aSource), Standard_DimensionMismatch);
#endif
}

TEST(NCollection_Array2Test, MoveConstructor)
{
  NCollection_Array2<int> anArray1(1, 5, 1, 10);
  anArray1.SetValue(3, 7, 123);

  // Move construct
  NCollection_Array2<int> anArray2(std::move(anArray1));

  // Verify new array has the data and dimensions
  EXPECT_EQ(50, anArray2.Length());
  EXPECT_EQ(5, anArray2.NbRows());
  EXPECT_EQ(10, anArray2.NbColumns());
  EXPECT_EQ(1, anArray2.LowerRow());
  EXPECT_EQ(10, anArray2.UpperCol());
  EXPECT_EQ(123, anArray2(3, 7));

  // Verify the moved-from array is empty
  EXPECT_EQ(0, anArray1.Length());
  EXPECT_EQ(0, anArray1.NbRows());
}

TEST(NCollection_Array2Test, MoveConstructorFromArray1)
{
  NCollection_Array1<int> anArray1(1, 6);
  for (size_t anIndex = 0; anIndex < anArray1.Size(); ++anIndex)
  {
    anArray1.ChangeAt(anIndex) = static_cast<int>(anIndex + 1);
  }
  const int* aData = anArray1.Data();

  NCollection_Array2<int> anArray2(std::move(anArray1), 1, 2, 1, 3);

  EXPECT_EQ(aData, anArray2.Data());
  EXPECT_EQ(0u, anArray1.Size());
  EXPECT_TRUE(anArray2.IsDeletable());
  EXPECT_EQ(2, anArray2.NbRows());
  EXPECT_EQ(3, anArray2.NbColumns());
  EXPECT_EQ(NCollection_Array2<int>::BeginPosition(1, 2, 1, 3), anArray2.Array1().Lower());
  EXPECT_EQ(1, anArray2(1, 1));
  EXPECT_EQ(6, anArray2(2, 3));
}

TEST(NCollection_Array2Test, MoveConstructorFromArray1ZeroBased)
{
  NCollection_Array1<int> anArray1(6);
  for (size_t anIndex = 0; anIndex < anArray1.Size(); ++anIndex)
  {
    anArray1.ChangeAt(anIndex) = static_cast<int>(anIndex + 1);
  }
  const int* aData = anArray1.Data();

  NCollection_Array2<int> anArray2(std::move(anArray1), size_t(2), size_t(3));

  EXPECT_EQ(aData, anArray2.Data());
  EXPECT_EQ(0u, anArray1.Size());
  EXPECT_TRUE(anArray2.IsDeletable());
  EXPECT_EQ(0, anArray2.LowerRow());
  EXPECT_EQ(0, anArray2.LowerCol());
  EXPECT_EQ(2, anArray2.NbRows());
  EXPECT_EQ(3, anArray2.NbColumns());
  EXPECT_EQ(0, anArray2.Array1().Lower());
  EXPECT_EQ(1, anArray2.At(0, 0));
  EXPECT_EQ(6, anArray2.At(1, 2));
}

TEST(NCollection_Array2Test, MoveConstructorFromArray1RejectsWrongSize)
{
#ifndef No_Exception
  NCollection_Array1<int> anArray1(1, 5);
  EXPECT_THROW((NCollection_Array2<int>(std::move(anArray1), 1, 2, 1, 3)),
               Standard_DimensionMismatch);
  EXPECT_EQ(5u, anArray1.Size());
#endif
}

TEST(NCollection_Array2Test, MoveAssignment)
{
  NCollection_Array2<int> anArray1(1, 5, 1, 10);
  anArray1.SetValue(3, 7, 123);

  NCollection_Array2<int> anArray2;
  anArray2 = std::move(anArray1); // Move assignment

  // Verify new array has the data and dimensions
  EXPECT_EQ(50, anArray2.Length());
  EXPECT_EQ(5, anArray2.NbRows());
  EXPECT_EQ(123, anArray2(3, 7));

  // Verify the moved-from array is empty
  EXPECT_EQ(0, anArray1.Length());
}

// --- Resizing and Re-indexing ---

TEST(NCollection_Array2Test, Resize)
{
  NCollection_Array2<int> anArray(1, 4, 1, 5); // 4x5 array
  for (int aRowIter = 1; aRowIter <= 4; ++aRowIter)
  {
    for (int aColIter = 1; aColIter <= 5; ++aColIter)
    {
      anArray(aRowIter, aColIter) = aRowIter * 100 + aColIter;
    }
  }

  // Resize to be larger, keeping data
  anArray.Resize(0, 5, 0, 6, true); // New size 6x7

  // Verify new dimensions
  EXPECT_EQ(6, anArray.NbRows());
  EXPECT_EQ(7, anArray.NbColumns());
  EXPECT_EQ(0, anArray.LowerRow());
  EXPECT_EQ(6, anArray.UpperCol());

  // Verify original data is preserved in the correct locations
  for (int aRowIter = 0; aRowIter <= 3; ++aRowIter)
  {
    for (int aColIter = 0; aColIter <= 4; ++aColIter)
    {
      EXPECT_EQ((aRowIter + 1) * 100 + (aColIter + 1), anArray(aRowIter, aColIter));
    }
  }
}

TEST(NCollection_Array2Test, ReIndex_UpdateBounds)
{
  NCollection_Array2<int> anArray(1, 5, 1, 10); // 5x10 array

  // Test updating lower bounds
  anArray.UpdateLowerRow(0);
  anArray.UpdateLowerCol(0);
  EXPECT_EQ(0, anArray.LowerRow());
  EXPECT_EQ(4, anArray.UpperRow()); // 0 + 5 - 1
  EXPECT_EQ(0, anArray.LowerCol());
  EXPECT_EQ(9, anArray.UpperCol()); // 0 + 10 - 1
  EXPECT_EQ(5, anArray.NbRows());   // Size should not change
  EXPECT_EQ(10, anArray.NbColumns());

  // Test updating upper bounds (which shifts the lower bounds)
  anArray.UpdateUpperRow(10); // Request upper row to be 10
  anArray.UpdateUpperCol(20); // Request upper col to be 20
  EXPECT_EQ(10, anArray.UpperRow());
  EXPECT_EQ(20, anArray.UpperCol());
  EXPECT_EQ(6, anArray.LowerRow());  // Lower is now 10 - 5 + 1
  EXPECT_EQ(11, anArray.LowerCol()); // Lower is now 20 - 10 + 1
  EXPECT_EQ(5, anArray.NbRows());    // Size should not change
  EXPECT_EQ(10, anArray.NbColumns());
}

// --- Iteration ---

TEST(NCollection_Array2Test, STLIteration)
{
  NCollection_Array2<int> anArray(1, 2, 1, 3); // 2x3 array
  for (int aRowIter = 1; aRowIter <= 2; ++aRowIter)
  {
    for (int aColIter = 1; aColIter <= 3; ++aColIter)
    {
      anArray(aRowIter, aColIter) = aRowIter * 10 + aColIter; // 11, 12, 13, 21, 22, 23
    }
  }

  // Test range-based for loop
  std::vector<int> aExpectedValues = {11, 12, 13, 21, 22, 23};
  int              anIndex         = 0;
  for (const auto& aValue : anArray)
  {
    EXPECT_EQ(aExpectedValues[anIndex++], aValue);
  }
  EXPECT_EQ(6, anIndex); // Ensure all elements were visited

  const NCollection_Array2<int>& aConstArray = anArray;
  EXPECT_EQ(anArray.begin(), aConstArray.cbegin());
  EXPECT_EQ(anArray.end(), aConstArray.cend());
  EXPECT_EQ(102, std::accumulate(aConstArray.cbegin(), aConstArray.cend(), 0));

  std::for_each(anArray.begin(), anArray.end(), [](int& theValue) { theValue += 1; });
  EXPECT_EQ(12, anArray(1, 1));
  EXPECT_EQ(24, anArray(2, 3));
}

TEST(NCollection_Array2Test, ResizeWithTrim_PreservesElementPositions)
{
  // Fill a 5x4 array with values encoding (row, col) position.
  NCollection_Array2<int> anArray(1, 5, 1, 4);
  for (int aRow = 1; aRow <= 5; ++aRow)
  {
    for (int aCol = 1; aCol <= 4; ++aCol)
    {
      anArray(aRow, aCol) = aRow * 100 + aCol;
    }
  }

  // Shrink rows (5x4 -> 3x4): only rows 1-3 should be preserved.
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(1, 3, 1, 4, true);
    EXPECT_EQ(3, aCopy.NbRows());
    EXPECT_EQ(4, aCopy.NbColumns());
    for (int aRow = 1; aRow <= 3; ++aRow)
    {
      for (int aCol = 1; aCol <= 4; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }

  // Shrink columns (5x4 -> 5x2): only cols 1-2 should be preserved.
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(1, 5, 1, 2, true);
    EXPECT_EQ(5, aCopy.NbRows());
    EXPECT_EQ(2, aCopy.NbColumns());
    for (int aRow = 1; aRow <= 5; ++aRow)
    {
      for (int aCol = 1; aCol <= 2; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }

  // Shrink both (5x4 -> 3x2): common sub-matrix [1..3, 1..2].
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(1, 3, 1, 2, true);
    EXPECT_EQ(3, aCopy.NbRows());
    EXPECT_EQ(2, aCopy.NbColumns());
    for (int aRow = 1; aRow <= 3; ++aRow)
    {
      for (int aCol = 1; aCol <= 2; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }

  // Grow both (5x4 -> 7x6): original data preserved, new area is default.
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(1, 7, 1, 6, true);
    EXPECT_EQ(7, aCopy.NbRows());
    EXPECT_EQ(6, aCopy.NbColumns());
    for (int aRow = 1; aRow <= 5; ++aRow)
    {
      for (int aCol = 1; aCol <= 4; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }
}

TEST(NCollection_Array2Test, ResizeWithTrim_NonUnitLowerBounds)
{
  // Array with non-1 lower bounds: rows [3..5], cols [10..12].
  NCollection_Array2<int> anArray(3, 5, 10, 12);
  for (int aRow = 3; aRow <= 5; ++aRow)
  {
    for (int aCol = 10; aCol <= 12; ++aCol)
    {
      anArray(aRow, aCol) = aRow * 100 + aCol;
    }
  }

  // Shrink rows, keep cols: [3..4, 10..12].
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(3, 4, 10, 12, true);
    EXPECT_EQ(2, aCopy.NbRows());
    EXPECT_EQ(3, aCopy.NbColumns());
    for (int aRow = 3; aRow <= 4; ++aRow)
    {
      for (int aCol = 10; aCol <= 12; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }

  // Grow both: [3..7, 10..14].
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(3, 7, 10, 14, true);
    EXPECT_EQ(5, aCopy.NbRows());
    EXPECT_EQ(5, aCopy.NbColumns());
    for (int aRow = 3; aRow <= 5; ++aRow)
    {
      for (int aCol = 10; aCol <= 12; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }

  // Same dimensions (no-op optimization): [3..5, 10..12].
  {
    NCollection_Array2<int> aCopy(anArray);
    aCopy.ResizeWithTrim(3, 5, 10, 12, true);
    EXPECT_EQ(3, aCopy.NbRows());
    EXPECT_EQ(3, aCopy.NbColumns());
    for (int aRow = 3; aRow <= 5; ++aRow)
    {
      for (int aCol = 10; aCol <= 12; ++aCol)
      {
        EXPECT_EQ(aRow * 100 + aCol, aCopy(aRow, aCol));
      }
    }
  }
}

TEST(NCollection_Array2Test, Resize_FromEmpty)
{
  // Default-constructed (empty) array resized with data copy should not crash.
  NCollection_Array2<int> anEmpty;
  EXPECT_EQ(0, anEmpty.NbRows());
  EXPECT_EQ(0, anEmpty.NbColumns());

  // Resize with copy (from empty -- nothing to copy, but must not dereference null).
  anEmpty.Resize(1, 3, 1, 2, true);
  EXPECT_EQ(3, anEmpty.NbRows());
  EXPECT_EQ(2, anEmpty.NbColumns());

  // ResizeWithTrim from empty.
  NCollection_Array2<int> anEmpty2;
  anEmpty2.ResizeWithTrim(1, 2, 1, 4, true);
  EXPECT_EQ(2, anEmpty2.NbRows());
  EXPECT_EQ(4, anEmpty2.NbColumns());
}

TEST(NCollection_Array2Test, Resize_SameSizeNewBounds)
{
  // When dimensions are unchanged but lower bounds change,
  // the Array1 lower bound must also be updated.
  NCollection_Array2<int> anArray(1, 3, 1, 3);
  for (int aRow = 1; aRow <= 3; ++aRow)
  {
    for (int aCol = 1; aCol <= 3; ++aCol)
    {
      anArray(aRow, aCol) = aRow * 10 + aCol;
    }
  }

  // Same 3x3 dimensions but shifted bounds: [5..7, 10..12].
  anArray.ResizeWithTrim(5, 7, 10, 12, true);
  EXPECT_EQ(3, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());

  // Data should be preserved with new indices.
  for (int aRow = 5; aRow <= 7; ++aRow)
  {
    for (int aCol = 10; aCol <= 12; ++aCol)
    {
      EXPECT_EQ((aRow - 4) * 10 + (aCol - 9), anArray(aRow, aCol));
    }
  }
}

TEST(NCollection_Array2Test, Resize_ChangeShapeSameSize)
{
  // This test checks for data scrambling when resizing to a different shape
  // with the same total number of elements.
  NCollection_Array2<int> anArray(1, 4, 1, 6); // 4x6 = 24 elements
  int                     anExpectedValue = 0;
  for (int aRowIter = 1; aRowIter <= 4; ++aRowIter)
  {
    for (int aColIter = 1; aColIter <= 6; ++aColIter)
    {
      anArray(aRowIter, aColIter) = anExpectedValue++;
    }
  }

  // Resize to 6x4 (24 elements), copying data
  anArray.Resize(1, 6, 1, 4, true);

  // Verify new dimensions
  EXPECT_EQ(6, anArray.NbRows());
  EXPECT_EQ(4, anArray.NbColumns());
  EXPECT_EQ(24, anArray.Length());

  // Verify the common 4x4 sub-matrix was not scrambled.
  // This will fail if the copy logic in Resize is incorrect.
  for (int anElemInd = anArray.Array1().Lower(); anElemInd < anArray.Array1().Lower() + 16;
       ++anElemInd)
  {
    EXPECT_EQ(anElemInd - anArray.Array1().Lower(), anArray.Array1().Value(anElemInd));
  }
}

TEST(NCollection_Array2Test, ReIndex_Interference)
{
  // This test explicitly verifies that UpdateUpperRow modifies the LowerRow,
  // showing how the separate update methods can interfere with each other.
  NCollection_Array2<int> anArray(1, 10, 1, 1); // A 10x1 array
  const int               anInitialNbRows = anArray.NbRows();

  // 1. User sets a new lower bound.
  anArray.UpdateLowerRow(5);
  EXPECT_EQ(5, anArray.LowerRow());
  EXPECT_EQ(14, anArray.UpperRow()); // Upper bound is now 5 + 10 - 1

  // 2. User then sets a new upper bound, expecting the lower bound to stay at 5.
  anArray.UpdateUpperRow(12);

  // 3. Verify the final state.
  EXPECT_EQ(12, anArray.UpperRow()); // The upper bound is set as requested.

  // Verify that the lower bound was changed to accommodate the new upper bound,
  // undoing the previous call to UpdateLowerRow.
  EXPECT_EQ(3, anArray.LowerRow()); // Lower bound is now 12 - 10 + 1 = 3
  EXPECT_NE(5, anArray.LowerRow()); // It is no longer 5.

  // The total number of rows should never change during these operations.
  EXPECT_EQ(anInitialNbRows, anArray.NbRows());
}

// Helper struct for testing in-place construction with multiple arguments
struct Array2MultiArgType
{
  int    myA;
  double myB;

  Array2MultiArgType()
      : myA(0),
        myB(0.0)
  {
  }

  Array2MultiArgType(int theA, double theB)
      : myA(theA),
        myB(theB)
  {
  }
};

TEST(NCollection_Array2Test, EmplaceValue)
{
  NCollection_Array2<Array2MultiArgType> anArray(1, 3, 1, 4);

  // Test EmplaceValue with multiple constructor arguments
  Array2MultiArgType& aRef1 = anArray.EmplaceValue(1, 1, 42, 3.14);
  EXPECT_EQ(42, aRef1.myA);
  EXPECT_NEAR(3.14, aRef1.myB, 1e-10);

  Array2MultiArgType& aRef2 = anArray.EmplaceValue(2, 3, 100, 2.71);
  EXPECT_EQ(100, aRef2.myA);
  EXPECT_NEAR(2.71, aRef2.myB, 1e-10);

  // Verify the values are in the array
  EXPECT_EQ(42, anArray(1, 1).myA);
  EXPECT_EQ(100, anArray(2, 3).myA);

  // Verify other elements are default-constructed
  EXPECT_EQ(0, anArray(1, 2).myA);
  EXPECT_EQ(0, anArray(3, 4).myA);
}

TEST(NCollection_Array2Test, EmplaceValue_ReplacesExisting)
{
  NCollection_Array2<Array2MultiArgType> anArray(1, 2, 1, 2);

  // Set initial values
  anArray.EmplaceValue(1, 1, 11, 1.1);
  anArray.EmplaceValue(1, 2, 12, 1.2);
  anArray.EmplaceValue(2, 1, 21, 2.1);
  anArray.EmplaceValue(2, 2, 22, 2.2);

  // Replace value at (1, 2)
  Array2MultiArgType& aRef = anArray.EmplaceValue(1, 2, 120, 12.0);
  EXPECT_EQ(120, aRef.myA);
  EXPECT_NEAR(12.0, aRef.myB, 1e-10);

  // Verify other values unchanged
  EXPECT_EQ(11, anArray(1, 1).myA);
  EXPECT_EQ(120, anArray(1, 2).myA);
  EXPECT_EQ(21, anArray(2, 1).myA);
  EXPECT_EQ(22, anArray(2, 2).myA);
}

TEST(NCollection_Array2Test, Resize_SameSizeNewBounds_Linear)
{
  // Test Resize() (linear copy) with same dimensions but shifted bounds.
  NCollection_Array2<int> anArray(1, 3, 1, 3);
  for (int aRow = 1; aRow <= 3; ++aRow)
  {
    for (int aCol = 1; aCol <= 3; ++aCol)
    {
      anArray(aRow, aCol) = aRow * 10 + aCol;
    }
  }

  // Same 3x3 dimensions but shifted bounds: [5..7, 10..12].
  anArray.Resize(5, 7, 10, 12, true);
  EXPECT_EQ(3, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());

  // Data should be preserved with new indices.
  for (int aRow = 5; aRow <= 7; ++aRow)
  {
    for (int aCol = 10; aCol <= 12; ++aCol)
    {
      EXPECT_EQ((aRow - 4) * 10 + (aCol - 9), anArray(aRow, aCol));
    }
  }
}

TEST(NCollection_Array2Test, Resize_NoCopy)
{
  // Test Resize(..., false) re-allocates without copying data.
  NCollection_Array2<int> anArray(1, 3, 1, 4);
  anArray.Init(42);

  // Resize without copy to different dimensions.
  anArray.Resize(1, 5, 1, 2, false);
  EXPECT_EQ(5, anArray.NbRows());
  EXPECT_EQ(2, anArray.NbColumns());

  // Resize without copy to same dimensions (no-op for allocation, but bounds may differ).
  anArray.Init(7);
  anArray.Resize(10, 14, 20, 21, false);
  EXPECT_EQ(5, anArray.NbRows());
  EXPECT_EQ(2, anArray.NbColumns());
  EXPECT_EQ(10, anArray.LowerRow());
  EXPECT_EQ(20, anArray.LowerCol());
}

TEST(NCollection_Array2Test, ResizeWithTrim_GrowPreservesOldRegion)
{
  // Verify that the preserved sub-matrix is intact after growing.
  // New (uncopied) elements are uninitialized for POD types, so only
  // the old region is checked.
  NCollection_Array2<int> anArray(1, 2, 1, 2);
  anArray.Init(99);

  // Grow from 2x2 to 4x3.
  anArray.ResizeWithTrim(1, 4, 1, 3, true);
  EXPECT_EQ(4, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());

  // Old 2x2 region should be preserved.
  for (int aRow = 1; aRow <= 2; ++aRow)
  {
    for (int aCol = 1; aCol <= 2; ++aCol)
    {
      EXPECT_EQ(99, anArray(aRow, aCol));
    }
  }
}

// ============================================================================
// Zero-based (size_t) construction mode tests
// ============================================================================

TEST(NCollection_Array2Test, SizeConstructor_AllocatesCorrectly)
{
  const size_t            aNbRows = 3;
  const size_t            aNbCols = 4;
  NCollection_Array2<int> anArray(aNbRows, aNbCols);

  EXPECT_EQ(aNbRows, static_cast<size_t>(anArray.NbRows()));
  EXPECT_EQ(aNbCols, static_cast<size_t>(anArray.NbColumns()));
  EXPECT_EQ(aNbRows * aNbCols, anArray.Size());
  EXPECT_EQ(0, anArray.LowerRow());
  EXPECT_EQ(0, anArray.LowerCol());
  EXPECT_EQ(static_cast<int>(aNbRows) - 1, anArray.UpperRow());
  EXPECT_EQ(static_cast<int>(aNbCols) - 1, anArray.UpperCol());
  EXPECT_TRUE(anArray.IsDeletable());
}

TEST(NCollection_Array2Test, SizeConstructor_AtAccess)
{
  const size_t            aNbRows = 3;
  const size_t            aNbCols = 5;
  NCollection_Array2<int> anArray(aNbRows, aNbCols);

  for (size_t aRow = 0; aRow < aNbRows; ++aRow)
  {
    for (size_t aCol = 0; aCol < aNbCols; ++aCol)
    {
      anArray.ChangeAt(aRow, aCol) = static_cast<int>(aRow * 100 + aCol);
    }
  }

  for (size_t aRow = 0; aRow < aNbRows; ++aRow)
  {
    for (size_t aCol = 0; aCol < aNbCols; ++aCol)
    {
      EXPECT_EQ(static_cast<int>(aRow * 100 + aCol), anArray.At(aRow, aCol));
    }
  }
}

TEST(NCollection_Array2Test, SizeConstructor_LegacyOperatorZeroBased)
{
  // When LowerRow/Col == 0, operator()(row, col) is also 0-based
  NCollection_Array2<int> anArray(static_cast<size_t>(2), static_cast<size_t>(3));
  anArray(0, 0) = 1;
  anArray(0, 1) = 2;
  anArray(1, 2) = 9;

  EXPECT_EQ(1, anArray.At(0, 0));
  EXPECT_EQ(2, anArray.At(0, 1));
  EXPECT_EQ(9, anArray.At(1, 2));
}

TEST(NCollection_Array2Test, SizeConstructor_BufferReuse_NotOwner)
{
  int                     aBuf[6] = {1, 2, 3, 4, 5, 6};
  NCollection_Array2<int> anArray(aBuf, 2, 3);

  EXPECT_FALSE(anArray.IsDeletable());
  EXPECT_EQ(2, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());
  EXPECT_EQ(0, anArray.LowerRow());
  EXPECT_EQ(0, anArray.LowerCol());
}

TEST(NCollection_Array2Test, SizeConstructor_BufferReuse_DataPreserved)
{
  // Row-major layout: buf[row * nbCols + col]
  int                     aBuf[6] = {10, 20, 30, 40, 50, 60};
  NCollection_Array2<int> anArray(aBuf, 2, 3);

  EXPECT_EQ(10, anArray.At(0, 0));
  EXPECT_EQ(20, anArray.At(0, 1));
  EXPECT_EQ(30, anArray.At(0, 2));
  EXPECT_EQ(40, anArray.At(1, 0));
  EXPECT_EQ(50, anArray.At(1, 1));
  EXPECT_EQ(60, anArray.At(1, 2));
}

TEST(NCollection_Array2Test, SizeConstructor_Resize_Grow)
{
  NCollection_Array2<int> anArray(static_cast<size_t>(2), static_cast<size_t>(2));
  anArray.Init(7);

  anArray.Resize(static_cast<size_t>(3), static_cast<size_t>(3), true);

  EXPECT_EQ(3, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());
  // Original 2x2 values (linear copy) should be preserved in first 4 elements
  EXPECT_EQ(7, anArray.At(0, 0));
  EXPECT_EQ(7, anArray.At(0, 1));
}

TEST(NCollection_Array2Test, SizeConstructor_Resize_NoData)
{
  NCollection_Array2<int> anArray(static_cast<size_t>(3), static_cast<size_t>(4));
  anArray.Init(5);

  anArray.Resize(static_cast<size_t>(2), static_cast<size_t>(2), false);

  EXPECT_EQ(2, anArray.NbRows());
  EXPECT_EQ(2, anArray.NbColumns());
  EXPECT_EQ(0, anArray.LowerRow());
  EXPECT_EQ(0, anArray.LowerCol());
  EXPECT_TRUE(anArray.IsDeletable());
}

TEST(NCollection_Array2Test, SizeConstructor_ResizeWithTrim_GrowPreserves)
{
  NCollection_Array2<int> anArray(static_cast<size_t>(2), static_cast<size_t>(2));
  anArray.Init(42);

  anArray.ResizeWithTrim(static_cast<size_t>(3), static_cast<size_t>(3), true);

  EXPECT_EQ(3, anArray.NbRows());
  EXPECT_EQ(3, anArray.NbColumns());
  // Original 2x2 corner should be preserved
  for (size_t aRow = 0; aRow < 2; ++aRow)
  {
    for (size_t aCol = 0; aCol < 2; ++aCol)
    {
      EXPECT_EQ(42, anArray.At(aRow, aCol));
    }
  }
}