@techstark/opencv-js 4.9.0-release.2 → 4.9.0-release.3

package/dist/src/types/opencv/_hacks.d.ts

@@ -26,6 +26,11 @@ export declare class Point {
     x: number;
     y: number;
 }
+export declare class Circle {
+    constructor(center: Point, radius: number);
+    center: Point;
+    radius: number;
+}
 export declare class Size {
     constructor(width: number, height: number);
     width: number;

package/dist/src/types/opencv/_hacks.js.map

@@ -1 +1 @@
-{"version":3,"file":"_hacks.js","sourceRoot":"","sources":["../../../../src/types/opencv/_hacks.ts"],"names":[],"mappings":";AAAA,uGAAuG;;;AAwFvG,wBAAsE;AA5EtD,2FA4Ee,MAAG,OA5ER;AACV,iGA2Ee,MAAG,OA3EF;AAChB,4FA0Ee,MAAG,OA1EP;AA2E3B,kBAAgB"}
+{"version":3,"file":"_hacks.js","sourceRoot":"","sources":["../../../../src/types/opencv/_hacks.ts"],"names":[],"mappings":";AAAA,uGAAuG;;;AA8FvG,wBAAsE;AAlFtD,2FAkFe,MAAG,OAlFR;AACV,iGAiFe,MAAG,OAjFF;AAChB,4FAgFe,MAAG,OAhFP;AAiF3B,kBAAgB"}

package/dist/src/types/opencv/imgproc_shape.d.ts

@@ -1,4 +1,4 @@
-import { bool, double, float, InputArray, int, Moments, OutputArray, OutputArrayOfArrays, Point, Point2f, Rect, RotatedRect } from "./_types";
+import { bool, Circle, double, float, InputArray, int, Moments, OutputArray, OutputArrayOfArrays, Point, Point2f, Rect, RotatedRect } from "./_types";
 /**
  * The function [cv::approxPolyDP] approximates a curve or a polygon with another curve/polygon with
  * less vertices so that the distance between them is less or equal to the specified precision. It uses
@@ -415,12 +415,8 @@ export declare function minAreaRect(points: InputArray): RotatedRect;
  * The function finds the minimal enclosing circle of a 2D point set using an iterative algorithm.
  *
  * @param points Input vector of 2D points, stored in std::vector<> or Mat
- *
- * @param center Output center of the circle.
- *
- * @param radius Output radius of the circle.
  */
-export declare function minEnclosingCircle(points: InputArray, center: any, radius: any): void;
+export declare function minEnclosingCircle(points: InputArray): Circle;
 /**
  * The function finds a triangle of minimum area enclosing the given set of 2D points and returns its
  * area. The output for a given 2D point set is shown in the image below. 2D points are depicted in

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@techstark/opencv-js",
-  "version": "4.9.0-release.2",
+  "version": "4.9.0-release.3",
   "description": "OpenCV JavaScript version for node.js or browser",
   "main": "dist/opencv.js",
   "types": "dist/src/index.d.ts",

package/src/types/opencv/_hacks.ts

@@ -32,6 +32,12 @@ export declare class Point {
   public y: number;
 }
 
+export declare class Circle {
+  public constructor(center: Point, radius: number);
+  public center: Point;
+  public radius: number;
+}
+
 export declare class Size {
   public constructor(width: number, height: number);
   public width: number;

package/src/types/opencv/imgproc_shape.ts

@@ -1,5 +1,6 @@
 import {
   bool,
+  Circle,
   double,
   float,
   InputArray,
@@ -12,6 +13,7 @@ import {
   Rect,
   RotatedRect,
 } from "./_types";
+
 /*
  * # Structural Analysis and Shape Descriptors
  *
@@ -530,16 +532,10 @@ export declare function minAreaRect(points: InputArray): RotatedRect;
  * The function finds the minimal enclosing circle of a 2D point set using an iterative algorithm.
  *
  * @param points Input vector of 2D points, stored in std::vector<> or Mat
- *
- * @param center Output center of the circle.
- *
- * @param radius Output radius of the circle.
  */
 export declare function minEnclosingCircle(
   points: InputArray,
-  center: any,
-  radius: any,
-): void;
+): Circle;
 
 /**
  * The function finds a triangle of minimum area enclosing the given set of 2D points and returns its