ruby_clipper 5.0.3

data/ext/clipper/clipper.hpp

@@ -0,0 +1,306 @@
+/*******************************************************************************
+*                                                                              *
+* Author    :  Angus Johnson                                                   *
+* Version   :  5.0.1                                                           *
+* Date      :  30 December 2012                                                *
+* Website   :  http://www.angusj.com                                           *
+* Copyright :  Angus Johnson 2010-2012                                         *
+*                                                                              *
+* License:                                                                     *
+* Use, modification & distribution is subject to Boost Software License Ver 1. *
+* http://www.boost.org/LICENSE_1_0.txt                                         *
+*                                                                              *
+* Attributions:                                                                *
+* The code in this library is an extension of Bala Vatti's clipping algorithm: *
+* "A generic solution to polygon clipping"                                     *
+* Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.             *
+* http://portal.acm.org/citation.cfm?id=129906                                 *
+*                                                                              *
+* Computer graphics and geometric modeling: implementation and algorithms      *
+* By Max K. Agoston                                                            *
+* Springer; 1 edition (January 4, 2005)                                        *
+* http://books.google.com/books?q=vatti+clipping+agoston                       *
+*                                                                              *
+* See also:                                                                    *
+* "Polygon Offsetting by Computing Winding Numbers"                            *
+* Paper no. DETC2005-85513 pp. 565-575                                         *
+* ASME 2005 International Design Engineering Technical Conferences             *
+* and Computers and Information in Engineering Conference (IDETC/CIE2005)      *
+* September 24–28, 2005 , Long Beach, California, USA                          *
+* http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf              *
+*                                                                              *
+*******************************************************************************/
+
+#ifndef clipper_hpp
+#define clipper_hpp
+
+#include <vector>
+#include <stdexcept>
+#include <cstring>
+#include <cstdlib>
+#include <ostream>
+
+namespace ClipperLib {
+
+enum ClipType { ctIntersection, ctUnion, ctDifference, ctXor };
+enum PolyType { ptSubject, ptClip };
+//By far the most widely used winding rules for polygon filling are
+//EvenOdd & NonZero (GDI, GDI+, XLib, OpenGL, Cairo, AGG, Quartz, SVG, Gr32)
+//Others rules include Positive, Negative and ABS_GTR_EQ_TWO (only in OpenGL)
+//see http://glprogramming.com/red/chapter11.html
+enum PolyFillType { pftEvenOdd, pftNonZero, pftPositive, pftNegative };
+
+typedef signed long long long64;
+typedef unsigned long long ulong64;
+
+struct IntPoint {
+public:
+  long64 X;
+  long64 Y;
+  IntPoint(long64 x = 0, long64 y = 0): X(x), Y(y) {};
+  friend std::ostream& operator <<(std::ostream &s, IntPoint &p);
+};
+
+typedef std::vector< IntPoint > Polygon;
+typedef std::vector< Polygon > Polygons;
+
+std::ostream& operator <<(std::ostream &s, Polygon &p);
+std::ostream& operator <<(std::ostream &s, Polygons &p);
+
+struct ExPolygon {
+  Polygon  outer;
+  Polygons holes;
+};
+typedef std::vector< ExPolygon > ExPolygons;
+
+enum JoinType { jtSquare, jtRound, jtMiter };
+
+bool Orientation(const Polygon &poly);
+double Area(const Polygon &poly);
+void OffsetPolygons(const Polygons &in_polys, Polygons &out_polys,
+  double delta, JoinType jointype = jtSquare, double MiterLimit = 2, bool AutoFix = true);
+void SimplifyPolygon(const Polygon &in_poly, Polygons &out_polys, PolyFillType fillType = pftEvenOdd);
+void SimplifyPolygons(const Polygons &in_polys, Polygons &out_polys, PolyFillType fillType = pftEvenOdd);
+void SimplifyPolygons(Polygons &polys, PolyFillType fillType = pftEvenOdd);
+
+void ReversePolygon(Polygon& p);
+void ReversePolygons(Polygons& p);
+
+//used internally ...
+enum EdgeSide { esLeft = 1, esRight = 2};
+enum IntersectProtects { ipNone = 0, ipLeft = 1, ipRight = 2, ipBoth = 3 };
+
+struct TEdge {
+  long64 xbot;
+  long64 ybot;
+  long64 xcurr;
+  long64 ycurr;
+  long64 xtop;
+  long64 ytop;
+  double dx;
+  long64 deltaX;
+  long64 deltaY;
+  long64 tmpX;
+  PolyType polyType;
+  EdgeSide side;
+  int windDelta; //1 or -1 depending on winding direction
+  int windCnt;
+  int windCnt2; //winding count of the opposite polytype
+  int outIdx;
+  TEdge *next;
+  TEdge *prev;
+  TEdge *nextInLML;
+  TEdge *nextInAEL;
+  TEdge *prevInAEL;
+  TEdge *nextInSEL;
+  TEdge *prevInSEL;
+};
+
+struct IntersectNode {
+  TEdge          *edge1;
+  TEdge          *edge2;
+  IntPoint        pt;
+  IntersectNode  *next;
+};
+
+struct LocalMinima {
+  long64        Y;
+  TEdge        *leftBound;
+  TEdge        *rightBound;
+  LocalMinima  *next;
+};
+
+struct Scanbeam {
+  long64    Y;
+  Scanbeam *next;
+};
+
+struct OutPt; //forward declaration
+
+struct OutRec {
+  int     idx;
+  bool    isHole;
+  OutRec *FirstLeft;
+  OutRec *AppendLink;
+  OutPt  *pts;
+  OutPt  *bottomPt;
+};
+
+struct OutPt {
+  int     idx;
+  IntPoint pt;
+  OutPt   *next;
+  OutPt   *prev;
+};
+
+struct JoinRec {
+  IntPoint  pt1a;
+  IntPoint  pt1b;
+  int       poly1Idx;
+  IntPoint  pt2a;
+  IntPoint  pt2b;
+  int       poly2Idx;
+};
+
+struct HorzJoinRec {
+  TEdge    *edge;
+  int       savedIdx;
+};
+
+struct IntRect { long64 left; long64 top; long64 right; long64 bottom; };
+
+typedef std::vector < OutRec* > PolyOutList;
+typedef std::vector < TEdge* > EdgeList;
+typedef std::vector < JoinRec* > JoinList;
+typedef std::vector < HorzJoinRec* > HorzJoinList;
+
+//ClipperBase is the ancestor to the Clipper class. It should not be
+//instantiated directly. This class simply abstracts the conversion of sets of
+//polygon coordinates into edge objects that are stored in a LocalMinima list.
+class ClipperBase
+{
+public:
+  ClipperBase();
+  virtual ~ClipperBase();
+  bool AddPolygon(const Polygon &pg, PolyType polyType);
+  bool AddPolygons( const Polygons &ppg, PolyType polyType);
+  virtual void Clear();
+  IntRect GetBounds();
+protected:
+  void DisposeLocalMinimaList();
+  TEdge* AddBoundsToLML(TEdge *e);
+  void PopLocalMinima();
+  virtual void Reset();
+  void InsertLocalMinima(LocalMinima *newLm);
+  LocalMinima      *m_CurrentLM;
+  LocalMinima      *m_MinimaList;
+  bool              m_UseFullRange;
+  EdgeList          m_edges;
+};
+
+class Clipper : public virtual ClipperBase
+{
+public:
+  Clipper();
+  ~Clipper();
+  bool Execute(ClipType clipType,
+  Polygons &solution,
+  PolyFillType subjFillType = pftEvenOdd,
+  PolyFillType clipFillType = pftEvenOdd);
+  bool Execute(ClipType clipType,
+  ExPolygons &solution,
+  PolyFillType subjFillType = pftEvenOdd,
+  PolyFillType clipFillType = pftEvenOdd);
+  void Clear();
+  bool ReverseSolution() {return m_ReverseOutput;};
+  void ReverseSolution(bool value) {m_ReverseOutput = value;};
+protected:
+  void Reset();
+  virtual bool ExecuteInternal();
+private:
+  PolyOutList       m_PolyOuts;
+  JoinList          m_Joins;
+  HorzJoinList      m_HorizJoins;
+  ClipType          m_ClipType;
+  Scanbeam         *m_Scanbeam;
+  TEdge           *m_ActiveEdges;
+  TEdge           *m_SortedEdges;
+  IntersectNode    *m_IntersectNodes;
+  bool              m_ExecuteLocked;
+  PolyFillType      m_ClipFillType;
+  PolyFillType      m_SubjFillType;
+  bool              m_ReverseOutput;
+  bool              m_UsingExPolygons;
+  void DisposeScanbeamList();
+  void SetWindingCount(TEdge& edge);
+  bool IsEvenOddFillType(const TEdge& edge) const;
+  bool IsEvenOddAltFillType(const TEdge& edge) const;
+  void InsertScanbeam(const long64 Y);
+  long64 PopScanbeam();
+  void InsertLocalMinimaIntoAEL(const long64 botY);
+  void InsertEdgeIntoAEL(TEdge *edge);
+  void AddEdgeToSEL(TEdge *edge);
+  void CopyAELToSEL();
+  void DeleteFromSEL(TEdge *e);
+  void DeleteFromAEL(TEdge *e);
+  void UpdateEdgeIntoAEL(TEdge *&e);
+  void SwapPositionsInSEL(TEdge *edge1, TEdge *edge2);
+  bool IsContributing(const TEdge& edge) const;
+  bool IsTopHorz(const long64 XPos);
+  void SwapPositionsInAEL(TEdge *edge1, TEdge *edge2);
+  void DoMaxima(TEdge *e, long64 topY);
+  void ProcessHorizontals();
+  void ProcessHorizontal(TEdge *horzEdge);
+  void AddLocalMaxPoly(TEdge *e1, TEdge *e2, const IntPoint &pt);
+  void AddLocalMinPoly(TEdge *e1, TEdge *e2, const IntPoint &pt);
+  void AppendPolygon(TEdge *e1, TEdge *e2);
+  void DoEdge1(TEdge *edge1, TEdge *edge2, const IntPoint &pt);
+  void DoEdge2(TEdge *edge1, TEdge *edge2, const IntPoint &pt);
+  void DoBothEdges(TEdge *edge1, TEdge *edge2, const IntPoint &pt);
+  void IntersectEdges(TEdge *e1, TEdge *e2,
+    const IntPoint &pt, const IntersectProtects protects);
+  OutRec* CreateOutRec();
+  void AddOutPt(TEdge *e, const IntPoint &pt);
+  void DisposeAllPolyPts();
+  void DisposeOutRec(PolyOutList::size_type index);
+  bool ProcessIntersections(const long64 botY, const long64 topY);
+  void AddIntersectNode(TEdge *e1, TEdge *e2, const IntPoint &pt);
+  void BuildIntersectList(const long64 botY, const long64 topY);
+  void ProcessIntersectList();
+  void ProcessEdgesAtTopOfScanbeam(const long64 topY);
+  void BuildResult(Polygons& polys);
+  void BuildResultEx(ExPolygons& polys);
+  void SetHoleState(TEdge *e, OutRec *OutRec);
+  void DisposeIntersectNodes();
+  bool FixupIntersections();
+  void FixupOutPolygon(OutRec &outRec);
+  bool IsHole(TEdge *e);
+  void FixHoleLinkage(OutRec *outRec);
+  void AddJoin(TEdge *e1, TEdge *e2, int e1OutIdx = -1, int e2OutIdx = -1);
+  void ClearJoins();
+  void AddHorzJoin(TEdge *e, int idx);
+  void ClearHorzJoins();
+  bool JoinPoints(const JoinRec *j, OutPt *&p1, OutPt *&p2);
+  void FixupJoinRecs(JoinRec *j, OutPt *pt, unsigned startIdx);
+  void JoinCommonEdges();
+};
+
+//------------------------------------------------------------------------------
+//------------------------------------------------------------------------------
+
+class clipperException : public std::exception
+{
+  public:
+    clipperException(const char* description): m_descr(description) {}
+    virtual ~clipperException() throw() {}
+    virtual const char* what() const throw() {return m_descr.c_str();}
+  private:
+    std::string m_descr;
+};
+//------------------------------------------------------------------------------
+
+} //ClipperLib namespace
+
+#endif //clipper_hpp
+
+

