contrek 1.0.8 → 1.0.9

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 862b863c602031251fedc2dc18a59c9bd270d91acff25761c24164e34e8952e9
-  data.tar.gz: 97f18e804accd2d6ae11f95223c95eebe198eafb07c745261d1110f5edf5eae4
+  metadata.gz: 15c162c3876502f8e8710ce261825dfe7fa66e1b600db084763e02ef70876a37
+  data.tar.gz: 32203f85040726d71ac519aac811d4078474c85dcd7c7b08227f1cea7e3b485f
 SHA512:
-  metadata.gz: d3d9ce7c0b5ae1a3c62f91480d63856312d89334f181899ccc2ff304c3fef983578838484da18f865ce1d50ea3cb3c291ce49fef1b01dcfaf397ab688bed9e37
-  data.tar.gz: c8f7aade05577e132829e7ffcc6af5e637aa879bb6972f4ba8566c8db7d11b641862e32a170c39db4b8ab57666996a4639ffd3f516ba85712266b7ffd82ac276
+  metadata.gz: c9f8d2a44f087f96cfeacc8df8dec0973bf301f770ae45e82e6bf7d01902546c280c0446ee9c281c850a8e7c8965309e20d1a723ec269e60a99d386c288af0e7
+  data.tar.gz: 4d2c5c834fca24731866d0a56cc64d4aeac12437fac11b78389c38f7fbed9e637c785eb2a3357fb5c90a5fc257b2d010fe36cac2f84db3888f2b311276c42895

data/CHANGELOG.md

@@ -29,3 +29,8 @@ All notable changes to this project will be documented in this file.
 - Fixed ARGB/RGBA format discrepancies between Ruby and C++.
 - Updated the multithreading-side algorithm for rejoining mono-connected orphan polygons to other orphan polygons. The algorithm can now identify them and defer their processing within the pipeline.
 - Improved, on the multithreading side, the polygon intersection detection mechanism; the geometric approach has been dropped in favor of a purely topological one.
+
+## [1.0.9] - 2026-01-31
+### Added
+- **CMake Integration**: The library is now fully modularized via CMake, enabling seamless integration as a dependency in external C++ projects.
+- Multithreading Algorithm Optimization.

data/Gemfile.lock

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

data/README.md

@@ -1,5 +1,5 @@
 # Contrek
-Contrek is a Ruby gem with a C++ core for fast contour tracing and edge detection in PNG images. Unlike standard geometric tracers, it employs a **topological approach** to extract polygonal contours, representing shapes as a connected graph of shared endpoints. This ensures perfect adjacency and structural integrity for shape analysis and raster-to-vector workflows, such as PNG to SVG conversion, managed via libspng (0.7.4) with multithreading support.
+Contrek is a Ruby gem powered by a <u>standalone C++17 core library</u> for fast contour tracing and edge detection in PNG images. It employs a **topological approach** to extract polygonal contours, representing shapes as a connected graph of shared endpoints. This ensures perfect adjacency and structural integrity for shape analysis and raster-to-vector workflows, such as PNG to SVG conversion, managed via libspng (0.7.4) with multithreading support.
 
 ## About Contrek library
 Contrek (**con**tour **trek**king) simply scans your png bitmap and returns shape contour as close polygonal lines, both for the external and internal sides. It can compute the nesting level of the polygons found with a tree structure. It supports various levels and modes of compression and approximation of the found coordinates. It is capable of multithreaded processing, splitting the image into vertical strips and recombining the coordinates in pairs.
@@ -99,7 +99,7 @@ Regarding multithreading:
 
 - The treemap option is currently ignored (multithreaded treemap support will be introduced in upcoming revisions).
 
-By not declaring native option CPP Multithreading optimized code is used. In the above example a [105 MP image](spec/files/images/sample_10240x10240.png) is examined by 2 threads working on 2 tiles (total compute time about 2 secs).
+By not declaring native option CPP Multithreading optimized code is used. In the above example a [105 MP image](spec/files/images/sample_10240x10240.png) is examined by 2 threads working on 2 tiles (total compute time about 1.66 secs with image load).
 
 ```ruby
 result = Contrek.contour!(
@@ -113,11 +113,13 @@ result = Contrek.contour!(
 )
 puts result.metadata[:benchmarks].inspect
 
-{"compress"=>14.596786999999999,
-  "init"=>2078.745861,
-  "inner"=>1183.143734,
-  "outer"=>118.94489599999999,
-  "total"=>2093.342648}
+{ "compress"=>13.423765,
+  "init"=>612.654121,
+  "inner"=>14.8930669,
+  "outer"=>33.0693249,
+  "total"=>626.0778879
+}
+
 ```
 
 ## Result
