contrek 1.2.4 → 1.2.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 0df584b1fe92f70cb27f479a6d7705545f662b8758a4843bf966fe92d90c4c9d
-  data.tar.gz: 2dfe6f8b0cc96298858f5055158ba439644d24a9921166c572e91cd5df17780b
+  metadata.gz: 32d1d662c0c6c0c1dc6ffcde36090b188e7d3abd39fc5dd7ba0887aa62526b27
+  data.tar.gz: df8b75836abf466043587f22995f12e13c3ed908b60a4fcda97216e803458540
 SHA512:
-  metadata.gz: d97742b1bc4f3688a8d083d25873da8db709b69c42c8068d02cfe6fe3569acac159f3d1a37c31128a7809b0e9851ba5e9da15c801f18c514189e53f4bc39440a
-  data.tar.gz: ee34393dc9713f62de0560b5d6538e7e9ffd6ff38358429f14f7ab7efb3cde201f2461d4ec209ed906a0a0e1e6aa0eb013040dddf290856400f632131e4c3622
+  metadata.gz: 33c9e4906109bcd7cee694401b3946b0fe2e5800c551bc20a4ea428bdb7cbe7eb456a2e7cadd57327ca93bf65491284e4566b2caaa9e0ea28a5c771c8e50510b
+  data.tar.gz: ede6984f06ebef2b9672e1f1c0569428b25332e9bb14249a8341fdc1e4f11c493a066015a496bd9d19baec57a97bf98d4d99d23262a4a7dac93757c129e8c441

data/CHANGELOG.md

@@ -95,7 +95,14 @@ All notable changes to this project will be documented in this file.
 
 ## [1.2.3] - 2026-05-23
 ### Changed
-### Changed
 * **SVG Conversion:** Added utility methods to convert point coordinates directly into SVG paths.
 * **Contrek API & RAII Architecture:** Refactored the Contrek API to utilize an RAII (Resource Acquisition Is Initialization) pattern, safely wrapping both the trace engine and the processing results within a unified context lifecycle shell.
 * **ProcessResult Memory Management:** Updated `ProcessResult` to properly manage resource deallocation during cloning operations, ensuring deep-copied or moved internal points are automatically and safely freed when the context scope ends.
+
+## [1.2.4] - 2026-05-26
+### Changed
+* Fixed an issue in connectivity8 tracing mode that, under specific rare conditions, disrupted the topological continuity of external contours in favor of internal ones.
+
+## [1.2.5] - 2026-05-27
+### Changed
+- **Refactored `ProcessResult.clone()`:** Switched from fragmented dynamic allocation to a contiguous `std::vector` with explicit `.reserve()`. Eliminates heap fragmentation during high-res streaming.

data/ext/cpp_polygon_finder/PolygonFinder/src/Tests.cpp

@@ -17,6 +17,8 @@
 #include <cstring>
 #include <algorithm>
 #include <cstdio>
+#include <sys/resource.h>
+
 #include "polygon/finder/PolygonFinder.h"
 #include "polygon/finder/concurrent/ClippedPolygonFinder.h"
 #include "polygon/bitmaps/Bitmap.h"
@@ -260,6 +262,16 @@ void Tests::test_h()
   delete right_result;
 }
 
