contrek 1.2.3 → 1.2.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 07f6097c256b6d44373aa941b969b12dd68630e168c72b29d1ae478bb5f48186
-  data.tar.gz: 7ec31b1ef4413e679e31a123f367d0a86ed332160455c8024ea185ca67c27020
+  metadata.gz: 32d1d662c0c6c0c1dc6ffcde36090b188e7d3abd39fc5dd7ba0887aa62526b27
+  data.tar.gz: df8b75836abf466043587f22995f12e13c3ed908b60a4fcda97216e803458540
 SHA512:
-  metadata.gz: c03213b7499e5741bf3c90044251a5ba6fc606905f3c72ff93462a62ffc116ebae7ce211fb2a201862d874ae865df048e45cf85beed094bc60967d2b4dd6fc34
-  data.tar.gz: ae891e55d9d9ef5503f654d79c7187713579c6fa1c699736d446d6b19497ddb9d30723a26e98a77261481f364466b7d891962e9937433a65e6e341f240129faa
+  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/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    contrek (1.2.3)
+    contrek (1.2.4)
       chunky_png (~> 1.4)
       concurrent-ruby (~> 1.3.5)
       rice (= 4.5.0)

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/ext/cpp_polygon_finder/PolygonFinder/src/polygon/finder/concurrent/Cursor.cpp