data/ext/clipper/extconf.rb

@@ -0,0 +1,6 @@
+require 'mkmf'
+
+CONFIG['LDSHARED'] = "$(CXX) -shared"
+
+dir_config('clipper')
+create_makefile('clipper')

data/ext/clipper/rbclipper.cpp

@@ -0,0 +1,389 @@
+/* 
+ * Clipper Ruby Bindings
+ * Copyright 2010 Mike Owens <http://mike.filespanker.com/>
+ * Changed by Dag Rende for Clipper after 2.9
+ *
+ * Released under the same terms as Clipper.
+ *
+ */
+
+#include <clipper.hpp>
+#include <ruby.h>
+
+#ifndef DBL2NUM
+# define DBL2NUM rb_float_new
+#endif
+
+using namespace std;
+using namespace ClipperLib;
+
+static ID id_even_odd;
+static ID id_non_zero;
+static ID id_positive;
+static ID id_negative;
+static ID id_polygons;
+static ID id_ex_polygons;
+static ID id_jtSquare;
+static ID id_jtMiter;
+static ID id_jtRound;
+
+static inline Clipper*
+XCLIPPER(VALUE x)
+{
+  Clipper* clipper;
+  Data_Get_Struct(x, Clipper, clipper);
+  return clipper;
+}
+
+static inline PolyFillType
+sym_to_filltype(VALUE sym)
+{
+  ID inp = rb_to_id(sym);
+
+  if (inp == id_even_odd) {
+    return pftEvenOdd;
+  } else if (inp == id_non_zero) {
+    return pftNonZero;
+  } else if (inp == id_positive) {
+    return pftPositive;
+  } else if (inp == id_negative) {
+    return pftNegative;
+  }
+
+  rb_raise(rb_eArgError, "%s", "Expected :even_odd, :non_zero, :positive or :negative");
+}
+
+static inline JoinType
+sym_to_jointype(VALUE sym)
+{
+  ID inp = rb_to_id(sym);
+
+  if (inp == id_jtSquare) {
+    return jtSquare;
+  } else if (inp == id_jtMiter) {
+    return jtMiter;
+  } else if (inp == id_jtRound) {
+    return jtRound;
+  }
+
+  rb_raise(rb_eArgError, "%s", "Expected :jtSquare, :jtMiter or :jtRound");
+}
+
+extern "C" {
+
+static void
+ary_to_polygon(VALUE ary, ClipperLib::Polygon* poly, double multiplier)
+{
+  const char* earg =
+    "Polygons have format: [[p0_x, p0_y], [p1_x, p1_y], ...]";
+
+  Check_Type(ary, T_ARRAY);
+
+  for(long i = 0; i != RARRAY_LEN(ary); i++) {
+    VALUE sub = rb_ary_entry(ary, i);
+    Check_Type(sub, T_ARRAY);
+
+    if(RARRAY_LEN(sub) != 2) {
+      rb_raise(rb_eArgError, "%s", earg);
+    }
+
+    VALUE px = rb_ary_entry(sub, 0);
+    VALUE py = rb_ary_entry(sub, 1);
+    poly->push_back(IntPoint((long64)(NUM2DBL(px) * multiplier), (long64)(NUM2DBL(py) * multiplier)));
+  }
+}
+
+static void
+rbclipper_free(void* ptr)
+{
+  delete (Clipper*) ptr;
+}
+
+static VALUE
+rbclipper_new(VALUE klass)
+{
+  Clipper* ptr = new Clipper;
+  VALUE r = Data_Wrap_Struct(klass, 0, rbclipper_free, ptr);
+  rb_obj_call_init(r, 0, 0);
+  rb_iv_set(r, "@multiplier", INT2NUM(1048576));
+  return r;
+}
+
+static VALUE
+rbclipper_add_polygon_internal(VALUE self, VALUE polygon,
+                               PolyType polytype)
+{
+  ClipperLib::Polygon tmp;
+  double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+  ary_to_polygon(polygon, &tmp, multiplier);
+  XCLIPPER(self)->AddPolygon(tmp, polytype);
+  return Qnil;
+}
+
+static VALUE
+rbclipper_add_polygons_internal(VALUE self, VALUE polygonsValue, PolyType polytype) {
+  double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+  Polygons polygons;
+  for(long i = 0; i != RARRAY_LEN(polygonsValue); i++) {
+    VALUE sub = rb_ary_entry(polygonsValue, i);
+    Check_Type(sub, T_ARRAY);
+
+    ClipperLib::Polygon tmp;
+    ary_to_polygon(sub, &tmp, multiplier);
+    polygons.push_back(tmp);
+  }
+  XCLIPPER(self)->AddPolygons(polygons, polytype);
+  return Qnil;
+}
+
+static VALUE
+rbclipper_add_subject_polygon(VALUE self, VALUE polygon)
+{
+  return rbclipper_add_polygon_internal(self, polygon, ptSubject);
+}
+
+static VALUE
+rbclipper_add_clip_polygon(VALUE self, VALUE polygon)
+{
+  return rbclipper_add_polygon_internal(self, polygon, ptClip);
+}
+
+static VALUE
+rbclipper_add_subject_polygons(VALUE self, VALUE polygons)
+{
+  return rbclipper_add_polygons_internal(self, polygons, ptSubject);
+}
+
+static VALUE
+rbclipper_add_clip_polygons(VALUE self, VALUE polygons)
+{
+  return rbclipper_add_polygons_internal(self, polygons, ptClip);
+}
+
+static VALUE
+rbclipper_clear(VALUE self)
+{
+  XCLIPPER(self)->Clear();
+  return Qnil;
+}
+
+static VALUE
+rbclipper_multiplier(VALUE self)
+{
+  return rb_iv_get(self, "@multiplier");
+}
+
+static VALUE
+rbclipper_multiplier_eq(VALUE self, VALUE multiplier)
+{
+  rb_iv_set(self, "@multiplier", multiplier);
+  return multiplier;
+}
+
+static VALUE
+rbclipper_orientation(VALUE self, VALUE polygonValue)
+{
+    double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+    ClipperLib::Polygon polygon;
+    ary_to_polygon(polygonValue, &polygon, multiplier);
+
+    Polygons resultPolygons;
+    return ClipperLib::Orientation(polygon) ? Qtrue : Qfalse;
+}
+
+static VALUE
+rbclipper_area(VALUE self, VALUE polygonValue)
+{
+    double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+    ClipperLib::Polygon polygon;
+    ary_to_polygon(polygonValue, &polygon, multiplier);
+
+    Polygons resultPolygons;
+    return DBL2NUM(ClipperLib::Area(polygon) / multiplier / multiplier);
+}
+
+
+static VALUE
+rbclipper_offset_polygons(int argc, VALUE* argv, VALUE self) 
+{
+    double multiplier = NUM2DBL(rb_iv_get(self, "@multiplier"));
+    double inv_multiplier = 1.0 / multiplier;
+    VALUE polygonsValue, deltaValue, joinTypeValue, miterLimitValue;
+
+    rb_scan_args(argc, argv, "31", &polygonsValue, &deltaValue, &joinTypeValue, &miterLimitValue);
+
+    Polygons polygons;
+    for(long i = 0; i != RARRAY_LEN(polygonsValue); i++) {
+        VALUE sub = rb_ary_entry(polygonsValue, i);
+        Check_Type(sub, T_ARRAY);
+
+        ClipperLib::Polygon tmp;
+        ary_to_polygon(sub, &tmp, multiplier);
+        polygons.push_back(tmp);
+    }
+    double miterLimit = 0;
+    if (!NIL_P(miterLimitValue)) {
+        miterLimit = NUM2DBL(miterLimitValue);
+    }
+
+    Polygons resultPolygons;
+    ClipperLib::OffsetPolygons(polygons, resultPolygons, NUM2DBL(deltaValue) * multiplier, sym_to_jointype(joinTypeValue), miterLimit * multiplier);
+
+    VALUE r = rb_ary_new();
+    for(Polygons::iterator i = resultPolygons.begin(); i != resultPolygons.end(); ++i) {
+        VALUE sub = rb_ary_new();
+        for(Polygon::iterator p = i->begin(); p != i->end(); ++p) {
+            rb_ary_push(sub, rb_ary_new3(2, DBL2NUM(p->X * inv_multiplier), DBL2NUM(p->Y * inv_multiplier)));
+        }
+        rb_ary_push(r, sub);
+    }
+    return r;
+}
+
+static VALUE
+rbclipper_execute_internal(VALUE self, ClipType cliptype,
+                           VALUE subjfill, VALUE clipfill, VALUE resulttype)
+{
+  if (NIL_P(subjfill)) {
+    subjfill = ID2SYM(id_even_odd);
+  }
+
+  if (NIL_P(clipfill)) {
+      clipfill = ID2SYM(id_even_odd);
+  }
+
+  if (NIL_P(resulttype)) {
+    resulttype = ID2SYM(id_polygons);
+  }
+
+  double inv_multiplier = 1.0 / NUM2LONG(rb_iv_get(self, "@multiplier"));
+
+  VALUE r = rb_ary_new();
+  if (resulttype == ID2SYM(id_polygons)) {
+      Polygons solution;
+      XCLIPPER(self)->Execute((ClipType) cliptype,
+                              solution,
+                              sym_to_filltype(subjfill),
+                              sym_to_filltype(clipfill));
+      for(Polygons::iterator i = solution.begin(); i != solution.end(); ++i) {
+        VALUE sub = rb_ary_new();
+        for(Polygon::iterator p = i->begin(); p != i->end(); ++p) {
+          rb_ary_push(sub, rb_ary_new3(2, DBL2NUM(p->X * inv_multiplier), DBL2NUM(p->Y * inv_multiplier)));
+        }
+        rb_ary_push(r, sub);
+      }
+  } else {
+      ExPolygons solution;
+      XCLIPPER(self)->Execute((ClipType) cliptype,
+                              solution,
+                              sym_to_filltype(subjfill),
+                              sym_to_filltype(clipfill));
+      for(ExPolygons::iterator i = solution.begin(); i != solution.end(); ++i) {
+        VALUE expolygon_arr = rb_ary_new();
+
+        VALUE outer_arr = rb_ary_new();
+        for(Polygon::iterator p = i->outer.begin(); p != i->outer.end(); ++p) {
+          rb_ary_push(outer_arr, rb_ary_new3(2, DBL2NUM(p->X * inv_multiplier), DBL2NUM(p->Y * inv_multiplier)));
+        }
+        rb_ary_push(expolygon_arr, outer_arr);
+
+        for(Polygons::iterator ps = i->holes.begin(); ps != i->holes.end(); ++ps) {
+          VALUE hole_arr = rb_ary_new();
+          for(Polygon::iterator p = ps->begin(); p != ps->end(); ++p) {
+            rb_ary_push(hole_arr, rb_ary_new3(2, DBL2NUM(p->X * inv_multiplier), DBL2NUM(p->Y * inv_multiplier)));
+          }
+          rb_ary_push(expolygon_arr, hole_arr);
+        }
+
+        rb_ary_push(r, expolygon_arr);
+      }
+  }
+  return r;
+}
+
+static VALUE
+rbclipper_intersection(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill, resulttype;
+  rb_scan_args(argc, argv, "03", &subjfill, &clipfill, &resulttype);
+  return rbclipper_execute_internal(self, ctIntersection, subjfill, clipfill, resulttype);
+}
+
+static VALUE
+rbclipper_union(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill, resulttype;
+  rb_scan_args(argc, argv, "03", &subjfill, &clipfill, &resulttype);
+  return rbclipper_execute_internal(self, ctUnion, subjfill, clipfill, resulttype);
+}
+
+
+static VALUE
+rbclipper_difference(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill, resulttype;
+  rb_scan_args(argc, argv, "03", &subjfill, &clipfill, &resulttype);
+  return rbclipper_execute_internal(self, ctDifference, subjfill, clipfill, resulttype);
+}
+
+
+static VALUE
+rbclipper_xor(int argc, VALUE* argv, VALUE self)
+{
+  VALUE subjfill, clipfill, resulttype;
+  rb_scan_args(argc, argv, "03", &subjfill, &clipfill, &resulttype);
+  return rbclipper_execute_internal(self, ctXor, subjfill, clipfill, resulttype);
+}
+
+
+typedef VALUE (*ruby_method)(...);
+
+void Init_clipper() {
+    id_even_odd = rb_intern("even_odd");
+    id_non_zero = rb_intern("non_zero");
+    id_positive = rb_intern("positive");
+    id_negative = rb_intern("negative");
+    id_polygons = rb_intern("polygons");
+    id_ex_polygons = rb_intern("expolygons");
+    id_jtSquare = rb_intern("jtSquare");
+    id_jtMiter = rb_intern("jtMiter");
+    id_jtRound = rb_intern("jtRound");
+
+    VALUE mod   = rb_define_module("Clipper");
+
+    VALUE k = rb_define_class_under(mod, "Clipper", rb_cObject);
+    rb_define_singleton_method(k, "new",
+                             (ruby_method) rbclipper_new, 0);
+
+    rb_define_method(k, "orientation",
+                   (ruby_method) rbclipper_orientation, 1);
+    rb_define_method(k, "area",
+                   (ruby_method) rbclipper_area, 1);
+    rb_define_method(k, "offset_polygons",
+                   (ruby_method) rbclipper_offset_polygons, -1);
+    rb_define_method(k, "add_subject_polygon",
+                   (ruby_method) rbclipper_add_subject_polygon, 1);
+    rb_define_method(k, "add_clip_polygon",
+                   (ruby_method) rbclipper_add_clip_polygon, 1);
+    rb_define_method(k, "add_subject_polygons",
+                   (ruby_method) rbclipper_add_subject_polygons, 1);
+    rb_define_method(k, "add_clip_polygons",
+                   (ruby_method) rbclipper_add_clip_polygons, 1);
+    rb_define_method(k, "clear!",
+                   (ruby_method) rbclipper_clear, 0);
+    rb_define_method(k, "intersection",
+                   (ruby_method) rbclipper_intersection, -1);
+    rb_define_method(k, "union",
+                   (ruby_method) rbclipper_union, -1);
+    rb_define_method(k, "difference",
+                   (ruby_method) rbclipper_difference, -1);
+    rb_define_method(k, "xor",
+                   (ruby_method) rbclipper_xor, -1);
+
+    rb_define_method(k, "multiplier",
+                   (ruby_method) rbclipper_multiplier, 0);
+    rb_define_method(k, "multiplier=",
+                   (ruby_method) rbclipper_multiplier_eq, 1);
+}
+
+} /* extern "C" */

data/lib/clipper/version.rb

@@ -0,0 +1,6 @@
+module Clipper
+  # Keep first two components sync'd to Clipper's major/minor.
+  # Last is our build number based on that.  Hopefully there
+  # won't be too much churn re: Clipper's version vs. the bindings.
+  VERSION = "5.0.3"
+end