Add comprehensive unit tests for SqliteDB functionality

- Implemented tests for database connection, query execution, and data manipulation.
- Added tests for parameterized queries, data retrieval, and error handling.
- Included tests for transactions, validation, and pagination of results.
- Verified behavior for edge cases such as non-existent tables and invalid queries.
- Ensured proper cleanup of test database files after each test run.

Author: AstroAir

atom/algorithm/convolve.cpp

@@ -287,94 +287,4 @@ template usize FloodFill::processRowSIMD<f32>(f32*, i32, i32, f32, f32);
 template usize FloodFill::processRowSIMD<u8>(u8*, i32, i32, u8, u8);
 #endif
 
-<<<<<<< HEAD
 }  // namespace atom::algorithm
-=======
-// Implementation of block processing template function
-template <Grid GridType>
-usize FloodFill::processBlock(
-    GridType& grid, i32 blockX, i32 blockY, i32 blockSize,
-    typename GridType::value_type::value_type target_color,
-    typename GridType::value_type::value_type fill_color, Connectivity conn,
-    std::queue<std::pair<i32, i32>>& borderQueue) {
-    usize filled_count = 0;
-    i32 rows = static_cast<i32>(grid.size());
-    i32 cols = static_cast<i32>(grid[0].size());
-
-    // Calculate block boundaries
-    i32 endX = std::min(blockX + blockSize, rows);
-    i32 endY = std::min(blockY + blockSize, cols);
-
-    // Use BFS to process the block
-    std::queue<std::pair<i32, i32>> localQueue;
-    std::vector<std::vector<bool>> localVisited(
-        static_cast<usize>(blockSize),
-        std::vector<bool>(static_cast<usize>(blockSize), false));
-
-    // Find any already filled pixel in the block to use as starting point
-    bool found_start = false;
-    for (i32 x = blockX; x < endX && !found_start; ++x) {
-        for (i32 y = blockY; y < endY && !found_start; ++y) {
-            if (grid[static_cast<usize>(x)][static_cast<usize>(y)] ==
-                fill_color) {
-                // Check neighbors for target color pixels
-                auto directions = getDirections(conn);
-                for (auto [dx, dy] : directions) {
-                    i32 nx = x + dx;
-                    i32 ny = y + dy;
-
-                    if (isInBounds(nx, ny, rows, cols) &&
-                        grid[static_cast<usize>(nx)][static_cast<usize>(ny)] ==
-                            target_color &&
-                        nx >= blockX && nx < endX && ny >= blockY &&
-                        ny < endY) {
-                        localQueue.emplace(nx, ny);
-                        localVisited[static_cast<usize>(nx - blockX)]
-                                    [static_cast<usize>(ny - blockY)] = true;
-                        grid[static_cast<usize>(nx)][static_cast<usize>(ny)] =
-                            fill_color;
-                        filled_count++;
-                        found_start = true;
-                    }
-                }
-            }
-        }
-    }
-
-    // Perform BFS within the block
-    auto directions = getDirections(conn);
-    while (!localQueue.empty()) {
-        auto [x, y] = localQueue.front();
-        localQueue.pop();
-
-        for (auto [dx, dy] : directions) {
-            i32 nx = x + dx;
-            i32 ny = y + dy;
-
-            if (isInBounds(nx, ny, rows, cols) &&
-                grid[static_cast<usize>(nx)][static_cast<usize>(ny)] ==
-                    target_color) {
-                // Check if the pixel is within the current block
-                if (nx >= blockX && nx < endX && ny >= blockY && ny < endY) {
-                    if (!localVisited[static_cast<usize>(nx - blockX)]
-                                     [static_cast<usize>(ny - blockY)]) {
-                        grid[static_cast<usize>(nx)][static_cast<usize>(ny)] =
-                            fill_color;
-                        localQueue.emplace(nx, ny);
-                        localVisited[static_cast<usize>(nx - blockX)]
-                                    [static_cast<usize>(ny - blockY)] = true;
-                        filled_count++;
-                    }
-                } else {
-                    // Pixel is outside the block, add to border queue
-                    borderQueue.emplace(x, y);
-                }
-            }
-        }
-    }
-
-    return filled_count;
-}
-
-}  // namespace atom::algorithm
->>>>>>> 7ca9448dadcbc6c2bb1a7286a72a7abccac61dea