@@ -86,9 +86,8 @@ void Cursor::traverse_outer(Part* act_part,
         auto& q_set = new_position->end_point()->queues();
         auto it = std::find_if(q_set.begin(), q_set.end(), [&](Queueable<Point>* q) {
           Part* p = static_cast<Part*>(q);
-          return p->versus() == -versus && p->polyline()->tile != act_part->polyline()->tile;
+          return (p->mirror || act_part->mirror || p->versus() == -versus) && p->polyline()->tile != act_part->polyline()->tile;
         });
-
         Part* part = nullptr;
         if (it != q_set.end()) {
           part = static_cast<Part*>(*it);
@@ -97,24 +96,26 @@ void Cursor::traverse_outer(Part* act_part,
           const auto n = all_parts.size();
           Part *last_last_part = n >= 2 ? all_parts[n - 2] : nullptr;
           if (last_last_part != part) {
+            bool all_seam = false;
             if (n >= 2) {
-              bool all_seam = true;
+              all_seam = true;
               for (std::size_t i = all_parts.size() - 2; i < all_parts.size(); ++i) {
                 if (all_parts[i]->type != Part::SEAM) {
                   all_seam = false;
                   break;
                 }
               }
-              if (all_seam) break;
             }
-            if (shapes_sequence_lookup.insert(part->polyline()->shape).second) {
-              shapes_sequence.push_back(part->polyline()->shape);
+            if (!all_seam) {
+              if (shapes_sequence_lookup.insert(part->polyline()->shape).second) {
+                shapes_sequence.push_back(part->polyline()->shape);
+              }
+              part->next_position(new_position);
+              part->dead_end = true;
+              act_part = part;
+              jumped_to_new_part = true;
+              break;
             }
-            part->next_position(new_position);
-            part->dead_end = true;
-            act_part = part;
-            jumped_to_new_part = true;
-            break;
           }
         }
         if (!jumped_to_new_part) {

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

@@ -65,7 +65,13 @@ void Part::orient()
 { if (this->size <= 1 || (this->size == 2 && this->inverts)) {
     this->versus_ = 0;
   } else {
-    this->versus_ = (this->tail->payload->y - this->head->payload->y) > 0 ? 1 : -1;
+    int diff = this->tail->payload->y - this->head->payload->y;
+    if (diff == 0) {
+      this->mirror = true;
+      this->versus_ = 0;
+    } else {
+      this->versus_ = diff > 0 ? 1 : -1;
+    }
   }
 }
 
@@ -78,6 +84,7 @@ std::string Part::inspect() {
   std::stringstream ss;
   ss << "part " << part_index
   << " (versus=" << this->versus_
+  << " mirror=" << this->mirror
   << " inv=" << this->inverts
   << " trm=" << this->trasmuted
   << " touched=" << this->touched_

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

@@ -33,6 +33,7 @@ class Part : public Queueable<Point> {
   bool inverts = false;
   bool trasmuted = false;
   bool dead_end = false;
+  bool mirror = false;
   Part* next = nullptr;
   Part* prev = nullptr;
   Part* circular_next = nullptr;

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

@@ -87,10 +87,16 @@ void Partitionable::trasmute_parts()
         }
         return false;
       });
-      if (count == inside->size && count < inside_compare->size) {
-        inside->type = Part::EXCLUSIVE;
-        inside->trasmuted = true;
-        break;
+      if (count == inside->size) {
+        if (count < inside_compare->size) {
+          inside->type = Part::EXCLUSIVE;
+          inside->trasmuted = true;
+          break;
+        } else if ( count == inside_compare->size &&
+                    inside->next == nullptr &&
+                    inside_compare->prev == nullptr) {
+          inside->mirror = true;
+        }
       }
     }
   }

data/lib/contrek/finder/concurrent/cursor.rb

@@ -115,7 +115,7 @@ module Contrek
             new_position.end_point.tracked_outer = true
             versus = act_part.versus
             part = new_position.end_point.queues.find do |p|
-              p.versus == -versus && p.polyline.tile != act_part.polyline.tile
+              (p.mirror || act_part.mirror || p.versus == -versus) && p.polyline.tile != act_part.polyline.tile
             end
             if part
               if all_parts[-2] != part

data/lib/contrek/finder/concurrent/part.rb

@@ -8,7 +8,7 @@ module Contrek
       ADDED = 2
 
       attr_reader :polyline, :touched
-      attr_accessor :next, :circular_next, :prev, :type, :dead_end, :inverts, :trasmuted, :versus
+      attr_accessor :next, :circular_next, :prev, :type, :dead_end, :inverts, :trasmuted, :versus, :mirror
       def initialize(type, polyline)
         @type = type
         @polyline = polyline
@@ -20,6 +20,7 @@ module Contrek
         @inverts = false
         @trasmuted = false
         @versus = 0
+        @mirror = false
       end
 
       def is?(type)
@@ -56,7 +57,7 @@ module Contrek
       end
 
       def inspect
-        "part #{polyline.parts.index(self)} (versus=#{@versus} inv=#{@inverts} trm=#{@trasmuted} touched=#{@touched} dead_end =#{@dead_end}, #{size}x) of #{polyline.info} (#{name}) (#{to_a.map { |e| "[#{e[:x]},#{e[:y]}]" }.join})"
+        "part #{polyline.parts.index(self)} (mir=#{@mirror} versus=#{@versus} inv=#{@inverts} trm=#{@trasmuted} touched=#{@touched} dead_end =#{@dead_end}, #{size}x) of #{polyline.named} (#{name}) (#{to_a.map { |e| "[#{e[:x]},#{e[:y]}]" }.join})"
       end
 
       def innerable?
@@ -67,7 +68,13 @@ module Contrek
         @versus = if size <= 1 || (size == 2 && @inverts)
           0
         else
-          (tail.payload[:y] - head.payload[:y]).positive? ? 1 : -1
+          diff = tail.payload[:y] - head.payload[:y]
+          if diff == 0
+            @mirror = true
+            0
+          else
+            diff.positive? ? 1 : -1
+          end
         end
       end
 

data/lib/contrek/finder/concurrent/partitionable.rb

@@ -73,6 +73,10 @@ module Contrek
               inside.trasmuted = true
               break
             end
+            if count == inside.size && count == inside_compare.size &&
+                inside.next.nil? && inside_compare.prev.nil?
+              inside.mirror = true
+            end
           end
         end
       end

data/lib/contrek/version.rb

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

metadata

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