@@ -262,7 +264,77 @@ This the one for the native C++
 }
 ```
 
-About 75x faster. Times are in microseconds; system: AMD Ryzen 7 3700X 8-Core Processor (BogoMIPS: 7199,99) on Ubuntu distro. 
+About 75x faster. Times are in microseconds; system: AMD Ryzen 7 3700X 8-Core Processor (BogoMIPS: 7199,99) on Ubuntu distro.
+
+## 🛠 C++ Standalone Library Usage
+
+The core of **Contrek** is a high-performance `C++17` library. It is designed to be **standalone**, meaning it has zero dependencies on Ruby and can be integrated into any `C++` project.
+
+
+### Prerequisites
+* **CMake** (3.10+)
+* **ZLIB** (Required for PNG processing)
+* **C++17 Compiler**
+
+### 1. Build & Run Examples
+If you want to test the performances or see the library in action:
+
+```bash
+# Navigate to the core folder
+cd ext/cpp_polygon_finder/PolygonFinder
+
+# Setup build directory
+mkdir build && cd build
+
+# Configure with examples enabled
+cmake -DBUILD_EXAMPLES=ON ..
+
+# Build and run
+make
+./contrek_test
+```
+
+### 2. How to integrate it into your project
+
+To use Contrek's engine in your own C++ application without Ruby:
+
+1. **Copy the core folder**: Take the `ext/cpp_polygon_finder/PolygonFinder` directory and place it inside your project (e.g., in a `libs/` or `third_party/` folder).
+2. **Update your CMakeLists.txt**: Add these lines to link the library:
+
+```cmake
+# Tell CMake to include Contrek
+add_subdirectory(libs/PolygonFinder)
+
+# Link it to your executable
+add_executable(my_app main.cpp)
+target_link_libraries(my_app PRIVATE ContrekLib)
+```
+
+### 3. C++ API Quick Start
+
+Contrek provides a high-level C++ API. Here is how you can use it in your standalone projects:
+
+```cpp
+#include "ContrekApi.h"
+#include <iostream>
+
+int main() {
+    // 1. Configure the engine
+    Contrek::Config cfg;
+    cfg.threads = 4;
+    cfg.tiles = 2;
+
+    // 2. Run the tracing process
+    // Supports PNG files via internal spng integration
+    auto result = Contrek::trace("path/to/image.png", cfg);
+
+    // 3. Access results
+    result->print_info(); // prints generic infos
+    std::cout << "Found polygons: " << result->groups << std::endl;
+
+    return 0;
+}
+```
 
 ## License
 

data/ext/cpp_polygon_finder/PolygonFinder/CMakeLists.txt

@@ -0,0 +1,39 @@
+cmake_minimum_required(VERSION 3.10)
+project(ContrekCore C CXX)
+
+set(CMAKE_CXX_STANDARD 17)
+set(CMAKE_C_STANDARD 11)
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -Wall -Wextra -pthread -g -march=native -DNDEBUG -Ofast -flto")
+set(CMAKE_C_FLAGS "${CMAKE_C_FLAGS} -O3 -march=native -fPIC -DNDEBUG")
+set(CMAKE_EXE_LINKER_FLAGS "${CMAKE_EXE_LINKER_FLAGS} -pthread -flto=auto -Wl,--no-as-needed")
+
+find_package(ZLIB REQUIRED)
+
+file(GLOB_RECURSE CPP_SOURCES "*.cpp")
+file(GLOB_RECURSE C_SOURCES "*.c")
+
+list(FILTER CPP_SOURCES EXCLUDE REGEX "examples/.*\\.cpp")
+
+add_library(ContrekLib STATIC ${CPP_SOURCES} ${C_SOURCES})
+
+file(GLOB_RECURSE ALL_HEADERS "*.h")
+foreach(header_file ${ALL_HEADERS})
+    get_filename_component(header_dir ${header_file} DIRECTORY)
+    list(APPEND ALL_INCLUDE_DIRS ${header_dir})
+endforeach()
+list(REMOVE_DUPLICATES ALL_INCLUDE_DIRS)
+
+target_include_directories(ContrekLib PUBLIC ${ALL_INCLUDE_DIRS} ${ZLIB_INCLUDE_DIRS})
+target_link_libraries(ContrekLib PRIVATE ${ZLIB_LIBRARIES} pthread)
+
+option(BUILD_EXAMPLES "Build the example application" OFF)
+
+if(BUILD_EXAMPLES)
+    if(EXISTS "${CMAKE_CURRENT_SOURCE_DIR}/examples/example.cpp")
+        message(STATUS "Contrek: Compiling example option ON")
+        add_executable(contrek_test examples/example.cpp)
+        target_link_libraries(contrek_test PRIVATE ContrekLib)
+    else()
+        message(WARNING "Contrek: examples/example.cpp not found!")
+    endif()
+endif()

data/ext/cpp_polygon_finder/PolygonFinder/examples/example.cpp

@@ -0,0 +1,43 @@
+//============================================================================
+// Name        : example.cpp
+// Author      : Emanuele Cesaroni
+// Version     :
+// Copyright   : 2025 Emanuele Cesaroni
+// Description :
+//============================================================================
+
+#include <iostream>
+#include "ContrekApi.h"
+#include "Tests.h"
+
+void run_test() {
+  CpuTimer cpu_timer;
+  Tests test_suite;
+  cpu_timer.start();
+
+  // test_suite.test_a();
+  // test_suite.test_b();
+  // test_suite.test_c();
+  // test_suite.test_d();
+  // test_suite.test_e();
+  test_suite.test_f();
+  std::cout << "compute time =" << cpu_timer.stop() << std::endl;
+}
+
+int main() {
+  Contrek::Config cfg;
+  cfg.threads = 2;
+  cfg.tiles = 2;
+  cfg.compress_unique = true;
+
+  CpuTimer cpu_timer;
+  cpu_timer.start();
+  std::cout << "--- Start Native Benchmark ---" << std::endl;
+  auto result = Contrek::trace("../images/sample_10240x10240.png", cfg);
+  result->print_info();
+  std::cout << "Found polygons: " << result->groups << std::endl;
+  std::cout << "Time: " << cpu_timer.stop() << " ms" << std::endl;
+
+  // run_test();
+  return 0;
+}

data/ext/cpp_polygon_finder/PolygonFinder/src/ContrekApi.h

@@ -0,0 +1,72 @@
+/*
+ * ContrekApi.h
+ *
+ *  Created on: 25 gen 2026
+ *      Author: ema
+ *      Copyright 2025 Emanuele Cesaroni
+ */
+
+#pragma once
+
+#include <string>
+#include <vector>
+#include <memory>
+#include <cstdint>
+
+#include "Finder.h"
+#include "FastPngBitmap.h"
+#include "RGBNotMatcher.h"
+#include "RGBMatcher.h"
+
+namespace Contrek {
+
+enum class MatchMode {
+  NOT_COLOR,    // Tracks border of what is not target color
+  EXACT_COLOR   // Tracks border of what exactly matchs target color
+};
+
+struct Config {
+  int threads = 4;
+  int tiles = 2;
+  bool compress_unique = false;
+  bool compress_linear = false;
+  bool compress_visvalingam = false;
+  bool treemap = false;
+  int32_t target_color = -1;
+  MatchMode mode = MatchMode::NOT_COLOR;
+};
+
+inline std::unique_ptr<ProcessResult> trace(const std::string& image_path, const Config& cfg = Config()) {
+  auto bitmap = std::make_unique<FastPngBitmap>(image_path);
+
+  int32_t color_to_match = (cfg.target_color == -1)
+                           ? bitmap->rgb_value_at(0, 0)
+                           : cfg.target_color;
+
+  std::unique_ptr<Matcher> matcher;
+  if (cfg.mode == MatchMode::NOT_COLOR) {
+    matcher = std::make_unique<RGBNotMatcher>(color_to_match);
+  } else {
+    matcher = std::make_unique<RGBMatcher>(color_to_match);
+  }
+
+  std::vector<std::string> internal_args = {"--versus=a"};
+  struct Mapping { bool flag; std::string_view arg; };
+  const Mapping mappings[] = {
+    {cfg.compress_unique,      "--compress_uniq"},
+    {cfg.compress_linear,      "--compress_linear"},
+    {cfg.compress_visvalingam, "--compress_visvalingam"},
+    {cfg.treemap,              "--treemap"}
+  };
+
+  for (auto& m : mappings) {
+      if (m.flag) internal_args.emplace_back(m.arg);
+  }
+  internal_args.push_back("--number_of_tiles=" + std::to_string(cfg.tiles));
+
+  Finder finder(cfg.threads, bitmap.get(), matcher.get(), &internal_args);
+
+  return std::unique_ptr<ProcessResult>(finder.process_info());
+}
+
+}  // namespace Contrek

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

@@ -28,12 +28,6 @@
 #include "polygon/finder/concurrent/Position.h"
 #include "polygon/finder/Polygon.h"
 
-Tests::Tests() {
-}
-
-Tests::~Tests() {
-}
-
 void Tests::test_a()
 { std::string chunk =
       "0000000000000000"\
@@ -79,22 +73,10 @@ void Tests::test_b()
       "  XX       XX   "\
       "  XX       XX   "\
       "  XXXXXXXXXXX   ";
-//        "0123456789012345"
-  /*chunk = "  XXXXXXXXXXX   "\
-          "  XX   XX  XX   "\
-          "  XX   XX  XX   "\
-          "  XX   XX  XX   "\
-          "  XXXXXXXXXXX   ";*/
 
   std::vector<std::string> arguments = {"--versus=o", "--number_of_tiles=2", "--compress_uniq", "--compress_linear", "--treemap"};
   ValueNotMatcher matcher(' ');
   Bitmap b(chunk, 16);
-
-  /*ClippedPolygonFinder pl(&b, &matcher, 0, 16, &arguments);
-  ProcessResult *pr = pl.process_info();
-  pr->print_polygons();
-  delete pr;*/
-
   Finder concurrentFinder(2, &b, &matcher, &arguments);
   ProcessResult *pro = concurrentFinder.process_info();
   pro->print_polygons();
@@ -155,7 +137,7 @@ void Tests::test_c()
 void Tests::test_d()
 { CpuTimer cpu_timer;
   cpu_timer.start();
-  FastPngBitmap png_bitmap("images/sample_10240x10240.png");
+  FastPngBitmap png_bitmap("../images/sample_10240x10240.png");
   // FastPngBitmap png_bitmap("images/labyrinth.png");
   std::cout << "image_w=" << png_bitmap.w() << " image_h=" << png_bitmap.h() << std::endl;
   std::cout << "immagine =" << cpu_timer.stop() << std::endl;
@@ -174,7 +156,7 @@ void Tests::test_d()
 void Tests::test_e()
 { CpuTimer cpu_timer;
   cpu_timer.start();
-  FastPngBitmap png_bitmap("images/sample_10240x10240.png");
+  FastPngBitmap png_bitmap("../images/sample_10240x10240.png");
   // FastPngBitmap png_bitmap("images/sample_1024x1024.png");
   std::cout << "image reading time =" << cpu_timer.stop() << std::endl;
 
@@ -189,3 +171,15 @@ void Tests::test_e()
   std::cout << "polygons =" << o->groups << std::endl;
   delete o;
 }
+
+void Tests::test_f()
+{ FastPngBitmap png_bitmap("../images/labyrinth.png");
+  std::cout << "image_w=" << png_bitmap.w() << " image_h=" << png_bitmap.h() << std::endl;
+  std::cout << "load_error=" << png_bitmap.error() << std::endl;
+
+  std::string data_url = "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==";
+  data_url.erase(0, 22);
+  RemoteFastPngBitmap bitmap(&data_url);
+  std::cout << "image_w=" << bitmap.w() << " image_h=" << bitmap.h() << std::endl;
+  std::cout << "load_error=" << bitmap.error() << std::endl;
+}

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

@@ -10,11 +10,10 @@
 
 class Tests {
  public:
-  Tests();
-  virtual ~Tests();
   virtual void test_a();
   virtual void test_b();
   virtual void test_c();
   virtual void test_d();
   virtual void test_e();
+  virtual void test_f();
 };

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

@@ -289,7 +289,7 @@ void Cursor::traverse_inner(Part* act_part, std::vector<Part*>& all_parts, Bound
         } else {
           for (Shape *shape : act_part->polyline()->next_tile_eligible_shapes()) {
             for (Part* dest_part : shape->outer_polyline->parts()) {
-              if (dest_part->trasmuted) continue;
+              if (dest_part->trasmuted || dest_part->is(Part::EXCLUSIVE)) continue;
               if (dest_part->intersect_part(act_part)) {
                 std::vector<Point*> link_seq = duplicates_intersection(*dest_part, *act_part);
                 if (!link_seq.empty()) {

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

@@ -11,10 +11,11 @@
 
 Hub::Hub(int height, int start_x, int end_x)
     : width_(end_x - start_x), height_(height), start_x_(start_x)
-{ size_t total_pixels = static_cast<size_t>(width_) * height;
+{ size_t total_pixels = static_cast<size_t>(height);
   payloads_.resize(total_pixels);
   bitset_.resize((total_pixels + 63) / 64, 0);
   std::memset(bitset_.data(), 0, bitset_.size() * sizeof(uint64_t));
+  endpoint_pool_.resize(total_pixels);
 }
 
 int Hub::spawn_end_point() {

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

@@ -37,7 +37,7 @@ class Hub {
   int height_;
   int start_x_;
   std::vector<int> payloads_;
-  std::deque<EndPoint> endpoint_pool_;
+  std::vector<EndPoint> endpoint_pool_;
   Hub(const Hub&) = delete;
   Hub& operator=(const Hub&) = delete;
   std::vector<uint64_t> bitset_;

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

@@ -44,7 +44,8 @@ Position* Part::next_position(Position* force_position) {
 
 void Part::add_position(Point* point) {
   Cluster* c = this->polyline_->tile->cluster;
-  c->positions_pool.emplace_back(c->hub(), point);
+  Hub* hub = is(EXCLUSIVE) ? nullptr : c->hub();
+  c->positions_pool.emplace_back(hub, point);
   this->add(&c->positions_pool.back());
 }
 

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

@@ -76,7 +76,9 @@ std::vector<std::pair<int, int>> Polyline::intersection(const Polyline* other) c
       if (!part->is(Part::SEAM) && part->trasmuted) continue;
       part->each([&](QNode<Point>* pos) -> bool {
         Position *position = dynamic_cast<Position*>(pos);
-        this->tracked_endpoints[position->end_point()] = i;
+        if (position->end_point() != nullptr)
+        { this->tracked_endpoints[position->end_point()] = i;
+        }
         return true;
       });
     }

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

@@ -11,20 +11,24 @@
 
 Position::Position(Hub* hub, Point* point)
 : QNode<Point>(point)
-{ int key = point->y * hub->width() + (point->x - hub->start_x());
-  EndPoint* existing_ep = hub->get(key);
-  if (existing_ep == nullptr)
-  { end_point_ = hub->put(key, hub->spawn_end_point());
-  } else {
-    end_point_ = existing_ep;
+{ if (hub != nullptr) {
+    int key = point->y;
+    EndPoint* existing_ep = hub->get(key);
+    if (existing_ep == nullptr)
+    { end_point_ = hub->put(key, hub->spawn_end_point());
+    } else {
+      end_point_ = existing_ep;
+    }
   }
 }
 
 void Position::before_rem(Queueable<Point>* q)  {
-  auto& queues = this->end_point_->queues();
-  queues.erase(std::remove(queues.begin(), queues.end(), q), queues.end());
+  if (this->end_point_ != nullptr) {
+    auto& queues = this->end_point_->queues();
+    queues.erase(std::remove(queues.begin(), queues.end(), q), queues.end());
+  }
 }
 
 void Position::after_add(Queueable<Point>* q)  {
-  this->end_point_->queues().push_back(q);
+  if (this->end_point_ != nullptr) this->end_point_->queues().push_back(q);
 }

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

@@ -21,5 +21,5 @@ class Position : public QNode<Point>{
   void before_rem(Queueable<Point>* q) override;
   void after_add(Queueable<Point>* q) override;
  private:
-  EndPoint* end_point_;
+  EndPoint* end_point_ = nullptr;
 };

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

@@ -43,8 +43,7 @@ class Queueable {
 
   QNode<T>* rem(QNode<T>* node) {
     if (!node) return nullptr;
-    if (node->owner != this)
-        throw std::runtime_error("Not my node");
+    // if (node->owner != this) throw std::runtime_error("Not my node");
     node->before_rem(this);
     if (node->prev) node->prev->next = node->next;
     if (node->next) node->next->prev = node->prev;

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

@@ -6,7 +6,7 @@ module Contrek
       def initialize(finder:, height:, start_x:, end_x:)
         @finder = finder
         @tiles = []
-        @hub = Hub.new(start_x:, end_x:)
+        @hub = Hub.new(height:, start_x:, end_x:)
       end
 
       def add(tile)

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

@@ -182,7 +182,8 @@ module Contrek
             else
               act_part.polyline.next_tile_eligible_shapes.each do |shape|
                 shape.outer_polyline.parts.each do |dest_part|
-                  next if dest_part.trasmuted
+                  next if dest_part.trasmuted || dest_part.is?(Part::EXCLUSIVE)
+
                   if dest_part.intersect_part?(act_part)
                     link_seq = duplicates_intersection(dest_part, act_part)
                     if link_seq.any?

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

@@ -1,10 +1,9 @@
 module Contrek
   module Concurrent
     class Hub
-      attr_reader :payloads, :width
-      def initialize(start_x:, end_x:)
-        @width = end_x - start_x
-        # @payloads = Array.new(width * height)
+      attr_reader :payloads
+      def initialize(height:, start_x:, end_x:)
+        # @payloads = Array.new(height)
         @payloads = {}
       end
     end

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

@@ -31,7 +31,8 @@ module Contrek
       end
 
       def add_position(position)
-        add(Position.new(position: position, hub: polyline.tile.cluster.hub))
+        hub = is?(EXCLUSIVE) ? nil : polyline.tile.cluster.hub
+        add(Position.new(position: position, hub: hub))
       end
 
       def next_position(force_position = nil)

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

@@ -66,6 +66,7 @@ module Contrek
           parts.each_with_index do |part, part_index|
             next if !part.is?(Part::SEAM) && part.trasmuted
             part.each do |pos|
+              next if pos.end_point.nil?
               @tracked_endpoints[pos.end_point.object_id] = part_index
             end
           end

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

@@ -6,8 +6,7 @@ module Contrek
       attr_reader :end_point
 
       def initialize(hub:, position:)
-        key = position[:y] * hub.width + position[:x]
-        @end_point = hub.payloads[key] ||= EndPoint.new
+        @end_point = hub.payloads[position[:y]] ||= EndPoint.new if hub
         @position = position
       end
 
@@ -16,11 +15,11 @@ module Contrek
       end
 
       def after_add(new_queue)
-        @end_point.queues << new_queue
+        @end_point.queues << new_queue if @end_point
       end
 
       def before_rem(old_queue)
-        @end_point.queues.delete(old_queue)
+        @end_point&.queues&.delete(old_queue)
       end
     end
   end

data/lib/contrek/version.rb

@@ -1,3 +1,3 @@
 module Contrek
-  VERSION = "1.0.8"
+  VERSION = "1.0.9"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: contrek
 version: !ruby/object:Gem::Version
-  version: 1.0.8
+  version: 1.0.9
 platform: ruby
 authors:
 - Emanuele Cesaroni
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2026-01-25 00:00:00.000000000 Z
+date: 2026-01-31 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
@@ -140,10 +140,11 @@ files:
 - Rakefile
 - contrek.gemspec
 - contrek.png
-- ext/cpp_polygon_finder/PolygonFinder/Makefile
+- ext/cpp_polygon_finder/PolygonFinder/CMakeLists.txt
+- ext/cpp_polygon_finder/PolygonFinder/examples/example.cpp
 - ext/cpp_polygon_finder/PolygonFinder/images/labyrinth.png
 - ext/cpp_polygon_finder/PolygonFinder/images/sample_10240x10240.png
-- ext/cpp_polygon_finder/PolygonFinder/src/Main.cpp
+- ext/cpp_polygon_finder/PolygonFinder/src/ContrekApi.h
 - ext/cpp_polygon_finder/PolygonFinder/src/Tests.cpp
 - ext/cpp_polygon_finder/PolygonFinder/src/Tests.h
 - ext/cpp_polygon_finder/PolygonFinder/src/polygon/CpuTimer.h

data/ext/cpp_polygon_finder/PolygonFinder/Makefile

@@ -1,44 +0,0 @@
-CXX = g++
-CXXFLAGS = -Wall -Wextra -std=c++17 -Isrc -MMD -MP -pthread -g \
-           -fno-omit-frame-pointer -fsanitize=address,undefined \
-           -O0
-LDFLAGS = -pthread -lz -fsanitize=address,undefined
-
-# valgrinf or perf setup
-# CXXFLAGS = -Wall -Wextra -std=c++17 -Isrc -MMD -MP -pthread -g -fno-omit-frame-pointer -march=native -DNDEBUG -O3
-# LDFLAGS = -lpng -pthread -lz
-
-# best performances
-CXXFLAGS = -Wall -Wextra -std=c++17 -Isrc -MMD -MP -pthread -g -march=native -DNDEBUG -Ofast -flto
-LDFLAGS = -pthread -lz -flto=auto
-
-SRC = $(shell find src -name '*.cpp')
-C_SRC = $(shell find src -name 'spng.c')
-
-OBJ = $(patsubst src/%.cpp, build/%.o, $(SRC))
-OBJ += $(patsubst src/%.c, build/%.o, $(C_SRC))
-
-DEPS = $(OBJ:.o=.d)
-
-EXEC = contrek
-
-all: $(EXEC)
-
-$(EXEC): $(OBJ)
-	$(CXX) $(CXXFLAGS) $(OBJ) -o $@ -Wl,--no-as-needed $(LDFLAGS)
-
-build/%.o: src/%.cpp
-	@mkdir -p $(dir $@)
-	$(CXX) $(CXXFLAGS) -c $< -o $@
-
-build/%.o: src/%.c
-	@mkdir -p $(dir $@)
-	$(CC) -O3 -march=native -fPIC -c $< -o $@
-
--include $(DEPS)
-
-clean:
-	rm -rf build $(EXEC)
-
-run: all
-	./$(EXEC)

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

@@ -1,50 +0,0 @@
-//============================================================================
-// Name        : PolygonFinder.cpp
-// Author      : Emanuele Cesaroni
-// Version     :
-// Copyright   : 2025 Emanuele Cesaroni
-// Description :
-//============================================================================
-
-#include <string.h>
-#include <iostream>
-#include <list>
-#include <map>
-#include <string>
-#include "polygon/finder/PolygonFinder.h"
-#include "polygon/bitmaps/Bitmap.h"
-#include "polygon/bitmaps/FastPngBitmap.h"
-#include "polygon/bitmaps/RemoteFastPngBitmap.h"
-#include "polygon/matchers/Matcher.h"
-#include "polygon/matchers/RGBMatcher.h"
-#include "polygon/matchers/RGBNotMatcher.h"
-#include "polygon/matchers/ValueNotMatcher.h"
-#include "polygon/finder/optionparser.h"
-#include "Tests.h"
-#include "polygon/CpuTimer.h"
-
-int main() {
-  CpuTimer cpu_timer;
-  Tests test_suite;
-  cpu_timer.start();
-
-  // test_suite.test_a();
-  // test_suite.test_b();
-  // test_suite.test_c();
-  // test_suite.test_d();
-  test_suite.test_e();
-  std::cout << "compute time =" << cpu_timer.stop() << std::endl;
-
-/*
-  FastPngBitmap png_bitmap("images/labyrinth.png");
-  std::cout << "image_w=" << png_bitmap.w() << " image_h=" << png_bitmap.h() << std::endl;
-  std::cout << "load_error=" << png_bitmap.error() << std::endl;
-
-  std::string data_url = "data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==";
-  data_url.erase(0, 22);
-  RemoteFastPngBitmap bitmap(&data_url);
-  std::cout << "image_w=" << bitmap.w() << " image_h=" << bitmap.h() << std::endl;
-  std::cout << "load_error=" << bitmap.error() << std::endl;
-*/
-  return 0;
-}