+double get_peak_rss() {
+  struct rusage r_usage;
+  getrusage(RUSAGE_SELF, &r_usage);
+#ifdef __APPLE__
+  return r_usage.ru_maxrss / (1024.0 * 1024.0);
+#else
+  return r_usage.ru_maxrss / 1024.0;
+#endif
+}
+
 /* In this example, PNG data is read by streaming into a user-defined buffer height.
   Contrek scans each stripe and extracts the polygons. Finally, it merges all
   polygons from every stripe as if they had been read from a single image and saves
@@ -303,7 +315,7 @@ void stream_png_image(const std::string& filepath, uint32_t stripe_height) {
     }
 
     size_t row_size = static_cast<size_t>(total_width) * 4;
-    // main strpes loop
+    // main stripes loop
     for (uint32_t current_y_offset = 0; current_y_offset < total_height; current_y_offset += stripe_height) {
       int uncovered_height = total_height - current_y_offset;
 
@@ -366,4 +378,5 @@ void stream_png_image(const std::string& filepath, uint32_t stripe_height) {
 
 void Tests::test_i() {
   stream_png_image("../images/graphs_1024x1024.png", 300);
+  std::cout << "Memory usage peak: " << get_peak_rss() << " MB" << std::endl;
 }

data/ext/cpp_polygon_finder/PolygonFinder/src/polygon/finder/Node.h

@@ -62,6 +62,7 @@ struct Point {
     return x == other.x && y == other.y;
   }
   Point(int x_, int y_) : x(x_), y(y_) {}
+  Point() : x(0), y(0) {}
 };
 
 class Node : public  Listable {

data/ext/cpp_polygon_finder/PolygonFinder/src/polygon/finder/PolygonFinder.cpp

@@ -103,7 +103,6 @@ void PolygonFinder::scan() {
 ProcessResult* PolygonFinder::process_info() {
   ProcessResult *pr = new ProcessResult();
   pr->groups = this->node_cluster->sequences.size();
-  pr->polygons = std::move(this->node_cluster->polygons);
   pr->benchmarks = std::move(this->reports);
   pr->treemap = this->node_cluster->treemap;
   pr->width = this->source_bitmap->w();
@@ -124,6 +123,7 @@ ProcessResult* PolygonFinder::process_info() {
     pr->named_sequence = sequence;
   }
   else pr->named_sequence = "";
+  pr->polygons = std::move(this->node_cluster->polygons);
   return(pr);
 }
 

data/ext/cpp_polygon_finder/PolygonFinder/src/polygon/finder/PolygonFinder.h

@@ -63,7 +63,7 @@ struct ProcessResult {
   std::list<Polygon> polygons;
   std::string named_sequence;
   std::vector<std::pair<int, int>> treemap;
-  std::vector<std::unique_ptr<Point>> cloned_points_storage;
+  std::vector<Point> cloned_points_storage;
 
   void draw_on_bitmap(RawBitmap& canvas) const;
 
@@ -119,22 +119,25 @@ struct ProcessResult {
 
     for (const auto& poly : this->polygons) {
       Polygon new_poly;
-      // bounds
       new_poly.bounds = poly.bounds;
+      new_poly.outer.reserve(poly.outer.size());
       // outer
       for (const Point* p : poly.outer) {
         if (p) {
-          new_res->cloned_points_storage.push_back(std::make_unique<Point>(p->x, p->y));
-          new_poly.outer.push_back(new_res->cloned_points_storage.back().get());
+          new_res->cloned_points_storage.push_back(Point(p->x, p->y));
+          size_t idx = new_res->cloned_points_storage.size() - 1;
+          new_poly.outer.push_back(&new_res->cloned_points_storage[idx]);
         }
       }
       // inner
       for (const auto& seq : poly.inner) {
         std::vector<Point*> new_seq;
+        new_seq.reserve(seq.size());
         for (const Point* p : seq) {
           if (p) {
-            new_res->cloned_points_storage.push_back(std::make_unique<Point>(p->x, p->y));
-            new_seq.push_back(new_res->cloned_points_storage.back().get());
+            new_res->cloned_points_storage.push_back(Point(p->x, p->y));
+            size_t idx = new_res->cloned_points_storage.size() - 1;
+            new_seq.push_back(&new_res->cloned_points_storage[idx]);
           }
         }
         new_poly.inner.push_back(new_seq);

data/lib/contrek/version.rb

@@ -1,3 +1,3 @@
 module Contrek
-  VERSION = "1.2.4"
+  VERSION = "1.2.5"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: contrek
 version: !ruby/object:Gem::Version
-  version: 1.2.4
+  version: 1.2.5
 platform: ruby
 authors:
 - Emanuele Cesaroni
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2026-05-26 00:00:00.000000000 Z
+date: 2026-05-27 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec