Using the last version (1.9) of kbool, downloaded from the wxArt2D project site.

bitmaps/makefile.g95

@@ -8,3 +8,7 @@ include makefile.include
 libbitmaps.a: $(OBJECTS)
 	ar ruv $@ $(OBJECTS)
 	ranlib $@
+
+clean:
+	rm -f *.o
+	rm -f *.a

change_log.txt

@@ -6,6 +6,17 @@ Please add newer entries at the top, list the date and your name with
 email address.
 
 
+2008-Nov-14 UPDATE Jean-Pierre Charras <jean-pierre.charras@inpg.fr>
+================================================================================
+kbool:
+    Using the last version (1.9) of kbool, downloaded from the wxArt2D project site
+    (see www.wxart2d.org)
+    But the version 1.8 bug still is here.
+    So using the workaround remains mandatory.
+    (this is not a problem because thermal shapes are better...)
+
+
+
 2008-Nov-14 UPDATE Dick Hollenbeck <dick@softplc.com>
 ================================================================================
 +gerview

include/build_version.h

@@ -9,7 +9,7 @@ COMMON_GLOBL wxString g_BuildVersion
 #    include "config.h"
      (wxT(KICAD_SVN_VERSION))
 #  else
-     (wxT("(20081106-unstable)")) /* main program version */
+     (wxT("(20081114-unstable)")) /* main program version */
 #  endif
 #endif
 ;
@@ -20,7 +20,7 @@ COMMON_GLOBL wxString g_BuildAboutVersion
 #    include "config.h"
      (wxT(KICAD_ABOUT_VERSION))
 #  else
-     (wxT("(20081106-unstable)")) /* svn date & rev (normally overridden) */
+     (wxT("(20081114-unstable)")) /* svn date & rev (normally overridden) */
 #  endif
 #endif
 ;

pcbnew/dialog_copper_zones.cpp

@@ -70,8 +70,8 @@ void dialog_copper_zone::OnInitDialog( wxInitDialogEvent& event )
     m_GridCtrl->SetLabel( msg );
 
     msg = ReturnStringFromValue( g_UnitMetric,
-        m_Zone_Setting->m_ZoneClearance,
+                                 m_Zone_Setting->m_ZoneClearance,
-        m_Parent->m_InternalUnits );
+                                 m_Parent->m_InternalUnits );
     m_ZoneClearanceCtrl->SetValue( msg );
 
     if( g_Zone_45_Only )
@@ -85,8 +85,8 @@ void dialog_copper_zone::OnInitDialog( wxInitDialogEvent& event )
     for( unsigned ii = 0; ii < 4; ii++ )
     {
         msg = ReturnStringFromValue( g_UnitMetric,
-            GridList[ii],
+                                     GridList[ii],
-            m_Parent->m_InternalUnits );
+                                     m_Parent->m_InternalUnits );
         m_GridCtrl->SetString( ii, msg );
         if( grid_routing == GridList[ii] )
             selection = ii;
@@ -98,8 +98,8 @@ void dialog_copper_zone::OnInitDialog( wxInitDialogEvent& event )
     m_GridCtrl->SetSelection( selection );
 
     msg = ReturnStringFromValue( g_UnitMetric,
-        m_Zone_Setting->m_ZoneClearance,
+                                 m_Zone_Setting->m_ZoneClearance,
-        m_Parent->m_InternalUnits );
+                                 m_Parent->m_InternalUnits );
     m_ZoneClearanceCtrl->SetValue( msg );
 
     switch( m_Zone_Setting->m_Zone_Pad_Options )
@@ -135,11 +135,11 @@ void dialog_copper_zone::OnInitDialog( wxInitDialogEvent& event )
     AddUnitSymbol( *m_AntipadSizeText, g_UnitMetric );
     AddUnitSymbol( *m_CopperBridgeWidthText, g_UnitMetric );
     PutValueInLocalUnits( *m_AntipadSizeValue,
-        m_Zone_Setting->m_ThermalReliefGapValue,
+                          m_Zone_Setting->m_ThermalReliefGapValue,
-        PCB_INTERNAL_UNIT );
+                          PCB_INTERNAL_UNIT );
     PutValueInLocalUnits( *m_CopperWidthValue,
-        m_Zone_Setting->m_ThermalReliefCopperBridgeValue,
+                          m_Zone_Setting->m_ThermalReliefCopperBridgeValue,
-        PCB_INTERNAL_UNIT );
+                          PCB_INTERNAL_UNIT );
 
     switch( m_Zone_Setting->m_Zone_HatchingStyle )
     {
@@ -189,8 +189,10 @@ void dialog_copper_zone::OnInitDialog( wxInitDialogEvent& event )
 
     m_NetNameFilter->SetValue( NetNameFilter );
     wxArrayString ListNetName;
-    m_Parent->m_Pcb->ReturnSortedNetnamesList( ListNetName,
+    m_Parent->m_Pcb->ReturnSortedNetnamesList(
-        m_NetSorting == 0 ? BOARD::ALPHA_SORT : BOARD::PAD_CNT_SORT );
+        ListNetName,
+        m_NetSorting ==
+        0 ? BOARD::ALPHA_SORT : BOARD::PAD_CNT_SORT );
 
     if( m_NetSorting != 0 )
     {
@@ -287,7 +289,7 @@ bool dialog_copper_zone::AcceptOptions( bool aPromptForErrors, bool aUseExportab
     if( m_Parent->m_Parent->m_EDA_Config )
     {
         m_Parent->m_Parent->m_EDA_Config->Write( ZONE_NET_OUTLINES_HATCH_OPTION_KEY,
-            (long) m_Zone_Setting->m_Zone_HatchingStyle );
+                                                 (long) m_Zone_Setting->m_Zone_HatchingStyle );
     }
 
     switch( m_GridCtrl->GetSelection() )
@@ -313,7 +315,7 @@ bool dialog_copper_zone::AcceptOptions( bool aPromptForErrors, bool aUseExportab
         m_Zone_Setting->m_GridFillValue = 0;
 #if 0   // I hope this feature works fine ( JP Charras)
         DisplayInfo( this, wxT(
-                "You are using No grid for filling zones\nThis is currently in development and for tests only.\n Do not use for production" ) );
+                        "You are using No grid for filling zones\nThis is currently in development and for tests only.\n Do not use for production" ) );
 #endif
         break;
     }
@@ -329,15 +331,17 @@ bool dialog_copper_zone::AcceptOptions( bool aPromptForErrors, bool aUseExportab
     m_Zone_Setting->m_FilledAreasShowMode = m_ShowFilledAreasInSketchOpt->IsChecked() ? 1 : 0;
 
     m_Zone_Setting->m_ThermalReliefGapValue = ReturnValueFromTextCtrl( *m_AntipadSizeValue,
-        PCB_INTERNAL_UNIT );
+                                                                       PCB_INTERNAL_UNIT );
     m_Zone_Setting->m_ThermalReliefCopperBridgeValue = ReturnValueFromTextCtrl(
         *m_CopperWidthValue,
         PCB_INTERNAL_UNIT );
 
     m_Parent->m_Parent->m_EDA_Config->Write( ZONE_THERMAL_RELIEF_GAP_STRING_KEY,
-        (long) m_Zone_Setting->m_ThermalReliefGapValue );
+                                             (long) m_Zone_Setting->m_ThermalReliefGapValue );
-    m_Parent->m_Parent->m_EDA_Config->Write( ZONE_THERMAL_RELIEF_COPPER_WIDTH_STRING_KEY,
+    m_Parent->m_Parent->m_EDA_Config->Write(
-        (long) m_Zone_Setting->m_ThermalReliefCopperBridgeValue );
+        ZONE_THERMAL_RELIEF_COPPER_WIDTH_STRING_KEY,
+        (long) m_Zone_Setting->
+        m_ThermalReliefCopperBridgeValue );
 
     // If we use only exportable to others zones parameters, exit here:
     if( aUseExportableSetupOnly )
@@ -388,8 +392,10 @@ void dialog_copper_zone::OnNetSortingOptionSelected( wxCommandEvent& event )
     wxArrayString ListNetName;
 
     m_NetSorting = m_NetSortingOption->GetSelection();
-    m_Parent->m_Pcb->ReturnSortedNetnamesList( ListNetName,
+    m_Parent->m_Pcb->ReturnSortedNetnamesList(
-        m_NetSorting == 0 ? BOARD::ALPHA_SORT : BOARD::PAD_CNT_SORT );
+        ListNetName,
+        m_NetSorting ==
+        0 ? BOARD::ALPHA_SORT : BOARD::PAD_CNT_SORT );
     if( m_NetSorting != 0 )
     {
         wxString Filter = m_NetNameFilter->GetValue();
@@ -408,7 +414,7 @@ void dialog_copper_zone::OnNetSortingOptionSelected( wxCommandEvent& event )
     {
         m_Parent->m_Parent->m_EDA_Config->Write( ZONE_NET_SORT_OPTION_KEY, (long) m_NetSorting );
         m_Parent->m_Parent->m_EDA_Config->Write( ZONE_NET_FILTER_STRING_KEY,
-            m_NetNameFilter->GetValue() );
+                                                m_NetNameFilter->GetValue() );
     }
 
     // Select and isplay current zone net name in listbox:
@@ -448,12 +454,14 @@ void dialog_copper_zone::ExportSetupToOtherCopperZones( wxCommandEvent& event )
     if( !AcceptOptions( true, true ) )
         return;
 
-    // Export to others zones:
+    // Export settings ( but layer ) to others zones:
     BOARD* pcb = m_Parent->m_Pcb;
     for( int ii = 0; ii < pcb->GetAreaCount(); ii++ )
     {
         ZONE_CONTAINER* zone = pcb->GetArea( ii );
+        int             zone_layer = zone->GetLayer();
         m_Zone_Setting->ExportSetting( *zone );
+        zone->SetLayer( zone_layer );
         m_Parent->GetScreen()->SetModify();
     }
 }

pcbnew/pcbframe.cpp

@@ -12,7 +12,7 @@
 #include "protos.h"
 #include "id.h"
 #include "drc_stuff.h"
-#include "kbool/include/booleng.h"
+#include "kbool/include/kbool/booleng.h"
 
 /*******************************/
 /* class WinEDA_PcbFrame */

pcbnew/zones_convert_brd_items_to_polygons.cpp

@@ -464,7 +464,7 @@ void    AddThermalReliefPadPolygon( Bool_Engine* aBooleng,
         // Now, add the 4 holes ( each is the pattern, rotated by 0, 90, 180 and 270  deg
         // WARNING: problems with kbool if angle = 0 (in fact when angle < 200):
         // bad filled polygon on some cases, when pads are on a same vertical line
-        // this seems a bug in kbool polygon
+        // this seems a bug in kbool polygon (exists in 1.9 kbool version)
         // angle = 450 (45.0 degrees orientation) seems work fine.
         // angle = 0 with thermal shapes without angle < 90 deg seems works fine also
         angle = 0;

polygon/PolyLine.h

@@ -17,7 +17,7 @@
 
 #include <vector>
 
-#include "kbool/include/booleng.h"
+#include "kbool/include/kbool/booleng.h"
 #include "pad_shapes.h"
 
 // inflection modes for DS_LINE and DS_LINE_VERTEX, used in math_for_graphics.cpp

polygon/kbool/CMakeLists.txt

@@ -1,3 +1,3 @@
 project(kbool)
 
-subdirs(src samples)
+subdirs(src)

polygon/kbool/include/_dl_itr.h

@@ -1,405 +0,0 @@
-/*! \file kbool/include/kbool/_dl_itr.h
-    \author Probably Klaas Holwerda 
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: _dl_itr.h,v 1.1 2005/05/24 19:13:35 titato Exp $
-*/
-
-//! author="Klaas Holwerda"
-/*
- * Definitions of classes, for list implementation
- * template list and iterator for any list node type
-*/
-
-#ifndef _DL_Iter_H
-#define _DL_Iter_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include <stdlib.h>
-#include "../include/booleng.h"
-
-#ifndef _STATUS_ENUM
-#define _STATUS_ENUM
-	//!<enum Error codes for List and iterator class
-	enum  Lerror  {
-   		  			NO_MES,              /*!<No Message will be generated */
-   					NO_LIST,             /*!<List is not attached to the iterator*/
-                  NO_LIST_OTHER,       /*!<no attached list on other iter*/
-                  AC_ITER_LIST_OTHER,  /*!<iter not allowed on other list  */
-                  SAME_LIST,           /*!<same list not allowed*/
-                  NOT_SAME_LIST,       /*!<must be same list*/
-                  ITER_GT_1,           /*!<more then one iteriter at root*/
-                  ITER_GT_0,           /*!<iter not allowed*/
-                  ITER_HITROOT,        /*!<iter at root*/
-                  NO_ITEM,             /*!<no item at current*/
-                  NO_NEXT,             /*!<no next after current*/
-                  NO_PREV,             /*!<no prev before current */
-                  EMPTY,               /*!<list is empty*/
-                  NOT_ALLOW,           /*!<not allowed*/
-                  ITER_NEG             /*!<to much iters deleted*/
-                 };
-#endif
-
-#define SWAP(x,y,t)((t)=(x),(x)=(y),(y)=(t))
-#define RT _list->_root
-#define HD _list->_root->_next
-#define TL _list->_root->_prev
-#define NB _list->_nbitems
-
-template <class Dtype> class DL_List;
-template <class Dtype> class DL_Iter;
-template <class Dtype> class DL_SortIter;
-
-//!   Template class DL_Node
-template <class Dtype>  class DL_Node
-{
-	   friend class DL_List<Dtype>;
-   	friend class DL_Iter<Dtype>;
-   	friend class DL_SortIter<Dtype>;
-
-      //!Public members
-      public:
-			//!Template constructor no contents
-			//!Construct a node for a list object
-         DL_Node();
-
-         //!constructor with init of Dtype
-         DL_Node( Dtype n );
- 
-		   //!Destructor
-         ~DL_Node();
-
-      //!Public members
-   	public:
-         //!data in node
-         Dtype _item;
-
-         //!pointer to next node
-         DL_Node* _next;
-
-         //!pointer to previous node
-         DL_Node* _prev;
-};
-
-//!Template class DL_List
-template <class Dtype> class DL_List
-{
-   	friend class DL_Iter<Dtype>;
-   	friend class DL_SortIter<Dtype>;
-
-      public:
-		   //!Constructor
-			//!Construct a list object
-			//!!tcarg class | Dtype | list object
-         DL_List();
-
-		   //!destructor
-         ~DL_List();
-
-		   //!Report off List Errors
-   		void Error(const char* function,Lerror a_error);
-
-		   //!Number of items in the list
-         int  count();
-
-		   //!Empty List?
-         bool empty();
-
-		   //!insert the object given at the end of the list, after tail
-         DL_Node<Dtype>* insend( Dtype n );
-
-		   //!insert the object given at the begin of the list, before head
-         DL_Node<Dtype>* insbegin( Dtype n );
-
-		   //!remove the object at the begin of the list (head)
-         void removehead();
-
-		   //! remove the object at the end of the list (tail)
-         void removetail();
-
-		   //!remove all objects from the list
-         void remove_all( bool deleteObject = false );
-
-		   //!Get the item at the head of the list
-         Dtype headitem();
-
-		   //!Get the item at the tail of the list
-         Dtype tailitem();
-
-         //! to move all objects in a list to this list.
-         void takeover(DL_List<Dtype>* otherlist);
-
-       public:
-		   //!the root node pointer of the list, the first and last node
-         //! in the list are connected to the root node. The root node is used
-         //! to detect the end / beginning of the list while traversing it.
-         DL_Node<Dtype>*  _root;
-
-		   //!the number of items in the list, if empty list it is 0
-         int _nbitems;
-
-         //!number of iterators on the list, Attaching or instantiating an iterator to list,
-         //! will increment this member, detaching and
-         //! destruction of iterator for a list will decrement this number
-         short int _iterlevel;
-};
-
-//!  Template class DL_Iter  for iterator on DL_List
-template <class Dtype>
-class DL_Iter
-{
-	public:
-	   //!Construct an iterator object for a given list of type Dtype
-		DL_Iter(DL_List<Dtype>* newlist);
-
-		//!Constructor of iterator for the same list as another iterator
-		DL_Iter(DL_Iter* otheriter);
-
-		//!Constructor without an attached list
-		DL_Iter();
-
-		//!destructor
-		~DL_Iter();
-
-	   //!Report off Iterator Errors
-		void 	  Error(const char* function,Lerror a_error);
-
-      //!This attaches an iterator to a list of a given type.
-		void    Attach(DL_List<Dtype>* newlist);
-
-      //!This detaches an iterator from a list
-      void    Detach();
-
-      //!execute given function for each item in the list/iterator
-		void 	  foreach_f(void (*fp) (Dtype n) );
-
-		//! list mutations
-
-	   //!insert after tail item
-		DL_Node<Dtype>*  insend(Dtype n);
-
-	   //!insert before head item
-		DL_Node<Dtype>* insbegin(Dtype n);
-
-	   //!insert before current iterator position
-        DL_Node<Dtype>* insbefore(Dtype n);
-
-	   //!insert after current iterator position
-		DL_Node<Dtype>* insafter(Dtype n);
-
-      //!to move all objects in a list to the list of the iterator.
-		void    takeover(DL_List<Dtype>* otherlist);
-
-      //!to move all objects in a list (using iterator of that list) to the list of the iterator
-		void    takeover(DL_Iter* otheriter);
-
-      //! to move maxcount objects in a list (using iterator of that list) to the list of the iterator
-      void    takeover(DL_Iter* otheriter, int maxcount);
-
-      //!remove object at current iterator position from the list.
-		void    remove();
-
-	   //!Remove head item
-		void    removehead();
-
-	   //!Remove tail item
-		void    removetail();
-
-	   //!Remove all items
-		void    remove_all();
-
-
-		/*		void 	  foreach_mf(void (Dtype::*mfp)() ); //call Dtype::mfp for each item */
-
-	   //!is list empty (contains items or not)?
-		bool  empty();
-
-	   //!is iterator at root node (begin or end)?
-		bool  hitroot();
-
-	   //!is iterator at head/first node?
-		bool  athead();
-
-	   //!is iterator at tail/last node?
-		bool  attail();
-
-      //!is given item member of the list
-		bool  has(Dtype otheritem);
-
-	   //!Number of items in the list
-		int count();
-
-		/* cursor movements */
-
-		//!go to last item,  if list is empty goto hite
-      void 	totail();
-
-		//!go to first item, if list is empty goto hite
-      void 	tohead();
-
-		//!set the iterator position to the root (empty dummy) object in the list.
-		void 	toroot();
-
-		//! set the iterator position to next object in the list ( can be the root also).
-		void    operator++      (void);
-
-      //!set iterator to next item (pre fix)
-		void    operator++      (int);
-
-		//!set the iterator position to previous object in the list ( can be the root also)(postfix).
-		void    operator--      (void);
-
-		//!set the iterator position to previous object in the list ( can be the root also)(pre fix).
-		void    operator--      (int);
-
-      //!set the iterator position n objects in the next direction ( can be the root also).
-		void    operator>>      (int);
-
-      //!set the iterator position n objects in the previous direction ( can be the root also).
-		void    operator<<      (int);
-
-      //!set the iterator position to next object in the list, if this would be the root object,
-      //!then set the iterator at the head object
-      void next_wrap();
-
-      //!set the iterator position to previous object in the list, if this would be the root object,
-		//!then set the iterator at the tail object
-      void prev_wrap();
-
-      //!move root in order to make the current node the tail
-      void reset_tail();
-
-      //!move root in order to make the current node the head
-      void reset_head();
-
-      //!put the iterator at the position of the given object in the list.
-		bool toitem(Dtype);
-
-      //!put the iterator at the same position as the given iterator in the list.
-		void toiter(DL_Iter* otheriter);
-
-      //!put the iterator at the position of the given node in the list.
-		bool tonode(DL_Node<Dtype>*);
-
-      //!iterate through all items of the list
-		bool iterate(void);
-
-		//!To get the item at the current iterator position
-		Dtype item();
-
-        //! get node at iterator
-        DL_Node<Dtype>* node();
-
-		//!sort list with mergesort
-		void mergesort(int (*fcmp) (Dtype, Dtype));
-
-		//!sort list with cocktailsort
-        /*! 
-                \return number of swaps done.
-          */
-		int cocktailsort(int (*)(Dtype,Dtype), bool (*)(Dtype,Dtype)=NULL);
-
-	protected:
-
-		//!sort list with mergesort
-		void mergesort_rec(int (*fcmp)(Dtype,Dtype), DL_Node<Dtype> *RT1,int n);
-
-		//!sort list with mergesort
-		void mergetwo(int (*fcmp)(Dtype,Dtype), DL_Node<Dtype> *RT1,DL_Node<Dtype> *RT2);
-
-		//!set the iterator position to next object in the list ( can be the root also).
-		void next();
-
-		//!set the iterator position to previous object in the list ( can be the root also).
-		void prev();
-
-      //!the list for this iterator
-		DL_List<Dtype> *_list;
-
-      //!the current position of the iterator
-		DL_Node<Dtype> *_current;
-};
-
-
-//!  template class DL_StackIter class for stack iterator on DL_List
-template <class Dtype>
-class DL_StackIter :protected DL_Iter<Dtype>
-{
-	public:
-	   //!Constructor of stack iterator for given list
-		DL_StackIter(DL_List<Dtype> *);
-	   //!Constructor of stack iterator no list attached
-		DL_StackIter();
-
-	   //!Destructor of stack iterator
-		~DL_StackIter();
-
-	   //!Remove all items from the stack
-		void remove_all();
-	   //!push given item on the stack
-		void push(Dtype n);
-      //!get last inserted item from stack
-		Dtype pop();
-   	//!is stack empty?
-		bool empty();
-      //!number of items on the stack
-		int count();
-};
-
-//!template class DL_SortIter
-template <class DType> class DL_SortIter :public DL_Iter<DType>
-{
-	public:
-	   //!Constructor of sort iterator for given list and sort function
-		DL_SortIter(DL_List<DType>* nw_list, int (*new_func)(DType ,DType ));
-
-	   //!Constructor of sort iterator with sort function and no list attached
-		DL_SortIter(int (*newfunc)(DType,DType));
-
-	   //!Destructor of sort iterator
-		~DL_SortIter();
-
-      //!insert item in sorted order
-		void insert (DType new_item);
-
-      /*override following functions to give an error */
-	   //!Not allowed
-		void   insend (bool n){sortitererror();};
-	   //!Not allowed
-		void   insbegin (bool n){sortitererror();};
-	   //!Not allowed
-      void   insbefore (bool n){sortitererror();};
-	   //!Not allowed
-		void   insafter (bool n){sortitererror();};
-	   //!Not allowed
-		void   takeover (DL_List<DType>*){sortitererror();};
-	   //!Not allowed
-		void   takeover (DL_Iter<DType>*){sortitererror();};
-	   //!Not allowed
-		void   takeover (DL_Iter<DType>* otheriter, int maxcount){sortitererror();};
-	   //!Not allowed
-      void   next_wrap() {sortitererror();};
-	   //!Not allowed
-      void   prev_wrap() {sortitererror();};
-	   //!Not allowed
-      void   reset_tail() {sortitererror();};
-	   //!Not allowed
-      void   reset_head() {sortitererror();};
-
-	private:
-	   //!Report off Iterator Errors
-      void sortitererror();
-
-		//!comparefunction used to insert items in sorted order
-		int  (*comparef)(DType, DType);
-};
-
-#include "../include/_dl_itr.cpp"
-
-#endif

polygon/kbool/include/_lnk_itr.cpp

@@ -1,269 +0,0 @@
-/*! \file kbool/include/kbool/_lnk_itr.cpp
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: _lnk_itr.cpp,v 1.1 2005/05/24 19:13:36 titato Exp $
-*/
-
-#ifdef __GNUG__
-#pragma implementation
-#endif
-
-#ifdef __UNIX__
-#include "../include/_lnk_itr.h"
-#endif 
-
-//=======================================================================
-// implementation class LinkBaseIter
-//=======================================================================
-
-template<class Type>
-TDLI<Type>::TDLI(DL_List<void*>* newlist):DL_Iter<void*>(newlist)
-{
-}
-
-template<class Type>
-TDLI<Type>::TDLI(DL_Iter<void*>* otheriter):DL_Iter<void*>(otheriter)
-{
-}
-
-template<class Type>
-TDLI<Type>::TDLI():DL_Iter<void*>()
-{
-}
-
-// destructor TDLI
-template<class Type>
-TDLI<Type>::~TDLI()
-{
-}
-
-template<class Type>
-void TDLI<Type>::delete_all()
-{
-   DL_Node<void*>* node;
-   Type* obj;
-	for (int i=0; i< NB; i++)
-	{
-		node = HD;
-		HD = node->_next;
-      obj=(Type*)(node->_item);
-      delete obj;
-		delete node;
-	}
-	NB=0; //reset memory used (no lost pointers)
-   TL=RT;
-   _current=RT;
-}
-
-template<class Type>
-void TDLI<Type>::foreach_f(void (*fp) (Type* item) )
-{
-   DL_Iter<void*>::foreach_f( (void (*)(void*))fp); //call fp for each item
-}
-
-template<class Type>
-void TDLI<Type>::foreach_mf(void (Type::*mfp) ())
-{
-
-   DL_Node<void*>* node=HD; //can be 0 if empty
-   Type* obj;
-   for(int i=0; i< NB; i++)
-   {
-     obj=(Type*)(node->_item);
-     (obj->*mfp)();
-     node=node->_next;
-   }
-}
-
-template<class Type>
-void TDLI<Type>::takeover(DL_List<void*>* otherlist)
-{
-   DL_Iter<void*>::takeover( (DL_List<void*>*) otherlist);
-}
-
-template<class Type>
-void TDLI<Type>::takeover(TDLI* otheriter)
-{
-   DL_Iter<void*>::takeover( (DL_Iter<void*>*) otheriter);
-}
-
-template<class Type>
-void TDLI<Type>::takeover(TDLI* otheriter,int maxcount)
-{
-   DL_Iter<void*>::takeover( (DL_Iter<void*>*) otheriter,maxcount);
-}
-
-// is item element of the list?
-template<class Type>
-bool TDLI<Type>::has(Type* otheritem)
-{
-   return DL_Iter<void*>::has( (void*) otheritem);
-}
-
-// goto to item
-template<class Type>
-bool TDLI<Type>::toitem(Type* item)
-{
-   return DL_Iter<void*>::toitem( (void*) item);
-}
-
-// get current item
-template<class Type>
-Type*    TDLI<Type>::item()
-{
-   return (Type*) DL_Iter<void*>::item();
-}
-
-template<class Type>
-void TDLI<Type>::insend(Type* newitem)
-{
-   DL_Iter<void*>::insend( (void*) newitem);
-}
-
-template<class Type>
-void TDLI<Type>::insbegin(Type* newitem)
-{
-   DL_Iter<void*>::insbegin( (void*) newitem);
-}
-
-template<class Type>
-void TDLI<Type>::insbefore(Type* newitem)
-{
-   DL_Iter<void*>::insbefore( (void*) newitem);
-}
-
-template<class Type>
-void TDLI<Type>::insafter(Type* newitem)
-{
-   DL_Iter<void*>::insafter( (void*) newitem);
-}
-
-template<class Type>
-void TDLI<Type>::insend_unsave(Type* newitem)
-{
-   short int iterbackup=_list->_iterlevel;
-   _list->_iterlevel=0;
-   DL_Iter<void*>::insend( (void*) newitem);
-   _list->_iterlevel=iterbackup;
-}
-
-template<class Type>
-void TDLI<Type>::insbegin_unsave(Type* newitem)
-{
-   short int iterbackup=_list->_iterlevel;
-   _list->_iterlevel=0;
-   DL_Iter<void*>::insbegin( (void*) newitem);
-   _list->_iterlevel=iterbackup;
-}
-
-template<class Type>
-void TDLI<Type>::insbefore_unsave(Type* newitem)
-{
-   short int iterbackup=_list->_iterlevel;
-   _list->_iterlevel=0;
-   DL_Iter<void*>::insbefore( (void*) newitem);
-   _list->_iterlevel=iterbackup;
-}
-
-template<class Type>
-void TDLI<Type>::insafter_unsave(Type* newitem)
-{
-   short int iterbackup=_list->_iterlevel;
-   _list->_iterlevel=0;
-   DL_Iter<void*>::insafter( (void*) newitem);
-   _list->_iterlevel=iterbackup;
-}
-
-template<class Type>
-void TDLI<Type>::mergesort(int (*f)(Type* a,Type* b))
-{
-   DL_Iter<void*>::mergesort( (int (*)(void*,void*)) f);
-}
-
-template<class Type>
-int TDLI<Type>::cocktailsort(int (*f)(Type* a,Type* b), bool (*f2)(Type* c,Type* d))
-{
-   return DL_Iter<void*>::cocktailsort( (int (*)(void*,void*)) f,( bool(*)(void*,void*)) f2);
-}
-
-template<class Type>
-TDLISort<Type>::TDLISort(DL_List<void*>* lista, int (*newfunc)(void*,void*))
-								 :DL_SortIter<void*>(lista, newfunc)
-{
-}
-
-template<class Type>
-TDLISort<Type>::~TDLISort()
-{
-}
-
-template<class Type>
-void TDLISort<Type>::delete_all()
-{
-   DL_Node<void*>* node;
-   Type* obj;
-	for (int i=0; i< NB; i++)
-	{
-		node = HD;
-		HD = node->_next;
-      obj=(Type*)(node->_item);
-      delete obj;
-		delete node;
-	}
-	NB=0; //reset memory used (no lost pointers)
-   TL=RT;
-   _current=RT;
-}
-
-// is item element of the list?
-template<class Type>
-bool TDLISort<Type>::has(Type* otheritem)
-{
-   return DL_Iter<void*>::has( (void*) otheritem);
-}
-
-// goto to item
-template<class Type>
-bool TDLISort<Type>::toitem(Type* item)
-{
-   return DL_Iter<void*>::toitem( (void*) item);
-}
-
-// get current item
-template<class Type>
-Type*    TDLISort<Type>::item()
-{
-   return (Type*) DL_Iter<void*>::item();
-}
-
-template<class Type>
-TDLIStack<Type>::TDLIStack(DL_List<void*>* newlist):DL_StackIter<void*>(newlist)
-{
-}
-
-// destructor TDLI
-template<class Type>
-TDLIStack<Type>::~TDLIStack()
-{
-}
-
-// plaats nieuw item op stack
-template<class Type>
-void TDLIStack<Type>::push(Type* newitem)
-{
-	DL_StackIter<void*>::push((Type*) newitem);
-}
-
-
-// haal bovenste item van stack
-template<class Type>
-Type* TDLIStack<Type>::pop()
-{
-  return (Type*) DL_StackIter<void*>::pop();
-}
-
-

polygon/kbool/include/_lnk_itr.h

@@ -1,163 +0,0 @@
-/*! \file kbool/include/kbool/_lnk_itr.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: _lnk_itr.h,v 1.1 2005/05/24 19:13:36 titato Exp $
-*/
-
-//! author="Klaas Holwerda"
-//! version="1.0"
-/*
- * Definitions of classes, for list implementation
- * template list and iterator for any list node type
-*/
-#ifndef _LinkBaseIter_H
-#define _LinkBaseIter_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-//! headerfiles="_dl_itr.h stdlib.h misc.h gdsmes.h"
-#include <stdlib.h>
-#include "../include/booleng.h"
-
-#define SWAP(x,y,t)((t)=(x),(x)=(y),(y)=(t))
-
-#include "../include/_dl_itr.h"
-
-//! codefiles="_dl_itr.cpp"
-
-//!  Template class TDLI
-/*!
- class for iterator on DL_List<void*> that is type casted version of DL_Iter
- \sa DL_Iter for further documentation
-*/
-template<class Type> class TDLI : public DL_Iter<void*>
-{
-	public:
-		//!constructor
-      /*!
-      \param list to iterate on.
-      */
-		TDLI(DL_List<void*>* list);
-
- 		//!constructor
-	   TDLI(DL_Iter<void*>* otheriter);
-
-		//! nolist constructor
-		TDLI();
-
-		//! destructor
-		~TDLI();
-
-		//!call fp for each item
-      void 	  foreach_f(void (*fp) (Type* item) );
-
-      //!call fp for each item
-      void 	  foreach_mf(void (Type::*fp) () );
-
-		/* list mutations */
-
-
-		//! delete all items
-		void    delete_all		();
-
-
-      //! insert at end
-		void    insend		      (Type* n);
-
-      //! insert at begin
-		void    insbegin		   (Type* n);
-
-      //! insert before current
-		void    insbefore       (Type* n);
-
-      //! insert after current
-		void    insafter        (Type* n);
-
-      //! insert at end unsave (works even if more then one iterator is on the list
-      //! the user must be sure not to delete/remove items where other iterators
-      //! are pointing to.
-		void    insend_unsave	 (Type* n);
-
-      //! insert at begin unsave (works even if more then one iterator is on the list
-      //! the user must be sure not to delete/remove items where other iterators
-      //! are pointing to.
-		void    insbegin_unsave	 (Type* n);
-
-      //! insert before iterator position unsave (works even if more then one iterator is on the list
-      //! the user must be sure not to delete/remove items where other iterators
-      //! are pointing to.
-		void    insbefore_unsave (Type* n);
-
-      //! insert after iterator position unsave (works even if more then one iterator is on the list
-      //! the user must be sure not to delete/remove items where other iterators
-      //! are pointing to.
-		void    insafter_unsave  (Type* n);
-
-      //! \sa DL_Iter::takeover(DL_List< Dtype >* otherlist )
-		void    takeover        (DL_List<void*>* otherlist);
-      //! \sa DL_Iter::takeover(DL_Iter* otheriter)
-		void    takeover        (TDLI* otheriter);
-      //! \sa DL_Iter::takeover(DL_Iter* otheriter, int maxcount)
-		void    takeover        (TDLI* otheriter, int maxcount);
-
-      //! \sa DL_Iter::has
-		bool  has             (Type*);
-      //! \sa DL_Iter::toitem
-		bool  toitem          (Type*);
-
-      //!get the item then iterator is pointing at
-      Type*   item            ();
-
-      //! \sa DL_Iter::mergesort
-		void    mergesort             (int (*f)(Type* a,Type* b));
-      //! \sa DL_Iter::cocktailsort
-		int  cocktailsort( int (*) (Type* a,Type* b), bool (*) (Type* c,Type* d) = NULL);
-
-};
-
-//!  Template class TDLIsort
-/*!
-// class for sort iterator on DL_List<void*> that is type casted version of DL_SortIter
-// see also inhereted class DL_SortIter for further documentation
-*/
-template<class Type> class TDLISort : public DL_SortIter<void*>
-{
-	public:
-
-      //!constructor givin a list and a sort function
-		TDLISort(DL_List<void*>* list, int (*newfunc)(void*,void*));
-		~TDLISort();
-
-      //!delete all items from the list
-		void    		 delete_all();
-		bool       has     (Type*);
-		bool       toitem  (Type*);
-		Type* item    ();
-};
-
-//!  Template class TDLIStack
-/*!
- class for iterator on DL_List<void*> that is type casted version of DL_StackIter
- see also inhereted class DL_StackIter for further documentation
-*/
-template<class Type> class TDLIStack : public DL_StackIter<void*>
-{
-   public:
-      //constructor givin a list
-		TDLIStack(DL_List<void*>* list);
-
-		~TDLIStack();
-
-		void            push(Type*);
-		Type*           pop();
-};
-
-#include"../include/_lnk_itr.cpp"
-
-#endif

polygon/kbool/include/booleng.h

@@ -1,544 +0,0 @@
-/*! \file kbool/include/kbool/booleng.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: booleng.h,v 1.3 2005/06/11 19:25:12 frm Exp $
-*/
-
-#ifndef BOOLENG_H
-#define BOOLENG_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-
-#include <stdio.h>
-#include <limits.h>
-
-
-#ifdef A2DKBOOLMAKINGDLL
-#define A2DKBOOLDLLEXP WXEXPORT
-#define A2DKBOOLDLLEXP_DATA(type) WXEXPORT type
-#define A2DKBOOLDLLEXP_CTORFN
-#if 0   // Kicad does dot use wxWidgets lib when building the kbool library
-        // but uses wxWidgets. So WXUSINGDLL has no meaning here, but could be defined in makefiles
-        // but must not be used when building kbool
-#elif defined(WXUSINGDLL)
-#define A2DKBOOLDLLEXP WXIMPORT
-#define A2DKBOOLDLLEXP_DATA(type) WXIMPORT type
-#define A2DKBOOLDLLEXP_CTORFN
-#endif
-#else // not making nor using DLL
-#define A2DKBOOLDLLEXP
-#define A2DKBOOLDLLEXP_DATA(type) type
-#define A2DKBOOLDLLEXP_CTORFN
-#endif
-
-#define KBOOL_VERSION "1.8"
-
-#define KBOOL_DEBUG 0
-#define KBOOL_LOG 0
-#define KBOOL_INT64 1
-
-class KBoolLink;
-
-#define LINELENGTH 200
-
-#ifdef  MAXDOUBLE
-#undef  MAXDOUBLE
-#endif
-#define MAXDOUBLE 1.7976931348623158e+308
-
-#ifdef KBOOL_INT64
-
-#if defined(__UNIX__) || defined(__GNUG__)
-
-typedef long long B_INT;		   // 8 bytes integer
-//#define MAXB_INT LONG_LONG_MAX
-//#define MINB_INT LONG_LONG_MIN	// 8 bytes integer
-#ifndef MAXB_INT
- const B_INT MAXB_INT = (0x7fffffffffffffffLL);             // 8 bytes integer
-#endif
-#ifndef MINB_INT
- const B_INT MINB_INT = (0x8000000000000000LL);
-#endif
-
-#else //defined(__UNIX__) || defined(__GNUG__)
-
-typedef __int64 B_INT;		   // 8 bytes integer
-#undef MAXB_INT 
-#undef MINB_INT 
-
-const B_INT MAXB_INT = (0x7fffffffffffffff);             // 8 bytes integer
-const B_INT MINB_INT = (0x8000000000000000);
-
-#endif //defined(__UNIX__) || defined(__GNUG__)
-
-#else //KBOOL_INT64 
-
-#if defined(__UNIX__) || defined(__GNUG__)
-typedef long B_INT;		   // 4 bytes integer
-const B_INT MAXB_INT = (0x7fffffffL);             // 4 bytes integer
-const B_INT MINB_INT = (0x80000000L);
-#else
-typedef long B_INT;		   // 4 bytes integer
-const B_INT MAXB_INT = (0x7fffffff);             // 4 bytes integer
-const B_INT MINB_INT = (0x80000000);
-#endif
-
-#endif //KBOOL_INT64 
-
-B_INT babs(B_INT);
-
-#ifdef  M_PI
-#undef  M_PI
-#endif
-#define M_PI		(3.1415926535897932384626433832795028841972)
-
-#ifdef  M_PI_2
-#undef  M_PI_2
-#endif
-#define M_PI_2      1.57079632679489661923
-
-#ifdef  M_PI_4
-#undef  M_PI_4
-#endif
-#define M_PI_4      0.785398163397448309616
-
-#ifndef NULL
-#define NULL 0
-#endif
-
-B_INT bmin(B_INT const value1, B_INT const value2);
-B_INT bmax(B_INT const value1, B_INT const value2);
-
-B_INT bmin(B_INT value1, B_INT value2);
-B_INT bmax(B_INT value1, B_INT value2);
-
-#include <string.h>
-
-//! errors in the boolean algorithm will be thrown using this class
-class A2DKBOOLDLLEXP Bool_Engine_Error
-{
-	public:
-		Bool_Engine_Error(const char* message, const char* header=0, int degree = 9, int fatal = 0);
-		Bool_Engine_Error(const Bool_Engine_Error& a);
-		~Bool_Engine_Error();
-		char*	GetErrorMessage();
-		char* GetHeaderMessage();
-		int	GetErrorDegree();
-		int	GetFatal();
-
-	protected:
-		char*	_message;
-		char*	_header;
-		int 	_degree;
-		int 	_fatal;
-};
-
-
-#define KBOOL_LOGFILE "kbool.log"
-
-enum kbEdgeType 
-{ 
-   KB_OUTSIDE_EDGE, /*!< edge of the outside contour of a polygon */
-   KB_INSIDE_EDGE,  /*!< edge of the inside hole a polygon */
-   KB_FALSE_EDGE    /*!< edge to connect holes into polygons */
-} ;
-
-enum GroupType 
-{ 
-   GROUP_A, /*!< to set Group A for polygons */
-   GROUP_B  /*!< to set Group A for polygons */
-};
-
-enum BOOL_OP 
-{ 
-   BOOL_NON, /*!< No operation */
-   BOOL_OR, /*!< boolean OR operation */
-   BOOL_AND, /*!< boolean AND operation */
-   BOOL_EXOR, /*!< boolean EX_OR operation */
-   BOOL_A_SUB_B, /*!< boolean Group A - Group B operation */
-   BOOL_B_SUB_A, /*!< boolean Group B - Group A operation */
-   BOOL_CORRECTION, /*!< polygon correction/offset operation */
-   BOOL_SMOOTHEN, /*!< smooth operation */
-   BOOL_MAKERING /*!< create a ring on all polygons */
-};
-
-class GraphList;
-class Graph;
-class KBoolLink;
-class Node;
-template<class Type> class TDLI;
-
-//! boolean engine to perform operation on two sets of polygons.
-/*
-	First the engine needs to be filled with polygons.
-	The first operand in the operation is called group A polygons, the second group B.
-	The boolean operation ( BOOL_OR, BOOL_AND, BOOL_EXOR, BOOL_A_SUB_B, BOOL_B_SUB_A )
-	are based on the two sets of polygons in group A and B.
-	The other operation on group A only.
-
-    At the end of the operation the resulting polygons can be extracted.
-*/
-class A2DKBOOLDLLEXP Bool_Engine {
-
-  public:
-
-   //! constructor    
-   Bool_Engine();
-
-   //! destructor   
-   virtual ~Bool_Engine();
-
-   const char* GetVersion() { return KBOOL_VERSION; }
-
-	//! reports progress of algorithm.
-   virtual void SetState( const char* = 0 );
-
-	//! called at an internal error.
-	virtual void error(const char *text, const char *title);
-
-	//! called at an internal generated possible error.
-   virtual void info(const char *text, const char *title);
-
-   bool Do_Operation(BOOL_OP operation);
-
-
-   //! distance within which points and lines will be snapped towards lines and other points
-   /*
-         The algorithm takes into account gaps and inaccuracies caused by rounding to integer coordinates
-         in the original data.
-         Imagine two rectangles one with a side ( 0,0 ) ( 2.0, 17.0 ) 
-         and the other has a side ( 0,0 ) ( 1.0, 8.5 )
-         If for some reason those coordinates where round to ( 0,0 ) ( 2, 17 ) ( 0,0 ) ( 1, 9 ),
-         there will be clearly a gap or overlap that was not intended.
-         Even without rounding this effect takes place since there is always a minimum significant bit
-         also when using doubles.
-
-         If the user used as minimum accuracy 0.001, you need to choose Marge > 0.001
-         The boolean engine scales up the input data with GetDGrid() * GetGrid() and rounds the result to
-         integer, So (assuming GRID = 100 DGRID = 1000)  a vertex of 123.001 in the user data will
-         become 12300100 internal.
-         At the end of the algorithm the internal vertexes are scaled down again with GetDGrid() * GetGrid(),
-         so 12300103 becomes 123.00103 eventually.
-         So indeed the minimum accuracy might increase, you are free to round again if needed.
-   */
-   void SetMarge(double marge);
-   double GetMarge();
-
-   //! input points are scaled up with GetDGrid() * GetGrid()
-   /*
-		Grid makes sure that the integer data used within the algorithm has room for extra intersections
-		smaller than the smallest number within the input data.
-		The input data scaled up with DGrid is related to the accuracy the user has in his input data.
-        Another scaling with Grid is applied on top of it to create space in the integer number for 
-		even smaller numbers. 
-   */
-   void SetGrid(B_INT grid);  
-	
-	//! See SetGrid
-   B_INT GetGrid();
-
-   //! input points are scaled up with GetDGrid() * GetGrid()
-   /*
-      The input data scaled up with DGrid is related to the accuracy the user has in his input data.
-      User data with a minimum accuracy of 0.001, means set the DGrid to 1000.
-      The input data may contain data with a minimum accuracy much smaller, but by setting the DGrid
-      everything smaller than 1/DGrid is rounded.
-
-      DGRID is only meant to make fractional parts of input data which can be
-      doubles, part of the integers used in vertexes within the boolean algorithm.
-      And therefore DGRID bigger than 1 is not usefull, you would only loose accuracy.
-      Within the algorithm all input data is multiplied with DGRID, and the result
-      is rounded to an integer. 
-   */
-   void SetDGrid(double dgrid);
-
-	//! See SetDGrid
-   double GetDGrid();
-
-   //! When doing a correction operation ( also known as process offset )
-	//! this defines the detail in the rounded corners.
-	/*
-		Depending on the round factor the corners of the polygon may be rounding within the correction
-		algorithm. The detail within this rounded corner is set here.
-		It defines the deviation the generated segments in arc like polygon may have towards the ideal
-		rounded corner using a perfect arc.
-    */
-   void SetCorrectionAber(double aber);
-
-	//! see SetCorrectionAber
-   double GetCorrectionAber();
-
-   //! When doing a correction operation ( also known as process offset )
-	//! this defines the amount of correction.
-   /*
-      The correction algorithm can apply positive and negative offset to polygons.
-      It takes into account closed in areas within a polygon, caused by overlapping/selfintersecting
-      polygons. So holes form that way are corrected proberly, but the overlapping parts itself
-      are left alone. An often used trick to present polygons with holes by linking to the outside
-      boundary, is therefore also handled properly.
-      The algoritm first does a boolean OR operation on the polygon, and seperates holes and
-      outside contours.
-      After this it creates a ring shapes on the above holes and outside contours.
-      This ring shape is added or subtracted from the holes and outside contours.
-      The result is the corrected polygon.
-      If the correction factor is > 0, the outside contours will become larger, while the hole contours
-      will become smaller.
-   */
-   void SetCorrectionFactor(double aber);
-
-	//! see SetCorrectionFactor
-   double GetCorrectionFactor();
-
-	//! used within the smooth algorithm to define how much the smoothed curve may deviate
-	//! from the original.
-   void SetSmoothAber(double aber);
-
-	//! see SetSmoothAber
-   double GetSmoothAber();
-
-	//! segments of this size will be left alone in the smooth algorithm.
-   void SetMaxlinemerge(double maxline);
-
-	//! see SetMaxlinemerge
-   double GetMaxlinemerge();
-
-	//! Polygon may be filled in different ways (alternate and winding rule).
-	//! This here defines which method will be assumed within the algorithm.
-   void SetWindingRule(bool rule);
-
-	//! see SetWindingRule
-   bool GetWindingRule();
-
-	//! the smallest accuracy used within the algorithm for comparing two real numbers.
-   double GetAccur();
-
-    //! Used with in correction/offset algorithm.
-	/*
-		When the polygon contains sharp angles ( < 90 ), after a positive correction the
-		extended parrallel constructed offset lines may leed to extreme offsets on the angles.
-		The length of the crossing generated by the parrallel constructed offset lines
-		towards the original point in the polygon is compared to the offset which needs to be applied.
-		The Roundfactor then decides if this corner will be rounded.
-		A Roundfactor of 1 means that the resulting offset will not be bigger then the correction factor
-		set in the algorithm. Meaning even straight 90 degrees corners will be rounded.
-		A Roundfactor of > sqrt(2) is where 90 corners will be left alone, and smaller corners will be rounded.
-	*/
-	void SetRoundfactor(double roundfac);
-
-	//! see SetRoundfactor
-   double GetRoundfactor();
-
-// the following are only be used within the algorithm,
-// since they are scaled with m_DGRID
-
-   //! only used internal.
-   void SetInternalMarge( B_INT marge );
-   //! only used internal.
-   B_INT GetInternalMarge();
-
-   //! only used internal.
-   double GetInternalCorrectionAber();
-
-   //! only used internal.
-   double GetInternalCorrectionFactor();
-
-   //! only used internal.
-   double GetInternalSmoothAber();
-
-   //! only used internal.
-   B_INT GetInternalMaxlinemerge();
-
-   //! in this mode polygons add clockwise, or contours,
-   /*!
-       and polygons added counter clockwise or holes.
-   */
-   void SetOrientationEntryMode( bool orientationEntryMode ) { m_orientationEntryMode = orientationEntryMode; }
-
-	//! see SetOrientationEntryMode()
-   bool GetOrientationEntryMode() { return m_orientationEntryMode; }
-
-   //! if set true holes are linked into outer contours by double overlapping segments.
-   /*!
-       This mode is needed when the software using the boolean algorithm does 
-       not understand hole polygons. In that case a contour and its holes form one
-       polygon. In cases where software understands the concept of holes, contours
-       are clockwise oriented, while holes are anticlockwise oriented.
-       The output of the boolean operations, is following those rules also.
-       But even if extracting the polygons from the engine, each segment is marked such
-       that holes and non holes and linksegments to holes can be recognized.
-   */
-   void SetLinkHoles( bool doLinkHoles ) { m_doLinkHoles = doLinkHoles; }
-
-	//! see SetLinkHoles()
-   bool GetLinkHoles() { return m_doLinkHoles; } 
-
-   //!lof file will be created when set True
-   void SetLog( bool OnOff ); 
-
-   //! used to write to log file
-   void Write_Log(const char *);
-   //! used to write to log file
-   void Write_Log(const char *, const char *);
-   //! used to write to log file
-   void Write_Log(const char *, double);
-   //! used to write to log file
-   void Write_Log(const char *, B_INT);
-
-   FILE* GetLogFile() { return m_logfile; }
-
-    // methods used to add polygons to the eng using points
-
-   //! Start adding a polygon to the engine
-   /*
-      The boolean operation work on two groups of polygons ( group A or B ),
-      other algorithms are only using group A.
-
-      You add polygons like this to the engine.
-
-      // foreach point in a polygon ...
-      if (booleng->StartPolygonAdd(GROUP_A))
-      {
-	      booleng->AddPoint(100,100);
-	      booleng->AddPoint(-100,100); 
-	      booleng->AddPoint(-100,-100); 
-	      booleng->AddPoint(100,-100); 
-      }
-      booleng->EndPolygonAdd(); 
-
-      \param A_or_B defines if the new polygon will be of group A or B
-
-      Holes or added by adding an inside polygons with opposite orientation compared
-      to another polygon added.
-      So the contour polygon ClockWise, then add counterclockwise polygons for holes, and visa versa.
-      BUT only if m_orientationEntryMode is set true, else all polygons are redirected, and become
-      individual areas without holes. 
-      Holes in such a case must be linked into the contour using two extra segments.
-   */
-   bool StartPolygonAdd( GroupType A_or_B );
-
-   //! see StartPolygonAdd
-   bool AddPoint(double x, double y);
-
-   //! see StartPolygonAdd
-   bool EndPolygonAdd();
-
-    // methods used to extract polygons from the eng by getting its points
-
-   //! Use after StartPolygonGet()
-   int GetNumPointsInPolygon() { return m_numPtsInPolygon ; }
-
-	//! get resulting polygons at end of an operation
-	/*!
-		// foreach resultant polygon in the booleng ...
-		while ( booleng->StartPolygonGet() )
-		{
-			// foreach point in the polygon
-			while ( booleng->PolygonHasMorePoints() )
-			{
-				fprintf(stdout,"x = %f\t", booleng->GetPolygonXPoint());
-				fprintf(stdout,"y = %f\n", booleng->GetPolygonYPoint());
-			}
-			booleng->EndPolygonGet();
-		}
-   */
-	bool StartPolygonGet(); 
-
-   //! see StartPolygonGet
-   /*!
-      This iterates through the first graph in the graphlist.
-      Setting the current Node properly by following the links in the graph
-      through its nodes. 
-   */
-   bool PolygonHasMorePoints(); 
-
-   //! see StartPolygonGet
-   double GetPolygonXPoint(); 
-
-   //! see StartPolygonGet
-   double GetPolygonYPoint(); 
-
-	//! in the resulting polygons this tells if the current polygon segment is one
-	//! used to link holes into the outer contour of the surrounding polygon
-	bool GetHoleConnectionSegment();
-
-	//! in the resulting polygons this tells if the current polygon segment is part
-	//! of a hole within a polygon.
-	bool GetHoleSegment();
-
-   //! an other way to get the type of segment.
-   kbEdgeType GetPolygonPointEdgeType();
-
-	//! see StartPolygonGet()
-   /*!
-      Removes a graph from the graphlist.
-      Called after an extraction of an output polygon was done.
-   */
-	void EndPolygonGet(); 
-
-  private:
-
-   bool m_doLog;
-
-   //! contains polygons in graph form
-   GraphList* m_graphlist;
-
-   double m_MARGE;
-   B_INT  m_GRID;
-   double m_DGRID;
-   double m_CORRECTIONABER;
-   double m_CORRECTIONFACTOR;
-   double m_SMOOTHABER;
-   double m_MAXLINEMERGE;
-   bool   m_WINDINGRULE;
-   double m_ACCUR;
-   double m_ROUNDFACTOR;
-
-   bool m_orientationEntryMode;
-
-   bool m_doLinkHoles;
-
-   //! used in the StartPolygonAdd, AddPt, EndPolygonAdd sequence
-   Graph*    m_GraphToAdd;
-   //! used in the StartPolygonAdd, AddPt, EndPolygonAdd sequence
-   Node*     m_lastNodeToAdd;
-   //! used in the StartPolygonAdd, AddPt, EndPolygonAdd sequence
-   Node*     m_firstNodeToAdd;
-
-   //! the current group type ( group A or B )
-   GroupType m_groupType;
-
-   //! used in extracting the points from the resultant polygons
-   Graph* m_getGraph;
-   //! used in extracting the points from the resultant polygons
-   KBoolLink* m_getLink;
-   //! used in extracting the points from the resultant polygons
-   Node* m_getNode;
-   //! used in extracting the points from the resultant polygons
-   double m_PolygonXPoint;
-   //! used in extracting the points from the resultant polygons
-   double m_PolygonYPoint;
-   //! used in extracting the points from the resultant polygons
-   int m_numPtsInPolygon;
-   //! used in extracting the points from the resultant polygons
-   int m_numNodesVisited;
-
-   FILE* m_logfile;
-
-public:
-
-   //! use in Node to iterate links. 
-   TDLI<KBoolLink>* 	_linkiter;
-
-   //! how many time run intersections fase.
-   unsigned int m_intersectionruns;
-
-};
-
-#endif

polygon/kbool/include/graph.h

@@ -1,211 +0,0 @@
-/*! \file ../include/../graph.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: graph.h,v 1.1 2005/05/24 19:13:37 titato Exp $
-*/
-
-/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/modules/../include/graph.h,v $ $Revision: 1.1 $ $Date: 2005/05/24 19:13:37 $ */
-
-/*
-Program	GRAPH.H
-Purpose	Used to Intercect and other process functions
-Last Update	03-04-1996
-*/
-
-#ifndef GRAPH_H
-#define GRAPH_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include "../include/booleng.h"
-#include "../include/_lnk_itr.h"
-#include "../include/link.h"
-#include "../include/line.h"
-#include "../include/scanbeam.h"
-
-class Node;
-
-class GraphList;
-
-//! one graph containing links that cab be connected.
-class A2DKBOOLDLLEXP Graph
-{
-   protected:
-      Bool_Engine* _GC;
-	public:
-
-      Graph(Bool_Engine* GC);
-      Graph(KBoolLink*,Bool_Engine* GC);
-
-      Graph( Graph* other );
-
-      ~Graph();
-
-      bool		 GetBin() 							{ return _bin; };
-      void		 SetBin(bool b) 					{ _bin = b; };
-
-		void 		 Prepare( int intersectionruns );
-		void      RoundInt(B_INT grid);
-		void 		 Rotate(bool plus90);
-
-      //! adds a link to the linklist
-		void		 AddLink(Node *begin,Node *end);  			
-
-      //! adds a link to the linklist
-		void		 AddLink(KBoolLink *a_link);  
-      
-		bool		 AreZeroLines(B_INT Marge);	
-
-      //! Delete parallel lines
-		void		 DeleteDoubles();             
-
-      //! delete zerolines
-		bool		 DeleteZeroLines(B_INT Marge);
-		bool 		 RemoveNullLinks();
-
-      //! Process found intersections
-		void		 ProcessCrossings();        					
-      //! set flags for operations based on group
-		void      Set_Operation_Flags();                   
-
-		//! Left Right values																		
-		void		 Remove_IN_Links();						
-
-      //! reset bin and mark flags in links.
-      void ResetBinMark();
-
-		// Remove unused links
-		void		 ReverseAllLinks();
-
-      //! Simplify the graph
-		bool		 Simplify( B_INT Marge );			 		
-
-
-      //! Takes over all links of the argument
-		bool 		 Smoothen( B_INT Marge);
-
-		void		 TakeOver(Graph*);                        
-
-		//! function for maximum performance
-
-      //! Get the First link from the graph
-		KBoolLink*	GetFirstLink(); 								
-		Node*			GetTopNode();
-		void			SetBeenHere(bool);
-	   void 			Reset_flags();
-
-      //! Set the group of a graph
-		void			SetGroup(GroupType);					
-
-      //! Set the number of the graph
-		void			SetNumber(int);				
-		void 			Reset_Mark_and_Bin();
-		bool		   GetBeenHere();
-		int			GetGraphNum();
-		int			GetNumberOfLinks();
-
-		void        Boolean(BOOL_OP operation,GraphList* Result);
-		void        Correction(GraphList* Result,double factor);
-		void        MakeRing(GraphList* Result,double factor);
-		void        CreateRing(GraphList *ring,double factor);
-		void        CreateRing_fast(GraphList *ring,double factor);
-		void        CreateArc(Node* center, KBoolLine* incoming, Node* end,double radius,double aber);
-		void        CreateArc(Node* center, Node* begin, Node* end,double radius,bool clock,double aber);
-		void        MakeOneDirection();
-		void        Make_Rounded_Shape(KBoolLink* a_link, double factor);
-		bool 		   MakeClockWise();
-		bool 		   writegraph(bool linked);
-		bool 		   writeintersections();
-      void        WriteKEY( Bool_Engine* GC,  FILE* file = NULL );
-      void        WriteGraphKEY( Bool_Engine* GC );
-   
-	protected:
-
-      //! Extracts partical polygons from the graph
-      /*     
-         Links are sorted in XY at beginpoint. Bin and mark flag are reset.
-         Next start to collect subparts from the graph, setting the links bin for all found parts.
-         The parts are searched starting at a topleft corner NON set bin flag link.
-         Found parts are numbered, to be easily split into to real sperate graphs by Split()
-      
-         \param operation operation to collect for.
-         \param detecthole if you want holes detected, influences also way of extraction.
-         \param foundholes when holes are found this flag is set true, but only if detecthole is set true.
-      */
-		void 	Extract_Simples(BOOL_OP operation, bool detecthole, bool& foundholes );
-
-      //! split graph into small graph, using the numbers in links.
-		void 	Split(GraphList* partlist);
-
-   	//! Collect a graph by starting at argument link
-      /*
-         Called from Extract_Simples, and assumes sorted links with bin flag unset for non extarted piece
-
-         Collect graphs pieces from a total graph, by following links set to a given boolean operation.
-         \param current_node start node to collect
-         \param operation operation to collect for.
-         \param detecthole if you want holes detected, influences also way of extraction.
-         \param graphnumber number to be given to links in the extracted graph piece
-         \param foundholes when holes are found this flag is set true.
-      */
-		void 	CollectGraph(Node *current_node, BOOL_OP operation, bool detecthole,int graphnumber, bool& foundholes );
-
-		void 	CollectGraphLast(Node *current_node, BOOL_OP operation, bool detecthole,int graphnumber, bool& foundholes );
-
-      //! find a link not bin in the top left corner ( links should be sorted already )
-      /*!
-         Last found position is used to find it quickly.
-         Used in ExtractSimples()
-      */
-		Node*	GetMostTopLeft(TDLI<KBoolLink>* _LI);
-
-      //! calculates crossing for all links in a graph, and add those as part of the graph.
-      /*
-         It is not just crossings calculation, snapping close nodes is part of it.
-         This is not done at maximum stability in economic time.
-         There are faster ways, but hardly ever they solve the problems, and they do not snap.
-         Here it is on purpose split into separate steps, to get a better result in snapping, and
-         to reach a better stability.
-
-         \param Marge nodes and lines closer to eachother then this, are merged.
-      */
-		bool CalculateCrossings(B_INT Marge);
-
-      //! equal nodes in position are merged into one.
-		int	Merge_NodeToNode(B_INT Marge);
-
-      //! basic scan algorithm with a sweeping beam are line.
-      /*!
-          \param scantype a different face in the algorithm.
-          \param holes to detect hole when needed.
-      */
-		int ScanGraph2( SCANTYPE scantype, bool& holes );
-
-      //! links not used for a certain operation can be deleted, simplifying extraction
-		void 	DeleteNonCond(BOOL_OP operation);
-
-      //! links not used for a certain operation can be set bin, simplifying extraction
-      void HandleNonCond(BOOL_OP operation);
-
-      //! debug
-	   bool 	checksort();
-
-      //! used in correction/offset algorithm
-		bool 	Small(B_INT howsmall);
-
-
-		bool	_bin;
-
-		DL_List<void*>* _linklist;
-
-};
-
-#endif
-
-

polygon/kbool/include/graphlst.h

@@ -1,69 +0,0 @@
-/*! \file ../include/../graphlst.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: graphlst.h,v 1.1 2005/05/24 19:13:37 titato Exp $
-*/
-
-/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/modules/../include/graphlst.h,v $ $Revision: 1.1 $ $Date: 2005/05/24 19:13:37 $ */
-
-/*
-Program	GRAPHLST.H
-Purpose	Implements a list of graphs (header)
-Last Update	11-03-1996
-*/
-
-#ifndef GRAPHLIST_H
-#define GRAPHLIST_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include "../include/booleng.h"
-
-#include "../include/_lnk_itr.h"
-
-#include "../include/graph.h"
-
-class Debug_driver;
-
-
-class A2DKBOOLDLLEXP GraphList: public DL_List<void*>
-{
-   protected:
-      Bool_Engine* _GC;
-	public:
-
-		GraphList(Bool_Engine* GC);
-
-      GraphList( GraphList* other ); 
-
-		~GraphList();
-
-		void				MakeOneGraph(Graph *total);
-
-		void				Prepare(Graph *total);
-		void 				MakeRings();
-		void 				Correction();
-
-		void				Simplify( double marge);
-		void 				Smoothen( double marge);
-		void 				Merge();
-		void 				Boolean(BOOL_OP operation, int intersectionRunsMax );
-
-      void           WriteGraphs();
-      void           WriteGraphsKEY( Bool_Engine* GC );
-   
-	protected:
-		void				Renumber();
-		void				UnMarkAll();
-
-};
-
-
-#endif
-

polygon/kbool/include/kbool/_dl_itr.h

@@ -0,0 +1,405 @@
+/*! \file kbool/include/kbool/_dl_itr.h
+    \author Probably Klaas Holwerda
+
+    Copyright: 2001-2004 (C) Probably Klaas Holwerda
+
+    Licence: wxWidgets Licence
+
+    RCS-ID: $Id: _dl_itr.h,v 1.3 2008/06/04 21:23:21 titato Exp $
+*/
+
+//! author="Klaas Holwerda"
+/*
+ * Definitions of classes, for list implementation
+ * template list and iterator for any list node type
+*/
+
+#ifndef _DL_Iter_H
+#define _DL_Iter_H
+
+#define _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES 1
+#define _CRT_SECURE_NO_DEPRECATE 1
+
+#include "kbool/booleng.h"
+#include <stdlib.h>
+
+
+#ifndef _STATUS_ENUM
+#define _STATUS_ENUM
+//!<enum Error codes for List and iterator class
+enum  Lerror  {
+    NO_MES,              /*!<No Message will be generated */
+    NO_LIST,             /*!<List is not attached to the iterator*/
+    NO_LIST_OTHER,       /*!<no attached list on other iter*/
+    AC_ITER_LIST_OTHER,  /*!<iter not allowed on other list  */
+    SAME_LIST,           /*!<same list not allowed*/
+    NOT_SAME_LIST,       /*!<must be same list*/
+    ITER_GT_1,           /*!<more then one iteriter at root*/
+    ITER_GT_0,           /*!<iter not allowed*/
+    ITER_HITROOT,        /*!<iter at root*/
+    NO_ITEM,             /*!<no item at current*/
+    NO_NEXT,             /*!<no next after current*/
+    NO_PREV,             /*!<no prev before current */
+    EMPTY,               /*!<list is empty*/
+    NOT_ALLOW,           /*!<not allowed*/
+    ITER_NEG             /*!<to much iters deleted*/
+};
+#endif
+
+#define SWAP(x,y,t)((t)=(x),(x)=(y),(y)=(t))
+#define RT _list->_root
+#define HD _list->_root->_next
+#define TL _list->_root->_prev
+#define NB _list->_nbitems
+
+template <class Dtype> class DL_List;
+template <class Dtype> class DL_Iter;
+template <class Dtype> class DL_SortIter;
+
+//!   Template class DL_Node
+template <class Dtype>  class DL_Node
+{
+    friend class DL_List<Dtype>;
+    friend class DL_Iter<Dtype>;
+    friend class DL_SortIter<Dtype>;
+
+    //!Public members
+public:
+    //!Template constructor no contents
+    //!Construct a node for a list object
+    DL_Node();
+
+    //!constructor with init of Dtype
+    DL_Node( Dtype n );
+
+    //!Destructor
+    ~DL_Node();
+
+    //!Public members
+public:
+    //!data in node
+    Dtype _item;
+
+    //!pointer to next node
+    DL_Node* _next;
+
+    //!pointer to previous node
+    DL_Node* _prev;
+};
+
+//!Template class DL_List
+template <class Dtype> class DL_List
+{
+    friend class DL_Iter<Dtype>;
+    friend class DL_SortIter<Dtype>;
+
+public:
+    //!Constructor
+    //!Construct a list object
+    //!!tcarg class | Dtype | list object
+    DL_List();
+
+    //!destructor
+    ~DL_List();
+
+    //!Report off List Errors
+    void Error( const char* function, Lerror a_error );
+
+    //!Number of items in the list
+    int  count();
+
+    //!Empty List?
+    bool empty();
+
+    //!insert the object given at the end of the list, after tail
+    DL_Node<Dtype>* insend( Dtype n );
+
+    //!insert the object given at the begin of the list, before head
+    DL_Node<Dtype>* insbegin( Dtype n );
+
+    //!remove the object at the begin of the list (head)
+    void removehead();
+
+    //! remove the object at the end of the list (tail)
+    void removetail();
+
+    //!remove all objects from the list
+    void remove_all( bool deleteObject = false );
+
+    //!Get the item at the head of the list
+    Dtype headitem();
+
+    //!Get the item at the tail of the list
+    Dtype tailitem();
+
+    //! to move all objects in a list to this list.
+    void takeover( DL_List<Dtype>* otherlist );
+
+public:
+    //!the root node pointer of the list, the first and last node
+    //! in the list are connected to the root node. The root node is used
+    //! to detect the end / beginning of the list while traversing it.
+    DL_Node<Dtype>*  _root;
+
+    //!the number of items in the list, if empty list it is 0
+    int _nbitems;
+
+    //!number of iterators on the list, Attaching or instantiating an iterator to list,
+    //! will increment this member, detaching and
+    //! destruction of iterator for a list will decrement this number
+    short int _iterlevel;
+};
+
+//!  Template class DL_Iter  for iterator on DL_List
+template <class Dtype>
+class DL_Iter
+{
+public:
+    //!Construct an iterator object for a given list of type Dtype
+    DL_Iter( DL_List<Dtype>* newlist );
+
+    //!Constructor of iterator for the same list as another iterator
+    DL_Iter( DL_Iter* otheriter );
+
+    //!Constructor without an attached list
+    DL_Iter();
+
+    //!destructor
+    ~DL_Iter();
+
+    //!Report off Iterator Errors
+    void    Error( const char* function, Lerror a_error );
+
+    //!This attaches an iterator to a list of a given type.
+    void    Attach( DL_List<Dtype>* newlist );
+
+    //!This detaches an iterator from a list
+    void    Detach();
+
+    //!execute given function for each item in the list/iterator
+    void    foreach_f( void ( *fp ) ( Dtype n ) );
+
+    //! list mutations
+
+    //!insert after tail item
+    DL_Node<Dtype>*  insend( Dtype n );
+
+    //!insert before head item
+    DL_Node<Dtype>* insbegin( Dtype n );
+
+    //!insert before current iterator position
+    DL_Node<Dtype>* insbefore( Dtype n );
+
+    //!insert after current iterator position
+    DL_Node<Dtype>* insafter( Dtype n );
+
+    //!to move all objects in a list to the list of the iterator.
+    void    takeover( DL_List<Dtype>* otherlist );
+
+    //!to move all objects in a list (using iterator of that list) to the list of the iterator
+    void    takeover( DL_Iter* otheriter );
+
+    //! to move maxcount objects in a list (using iterator of that list) to the list of the iterator
+    void    takeover( DL_Iter* otheriter, int maxcount );
+
+    //!remove object at current iterator position from the list.
+    void    remove();
+
+    //!Remove head item
+    void    removehead();
+
+    //!Remove tail item
+    void    removetail();
+
+    //!Remove all items
+    void    remove_all();
+
+
+    /*  void    foreach_mf(void (Dtype::*mfp)() ); //call Dtype::mfp for each item */
+
+    //!is list empty (contains items or not)?
+    bool  empty();
+
+    //!is iterator at root node (begin or end)?
+    bool  hitroot();
+
+    //!is iterator at head/first node?
+    bool  athead();
+
+    //!is iterator at tail/last node?
+    bool  attail();
+
+    //!is given item member of the list
+    bool  has( Dtype otheritem );
+
+    //!Number of items in the list
+    int count();
+
+    /* cursor movements */
+
+    //!go to last item,  if list is empty goto hite
+    void  totail();
+
+    //!go to first item, if list is empty goto hite
+    void  tohead();
+
+    //!set the iterator position to the root (empty dummy) object in the list.
+    void  toroot();
+
+    //! set the iterator position to next object in the list ( can be the root also).
+    void    operator++      ( void );
+
+    //!set iterator to next item (pre fix)
+    void    operator++      ( int );
+
+    //!set the iterator position to previous object in the list ( can be the root also)(postfix).
+    void    operator--      ( void );
+
+    //!set the iterator position to previous object in the list ( can be the root also)(pre fix).
+    void    operator--      ( int );
+
+    //!set the iterator position n objects in the next direction ( can be the root also).
+    void    operator>>      ( int );
+
+    //!set the iterator position n objects in the previous direction ( can be the root also).
+    void    operator<<      ( int );
+
+    //!set the iterator position to next object in the list, if this would be the root object,
+    //!then set the iterator at the head object
+    void next_wrap();
+
+    //!set the iterator position to previous object in the list, if this would be the root object,
+    //!then set the iterator at the tail object
+    void prev_wrap();
+
+    //!move root in order to make the current node the tail
+    void reset_tail();
+
+    //!move root in order to make the current node the head
+    void reset_head();
+
+    //!put the iterator at the position of the given object in the list.
+    bool toitem( Dtype );
+
+    //!put the iterator at the same position as the given iterator in the list.
+    void toiter( DL_Iter* otheriter );
+
+    //!put the iterator at the position of the given node in the list.
+    bool tonode( DL_Node<Dtype>* );
+
+    //!iterate through all items of the list
+    bool iterate( void );
+
+    //!To get the item at the current iterator position
+    Dtype item();
+
+    //! get node at iterator
+    DL_Node<Dtype>* node();
+
+    //!sort list with mergesort
+    void mergesort( int ( *fcmp ) ( Dtype, Dtype ) );
+
+    //!sort list with cocktailsort
+    /*!
+            \return number of swaps done.
+      */
+    int cocktailsort( int ( * )( Dtype, Dtype ), bool ( * )( Dtype, Dtype ) = NULL );
+
+protected:
+
+    //!sort list with mergesort
+    void mergesort_rec( int ( *fcmp )( Dtype, Dtype ), DL_Node<Dtype> *RT1, int n );
+
+    //!sort list with mergesort
+    void mergetwo( int ( *fcmp )( Dtype, Dtype ), DL_Node<Dtype> *RT1, DL_Node<Dtype> *RT2 );
+
+    //!set the iterator position to next object in the list ( can be the root also).
+    void next();
+
+    //!set the iterator position to previous object in the list ( can be the root also).
+    void prev();
+
+    //!the list for this iterator
+    DL_List<Dtype> *_list;
+
+    //!the current position of the iterator
+    DL_Node<Dtype> *_current;
+};
+
+
+//!  template class DL_StackIter class for stack iterator on DL_List
+template <class Dtype>
+class DL_StackIter : protected DL_Iter<Dtype>
+{
+public:
+    //!Constructor of stack iterator for given list
+    DL_StackIter( DL_List<Dtype> * );
+    //!Constructor of stack iterator no list attached
+    DL_StackIter();
+
+    //!Destructor of stack iterator
+    ~DL_StackIter();
+
+    //!Remove all items from the stack
+    void remove_all();
+    //!push given item on the stack
+    void push( Dtype n );
+    //!get last inserted item from stack
+    Dtype pop();
+    //!is stack empty?
+    bool empty();
+    //!number of items on the stack
+    int count();
+};
+
+//!template class DL_SortIter
+template <class DType> class DL_SortIter : public DL_Iter<DType>
+{
+public:
+    //!Constructor of sort iterator for given list and sort function
+    DL_SortIter( DL_List<DType>* nw_list, int ( *new_func )( DType , DType ) );
+
+    //!Constructor of sort iterator with sort function and no list attached
+    DL_SortIter( int ( *newfunc )( DType, DType ) );
+
+    //!Destructor of sort iterator
+    ~DL_SortIter();
+
+    //!insert item in sorted order
+    void insert ( DType new_item );
+
+    /*override following functions to give an error */
+    //!Not allowed
+    void   insend ( bool n ){sortitererror();};
+    //!Not allowed
+    void   insbegin ( bool n ){sortitererror();};
+    //!Not allowed
+    void   insbefore ( bool n ){sortitererror();};
+    //!Not allowed
+    void   insafter ( bool n ){sortitererror();};
+    //!Not allowed
+    void   takeover ( DL_List<DType>* ){sortitererror();};
+    //!Not allowed
+    void   takeover ( DL_Iter<DType>* ){sortitererror();};
+    //!Not allowed
+    void   takeover ( DL_Iter<DType>* otheriter, int maxcount ){sortitererror();};
+    //!Not allowed
+    void   next_wrap() {sortitererror();};
+    //!Not allowed
+    void   prev_wrap() {sortitererror();};
+    //!Not allowed
+    void   reset_tail() {sortitererror();};
+    //!Not allowed
+    void   reset_head() {sortitererror();};
+
+private:
+    //!Report off Iterator Errors
+    void sortitererror();
+
+    //!comparefunction used to insert items in sorted order
+    int  ( *comparef )( DType, DType );
+};
+
+#include "kbool/_dl_itr.cpp"
+
+#endif

polygon/kbool/include/kbool/_lnk_itr.cpp

@@ -0,0 +1,257 @@
+/*! \file kbool/_lnk_itr.cpp
+    \author Probably Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Probably Klaas Holwerda
+ 
+    Licence: wxWidgets Licence
+ 
+    RCS-ID: $Id: _lnk_itr.cpp,v 1.3 2006/12/13 21:43:33 titato Exp $
+*/
+
+#ifdef __UNIX__
+#include "kbool/_lnk_itr.h"
+#endif
+
+//=======================================================================
+// implementation class LinkBaseIter
+//=======================================================================
+
+template<class Type>
+TDLI<Type>::TDLI( DL_List<void*>* newlist ): DL_Iter<void*>( newlist )
+{}
+
+template<class Type>
+TDLI<Type>::TDLI( DL_Iter<void*>* otheriter ): DL_Iter<void*>( otheriter )
+{}
+
+template<class Type>
+TDLI<Type>::TDLI(): DL_Iter<void*>()
+{}
+
+// destructor TDLI
+template<class Type>
+TDLI<Type>::~TDLI()
+{}
+
+template<class Type>
+void TDLI<Type>::delete_all()
+{
+    DL_Node<void*>* node;
+    Type* obj;
+    for ( int i = 0; i < NB; i++ )
+    {
+        node = HD;
+        HD = node->_next;
+        obj = ( Type* )( node->_item );
+        delete obj;
+        delete node;
+    }
+    NB = 0; //reset memory used (no lost pointers)
+    TL = RT;
+    _current = RT;
+}
+
+template<class Type>
+void TDLI<Type>::foreach_f( void ( *fp ) ( Type* item ) )
+{
+    DL_Iter<void*>::foreach_f( ( void ( * )( void* ) )fp ); //call fp for each item
+}
+
+template<class Type>
+void TDLI<Type>::foreach_mf( void ( Type::*mfp ) () )
+{
+
+    DL_Node<void*>* node = HD; //can be 0 if empty
+    Type* obj;
+    for( int i = 0; i < NB; i++ )
+    {
+        obj = ( Type* )( node->_item );
+        ( obj->*mfp )();
+        node = node->_next;
+    }
+}
+
+template<class Type>
+void TDLI<Type>::takeover( DL_List<void*>* otherlist )
+{
+    DL_Iter<void*>::takeover( ( DL_List<void*>* ) otherlist );
+}
+
+template<class Type>
+void TDLI<Type>::takeover( TDLI* otheriter )
+{
+    DL_Iter<void*>::takeover( ( DL_Iter<void*>* ) otheriter );
+}
+
+template<class Type>
+void TDLI<Type>::takeover( TDLI* otheriter, int maxcount )
+{
+    DL_Iter<void*>::takeover( ( DL_Iter<void*>* ) otheriter, maxcount );
+}
+
+// is item element of the list?
+template<class Type>
+bool TDLI<Type>::has( Type* otheritem )
+{
+    return DL_Iter<void*>::has( ( void* ) otheritem );
+}
+
+// goto to item
+template<class Type>
+bool TDLI<Type>::toitem( Type* item )
+{
+    return DL_Iter<void*>::toitem( ( void* ) item );
+}
+
+// get current item
+template<class Type>
+Type*    TDLI<Type>::item()
+{
+    return ( Type* ) DL_Iter<void*>::item();
+}
+
+template<class Type>
+void TDLI<Type>::insend( Type* newitem )
+{
+    DL_Iter<void*>::insend( ( void* ) newitem );
+}
+
+template<class Type>
+void TDLI<Type>::insbegin( Type* newitem )
+{
+    DL_Iter<void*>::insbegin( ( void* ) newitem );
+}
+
+template<class Type>
+void TDLI<Type>::insbefore( Type* newitem )
+{
+    DL_Iter<void*>::insbefore( ( void* ) newitem );
+}
+
+template<class Type>
+void TDLI<Type>::insafter( Type* newitem )
+{
+    DL_Iter<void*>::insafter( ( void* ) newitem );
+}
+
+template<class Type>
+void TDLI<Type>::insend_unsave( Type* newitem )
+{
+    short int iterbackup = _list->_iterlevel;
+    _list->_iterlevel = 0;
+    DL_Iter<void*>::insend( ( void* ) newitem );
+    _list->_iterlevel = iterbackup;
+}
+
+template<class Type>
+void TDLI<Type>::insbegin_unsave( Type* newitem )
+{
+    short int iterbackup = _list->_iterlevel;
+    _list->_iterlevel = 0;
+    DL_Iter<void*>::insbegin( ( void* ) newitem );
+    _list->_iterlevel = iterbackup;
+}
+
+template<class Type>
+void TDLI<Type>::insbefore_unsave( Type* newitem )
+{
+    short int iterbackup = _list->_iterlevel;
+    _list->_iterlevel = 0;
+    DL_Iter<void*>::insbefore( ( void* ) newitem );
+    _list->_iterlevel = iterbackup;
+}
+
+template<class Type>
+void TDLI<Type>::insafter_unsave( Type* newitem )
+{
+    short int iterbackup = _list->_iterlevel;
+    _list->_iterlevel = 0;
+    DL_Iter<void*>::insafter( ( void* ) newitem );
+    _list->_iterlevel = iterbackup;
+}
+
+template<class Type>
+void TDLI<Type>::mergesort( int ( *f )( Type* a, Type* b ) )
+{
+    DL_Iter<void*>::mergesort( ( int ( * )( void*, void* ) ) f );
+}
+
+template<class Type>
+int TDLI<Type>::cocktailsort( int ( *f )( Type* a, Type* b ), bool ( *f2 )( Type* c, Type* d ) )
+{
+    return DL_Iter<void*>::cocktailsort( ( int ( * )( void*, void* ) ) f, ( bool( * )( void*, void* ) ) f2 );
+}
+
+template<class Type>
+TDLISort<Type>::TDLISort( DL_List<void*>* lista, int ( *newfunc )( void*, void* ) )
+        : DL_SortIter<void*>( lista, newfunc )
+{}
+
+template<class Type>
+TDLISort<Type>::~TDLISort()
+{}
+
+template<class Type>
+void TDLISort<Type>::delete_all()
+{
+    DL_Node<void*>* node;
+    Type* obj;
+    for ( int i = 0; i < NB; i++ )
+    {
+        node = HD;
+        HD = node->_next;
+        obj = ( Type* )( node->_item );
+        delete obj;
+        delete node;
+    }
+    NB = 0; //reset memory used (no lost pointers)
+    TL = RT;
+    _current = RT;
+}
+
+// is item element of the list?
+template<class Type>
+bool TDLISort<Type>::has( Type* otheritem )
+{
+    return DL_Iter<void*>::has( ( void* ) otheritem );
+}
+
+// goto to item
+template<class Type>
+bool TDLISort<Type>::toitem( Type* item )
+{
+    return DL_Iter<void*>::toitem( ( void* ) item );
+}
+
+// get current item
+template<class Type>
+Type*    TDLISort<Type>::item()
+{
+    return ( Type* ) DL_Iter<void*>::item();
+}
+
+template<class Type>
+TDLIStack<Type>::TDLIStack( DL_List<void*>* newlist ): DL_StackIter<void*>( newlist )
+{}
+
+// destructor TDLI
+template<class Type>
+TDLIStack<Type>::~TDLIStack()
+{}
+
+// plaats nieuw item op stack
+template<class Type>
+void TDLIStack<Type>::push( Type* newitem )
+{
+    DL_StackIter<void*>::push( ( Type* ) newitem );
+}
+
+
+// haal bovenste item van stack
+template<class Type>
+Type* TDLIStack<Type>::pop()
+{
+    return ( Type* ) DL_StackIter<void*>::pop();
+}
+
+

polygon/kbool/include/kbool/_lnk_itr.h

@@ -0,0 +1,159 @@
+/*! \file kbool/include/kbool/_lnk_itr.h
+    \author Probably Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Probably Klaas Holwerda
+ 
+    Licence: wxWidgets Licence
+ 
+    RCS-ID: $Id: _lnk_itr.h,v 1.2 2006/12/15 21:00:05 titato Exp $
+*/
+
+//! author="Klaas Holwerda"
+//! version="1.0"
+/*
+ * Definitions of classes, for list implementation
+ * template list and iterator for any list node type
+*/
+#ifndef _LinkBaseIter_H
+#define _LinkBaseIter_H
+
+//! headerfiles="_dl_itr.h stdlib.h misc.h gdsmes.h"
+#include <stdlib.h>
+#include "kbool/booleng.h"
+
+#define SWAP(x,y,t)((t)=(x),(x)=(y),(y)=(t))
+
+#include "kbool/_dl_itr.h"
+
+//! codefiles="_dl_itr.cpp"
+
+//!  Template class TDLI
+/*!
+ class for iterator on DL_List<void*> that is type casted version of DL_Iter
+ \sa DL_Iter for further documentation
+*/
+template<class Type> class TDLI : public DL_Iter<void*>
+{
+public:
+    //!constructor
+    /*!
+    \param list to iterate on.
+    */
+    TDLI( DL_List<void*>* list );
+
+    //!constructor
+    TDLI( DL_Iter<void*>* otheriter );
+
+    //! nolist constructor
+    TDLI();
+
+    //! destructor
+    ~TDLI();
+
+    //!call fp for each item
+    void    foreach_f( void ( *fp ) ( Type* item ) );
+
+    //!call fp for each item
+    void    foreach_mf( void ( Type::*fp ) () );
+
+    /* list mutations */
+
+
+    //! delete all items
+    void    delete_all  ();
+
+
+    //! insert at end
+    void    insend        ( Type* n );
+
+    //! insert at begin
+    void    insbegin     ( Type* n );
+
+    //! insert before current
+    void    insbefore       ( Type* n );
+
+    //! insert after current
+    void    insafter        ( Type* n );
+
+    //! insert at end unsave (works even if more then one iterator is on the list
+    //! the user must be sure not to delete/remove items where other iterators
+    //! are pointing to.
+    void    insend_unsave  ( Type* n );
+
+    //! insert at begin unsave (works even if more then one iterator is on the list
+    //! the user must be sure not to delete/remove items where other iterators
+    //! are pointing to.
+    void    insbegin_unsave  ( Type* n );
+
+    //! insert before iterator position unsave (works even if more then one iterator is on the list
+    //! the user must be sure not to delete/remove items where other iterators
+    //! are pointing to.
+    void    insbefore_unsave ( Type* n );
+
+    //! insert after iterator position unsave (works even if more then one iterator is on the list
+    //! the user must be sure not to delete/remove items where other iterators
+    //! are pointing to.
+    void    insafter_unsave  ( Type* n );
+
+    //! \sa DL_Iter::takeover(DL_List< Dtype >* otherlist )
+    void    takeover        ( DL_List<void*>* otherlist );
+    //! \sa DL_Iter::takeover(DL_Iter* otheriter)
+    void    takeover        ( TDLI* otheriter );
+    //! \sa DL_Iter::takeover(DL_Iter* otheriter, int maxcount)
+    void    takeover        ( TDLI* otheriter, int maxcount );
+
+    //! \sa DL_Iter::has
+    bool  has             ( Type* );
+    //! \sa DL_Iter::toitem
+    bool  toitem          ( Type* );
+
+    //!get the item then iterator is pointing at
+    Type*   item            ();
+
+    //! \sa DL_Iter::mergesort
+    void    mergesort             ( int ( *f )( Type* a, Type* b ) );
+    //! \sa DL_Iter::cocktailsort
+    int  cocktailsort( int ( * ) ( Type* a, Type* b ), bool ( * ) ( Type* c, Type* d ) = NULL );
+
+};
+
+//!  Template class TDLIsort
+/*!
+// class for sort iterator on DL_List<void*> that is type casted version of DL_SortIter
+// see also inhereted class DL_SortIter for further documentation
+*/
+template<class Type> class TDLISort : public DL_SortIter<void*>
+{
+public:
+
+    //!constructor givin a list and a sort function
+    TDLISort( DL_List<void*>* list, int ( *newfunc )( void*, void* ) );
+    ~TDLISort();
+
+    //!delete all items from the list
+    void       delete_all();
+    bool       has     ( Type* );
+    bool       toitem  ( Type* );
+    Type* item    ();
+};
+
+//!  Template class TDLIStack
+/*!
+ class for iterator on DL_List<void*> that is type casted version of DL_StackIter
+ see also inhereted class DL_StackIter for further documentation
+*/
+template<class Type> class TDLIStack : public DL_StackIter<void*>
+{
+public:
+    //constructor givin a list
+    TDLIStack( DL_List<void*>* list );
+
+    ~TDLIStack();
+
+    void            push( Type* );
+    Type*           pop();
+};
+
+#include"kbool/_lnk_itr.cpp"
+
+#endif

polygon/kbool/include/kbool/booleng.h

@@ -0,0 +1,583 @@
+/*! \file include/booleng.h
+    \author Klaas Holwerda
+
+    Copyright: 2001-2004 (C) Klaas Holwerda
+
+    Licence: see kboollicense.txt
+
+    RCS-ID: $Id: booleng.h,v 1.4 2008/09/05 19:01:14 titato Exp $
+*/
+
+#ifndef BOOLENG_H
+#define BOOLENG_H
+
+#undef _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES
+#define _CRT_SECURE_CPP_OVERLOAD_STANDARD_NAMES 1
+#define _CRT_SECURE_NO_DEPRECATE 1
+
+#include <stdio.h>
+#include <limits.h>
+#include <assert.h>
+#include <math.h>
+
+
+#if 0       // Kicad does not use kbool in dll version
+#if defined(__WXMSW__)
+    /*
+       __declspec works in BC++ 5 and later, Watcom C++ 11.0 and later as well
+       as VC++ and gcc
+     */
+#    if defined(__VISUALC__) || defined(__BORLANDC__) || defined(__GNUC__) || defined(__WATCOMC__)
+#        define WXEXPORT __declspec(dllexport)
+#        define WXIMPORT __declspec(dllimport)
+#    else /* compiler doesn't support __declspec() */
+#        define WXEXPORT
+#        define WXIMPORT
+#    endif
+#elif defined(__WXPM__)
+#    if defined (__WATCOMC__)
+#        define WXEXPORT __declspec(dllexport)
+        /*
+           __declspec(dllimport) prepends __imp to imported symbols. We do NOT
+           want that!
+         */
+#        define WXIMPORT
+#    elif defined(__EMX__)
+#        define WXEXPORT
+#        define WXIMPORT
+#    elif (!(defined(__VISAGECPP__) && (__IBMCPP__ < 400 || __IBMC__ < 400 )))
+#        define WXEXPORT _Export
+#        define WXIMPORT _Export
+#    endif
+#elif defined(__WXMAC__) || defined(__WXCOCOA__)
+#    ifdef __MWERKS__
+#        define WXEXPORT __declspec(export)
+#        define WXIMPORT __declspec(import)
+#    endif
+#elif defined(__CYGWIN__)
+#    define WXEXPORT __declspec(dllexport)
+#    define WXIMPORT __declspec(dllimport)
+#endif
+#endif      // if 0 for kicad
+
+/* for other platforms/compilers we don't anything */
+#ifndef WXEXPORT
+#    define WXEXPORT
+#    define WXIMPORT
+#endif
+
+#ifdef A2DKBOOLMAKINGDLL
+#define A2DKBOOLDLLEXP WXEXPORT
+#define A2DKBOOLDLLEXP_DATA(type) WXEXPORT type
+#define A2DKBOOLDLLEXP_CTORFN
+#elif defined(WXART2D_USINGDLL)
+#define A2DKBOOLDLLEXP WXIMPORT
+#define A2DKBOOLDLLEXP_DATA(type) WXIMPORT type
+#define A2DKBOOLDLLEXP_CTORFN
+#else // not making nor using DLL
+#define A2DKBOOLDLLEXP
+#define A2DKBOOLDLLEXP_DATA(type) type
+#define A2DKBOOLDLLEXP_CTORFN
+#endif
+
+#define KBOOL_VERSION "1.9"
+
+#define KBOOL_DEBUG 0
+#define KBOOL_LOG 0
+#define KBOOL_INT64 1
+
+class KBoolLink;
+
+#define LINELENGTH 200
+
+#ifdef  MAXDOUBLE
+#undef  MAXDOUBLE
+#endif
+#define MAXDOUBLE 1.7976931348623158e+308
+
+#ifdef KBOOL_INT64
+
+#if defined(__UNIX__) || defined(__GNUG__)
+
+typedef long long B_INT;     // 8 bytes integer
+//#define MAXB_INT LONG_LONG_MAX
+//#define MINB_INT LONG_LONG_MIN // 8 bytes integer
+const B_INT MAXB_INT = ( 0x7fffffffffffffffLL );             // 8 bytes integer
+const B_INT MINB_INT = ( 0x8000000000000000LL );
+
+#else //defined(__UNIX__) || defined(__GNUG__)
+
+typedef __int64 B_INT;     // 8 bytes integer
+#undef MAXB_INT
+#undef MINB_INT
+
+const B_INT MAXB_INT = ( 0x7fffffffffffffff );             // 8 bytes integer
+const B_INT MINB_INT = ( 0x8000000000000000 );
+
+#endif //defined(__UNIX__) || defined(__GNUG__)
+
+#else //KBOOL_INT64
+
+#if defined(__UNIX__) || defined(__GNUG__)
+typedef long B_INT;     // 8 bytes integer
+const B_INT MAXB_INT = ( 0x7fffffffL );             // 8 bytes integer
+const B_INT MINB_INT = ( 0x80000000L );
+#else
+typedef long B_INT;     // 8 bytes integer
+const B_INT MAXB_INT = ( 0x7fffffff );             // 8 bytes integer
+const B_INT MINB_INT = ( 0x80000000 );
+#endif
+
+#endif //KBOOL_INT64
+
+B_INT babs( B_INT );
+
+#ifdef  M_PI
+#undef  M_PI
+#endif
+#define M_PI  (3.1415926535897932384626433832795028841972)
+
+#ifdef  M_PI_2
+#undef  M_PI_2
+#endif
+#define M_PI_2      1.57079632679489661923
+
+#ifdef  M_PI_4
+#undef  M_PI_4
+#endif
+#define M_PI_4      0.785398163397448309616
+
+#ifndef NULL
+#define NULL 0
+#endif
+
+B_INT bmin( B_INT const value1, B_INT const value2 );
+B_INT bmax( B_INT const value1, B_INT const value2 );
+
+B_INT bmin( B_INT value1, B_INT value2 );
+B_INT bmax( B_INT value1, B_INT value2 );
+
+#include <string.h>
+
+//! errors in the boolean algorithm will be thrown using this class
+class A2DKBOOLDLLEXP Bool_Engine_Error
+{
+public:
+    Bool_Engine_Error( const char* message, const char* header = 0, int degree = 9, int fatal = 0 );
+    Bool_Engine_Error( const Bool_Engine_Error& a );
+    ~Bool_Engine_Error();
+    char* GetErrorMessage();
+    char* GetHeaderMessage();
+    int GetErrorDegree();
+    int GetFatal();
+
+protected:
+    char* _message;
+    char* _header;
+    int  _degree;
+    int  _fatal;
+};
+
+
+#define KBOOL_LOGFILE "kbool.log"
+
+enum kbEdgeType
+{
+    KB_OUTSIDE_EDGE, /*!< edge of the outside contour of a polygon */
+    KB_INSIDE_EDGE,  /*!< edge of the inside hole a polygon */
+    KB_FALSE_EDGE    /*!< edge to connect holes into polygons */
+} ;
+
+enum GroupType
+{
+    GROUP_A, /*!< to set Group A for polygons */
+    GROUP_B  /*!< to set Group A for polygons */
+};
+
+enum BOOL_OP
+{
+    BOOL_NON, /*!< No operation */
+    BOOL_OR, /*!< boolean OR operation */
+    BOOL_AND, /*!< boolean AND operation */
+    BOOL_EXOR, /*!< boolean EX_OR operation */
+    BOOL_A_SUB_B, /*!< boolean Group A - Group B operation */
+    BOOL_B_SUB_A, /*!< boolean Group B - Group A operation */
+    BOOL_CORRECTION, /*!< polygon correction/offset operation */
+    BOOL_SMOOTHEN, /*!< smooth operation */
+    BOOL_MAKERING /*!< create a ring on all polygons */
+};
+
+class GraphList;
+class Graph;
+class KBoolLink;
+class Node;
+template<class Type> class TDLI;
+
+//! boolean engine to perform operation on two sets of polygons.
+/*
+ First the engine needs to be filled with polygons.
+ The first operand in the operation is called group A polygons, the second group B.
+ The boolean operation ( BOOL_OR, BOOL_AND, BOOL_EXOR, BOOL_A_SUB_B, BOOL_B_SUB_A )
+ are based on the two sets of polygons in group A and B.
+ The other operation on group A only.
+
+    At the end of the operation the resulting polygons can be extracted.
+*/
+class A2DKBOOLDLLEXP Bool_Engine
+{
+
+public:
+
+    //! constructor
+    Bool_Engine();
+
+    //! destructor
+    virtual ~Bool_Engine();
+
+    const char* GetVersion() { return KBOOL_VERSION; }
+
+    //! reports progress of algorithm.
+    virtual void SetState( const char* = 0 );
+
+    //! called at an internal error.
+    virtual void error( const char *text, const char *title );
+
+    //! called at an internal generated possible error.
+    virtual void info( const char *text, const char *title );
+
+    bool Do_Operation( BOOL_OP operation );
+
+
+    //! distance within which points and lines will be snapped towards lines and other points
+    /*
+          The algorithm takes into account gaps and inaccuracies caused by rounding to integer coordinates
+          in the original data.
+          Imagine two rectangles one with a side ( 0,0 ) ( 2.0, 17.0 )
+          and the other has a side ( 0,0 ) ( 1.0, 8.5 )
+          If for some reason those coordinates where round to ( 0,0 ) ( 2, 17 ) ( 0,0 ) ( 1, 9 ),
+          there will be clearly a gap or overlap that was not intended.
+          Even without rounding this effect takes place since there is always a minimum significant bit
+          also when using doubles.
+
+          If the user used as minimum accuracy 0.001, you need to choose Marge > 0.001
+          The boolean engine scales up the input data with GetDGrid() * GetGrid() and rounds the result to
+          integer, So (assuming GRID = 100 DGRID = 1000)  a vertex of 123.001 in the user data will
+          become 12300100 internal.
+          At the end of the algorithm the internal vertexes are scaled down again with GetDGrid() * GetGrid(),
+          so 12300103 becomes 123.00103 eventually.
+          So indeed the minimum accuracy might increase, you are free to round again if needed.
+    */
+    void SetMarge( double marge );
+    double GetMarge();
+
+    //! input points are scaled up with GetDGrid() * GetGrid()
+    /*
+    Grid makes sure that the integer data used within the algorithm has room for extra intersections
+    smaller than the smallest number within the input data.
+    The input data scaled up with DGrid is related to the accuracy the user has in his input data.
+         Another scaling with Grid is applied on top of it to create space in the integer number for
+    even smaller numbers.
+    */
+    void SetGrid( B_INT grid );
+
+    //! See SetGrid
+    B_INT GetGrid();
+
+    //! input points are scaled up with GetDGrid() * GetGrid()
+    /*
+       The input data scaled up with DGrid is related to the accuracy the user has in his input data.
+       User data with a minimum accuracy of 0.001, means set the DGrid to 1000.
+       The input data may contain data with a minimum accuracy much smaller, but by setting the DGrid
+       everything smaller than 1/DGrid is rounded.
+
+       DGRID is only meant to make fractional parts of input data which can be
+       doubles, part of the integers used in vertexes within the boolean algorithm.
+       And therefore DGRID bigger than 1 is not usefull, you would only loose accuracy.
+       Within the algorithm all input data is multiplied with DGRID, and the result
+       is rounded to an integer.
+    */
+    void SetDGrid( double dgrid );
+
+    //! See SetDGrid
+    double GetDGrid();
+
+    //! When doing a correction operation ( also known as process offset )
+    //! this defines the detail in the rounded corners.
+    /*
+     Depending on the round factor the corners of the polygon may be rounding within the correction
+     algorithm. The detail within this rounded corner is set here.
+     It defines the deviation the generated segments in arc like polygon may have towards the ideal
+     rounded corner using a perfect arc.
+       */
+    void SetCorrectionAber( double aber );
+
+    //! see SetCorrectionAber
+    double GetCorrectionAber();
+
+    //! When doing a correction operation ( also known as process offset )
+    //! this defines the amount of correction.
+    /*
+       The correction algorithm can apply positive and negative offset to polygons.
+       It takes into account closed in areas within a polygon, caused by overlapping/selfintersecting
+       polygons. So holes form that way are corrected proberly, but the overlapping parts itself
+       are left alone. An often used trick to present polygons with holes by linking to the outside
+       boundary, is therefore also handled properly.
+       The algoritm first does a boolean OR operation on the polygon, and seperates holes and
+       outside contours.
+       After this it creates a ring shapes on the above holes and outside contours.
+       This ring shape is added or subtracted from the holes and outside contours.
+       The result is the corrected polygon.
+       If the correction factor is > 0, the outside contours will become larger, while the hole contours
+       will become smaller.
+    */
+    void SetCorrectionFactor( double aber );
+
+    //! see SetCorrectionFactor
+    double GetCorrectionFactor();
+
+    //! used within the smooth algorithm to define how much the smoothed curve may deviate
+    //! from the original.
+    void SetSmoothAber( double aber );
+
+    //! see SetSmoothAber
+    double GetSmoothAber();
+
+    //! segments of this size will be left alone in the smooth algorithm.
+    void SetMaxlinemerge( double maxline );
+
+    //! see SetMaxlinemerge
+    double GetMaxlinemerge();
+
+    //! Polygon may be filled in different ways (alternate and winding rule).
+    //! This here defines which method will be assumed within the algorithm.
+    void SetWindingRule( bool rule );
+
+    //! see SetWindingRule
+    bool GetWindingRule();
+
+    //! the smallest accuracy used within the algorithm for comparing two real numbers.
+    double GetAccur();
+
+    //! Used with in correction/offset algorithm.
+    /*
+     When the polygon contains sharp angles ( < 90 ), after a positive correction the
+     extended parrallel constructed offset lines may leed to extreme offsets on the angles.
+     The length of the crossing generated by the parrallel constructed offset lines
+     towards the original point in the polygon is compared to the offset which needs to be applied.
+     The Roundfactor then decides if this corner will be rounded.
+     A Roundfactor of 1 means that the resulting offset will not be bigger then the correction factor
+     set in the algorithm. Meaning even straight 90 degrees corners will be rounded.
+     A Roundfactor of > sqrt(2) is where 90 corners will be left alone, and smaller corners will be rounded.
+    */
+    void SetRoundfactor( double roundfac );
+
+    //! see SetRoundfactor
+    double GetRoundfactor();
+
+// the following are only be used within the algorithm,
+// since they are scaled with m_DGRID
+
+    //! only used internal.
+    void SetInternalMarge( B_INT marge );
+    //! only used internal.
+    B_INT GetInternalMarge();
+
+    //! only used internal.
+    double GetInternalCorrectionAber();
+
+    //! only used internal.
+    double GetInternalCorrectionFactor();
+
+    //! only used internal.
+    double GetInternalSmoothAber();
+
+    //! only used internal.
+    B_INT GetInternalMaxlinemerge();
+
+    //! in this mode polygons add clockwise, or contours,
+    /*!
+        and polygons added counter clockwise or holes.
+    */
+    void SetOrientationEntryMode( bool orientationEntryMode ) { m_orientationEntryMode = orientationEntryMode; }
+
+    //! see SetOrientationEntryMode()
+    bool GetOrientationEntryMode() { return m_orientationEntryMode; }
+
+    //! if set true holes are linked into outer contours by double overlapping segments.
+    /*!
+        This mode is needed when the software using the boolean algorithm does
+        not understand hole polygons. In that case a contour and its holes form one
+        polygon. In cases where software understands the concept of holes, contours
+        are clockwise oriented, while holes are anticlockwise oriented.
+        The output of the boolean operations, is following those rules also.
+        But even if extracting the polygons from the engine, each segment is marked such
+        that holes and non holes and linksegments to holes can be recognized.
+    */
+    void SetLinkHoles( bool doLinkHoles ) { m_doLinkHoles = doLinkHoles; }
+
+    //! see SetLinkHoles()
+    bool GetLinkHoles() { return m_doLinkHoles; }
+
+    //!lof file will be created when set True
+    void SetLog( bool OnOff );
+
+    //! used to write to log file
+    void Write_Log( const char * );
+    //! used to write to log file
+    void Write_Log( const char *, const char * );
+    //! used to write to log file
+    void Write_Log( const char *, double );
+    //! used to write to log file
+    void Write_Log( const char *, B_INT );
+
+    FILE* GetLogFile() { return m_logfile; }
+
+    // methods used to add polygons to the eng using points
+
+    //! Start adding a polygon to the engine
+    /*
+       The boolean operation work on two groups of polygons ( group A or B ),
+       other algorithms are only using group A.
+
+       You add polygons like this to the engine.
+
+       // foreach point in a polygon ...
+       if (booleng->StartPolygonAdd(GROUP_A))
+       {
+        booleng->AddPoint(100,100);
+        booleng->AddPoint(-100,100);
+        booleng->AddPoint(-100,-100);
+        booleng->AddPoint(100,-100);
+       }
+       booleng->EndPolygonAdd();
+
+       \param A_or_B defines if the new polygon will be of group A or B
+
+       Holes or added by adding an inside polygons with opposite orientation compared
+       to another polygon added.
+       So the contour polygon ClockWise, then add counterclockwise polygons for holes, and visa versa.
+       BUT only if m_orientationEntryMode is set true, else all polygons are redirected, and become
+       individual areas without holes.
+       Holes in such a case must be linked into the contour using two extra segments.
+    */
+    bool StartPolygonAdd( GroupType A_or_B );
+
+    //! see StartPolygonAdd
+    bool AddPoint( double x, double y );
+
+    //! see StartPolygonAdd
+    bool EndPolygonAdd();
+
+    // methods used to extract polygons from the eng by getting its points
+
+    //! Use after StartPolygonGet()
+    int GetNumPointsInPolygon() { return m_numPtsInPolygon ; }
+
+    //! get resulting polygons at end of an operation
+    /*!
+     // foreach resultant polygon in the booleng ...
+     while ( booleng->StartPolygonGet() )
+     {
+      // foreach point in the polygon
+      while ( booleng->PolygonHasMorePoints() )
+      {
+       fprintf(stdout,"x = %f\t", booleng->GetPolygonXPoint());
+       fprintf(stdout,"y = %f\n", booleng->GetPolygonYPoint());
+      }
+      booleng->EndPolygonGet();
+     }
+      */
+    bool StartPolygonGet();
+
+    //! see StartPolygonGet
+    /*!
+       This iterates through the first graph in the graphlist.
+       Setting the current Node properly by following the links in the graph
+       through its nodes.
+    */
+    bool PolygonHasMorePoints();
+
+    //! see StartPolygonGet
+    double GetPolygonXPoint();
+
+    //! see StartPolygonGet
+    double GetPolygonYPoint();
+
+    //! in the resulting polygons this tells if the current polygon segment is one
+    //! used to link holes into the outer contour of the surrounding polygon
+    bool GetHoleConnectionSegment();
+
+    //! in the resulting polygons this tells if the current polygon segment is part
+    //! of a hole within a polygon.
+    bool GetHoleSegment();
+
+    //! an other way to get the type of segment.
+    kbEdgeType GetPolygonPointEdgeType();
+
+    //! see StartPolygonGet()
+    /*!
+       Removes a graph from the graphlist.
+       Called after an extraction of an output polygon was done.
+    */
+    void EndPolygonGet();
+
+private:
+
+    bool m_doLog;
+
+    //! contains polygons in graph form
+    GraphList* m_graphlist;
+
+    double m_MARGE;
+    B_INT  m_GRID;
+    double m_DGRID;
+    double m_CORRECTIONABER;
+    double m_CORRECTIONFACTOR;
+    double m_SMOOTHABER;
+    double m_MAXLINEMERGE;
+    bool   m_WINDINGRULE;
+    double m_ACCUR;
+    double m_ROUNDFACTOR;
+
+    bool m_orientationEntryMode;
+
+    bool m_doLinkHoles;
+
+    //! used in the StartPolygonAdd, AddPt, EndPolygonAdd sequence
+    Graph*    m_GraphToAdd;
+    //! used in the StartPolygonAdd, AddPt, EndPolygonAdd sequence
+    Node*     m_lastNodeToAdd;
+    //! used in the StartPolygonAdd, AddPt, EndPolygonAdd sequence
+    Node*     m_firstNodeToAdd;
+
+    //! the current group type ( group A or B )
+    GroupType m_groupType;
+
+    //! used in extracting the points from the resultant polygons
+    Graph* m_getGraph;
+    //! used in extracting the points from the resultant polygons
+    KBoolLink* m_getLink;
+    //! used in extracting the points from the resultant polygons
+    Node* m_getNode;
+    //! used in extracting the points from the resultant polygons
+    double m_PolygonXPoint;
+    //! used in extracting the points from the resultant polygons
+    double m_PolygonYPoint;
+    //! used in extracting the points from the resultant polygons
+    int m_numPtsInPolygon;
+    //! used in extracting the points from the resultant polygons
+    int m_numNodesVisited;
+
+    FILE* m_logfile;
+
+public:
+
+    //! use in Node to iterate links.
+    TDLI<KBoolLink>*  _linkiter;
+
+    //! how many time run intersections fase.
+    unsigned int m_intersectionruns;
+
+};
+
+#endif

polygon/kbool/include/kbool/graph.h

@@ -0,0 +1,207 @@
+/*! \file include/graph.h
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: graph.h,v 1.3 2008/06/04 21:23:21 titato Exp $
+*/
+
+/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/thirdparty/kbool/include/kbool/graph.h,v $ $Revision: 1.3 $ $Date: 2008/06/04 21:23:21 $ */
+
+/*
+Program GRAPH.H
+Purpose Used to Intercect and other process functions
+Last Update 03-04-1996
+*/
+
+#ifndef GRAPH_H
+#define GRAPH_H
+
+#include "kbool/booleng.h"
+#include "kbool/_lnk_itr.h"
+#include "kbool/link.h"
+#include "kbool/line.h"
+#include "kbool/scanbeam.h"
+
+class Node;
+
+class GraphList;
+
+//! one graph containing links that cab be connected.
+class A2DKBOOLDLLEXP Graph
+{
+protected:
+    Bool_Engine* _GC;
+public:
+
+    Graph( Bool_Engine* GC );
+    Graph( KBoolLink*, Bool_Engine* GC );
+
+    Graph( Graph* other );
+
+    ~Graph();
+
+    bool   GetBin()        { return _bin; };
+    void   SetBin( bool b )      { _bin = b; };
+
+    void    Prepare( int intersectionruns );
+    void      RoundInt( B_INT grid );
+    void    Rotate( bool plus90 );
+
+    //! adds a link to the linklist
+    void   AddLink( Node *begin, Node *end );
+
+    //! adds a link to the linklist
+    void   AddLink( KBoolLink *a_link );
+
+    bool   AreZeroLines( B_INT Marge );
+
+    //! Delete parallel lines
+    void   DeleteDoubles();
+
+    //! delete zerolines
+    bool   DeleteZeroLines( B_INT Marge );
+    bool    RemoveNullLinks();
+
+    //! Process found intersections
+    void   ProcessCrossings();
+    //! set flags for operations based on group
+    void      Set_Operation_Flags();
+
+    //! Left Right values
+    void   Remove_IN_Links();
+
+    //! reset bin and mark flags in links.
+    void ResetBinMark();
+
+    // Remove unused links
+    void   ReverseAllLinks();
+
+    //! Simplify the graph
+    bool   Simplify( B_INT Marge );
+
+
+    //! Takes over all links of the argument
+    bool    Smoothen( B_INT Marge );
+
+    void   TakeOver( Graph* );
+
+    //! function for maximum performance
+
+    //! Get the First link from the graph
+    KBoolLink* GetFirstLink();
+    Node*   GetTopNode();
+    void   SetBeenHere( bool );
+    void    Reset_flags();
+
+    //! Set the group of a graph
+    void   SetGroup( GroupType );
+
+    //! Set the number of the graph
+    void   SetNumber( int );
+    void    Reset_Mark_and_Bin();
+    bool     GetBeenHere();
+    int   GetGraphNum();
+    int   GetNumberOfLinks();
+
+    void        Boolean( BOOL_OP operation, GraphList* Result );
+    void        Correction( GraphList* Result, double factor );
+    void        MakeRing( GraphList* Result, double factor );
+    void        CreateRing( GraphList *ring, double factor );
+    void        CreateRing_fast( GraphList *ring, double factor );
+    void        CreateArc( Node* center, KBoolLine* incoming, Node* end, double radius, double aber );
+    void        CreateArc( Node* center, Node* begin, Node* end, double radius, bool clock, double aber );
+    void        MakeOneDirection();
+    void        Make_Rounded_Shape( KBoolLink* a_link, double factor );
+    bool      MakeClockWise();
+    bool      writegraph( bool linked );
+    bool      writeintersections();
+    void        WriteKEY( Bool_Engine* GC,  FILE* file = NULL );
+    void        WriteGraphKEY( Bool_Engine* GC );
+
+protected:
+
+    //! Extracts partical polygons from the graph
+    /*
+       Links are sorted in XY at beginpoint. Bin and mark flag are reset.
+       Next start to collect subparts from the graph, setting the links bin for all found parts.
+       The parts are searched starting at a topleft corner NON set bin flag link.
+       Found parts are numbered, to be easily split into to real sperate graphs by Split()
+
+       \param operation operation to collect for.
+       \param detecthole if you want holes detected, influences also way of extraction.
+       \param foundholes when holes are found this flag is set true, but only if detecthole is set true.
+    */
+    void  Extract_Simples( BOOL_OP operation, bool detecthole, bool& foundholes );
+
+    //! split graph into small graph, using the numbers in links.
+    void  Split( GraphList* partlist );
+
+    //! Collect a graph by starting at argument link
+    /*
+       Called from Extract_Simples, and assumes sorted links with bin flag unset for non extarted piece
+
+       Collect graphs pieces from a total graph, by following links set to a given boolean operation.
+       \param current_node start node to collect
+       \param operation operation to collect for.
+       \param detecthole if you want holes detected, influences also way of extraction.
+       \param graphnumber number to be given to links in the extracted graph piece
+       \param foundholes when holes are found this flag is set true.
+    */
+    void  CollectGraph( Node *current_node, BOOL_OP operation, bool detecthole, int graphnumber, bool& foundholes );
+
+    void  CollectGraphLast( Node *current_node, BOOL_OP operation, bool detecthole, int graphnumber, bool& foundholes );
+
+    //! find a link not bin in the top left corner ( links should be sorted already )
+    /*!
+       Last found position is used to find it quickly.
+       Used in ExtractSimples()
+    */
+    Node* GetMostTopLeft( TDLI<KBoolLink>* _LI );
+
+    //! calculates crossing for all links in a graph, and add those as part of the graph.
+    /*
+       It is not just crossings calculation, snapping close nodes is part of it.
+       This is not done at maximum stability in economic time.
+       There are faster ways, but hardly ever they solve the problems, and they do not snap.
+       Here it is on purpose split into separate steps, to get a better result in snapping, and
+       to reach a better stability.
+
+       \param Marge nodes and lines closer to eachother then this, are merged.
+    */
+    bool CalculateCrossings( B_INT Marge );
+
+    //! equal nodes in position are merged into one.
+    int Merge_NodeToNode( B_INT Marge );
+
+    //! basic scan algorithm with a sweeping beam are line.
+    /*!
+        \param scantype a different face in the algorithm.
+        \param holes to detect hole when needed.
+    */
+    int ScanGraph2( SCANTYPE scantype, bool& holes );
+
+    //! links not used for a certain operation can be deleted, simplifying extraction
+    void  DeleteNonCond( BOOL_OP operation );
+
+    //! links not used for a certain operation can be set bin, simplifying extraction
+    void HandleNonCond( BOOL_OP operation );
+
+    //! debug
+    bool  checksort();
+
+    //! used in correction/offset algorithm
+    bool  Small( B_INT howsmall );
+
+
+    bool _bin;
+
+    DL_List<void*>* _linklist;
+
+};
+
+#endif
+
+

polygon/kbool/include/kbool/graphlst.h

@@ -0,0 +1,65 @@
+/*! \file include/graphlst.h
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: graphlst.h,v 1.3 2008/06/04 21:23:21 titato Exp $
+*/
+
+/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/thirdparty/kbool/include/kbool/graphlst.h,v $ $Revision: 1.3 $ $Date: 2008/06/04 21:23:21 $ */
+
+/*
+Program GRAPHLST.H
+Purpose Implements a list of graphs (header)
+Last Update 11-03-1996
+*/
+
+#ifndef GRAPHLIST_H
+#define GRAPHLIST_H
+
+#include "kbool/booleng.h"
+
+#include "kbool/_lnk_itr.h"
+
+#include "kbool/graph.h"
+
+class Debug_driver;
+
+
+class A2DKBOOLDLLEXP GraphList: public DL_List<void*>
+{
+protected:
+    Bool_Engine* _GC;
+public:
+
+    GraphList( Bool_Engine* GC );
+
+    GraphList( GraphList* other );
+
+    ~GraphList();
+
+    void    MakeOneGraph( Graph *total );
+
+    void    Prepare( Graph *total );
+    void     MakeRings();
+    void     Correction();
+
+    void    Simplify( double marge );
+    void     Smoothen( double marge );
+    void     Merge();
+    void     Boolean( BOOL_OP operation, int intersectionRunsMax );
+
+    void           WriteGraphs();
+    void           WriteGraphsKEY( Bool_Engine* GC );
+
+protected:
+    void    Renumber();
+    void    UnMarkAll();
+
+};
+
+
+#endif
+

polygon/kbool/include/kbool/kboolmod.h

@@ -0,0 +1,15 @@
+#ifndef __A2D_KBOOLMOD_H__
+#define __A2D_KBOOLMOD_H__
+
+#include "kbool/booleng.h"
+#include "kbool/graph.h"
+#include "kbool/graphlst.h"
+#include "kbool/line.h"
+#include "kbool/link.h"
+#include "kbool/lpoint.h"
+#include "kbool/node.h"
+#include "kbool/record.h"
+#include "kbool/scanbeam.h"
+
+#endif
+

polygon/kbool/include/kbool/line.h

@@ -0,0 +1,107 @@
+/*! \file include/line.h
+    \brief Mainy used for calculating crossings
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: line.h,v 1.3 2008/06/04 21:23:21 titato Exp $
+*/
+
+#ifndef LINE_H
+#define LINE_H
+
+#include "kbool/booleng.h"
+#include "kbool/link.h"
+
+class A2DKBOOLDLLEXP Bool_Engine;
+
+// Status of a point to a line
+enum PointStatus {LEFT_SIDE, RIGHT_SIDE, ON_AREA, IN_AREA};
+
+class A2DKBOOLDLLEXP Graph;
+
+class A2DKBOOLDLLEXP KBoolLine
+{
+protected:
+    Bool_Engine* m_GC;
+public:
+
+    // constructors and destructor
+    KBoolLine( Bool_Engine* GC );
+    KBoolLine( KBoolLink*, Bool_Engine* GC );
+    ~KBoolLine();
+
+    void   Set( KBoolLink * );
+    KBoolLink*  GetLink();
+
+    //! Get the beginnode from a line
+    Node*  GetBeginNode();
+
+    //! Get the endnode from a line
+    Node*  GetEndNode();
+
+    //! Check if two lines intersects
+    int     CheckIntersect( KBoolLine*, double Marge );
+
+    //! Intersects two lines
+    int     Intersect( KBoolLine*, double Marge );
+    int               Intersect_simple( KBoolLine * lijn );
+    bool       Intersect2( Node* crossing, KBoolLine * lijn );
+
+    //!For an infinite line
+    PointStatus   PointOnLine( Node* a_node, double& Distance, double Marge );
+
+    //!For a non-infinite line
+    PointStatus   PointInLine( Node* a_node, double& Distance, double Marge );
+
+    //! Caclulate Y if X is known
+    B_INT     Calculate_Y( B_INT X );
+    B_INT           Calculate_Y_from_X( B_INT X );
+    void              Virtual_Point( LPoint *a_point, double distance );
+
+    //! assignment operator
+    KBoolLine&    operator=( const KBoolLine& );
+
+    Node*     OffsetContour( KBoolLine* const nextline, Node* last_ins, double factor, Graph *shape );
+    Node*     OffsetContour_rounded( KBoolLine* const nextline, Node* _last_ins, double factor, Graph *shape );
+    bool        OkeForContour( KBoolLine* const nextline, double factor, Node* LastLeft, Node* LastRight, LinkStatus& _outproduct );
+    bool       Create_Ring_Shape( KBoolLine* nextline, Node** _last_ins_left, Node** _last_ins_right, double factor, Graph *shape );
+    void      Create_Begin_Shape( KBoolLine* nextline, Node** _last_ins_left, Node** _last_ins_right, double factor, Graph *shape );
+    void      Create_End_Shape( KBoolLine* nextline, Node* _last_ins_left, Node* _last_ins_right, double factor, Graph *shape );
+
+    //! Calculate the parameters if nessecary
+    void  CalculateLineParameters();
+
+    //! Adds a crossing between the intersecting lines
+    void  AddLineCrossing( B_INT , B_INT , KBoolLine * );
+
+    void  AddCrossing( Node *a_node );
+    Node* AddCrossing( B_INT X, B_INT Y );
+    bool  ProcessCrossings( TDLI<KBoolLink>* _LI );
+
+// Linecrosslist
+    void SortLineCrossings();
+    bool CrossListEmpty();
+    DL_List<void*>*  GetCrossList();
+//  bool HasInCrossList(Node*);
+
+private:
+
+    //! Function needed for Intersect
+    int   ActionOnTable1( PointStatus, PointStatus );
+    //! Function needed for Intersect
+    int   ActionOnTable2( PointStatus, PointStatus );
+
+    double   m_AA;
+    double  m_BB;
+    double  m_CC;
+    KBoolLink* m_link;
+    bool  m_valid_parameters;
+
+    //! List with crossings through this link
+    DL_List<void*>  *linecrosslist;
+};
+
+#endif

polygon/kbool/include/kbool/link.h

@@ -0,0 +1,230 @@
+/*! \file include/link.h
+    \brief Part of a graph, connection between nodes (Header)
+    \author Klaas Holwerda or Julian Smart
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: link.h,v 1.3 2008/06/04 21:23:22 titato Exp $
+*/
+
+#ifndef LINK_H
+#define LINK_H
+
+#include "kbool/booleng.h"
+#include "kbool/_lnk_itr.h"
+
+enum LinkStatus {IS_LEFT, IS_ON, IS_RIGHT};
+
+class LPoint;
+class Node;
+class Record;
+
+//!   segment within a graph
+/*
+   A Graph contains a list of KBoolLink, the KBoolLink or connected by Node's. 
+   Several KBoolLink can be connected to one Node. 
+   A KBoolLink has a direction defined by its begin and end node.
+   Node do have a list of connected KBoolLink's.
+   So one can walk trough a graph in two ways:
+   1- via its KBoolLink list 
+   2- via the node connected to the KBoolLink's 
+*/
+class A2DKBOOLDLLEXP KBoolLink
+{
+protected:
+    Bool_Engine* _GC;
+public:
+
+    //! contructors
+    KBoolLink( Bool_Engine* GC );
+
+    //! contructors
+    KBoolLink( int graphnr, Node* begin, Node* end, Bool_Engine* GC );
+
+    //! contructors
+    KBoolLink( Node *begin, Node *end, Bool_Engine* GC );
+
+    //! destructors
+    ~KBoolLink();
+
+
+    //! Merges the other node with argument
+    void MergeNodes( Node* const );
+
+    //! outproduct of two links
+    LinkStatus OutProduct( KBoolLink* const two, double accur );
+
+    //! link three compared to this and two
+    LinkStatus PointOnCorner( KBoolLink* const, KBoolLink* const );
+
+    //! Removes argument from the link
+    void Remove( Node* );
+
+    //! replaces olddone in the link by newnode
+    void Replace( Node* oldnode, Node* newnode );
+
+    //!top hole marking
+    void SetTopHole( bool value );
+
+    //!top hole marking
+    bool IsTopHole();
+
+    //! Marking functions
+    void UnMark();
+    //! Marking functions
+    void Mark();
+    //! Marking functions
+    void SetMark( bool );
+    //! Marking functions
+    bool IsMarked();
+
+    //! holelink Marking functions
+    void SetHoleLink( bool val ){ m_holelink = val;};
+
+    //! holelink Marking functions
+    bool GetHoleLink(){ return m_holelink;};
+
+    //! Bin functions
+    void SetNotBeenHere();
+    //! Bin functions
+    void SetBeenHere();
+    //! Have you been here ??
+    bool BeenHere();
+
+    //! Removes all the references to this
+    void UnLink();
+
+    //! functions for maximum performance
+    Node* GetBeginNode();
+
+    //! Datamember access functions
+    Node* GetEndNode();
+    Node* GetLowNode();
+    Node* GetHighNode();
+
+    //! Returns a next link beginning with argument
+    KBoolLink* Forth( Node* );
+
+    int GetGraphNum();
+    bool GetInc();
+    bool GetLeftA();
+    bool GetLeftB();
+    bool GetRightA();
+    bool GetRightB();
+    void GetLRO( LPoint*, int&, int&, double );
+
+    //! Return a node not equal to arg.
+    Node* GetOther( const Node* const );
+    //! Is this link unused ?
+    bool IsUnused();
+
+    //! Used for given operation ?
+    bool IsMarked( BOOL_OP operation );
+
+    //! return true if Left side is marked true for operation
+    bool IsMarkedLeft( BOOL_OP operation );
+
+    //! return true if Right side is marked true for operation
+    bool IsMarkedRight( BOOL_OP operation );
+
+    //! is this a hole link for given operation
+    bool IsHole( BOOL_OP operation );
+
+    //! set the hole mark
+    void SetHole( bool );
+
+    //! is the hole mark set?
+    bool GetHole();
+
+    //! Are the nodes on about the same coordinates ?
+    bool IsZero( B_INT marge );
+    bool ShorterThan( B_INT marge );
+
+    //! Resets the link
+    void Reset( Node* begin, Node* end, int graphnr = 0 );
+    void Set( Node* begin, Node* end );
+    void SetBeginNode( Node* );
+    void SetEndNode( Node* );
+    void SetGraphNum( int );
+    void SetInc( bool );
+    void SetLeftA( bool );
+    void SetLeftB( bool );
+    void SetRightA( bool );
+    void SetRightB( bool );
+    void SetGroup( GroupType );
+    GroupType Group();
+
+    //! Flag calculation (internal only)
+    void SetLineTypes();
+    void Reset();
+    void Reset_flags();
+
+    //!put in this direction
+    void Redirect( Node* a_node );
+
+    void TakeOverOperationFlags( KBoolLink* link );
+
+    void SetRecordNode( DL_Node<Record*>* recordNode ) { m_record = recordNode; }
+
+    DL_Node<Record*>* GetRecordNode() { return m_record; }
+
+protected:
+
+    //! The mainitems of a link
+    Node  *m_beginnode, *m_endnode;
+    //! Marker for walking over the graph
+bool m_bin     : 1;
+    //! Is this a part of hole ?
+bool m_hole     : 1;
+    //! link that is toplink of hole?
+bool m_hole_top : 1;
+    //! going in one more time in this graph if true  else going out one time
+bool  m_Inc    : 1;
+    //! Is left in polygongroup A
+bool  m_LeftA  : 1;
+    //! Is right in polygon group A
+bool  m_RightA : 1;
+    //! Is left in polygon group B
+bool  m_LeftB  : 1;
+    //! Is right in polygongroup B
+bool m_RightB : 1;
+    //! General purose marker, internally unused
+bool m_mark  : 1;
+    //! link for linking holes
+bool m_holelink : 1;
+
+    //! Marker for Merge Left
+bool m_merge_L  : 1;
+    //! Marker for substract a-b Left
+bool m_a_substract_b_L: 1;
+    //! Marker for substract b-a Left
+bool m_b_substract_a_L: 1;
+    //! Marker for intersect Left
+bool m_intersect_L: 1;
+    //! Marker for X-OR Left
+bool m_exor_L: 1;
+
+    //! Marker for Merge Right
+bool m_merge_R  : 1;
+    //! Marker for substract a-b Right
+bool m_a_substract_b_R: 1;
+    //! Marker for substract b-a Right
+bool m_b_substract_a_R: 1;
+    //! Marker for intersect Right
+bool m_intersect_R: 1;
+    //! Marker for X-OR Right
+bool m_exor_R: 1;
+
+    //! belongs to group A or B
+GroupType m_group : 1;
+
+    //! belongs to this polygon part in the graph.
+    int m_graphnum;
+
+    DL_Node<Record*>* m_record;
+};
+
+#endif
+

polygon/kbool/include/kbool/lpoint.h

@@ -0,0 +1,60 @@
+/*! \file include/lpoint.h
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: lpoint.h,v 1.3 2008/06/04 21:23:22 titato Exp $
+*/
+
+/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/thirdparty/kbool/include/kbool/lpoint.h,v $ $Revision: 1.3 $ $Date: 2008/06/04 21:23:22 $ */
+
+/*
+Program LPOINT.H
+Purpose Definition of GDSII pointtype structure
+Last Update 12-12-1995
+*/
+
+#ifndef LPOINT_H
+#define LPOINT_H
+
+#include "kbool/booleng.h"
+
+class A2DKBOOLDLLEXP LPoint
+{
+public:
+    LPoint();
+    LPoint( B_INT const , B_INT const );
+    LPoint( LPoint* const );
+
+    void  Set( const B_INT, const B_INT );
+    void  Set( const LPoint & );
+
+    LPoint  GetPoint();
+    B_INT  GetX();
+    B_INT  GetY();
+    void   SetX( B_INT );
+    void  SetY( B_INT );
+    bool  Equal( const LPoint a_point, B_INT Marge );
+    bool  Equal( const B_INT, const B_INT , B_INT Marge );
+    bool  ShorterThan( const LPoint a_point, B_INT marge );
+    bool  ShorterThan( const B_INT X, const B_INT Y, B_INT );
+
+    LPoint &operator=( const LPoint & );
+    LPoint &operator+( const LPoint & );
+    LPoint &operator-( const LPoint & );
+
+    LPoint &operator*( int );
+    LPoint &operator/( int );
+
+    int  operator==( const LPoint & ) const;
+    int  operator!=( const LPoint & ) const;
+
+protected:
+    B_INT _x;
+    B_INT _y;
+
+};
+
+#endif

polygon/kbool/include/kbool/node.h

@@ -0,0 +1,85 @@
+/*! \file include/node.h
+    \brief Holds a GDSII node structure (Header)
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: node.h,v 1.3 2008/06/04 21:23:22 titato Exp $
+*/
+
+#ifndef NODE_H
+#define NODE_H
+
+#include "kbool/booleng.h"
+
+#include "kbool/lpoint.h"
+
+#include "kbool/link.h"
+#include "kbool/_lnk_itr.h" // LinkBaseIter
+#include <math.h>
+
+enum NodePosition { N_LEFT, N_ON, N_RIGHT};
+
+class A2DKBOOLDLLEXP Node : public LPoint
+{
+protected:
+    Bool_Engine* _GC;
+public:
+    // friend must be deleted in the final version!
+    friend class Debug_driver;
+
+    // constructors and destructors
+    Node( Bool_Engine* GC );
+
+    Node( const B_INT, const B_INT, Bool_Engine* GC );
+
+    Node( LPoint* const a_point, Bool_Engine* GC );
+    Node( Node * const, Bool_Engine* GC );
+    Node& operator=( const Node &other_node );
+    ~Node();
+
+    //public member functions
+    void AddLink( KBoolLink* );
+    DL_List<void*>* GetLinklist();
+
+    //! check two link for its operation flags to be the same when coming from the prev link.
+    bool SameSides( KBoolLink* const prev , KBoolLink* const link, BOOL_OP operation );
+
+    //! get the link most right or left to the current link, but with the specific operation
+    /*! flags the same on the sides of the new link.
+    */
+    KBoolLink*  GetMost( KBoolLink* const prev , LinkStatus whatside, BOOL_OP operation );
+
+    //! get link that is leading to a hole ( hole segment or linking segment )
+    KBoolLink* GetMostHole( KBoolLink* const prev , LinkStatus whatside, BOOL_OP operation );
+
+    //! get link that is not vertical.
+    KBoolLink*  GetNotFlat();
+
+    //! get a link to a hole or from a hole.
+    KBoolLink* GetHoleLink( KBoolLink* const prev, bool checkbin, BOOL_OP operation );
+
+    int Merge( Node* );
+    void RemoveLink( KBoolLink* );
+    bool Simplify( Node* First, Node* Second, B_INT Marge );
+
+    //  memberfunctions for maximum performance
+    void        RoundInt( B_INT grid );
+    KBoolLink* GetIncomingLink();
+
+    int    GetNumberOfLinks();
+    KBoolLink* GetNextLink();
+    KBoolLink* GetOtherLink( KBoolLink* );
+    KBoolLink* GetOutgoingLink();
+    KBoolLink* GetPrevLink();
+
+    KBoolLink* Follow( KBoolLink* const prev );
+    KBoolLink* GetBinHighest( bool binset );
+
+protected:
+    DL_List<void*>*  _linklist;
+};
+
+#endif

polygon/kbool/include/kbool/record.h

@@ -0,0 +1,78 @@
+/*! \file include/record.h
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: record.h,v 1.3 2008/06/04 21:23:22 titato Exp $
+*/
+
+#ifndef RECORD_H
+#define RECORD_H
+
+class Node;
+#include "kbool/booleng.h"
+
+#include "kbool/link.h"
+#include "kbool/line.h"
+
+enum BEAM_TYPE { NORMAL, FLAT};
+
+enum DIRECTION  {GO_LEFT, GO_RIGHT};
+
+//extern void DeleteRecordPool();
+class A2DKBOOLDLLEXP Bool_Engine;
+
+class A2DKBOOLDLLEXP Record
+{
+protected:
+    Bool_Engine* _GC;
+public:
+//     void deletepool();
+
+    Record( KBoolLink* link, Bool_Engine* GC );
+
+    ~Record();
+
+//     void* operator new(size_t size);
+
+//     void operator delete(void* recordptr);
+
+    void SetNewLink( KBoolLink* link );
+
+    void Set_Flags();
+
+    void Calc_Ysp( Node* low );
+
+    KBoolLink* GetLink();
+
+    KBoolLine* GetLine();
+
+    B_INT Ysp();
+
+    void SetYsp( B_INT ysp );
+
+    DIRECTION Direction();
+
+    bool Calc_Left_Right( Record* record_above_me );
+
+    bool Equal( Record* );
+
+private:
+    KBoolLine   _line;
+
+    B_INT   _ysp;
+
+    //! going left are right in beam
+    DIRECTION _dir;
+
+    //! how far in group_a
+    int         _a;
+
+    //! how far in group_b
+    int         _b;
+
+};
+
+#endif

polygon/kbool/include/kbool/scanbeam.h

@@ -0,0 +1,58 @@
+/*! \file include/scanbeam.h
+    \author Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Klaas Holwerda
+ 
+    Licence: see kboollicense.txt 
+ 
+    RCS-ID: $Id: scanbeam.h,v 1.4 2008/09/05 19:01:14 titato Exp $
+*/
+
+#ifndef SCANBEAM_H
+#define SCANBEAM_H
+
+#include "kbool/booleng.h"
+#include "kbool/_lnk_itr.h"
+
+#include "kbool/record.h"
+#include "kbool/link.h"
+
+enum SCANTYPE{NODELINK, LINKLINK, GENLR, LINKHOLES, INOUT};
+
+#if defined(WXART2D_USINGDLL)
+template class A2DKBOOLDLLEXP DL_Iter<Record*>;
+#endif
+
+class A2DKBOOLDLLEXP ScanBeam : public DL_List<Record*>
+{
+protected:
+    Bool_Engine* _GC;
+
+public:
+    ScanBeam( Bool_Engine* GC );
+    ~ScanBeam();
+    void SetType( Node* low, Node* high );
+
+    bool  FindNew( SCANTYPE scantype, TDLI<KBoolLink>* _I, bool& holes );
+    bool  RemoveOld( SCANTYPE scantype, TDLI<KBoolLink>* _I, bool& holes );
+
+private:
+
+    bool  ProcessHoles( bool atinsert, TDLI<KBoolLink>* _LI );
+    int Process_LinkToLink_Crossings();   // find crossings
+    int  Process_PointToLink_Crossings();
+    int  Process_LinkToLink_Flat( KBoolLine* flatline );
+    void SortTheBeam( bool backangle );
+    bool  checksort();
+    bool  writebeam();
+    void Calc_Ysp();
+    //int  FindCloseLinksAndCross(TDLI<KBoolLink>* _I,Node* _lowf);
+    void  Generate_INOUT( int graphnumber );
+
+    Node*      _low;
+    DL_Iter<Record*> _BI;
+    int       lastinserted;
+    BEAM_TYPE    _type;
+};
+
+#endif

polygon/kbool/include/kbool/statusb.h

@@ -0,0 +1,54 @@
+/*! \file kbool/include/kbool/statusb.h
+    \author Probably Klaas Holwerda
+ 
+    Copyright: 2001-2004 (C) Probably Klaas Holwerda
+ 
+    Licence: wxWidgets Licence
+ 
+    RCS-ID: $Id: statusb.h,v 1.2 2006/12/15 21:00:06 titato Exp $
+*/
+
+/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/thirdparty/kbool/include/kbool/statusb.h,v $ $Revision: 1.2 $ $Date: 2006/12/15 21:00:06 $ */
+
+/*
+Program STATUSB.H
+Purpose Controls the statusbar of the application (header)
+  This statusbar is a typical Windows statusbar
+  For porting to another platform there must be a StatusBar class
+  derived from this.
+  User interface element (See documentation for more details
+  about the functions needed in this class)
+*/
+
+#ifndef STATUSB_H
+#define STATUSB_H
+#include <time.h>
+
+// abstract base class for own statusbar inherite from it
+class A2DKBOOLDLLEXP StatusBar
+{
+public:
+    // constructor & destructor
+    StatusBar(){};
+    ~StatusBar(){};
+
+    virtual void SetXY( double = 0.0, double = 0.0 ) = 0;
+    virtual void ResetCoord() = 0;
+    virtual void  SetFile( char* = 0 ) = 0;
+    virtual void SetProcess( char* = 0 ) = 0;
+    virtual void  SetTime( time_t seconds = 0 ) = 0;
+    virtual void SetRecording( int status = 0 ) = 0;
+    virtual void SetZoom( float factor = 1 ) = 0;
+    virtual void Reset() = 0;
+    void     StartDTimer();
+    void     EndDTimer();
+    int    GetDTimerOn();
+    time_t   GetDTimer();
+
+protected:
+    int    timer;
+    time_t   oldtime;
+    time_t   curtime;
+};
+
+#endif

polygon/kbool/include/kbool/valuesvc.h

@@ -5,5 +5,5 @@
  
     Licence: wxWidgets Licence
  
-    RCS-ID: $Id: valuesvc.h,v 1.1 2005/05/24 19:13:37 titato Exp $
+    RCS-ID: $Id: valuesvc.h,v 1.1 2006/11/04 21:49:01 titato Exp $
 */

polygon/kbool/include/kboolmod.h

@@ -1,15 +0,0 @@
-#ifndef __A2D_KBOOLMOD_H__
-#define __A2D_KBOOLMOD_H__ 
-
-#include "../include/booleng.h" 
-#include "../include/graph.h" 
-#include "../include/graphlst.h" 
-#include "../include/line.h" 
-#include "../include/link.h"
-#include "../include/lpoint.h" 
-#include "../include/node.h" 
-#include "../include/record.h"
-#include "../include/scanbeam.h"     
-    
-#endif
- 

polygon/kbool/include/line.h

@@ -1,111 +0,0 @@
-/*! \file ../include/../line.h
-    \brief Mainy used for calculating crossings
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: line.h,v 1.2 2005/06/12 00:03:11 kbluck Exp $
-*/
-
-#ifndef LINE_H
-#define LINE_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include "../include/booleng.h"
-#include "../include/link.h"
-
-class A2DKBOOLDLLEXP Bool_Engine;
-
-// Status of a point to a line
-enum PointStatus {LEFT_SIDE, RIGHT_SIDE, ON_AREA, IN_AREA};
-
-class A2DKBOOLDLLEXP Graph;
-
-class A2DKBOOLDLLEXP KBoolLine
-{
-   protected:
-      Bool_Engine* m_GC;
-	public:
-
-		// constructors and destructor
-		KBoolLine(Bool_Engine* GC);
-		KBoolLine(KBoolLink*,Bool_Engine* GC);
-		~KBoolLine();
-
-		void			Set(KBoolLink *);
-		KBoolLink*		GetLink();
-
-      //! Get the beginnode from a line
-		Node*		GetBeginNode();		
-      
-      //! Get the endnode from a line
-		Node*		GetEndNode();   										  	
-
-      //! Check if two lines intersects
-		int					CheckIntersect(KBoolLine*, double Marge);	
-
-      //! Intersects two lines
-		int					Intersect(KBoolLine*, double Marge);    	 
-		int               Intersect_simple(KBoolLine * lijn);
-		bool				   Intersect2(Node* crossing,KBoolLine * lijn);
-
-      //!For an infinite line
-		PointStatus			PointOnLine(Node* a_node, double& Distance, double Marge ); 
-
-      //!For a non-infinite line
-		PointStatus			PointInLine(Node* a_node, double& Distance, double Marge ); 
-
-      //! Caclulate Y if X is known
-      B_INT					Calculate_Y(B_INT X); 								
-		B_INT         		Calculate_Y_from_X(B_INT X);
-		void              Virtual_Point( LPoint *a_point, double distance);
-
-      //! assignment operator
-		KBoolLine& 			operator=(const KBoolLine&); 					
-
-		Node* 				OffsetContour(KBoolLine* const nextline,Node* last_ins, double factor,Graph *shape);
-		Node* 				OffsetContour_rounded(KBoolLine* const nextline,Node* _last_ins, double factor,Graph *shape);
-		bool 				   OkeForContour(KBoolLine* const nextline,double factor,Node* LastLeft,Node* LastRight, LinkStatus& _outproduct);
-		bool				   Create_Ring_Shape(KBoolLine* nextline,Node** _last_ins_left,Node** _last_ins_right,double factor,Graph *shape);
-		void 					Create_Begin_Shape(KBoolLine* nextline,Node** _last_ins_left,Node** _last_ins_right,double factor,Graph *shape);
-		void 					Create_End_Shape(KBoolLine* nextline,Node* _last_ins_left,Node* _last_ins_right,double factor,Graph *shape);
-
-      //! Calculate the parameters if nessecary
-		void  CalculateLineParameters(); 								
-
-      //! Adds a crossing between the intersecting lines
-		void  AddLineCrossing(B_INT , B_INT , KBoolLine *); 		
-
-		void  AddCrossing(Node *a_node);
-		Node* AddCrossing(B_INT X, B_INT Y);
-		bool  ProcessCrossings(TDLI<KBoolLink>* _LI);
-
-// Linecrosslist
-		void	SortLineCrossings();
-		bool	CrossListEmpty();
-		DL_List<void*>*		GetCrossList();
-//		bool	HasInCrossList(Node*);
-
-	private:
-
-      //! Function needed for Intersect
-		int   ActionOnTable1(PointStatus,PointStatus); 							
-      //! Function needed for Intersect
-		int   ActionOnTable2(PointStatus,PointStatus); 						
-
-		double 		m_AA;
-		double		m_BB;
-		double		m_CC;
-		KBoolLink*	m_link;
-		bool		m_valid_parameters;
-
-      //! List with crossings through this link
-		DL_List<void*>	 *linecrosslist;
-};
-
-#endif

polygon/kbool/include/link.h

@@ -1,234 +0,0 @@
-/*! \file kbool/include/kbool/link.h
-    \brief Part of a graph, connection between nodes (Header)
-    \author Probably Klaas Holwerda or Julian Smart
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: link.h,v 1.1 2005/05/24 19:13:37 titato Exp $
-*/
-
-#ifndef LINK_H
-#define LINK_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include "../include/booleng.h"
-#include "../include/_lnk_itr.h"
-
-enum LinkStatus {IS_LEFT,IS_ON,IS_RIGHT};
-
-class LPoint;
-class Node;
-class Record;
-
-//!   segment within a graph 
-/*
-   A Graph contains a list of KBoolLink, the KBoolLink or connected by Node's. 
-   Several KBoolLink can be connected to one Node. 
-   A KBoolLink has a direction defined by its begin and end node.
-   Node do have a list of connected KBoolLink's.
-   So one can walk trough a graph in two ways:
-   1- via its KBoolLink list 
-   2- via the node connected to the KBoolLink's 
-*/
-class A2DKBOOLDLLEXP KBoolLink
-{
-   protected:
-      Bool_Engine* _GC;
-	public:
-
-		//! contructors 
-		KBoolLink(Bool_Engine* GC);
-
-		//! contructors 
-		KBoolLink(int graphnr, Node* begin, Node* end, Bool_Engine* GC);
-
-		//! contructors 
-		KBoolLink(Node *begin, Node *end, Bool_Engine* GC);
-
-		//! destructors
-		~KBoolLink();
-
-
-      //! Merges the other node with argument
-		void MergeNodes(Node* const);      				
-
-      //! outproduct of two links
-      LinkStatus OutProduct(KBoolLink* const two,double accur);              
-		
-      //! link three compared to this and two
-      LinkStatus PointOnCorner(KBoolLink* const, KBoolLink* const);	
-
-      //! Removes argument from the link
-		void Remove(Node*);		
-      
-      //! replaces olddone in the link by newnode
-		void Replace(Node* oldnode, Node* newnode);		
-
-      //!top hole marking
-		void SetTopHole(bool value);
-
-      //!top hole marking
-		bool IsTopHole();
-
-      //! Marking functions
-		void UnMark();
-      //! Marking functions
-		void Mark();
-      //! Marking functions
-		void SetMark(bool);
-      //! Marking functions
-		bool IsMarked();
-
-      //! holelink Marking functions
-      void SetHoleLink(bool val){ m_holelink = val;};
-
-      //! holelink Marking functions
-      bool GetHoleLink(){ return m_holelink;};
-
-      //! Bin functions
-		void SetNotBeenHere();
-      //! Bin functions
-		void SetBeenHere();
-      //! Have you been here ??
-		bool BeenHere();										
-
-      //! Removes all the references to this
-		void	UnLink();												
-
-		//! functions for maximum performance
-		Node*	GetBeginNode();      				  	
-
-      //! Datamember access functions
-		Node*	GetEndNode();
-		Node*	GetLowNode();
-		Node*	GetHighNode();
-
-      //! Returns a next link beginning with argument
-		KBoolLink* Forth(Node*); 	
-      
-		int GetGraphNum();
-		bool GetInc();
-      bool GetLeftA();
-		bool GetLeftB();
-		bool GetRightA();
-		bool GetRightB();
-		void GetLRO(LPoint*, int&, int&, double);
-
-      //! Return a node not equal to arg.
-		Node*	GetOther(const Node* const);			
-      //! Is this link unused ?
-		bool IsUnused();									
-
-      //! Used for given operation ?
-		bool IsMarked(BOOL_OP operation);            
-
-      //! return true if Left side is marked true for operation
-		bool IsMarkedLeft(BOOL_OP operation);            
-
-      //! return true if Right side is marked true for operation
-		bool IsMarkedRight(BOOL_OP operation);            
-
-      //! is this a hole link for given operation
-		bool IsHole(BOOL_OP operation);				
-      
-      //! set the hole mark
-      void SetHole(bool);
-
-      //! is the hole mark set?
-		bool GetHole();
-
-      //! Are the nodes on about the same coordinates ?
-		bool IsZero(B_INT marge );		
-		bool ShorterThan(B_INT marge );
-
-      //! Resets the link
-		void Reset(Node* begin, Node* end, int graphnr = 0);	
-		void Set(Node* begin, Node* end);
-		void SetBeginNode(Node*);
-		void SetEndNode(Node*);
-		void SetGraphNum(int);
-		void SetInc(bool);
-      void SetLeftA(bool);
-		void SetLeftB(bool);
-		void SetRightA(bool);
-		void SetRightB(bool);
-		void SetGroup(GroupType);
-		GroupType Group();
-
-      //! Flag calculation (internal only)
-		void SetLineTypes();
-		void Reset();
-		void Reset_flags();
-
-      //!put in this direction
-      void Redirect(Node* a_node); 
-
-      void TakeOverOperationFlags( KBoolLink* link );
-
-      void SetRecordNode( DL_Node<Record*>* recordNode ) { m_record = recordNode; }
-
-      DL_Node<Record*>* GetRecordNode() { return m_record; }
-
-	protected:
-
-      //! The mainitems of a link
-		Node 	*m_beginnode, *m_endnode;
-      //! Marker for walking over the graph
-		bool	m_bin    	: 1;				
-      //! Is this a part of hole ?
-		bool	m_hole     : 1;				
-      //! link that is toplink of hole?
-		bool	m_hole_top : 1;				
-      //! going in one more time in this graph if true  else going out one time
-		bool 	m_Inc   	: 1;    			
-      //! Is left in polygongroup A
-      bool 	m_LeftA 	: 1;    			
-      //! Is right in polygon group A
-		bool 	m_RightA	: 1;    			
-      //! Is left in polygon group B
-		bool 	m_LeftB 	: 1;    			
-      //! Is right in polygongroup B
-		bool	m_RightB	: 1;    			
-      //! General purose marker, internally unused
-		bool	m_mark		: 1;    			
-      //! link for linking holes
-		bool	m_holelink : 1; 
-   				
-      //! Marker for Merge Left
-		bool m_merge_L 	: 1;				
-      //! Marker for substract a-b Left
-		bool m_a_substract_b_L: 1;	  		
-      //! Marker for substract b-a Left
-		bool m_b_substract_a_L: 1;	  		
-      //! Marker for intersect Left
-		bool m_intersect_L: 1;				
-      //! Marker for X-OR Left
-		bool m_exor_L: 1;				
-
-      //! Marker for Merge Right
-		bool m_merge_R 	: 1;				
-      //! Marker for substract a-b Right
-		bool m_a_substract_b_R: 1;	  		
-      //! Marker for substract b-a Right
-		bool m_b_substract_a_R: 1;	  		
-      //! Marker for intersect Right
-		bool m_intersect_R: 1;				
-      //! Marker for X-OR Right
-		bool m_exor_R: 1;				
-
-      //! belongs to group A or B
-		GroupType m_group : 1;      
-      
-      //! belongs to this polygon part in the graph.
-		int m_graphnum;
-
-      DL_Node<Record*>* m_record; 
-};
-
-#endif
-

polygon/kbool/include/lpoint.h

@@ -1,64 +0,0 @@
-/*! \file ../include/../lpoint.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: lpoint.h,v 1.1 2005/05/24 19:13:37 titato Exp $
-*/
-
-/* @@(#) $Source: /cvsroot/wxart2d/wxArt2D/modules/../include/lpoint.h,v $ $Revision: 1.1 $ $Date: 2005/05/24 19:13:37 $ */
-
-/*
-Program	LPOINT.H
-Purpose	Definition of GDSII pointtype structure
-Last Update	12-12-1995
-*/
-
-#ifndef LPOINT_H
-#define LPOINT_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include "../include/booleng.h"
-
-class A2DKBOOLDLLEXP LPoint
-{
-	public:
-		LPoint();
-		LPoint(B_INT const ,B_INT const);
-		LPoint(LPoint* const);
-
-		void		Set(const B_INT,const B_INT);
-		void		Set(const LPoint &);
-
-		LPoint		GetPoint();
-		B_INT		GetX();
-		B_INT		GetY();
-		void 		SetX(B_INT);
-		void		SetY(B_INT);
-		bool		Equal(const LPoint a_point, B_INT Marge );
-		bool		Equal(const B_INT,const B_INT , B_INT Marge);
-		bool		ShorterThan(const LPoint a_point, B_INT marge);
-		bool		ShorterThan(const B_INT X, const B_INT Y, B_INT);
-
-		LPoint	&operator=(const LPoint &);
-		LPoint	&operator+(const LPoint &);
-		LPoint	&operator-(const LPoint &);
-
-		LPoint	&operator*(int);
-		LPoint	&operator/(int);
-
-		int		operator==(const LPoint &) const;
-		int		operator!=(const LPoint &) const;
-
-	protected:
-		B_INT _x;
-		B_INT _y;
-
-};
-
-#endif

polygon/kbool/include/node.h

@@ -1,89 +0,0 @@
-/*! \file ../include/../node.h
-    \brief Holds a GDSII node structure (Header)
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: node.h,v 1.1 2005/05/24 19:13:37 titato Exp $
-*/
-
-#ifndef NODE_H
-#define NODE_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include <math.h>
-#include "../include/booleng.h"
-
-#include "../include/lpoint.h"
-
-#include "../include/link.h"
-#include "../include/_lnk_itr.h" // LinkBaseIter
-
-enum NodePosition { N_LEFT, N_ON, N_RIGHT};
-
-class A2DKBOOLDLLEXP Node : public LPoint
-{
-	protected:
-      Bool_Engine* _GC;
-	public:
-		// friend must be deleted in the final version!
-		friend class Debug_driver;
-
-		// constructors and destructors
-		Node(Bool_Engine* GC);
-
-		Node(const B_INT, const B_INT, Bool_Engine* GC);
-	
-		Node(LPoint* const a_point, Bool_Engine* GC);
-		Node(Node * const, Bool_Engine* GC);
-		Node& operator=(const Node &other_node);
-		~Node();
-
-		//public member functions
-		void AddLink(KBoolLink*);
-		DL_List<void*>* GetLinklist();
-
-      //! check two link for its operation flags to be the same when coming from the prev link.
-      bool SameSides( KBoolLink* const prev , KBoolLink* const link, BOOL_OP operation );
-
-      //! get the link most right or left to the current link, but with the specific operation
-      /*! flags the same on the sides of the new link.
-      */
-		KBoolLink*  GetMost( KBoolLink* const prev ,LinkStatus whatside, BOOL_OP operation );
-
-      //! get link that is leading to a hole ( hole segment or linking segment )
-      KBoolLink* GetMostHole( KBoolLink* const prev ,LinkStatus whatside, BOOL_OP operation );
-
-      //! get link that is not vertical.
-      KBoolLink* 	GetNotFlat();
-
-      //! get a link to a hole or from a hole.
-      KBoolLink* GetHoleLink( KBoolLink* const prev, bool checkbin, BOOL_OP operation );
-
-		int Merge(Node*);
-		void RemoveLink(KBoolLink*);
-		bool Simplify(Node* First, Node* Second, B_INT Marge );
-
-		//  memberfunctions for maximum performance
-		void        RoundInt(B_INT grid);
-		KBoolLink*	GetIncomingLink();
-
-		int		  GetNumberOfLinks();
-		KBoolLink* GetNextLink();
-		KBoolLink* GetOtherLink(KBoolLink*);
-		KBoolLink* GetOutgoingLink();
-		KBoolLink* GetPrevLink();
-
-		KBoolLink* Follow(KBoolLink* const prev );
-		KBoolLink* GetBinHighest(bool binset);
-
-	protected:
-		DL_List<void*>*		_linklist;
-};
-
-#endif

polygon/kbool/include/record.h

@@ -1,82 +0,0 @@
-/*! \file ../include/../record.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: record.h,v 1.1 2005/05/24 19:13:37 titato Exp $
-*/
-
-#ifndef RECORD_H
-#define RECORD_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-class Node;
-#include "../include/booleng.h"
-
-#include "../include/link.h"
-#include "../include/line.h"
-
-enum BEAM_TYPE { NORMAL,FLAT};
-
-enum DIRECTION  {GO_LEFT,GO_RIGHT};
-
-//extern void DeleteRecordPool();
-class A2DKBOOLDLLEXP Bool_Engine;
-
-class A2DKBOOLDLLEXP Record
-{
-        protected:
-                                        Bool_Engine* _GC;
-	public:
-//					void deletepool();
-
-					Record(KBoolLink* link,Bool_Engine* GC);
-
-					~Record();
-
-//					void* operator new(size_t size);
-
-//					void operator delete(void* recordptr);
-
-					void SetNewLink(KBoolLink* link);
-
-					void Set_Flags();
-
-					void Calc_Ysp(Node* low);
-
-					KBoolLink* GetLink();
-
-					KBoolLine* GetLine();
-
-					B_INT	Ysp();
-
-					void SetYsp(B_INT ysp);
-
-					DIRECTION Direction();
-
-					bool Calc_Left_Right(Record* record_above_me);
-
-					bool Equal(Record*);
-
-	private:
-					KBoolLine   _line;
-
-					B_INT 		_ysp;
-
-               //! going left are right in beam
-					DIRECTION	_dir;    
-
-               //! how far in group_a
-               int         _a;               
-
-               //! how far in group_b
-               int         _b;               
-
-};
-
-#endif 

polygon/kbool/include/scanbeam.h

@@ -1,66 +0,0 @@
-/*! \file ../include/../scanbeam.h
-    \author Probably Klaas Holwerda
-
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
-
-    Licence: wxWidgets Licence
-
-    RCS-ID: $Id: scanbeam.h,v 1.2 2005/06/11 19:25:12 frm Exp $
-*/
-
-#ifndef SCANBEAM_H
-#define SCANBEAM_H
-
-#if defined(__GNUG__) && !defined(NO_GCC_PRAGMA)
-#pragma interface
-#endif
-
-#include "../include/booleng.h"
-#include "../include/_lnk_itr.h"
-
-#include "../include/record.h"
-#include "../include/link.h"
-
-enum SCANTYPE{NODELINK,LINKLINK,GENLR,LINKHOLES,INOUT};
-
-#if 0   // Kicad does dot use wxWidgets lib when building the kbool library
-        // but uses wxWidgets. So WXUSINGDLL could be defined in makefiles
-        // but must not be used when building kbool
-#if defined(WXUSINGDLL)
-template class A2DKBOOLDLLEXP DL_Iter<Record*>;
-#endif
-#endif
-
-class A2DKBOOLDLLEXP ScanBeam : public DL_List<Record*>
-{
-   protected:
-      Bool_Engine* _GC;
-
-	public:
-			ScanBeam(Bool_Engine* GC);
-			~ScanBeam();
-         void SetType(Node* low,Node* high);
-
-			bool  FindNew(SCANTYPE scantype,TDLI<KBoolLink>* _I, bool& holes );
-			bool  RemoveOld(SCANTYPE scantype,TDLI<KBoolLink>* _I, bool& holes );
-
-   private:
-
-			bool  ProcessHoles(bool atinsert,TDLI<KBoolLink>* _LI);
-         int	Process_LinkToLink_Crossings();			// find crossings
-			int 	Process_PointToLink_Crossings();
-			int 	Process_LinkToLink_Flat(KBoolLine* flatline);
-         void	SortTheBeam( bool backangle );
-			bool 	checksort();
-			bool 	writebeam();
-			void	Calc_Ysp();
-			//int 	FindCloseLinksAndCross(TDLI<KBoolLink>* _I,Node* _lowf);
-         void 	Generate_INOUT(int graphnumber);
-
-         Node*				  _low;
-         DL_Iter<Record*> _BI;
-         int 				  lastinserted;
-         BEAM_TYPE		  _type;
-};
-
-#endif 

polygon/kbool/infos_and_license.txt

@@ -1,10 +0,0 @@
-Boolean: GDSII viewer/editor + (boolean) operations on sets of 2d polygons.
-Boolean Web Site:
-http://boolean.klaasholwerda.nl/bool.html
-
-Copyright section form the site:
-The code is written by Klaas Holwerda,  it is free to use for non commercial open source projects licensed as GPL.
-
-Note:
-License info in kbool files:
-files are under wxWidget license

polygon/kbool/infos_kbool.txt

@@ -0,0 +1,7 @@
+Boolean: GDSII viewer/editor + (boolean) operations on sets of 2d polygons.
+Boolean Web Site:
+http://boolean.klaasholwerda.nl/bool.html
+
+kbool is also used in wxArt2D
+see www.wxart2d.org
+the last version of kbool can be found on this site.

polygon/kbool/kboollicense.txt

@@ -0,0 +1,684 @@
+The kbool library is dual licensed.
+The GPL applies for open source, but for commercial use it is proprietary.
+Contact copyright holder for more information on other licensing schemes.
+
+Software library is provided "AS IS" without warranty of any kind, conform point 16 and 17 down here.
+
+Next a copy of the GPL license text.
+
+==========================================================================
+
+       GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.

polygon/kbool/src/CMakeLists.txt

@@ -1,10 +1,11 @@
-if(WIN32)
+IF(WIN32)
-    add_definitions(-D_MSWVC_)
+    ADD_DEFINITIONS( -D_MSWVC_ )
-else(WIN32)
+ELSE(WIN32)
-    add_definitions(-D__UNIX__)
+    ADD_DEFINITIONS( -D__UNIX__  )
-endif(WIN32)
+ENDIF(WIN32)
 
-include_directories(${kbool_SOURCE_DIR}/include)
+
+include_directories(../include)
 
 set(KBOOL_SRCS
     booleng.cpp

polygon/kbool/src/booleng.cpp

@@ -1,111 +1,107 @@
-/*! \file kbool/src/booleng.cpp
+/*! \file src/booleng.cpp
-    \author Probably Klaas Holwerda
+    \author Klaas Holwerda
 
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
+    Copyright: 2001-2004 (C) Klaas Holwerda
 
-    Licence: wxWidgets Licence
+    Licence: see kboollicense.txt
 
-    RCS-ID: $Id: booleng.cpp,v 1.11 2005/05/24 19:13:38 titato Exp $
+    RCS-ID: $Id: booleng.cpp,v 1.3 2008/06/04 21:23:22 titato Exp $
 */
 
-#ifdef __GNUG__
+#include "kbool/booleng.h"
-#pragma implementation
-#endif
 
-#include <math.h>
 #include <time.h>
 
-#include "../include/booleng.h"
+#include "kbool/link.h"
-#include "../include/link.h"
+#include "kbool/line.h"
-#include "../include/line.h"
+#include "kbool/node.h"
-#include "../include/node.h"
+#include "kbool/graph.h"
-#include "../include/graph.h"
+#include "kbool/graphlst.h"
-#include "../include/graphlst.h"
 
-B_INT bmin(B_INT const value1, B_INT const value2)
+B_INT bmin( B_INT const value1, B_INT const value2 )
 {
-	return((value1 < value2) ? value1 : value2 );
+    return( ( value1 < value2 ) ? value1 : value2 );
 }
 
-B_INT bmax(B_INT const value1, B_INT const value2)
+B_INT bmax( B_INT const value1, B_INT const value2 )
 {
-	return((value1 > value2) ? value1 : value2 );
+    return( ( value1 > value2 ) ? value1 : value2 );
 }
 
-B_INT babs(B_INT a)
+B_INT babs( B_INT a )
 {
-   if (a < 0) a=-a;
+    if ( a < 0 ) a = -a;
-   return a;
+    return a;
 }
 
 //-------------------------------------------------------------------/
 //----------------- Bool_Engine_Error -------------------------------/
 //-------------------------------------------------------------------/
 
-Bool_Engine_Error::Bool_Engine_Error(const char* message, const char* header, int degree, int fatal)
+Bool_Engine_Error::Bool_Engine_Error( const char* message, const char* header, int degree, int fatal )
 {
-	_message = new char[LINELENGTH];
+    _message = new char[LINELENGTH];
-	_header  = new char[LINELENGTH];
+    _header  = new char[LINELENGTH];
-	if (message)
+    if ( message )
-		strcpy(_message, message);
+        strcpy( _message, message );
-	else
+    else
-		strcpy(_message,"non specified");
+        strcpy( _message, "non specified" );
 
-	if (header)
+    if ( header )
-		strcpy(_header, header);
+        strcpy( _header, header );
-	else
+    else
-		strcpy(_header,"non specified");
+        strcpy( _header, "non specified" );
 
-	_degree = degree;
+    _degree = degree;
-	_fatal = fatal;
+    _fatal = fatal;
 
 }
 
-Bool_Engine_Error::Bool_Engine_Error(const Bool_Engine_Error& a)
+Bool_Engine_Error::Bool_Engine_Error( const Bool_Engine_Error& a )
 {
-	_message = new char[LINELENGTH];
+    _message = new char[LINELENGTH];
-	_header  = new char[LINELENGTH];
+    _header  = new char[LINELENGTH];
-	if (a._message)
+    if ( a._message )
-		strcpy(_message, a._message);
+        strcpy( _message, a._message );
-	else
+    else
-		strcpy(_message,"non specified");
+        strcpy( _message, "non specified" );
 
-	if (a._header)
+    if ( a._header )
-		strcpy(_header, a._header);
+        strcpy( _header, a._header );
-	else
+    else
-		strcpy(_header,"non specified");
+        strcpy( _header, "non specified" );
 
-	_degree = a._degree;
+    _degree = a._degree;
-	_fatal = a._fatal;
+    _fatal = a._fatal;
 
 }
 
 Bool_Engine_Error::~Bool_Engine_Error()
 {
-	strcpy(_message,"");
+    strcpy( _message, "" );
-	strcpy(_header,"");
+    strcpy( _header, "" );
-	delete _message;
+    delete _message;
-	delete _header;
+    delete _header;
 }
 
 char* Bool_Engine_Error::GetErrorMessage()
 {
-	return _message;
+    return _message;
 }
 
 char* Bool_Engine_Error::GetHeaderMessage()
 {
-	return _header;
+    return _header;
 }
 
 int Bool_Engine_Error::GetErrorDegree()
 {
-	return _degree;
+    return _degree;
 }
 
 int Bool_Engine_Error::GetFatal()
 {
-	return _fatal;
+    return _fatal;
 }
 
 //-------------------------------------------------------------------/
@@ -114,91 +110,91 @@ int Bool_Engine_Error::GetFatal()
 
 Bool_Engine::Bool_Engine()
 {
-   _linkiter=new TDLI<KBoolLink>();
+    _linkiter = new TDLI<KBoolLink>();
-   m_intersectionruns = 1;
+    m_intersectionruns = 1;
 
-   m_orientationEntryMode = false;
+    m_orientationEntryMode = false;
-   m_doLinkHoles = true;
+    m_doLinkHoles = true;
 
-   m_graphlist = new GraphList(this);
+    m_graphlist = new GraphList( this );
-   m_ACCUR = 1e-4;
+    m_ACCUR = 1e-4;
-   m_WINDINGRULE = true;
+    m_WINDINGRULE = true;
-   m_GraphToAdd = NULL;
+    m_GraphToAdd = NULL;
-   m_firstNodeToAdd = NULL;
+    m_firstNodeToAdd = NULL;
-   m_lastNodeToAdd = NULL;
+    m_lastNodeToAdd = NULL;
 
-	m_logfile = NULL;
+    m_logfile = NULL;
 
 #if KBOOL_LOG == 1
-	SetLog( true );
+    SetLog( true );
 #else
-	SetLog( false );
+    SetLog( false );
 #endif
 }
 
 Bool_Engine::~Bool_Engine()
 {
-   if (m_logfile != NULL)
+    if ( m_logfile != NULL )
-       fclose (m_logfile);
+        fclose ( m_logfile );
 
-   delete _linkiter;
+    delete _linkiter;
-   delete m_graphlist;
+    delete m_graphlist;
 }
 
 void Bool_Engine::SetLog( bool OnOff )
 {
-	m_doLog = OnOff;
+    m_doLog = OnOff;
-   if ( m_doLog )
+    if ( m_doLog )
-	{
+    {
-		if ( m_logfile == NULL )
+        if ( m_logfile == NULL )
-		{
+        {
-		    // create a new logfile
+            // create a new logfile
-		    m_logfile = fopen(KBOOL_LOGFILE, "w");
+            m_logfile = fopen( KBOOL_LOGFILE, "w" );
-			if (m_logfile == NULL)
+            if ( m_logfile == NULL )
-				fprintf(stderr,"Bool_Engine: Unable to write to Boolean Engine logfile\n");
+                fprintf( stderr, "Bool_Engine: Unable to write to Boolean Engine logfile\n" );
-			else
+            else
-			{
+            {
-            time_t timer;
+                time_t timer;
-	         struct tm * today;
+                struct tm * today;
-	         timer = time(NULL);
+                timer = time( NULL );
-	         today = localtime(&timer);
+                today = localtime( &timer );
 
-            fprintf(m_logfile, "Logfile created on:\t\t\t%s", ctime( &timer ) );
+                fprintf( m_logfile, "Logfile created on:\t\t\t%s", ctime( &timer ) );
-			}
+            }
-		}
+        }
-	}
+    }
-	else 
+    else
-	{
+    {
-	   if (m_logfile != NULL)
+        if ( m_logfile != NULL )
-      {      
+        {
-		   fclose (m_logfile);
+            fclose ( m_logfile );
-         m_logfile = NULL;
+            m_logfile = NULL;
-      }
+        }
-	}
+    }
 }
 
 void Bool_Engine::SetState( const char* process )
 {
-   Write_Log(process);
+    Write_Log( process );
 }
 
-void Bool_Engine::error(const char *text,const char *title)
+void Bool_Engine::error( const char *text, const char *title )
 {
-   Write_Log("FATAL ERROR: ", title);
+    Write_Log( "FATAL ERROR: ", title );
-   Write_Log("FATAL ERROR: ", text);
+    Write_Log( "FATAL ERROR: ", text );
-   throw Bool_Engine_Error(" Fatal Error", "Fatal Error", 9, 1);
+    throw Bool_Engine_Error( " Fatal Error", "Fatal Error", 9, 1 );
 };
 
-void Bool_Engine::info(const char *text, const char *title)
+void Bool_Engine::info( const char *text, const char *title )
 {
-   Write_Log("FATAL ERROR: ", title);
+    Write_Log( "FATAL ERROR: ", title );
-   Write_Log("FATAL ERROR: ", text);
+    Write_Log( "FATAL ERROR: ", text );
 };
 
-void Bool_Engine::SetMarge(double marge)
+void Bool_Engine::SetMarge( double marge )
 {
     m_MARGE = marge;
-    Write_Log("Bool_Engine::m_MARGE = %f\n", m_MARGE);
+    Write_Log( "Bool_Engine::m_MARGE = %f\n", m_MARGE );
 }
 
 double Bool_Engine::GetAccur()
@@ -206,10 +202,10 @@ double Bool_Engine::GetAccur()
     return m_ACCUR;
 }
 
-void Bool_Engine::SetRoundfactor(double roundfac)
+void Bool_Engine::SetRoundfactor( double roundfac )
 {
     m_ROUNDFACTOR = roundfac;
-    Write_Log("Bool_Engine::m_ROUNDFACTOR = %f\n", m_ROUNDFACTOR);
+    Write_Log( "Bool_Engine::m_ROUNDFACTOR = %f\n", m_ROUNDFACTOR );
 }
 
 double Bool_Engine::GetRoundfactor()
@@ -222,10 +218,10 @@ double Bool_Engine::GetMarge()
     return m_MARGE;
 }
 
-void Bool_Engine::SetDGrid(double dgrid)
+void Bool_Engine::SetDGrid( double dgrid )
 {
     m_DGRID = dgrid;
-    Write_Log("Bool_Engine::m_DGRID = %f\n", m_DGRID);
+    Write_Log( "Bool_Engine::m_DGRID = %f\n", m_DGRID );
 }
 
 double Bool_Engine::GetDGrid()
@@ -233,10 +229,10 @@ double Bool_Engine::GetDGrid()
     return m_DGRID;
 }
 
-void Bool_Engine::SetGrid(B_INT grid)
+void Bool_Engine::SetGrid( B_INT grid )
 {
     m_GRID = grid;
-    Write_Log("Bool_Engine::m_GRID = %lld\n", m_GRID);
+    Write_Log( "Bool_Engine::m_GRID = %lld\n", m_GRID );
 }
 
 B_INT Bool_Engine::GetGrid()
@@ -244,10 +240,10 @@ B_INT Bool_Engine::GetGrid()
     return m_GRID;
 }
 
-void Bool_Engine::SetCorrectionAber(double aber)
+void Bool_Engine::SetCorrectionAber( double aber )
 {
     m_CORRECTIONABER = aber;
-    Write_Log("Bool_Engine::m_CORRECTIONABER = %f\n", m_CORRECTIONABER);
+    Write_Log( "Bool_Engine::m_CORRECTIONABER = %f\n", m_CORRECTIONABER );
 }
 
 double Bool_Engine::GetCorrectionAber()
@@ -255,10 +251,10 @@ double Bool_Engine::GetCorrectionAber()
     return m_CORRECTIONABER;
 }
 
-void Bool_Engine::SetCorrectionFactor(double aber)
+void Bool_Engine::SetCorrectionFactor( double aber )
 {
     m_CORRECTIONFACTOR = aber;
-    Write_Log("Bool_Engine::m_CORRECTIONFACTOR = %f\n", m_CORRECTIONFACTOR );
+    Write_Log( "Bool_Engine::m_CORRECTIONFACTOR = %f\n", m_CORRECTIONFACTOR );
 }
 
 double Bool_Engine::GetCorrectionFactor()
@@ -266,10 +262,10 @@ double Bool_Engine::GetCorrectionFactor()
     return m_CORRECTIONFACTOR;
 }
 
-void Bool_Engine::SetSmoothAber(double aber)
+void Bool_Engine::SetSmoothAber( double aber )
 {
     m_SMOOTHABER = aber;
-    Write_Log("Bool_Engine::m_SMOOTHABER = %f\n",m_SMOOTHABER );
+    Write_Log( "Bool_Engine::m_SMOOTHABER = %f\n", m_SMOOTHABER );
 }
 
 double Bool_Engine::GetSmoothAber()
@@ -277,10 +273,10 @@ double Bool_Engine::GetSmoothAber()
     return m_SMOOTHABER;
 }
 
-void Bool_Engine::SetMaxlinemerge(double maxline)
+void Bool_Engine::SetMaxlinemerge( double maxline )
 {
     m_MAXLINEMERGE = maxline;
-    Write_Log("Bool_Engine::m_MAXLINEMERGE = %f\n",m_MAXLINEMERGE );
+    Write_Log( "Bool_Engine::m_MAXLINEMERGE = %f\n", m_MAXLINEMERGE );
 }
 
 double Bool_Engine::GetMaxlinemerge()
@@ -288,7 +284,7 @@ double Bool_Engine::GetMaxlinemerge()
     return m_MAXLINEMERGE;
 }
 
-void Bool_Engine::SetWindingRule(bool rule)
+void Bool_Engine::SetWindingRule( bool rule )
 {
     m_WINDINGRULE = rule;
 }
@@ -301,226 +297,226 @@ bool Bool_Engine::GetWindingRule()
 
 void Bool_Engine::SetInternalMarge( B_INT marge )
 {
-   m_MARGE = (double)marge/m_GRID/m_DGRID;
+    m_MARGE = ( double )marge / m_GRID / m_DGRID;
 }
 
 B_INT Bool_Engine::GetInternalMarge()
 {
-   return (B_INT) ( m_MARGE*m_GRID*m_DGRID );
+    return ( B_INT ) ( m_MARGE * m_GRID * m_DGRID );
 }
 
 double Bool_Engine::GetInternalCorrectionAber()
 {
-   return  m_CORRECTIONABER*m_GRID*m_DGRID;
+    return  m_CORRECTIONABER * m_GRID * m_DGRID;
 }
 
 double Bool_Engine::GetInternalCorrectionFactor()
 {
-   return m_CORRECTIONFACTOR*m_GRID*m_DGRID;
+    return m_CORRECTIONFACTOR * m_GRID * m_DGRID;
 }
 
 double Bool_Engine::GetInternalSmoothAber()
 {
-   return m_SMOOTHABER*m_GRID*m_DGRID;
+    return m_SMOOTHABER * m_GRID * m_DGRID;
 }
 
 B_INT Bool_Engine::GetInternalMaxlinemerge()
 {
-   return (B_INT) ( m_MAXLINEMERGE*m_GRID*m_DGRID );
+    return ( B_INT ) ( m_MAXLINEMERGE * m_GRID * m_DGRID );
 }
 
 #define TRIALS 30
 
-bool Bool_Engine::Do_Operation(BOOL_OP operation)
+bool Bool_Engine::Do_Operation( BOOL_OP operation )
 {
 
 #if KBOOL_DEBUG
-   GraphList* saveme = new GraphList( m_graphlist );
+    GraphList * saveme = new GraphList( m_graphlist );
 #endif
 
-   try 
+    try
-   {
+    {
-      switch (operation)
+        switch ( operation )
-      {
+        {
-         case (BOOL_OR):
+            case ( BOOL_OR ):
-         case (BOOL_AND):
+                        case ( BOOL_AND ):
-         case (BOOL_EXOR):
+                            case ( BOOL_EXOR ):
-         case (BOOL_A_SUB_B):
+                                case ( BOOL_A_SUB_B ):
-         case (BOOL_B_SUB_A):
+                                    case ( BOOL_B_SUB_A ):
-            m_graphlist->Boolean(operation, m_intersectionruns);
+                                            m_graphlist->Boolean( operation, m_intersectionruns );
-            break;
+                break;
-         case (BOOL_CORRECTION):
+            case ( BOOL_CORRECTION ):
-            m_graphlist->Correction();
+                            m_graphlist->Correction();
-            break;
+                break;
-         case (BOOL_MAKERING):
+            case ( BOOL_MAKERING ):
-            m_graphlist->MakeRings();
+                            m_graphlist->MakeRings();
-            break;
+                break;
-         case (BOOL_SMOOTHEN):
+            case ( BOOL_SMOOTHEN ):
-            m_graphlist->Smoothen( GetInternalSmoothAber() );
+                            m_graphlist->Smoothen( GetInternalSmoothAber() );
-            break;
+                break;
-         default:
+            default:
-         {
+    {
-	         error("Wrong operation","Command Error");
+                error( "Wrong operation", "Command Error" );
-	         return false;
+                return false;
-         }
+            }
-      }
+        }
-   }
+    }
-	catch (Bool_Engine_Error& error)
+    catch ( Bool_Engine_Error & error )
-	{
+    {
 
 #if KBOOL_DEBUG
-      delete m_graphlist;
+        delete m_graphlist;
-      m_graphlist = new GraphList( saveme );
+        m_graphlist = new GraphList( saveme );
-      m_graphlist->WriteGraphsKEY(this);
+        m_graphlist->WriteGraphsKEY( this );
 #endif
 
-	   if (m_logfile != NULL)
+        if ( m_logfile != NULL )
-      {      
+        {
-		   fclose (m_logfile);
+            fclose ( m_logfile );
-         m_logfile = NULL;
+            m_logfile = NULL;
-      }
+        }
 
-      info(error.GetErrorMessage(), "error");
+        info( error.GetErrorMessage(), "error" );
-		throw error;
+        throw error;
-	}
+    }
-   catch(...)
+    catch( ... )
-   {
+    {
 
 #if KBOOL_DEBUG
-      delete m_graphlist;
+        delete m_graphlist;
-      m_graphlist = new GraphList( saveme );
+        m_graphlist = new GraphList( saveme );
-      m_graphlist->WriteGraphsKEY(this);
+        m_graphlist->WriteGraphsKEY( this );
 #endif
 
-	   if (m_logfile != NULL)
+        if ( m_logfile != NULL )
-      {      
+        {
-		   fclose (m_logfile);
+            fclose ( m_logfile );
-         m_logfile = NULL;
+            m_logfile = NULL;
-      }
+        }
 
-      info("Unknown exception", "error");
+        info( "Unknown exception", "error" );
-		throw ;
+        throw ;
-   }
+    }
 
 #if KBOOL_DEBUG
-   delete saveme;
+    delete saveme;
 #endif
 
-   return true;
+    return true;
 }
 
-bool Bool_Engine::StartPolygonAdd(GroupType A_or_B)
+bool Bool_Engine::StartPolygonAdd( GroupType A_or_B )
 {
 #if KBOOL_DEBUG
-    if (m_logfile != NULL)
+    if ( m_logfile != NULL )
-   	fprintf(m_logfile, "-> StartPolygonAdd(%d)\n", A_or_B);
+        fprintf( m_logfile, "-> StartPolygonAdd(%d)\n", A_or_B );
 #endif
-    if (m_GraphToAdd != NULL)
+    if ( m_GraphToAdd != NULL )
-      return false;
+        return false;
 
-    Graph *myGraph = new Graph(this);
+    Graph *myGraph = new Graph( this );
-    m_graphlist->insbegin(myGraph);
+    m_graphlist->insbegin( myGraph );
     m_GraphToAdd = myGraph;
     m_groupType = A_or_B;
 
     return true;
 }
 
-bool Bool_Engine::AddPoint(double x, double y)
+bool Bool_Engine::AddPoint( double x, double y )
 {
-   if (m_GraphToAdd == NULL){return false;}
+    if ( m_GraphToAdd == NULL ){return false;}
 
-   double scaledx = x * m_DGRID * m_GRID;
+    double scaledx = x * m_DGRID * m_GRID;
-   double scaledy = y * m_DGRID * m_GRID;
+    double scaledy = y * m_DGRID * m_GRID;
 
-   if ( scaledx > MAXB_INT  || scaledx < MINB_INT )
+    if ( scaledx > MAXB_INT  || scaledx < MINB_INT )
-      error("X coordinate of vertex to big", "" );
+        error( "X coordinate of vertex to big", "" );
-   if ( scaledy > MAXB_INT || scaledy < MINB_INT )
+    if ( scaledy > MAXB_INT || scaledy < MINB_INT )
-      error("Y coordinate of vertex to big", "" );
+        error( "Y coordinate of vertex to big", "" );
 
 
-   B_INT rintx = ((B_INT) (x * m_DGRID)) * m_GRID;
+    B_INT rintx = ( ( B_INT ) ( x * m_DGRID ) ) * m_GRID;
-   B_INT rinty = ((B_INT) (y * m_DGRID)) * m_GRID;
+    B_INT rinty = ( ( B_INT ) ( y * m_DGRID ) ) * m_GRID;
-   Node *myNode = new Node( rintx, rinty, this );
+    Node *myNode = new Node( rintx, rinty, this );
 
     // adding first point to graph
-   if (m_firstNodeToAdd == NULL)
+    if ( m_firstNodeToAdd == NULL )
-   {
+    {
 #if KBOOL_DEBUG
-      if (m_logfile != NULL)
+        if ( m_logfile != NULL )
-      {
+        {
-		   fprintf(m_logfile, "-> AddPt() *FIRST* :");
+            fprintf( m_logfile, "-> AddPt() *FIRST* :" );
-		   fprintf(m_logfile, " input: x = %f, y = %f\n", x, y);
+            fprintf( m_logfile, " input: x = %f, y = %f\n", x, y );
-		   fprintf(m_logfile, " input: x = %I64d, y = %I64d\n", rintx, rinty) ;
+            fprintf( m_logfile, " input: x = %I64d, y = %I64d\n", rintx, rinty ) ;
-      }
+        }
 #endif
 
-		m_firstNodeToAdd = (Node *) myNode;
+        m_firstNodeToAdd = ( Node * ) myNode;
-		m_lastNodeToAdd  = (Node *) myNode;
+        m_lastNodeToAdd  = ( Node * ) myNode;
-   }
+    }
-   else
+    else
-   {
+    {
 #if KBOOL_DEBUG
-      if (m_logfile != NULL)
+        if ( m_logfile != NULL )
-      {
+        {
-   		fprintf(m_logfile, "-> AddPt():");
+            fprintf( m_logfile, "-> AddPt():" );
-	   	fprintf(m_logfile, " input: x = %f, y = %f\n", x, y);
+            fprintf( m_logfile, " input: x = %f, y = %f\n", x, y );
-		   fprintf(m_logfile, " input: x = %I64d, y = %I64d\n", rintx, rinty) ;
+            fprintf( m_logfile, " input: x = %I64d, y = %I64d\n", rintx, rinty ) ;
-      }
+        }
 #endif
 
-		m_GraphToAdd->AddLink(m_lastNodeToAdd, myNode);
+        m_GraphToAdd->AddLink( m_lastNodeToAdd, myNode );
-		m_lastNodeToAdd = (Node *) myNode;
+        m_lastNodeToAdd = ( Node * ) myNode;
-   }
+    }
 
-   return true;
+    return true;
 }
 
 bool Bool_Engine::EndPolygonAdd()
 {
-   if (m_GraphToAdd == NULL) {return false;}
+    if ( m_GraphToAdd == NULL ) {return false;}
 
-   m_GraphToAdd->AddLink(m_lastNodeToAdd, m_firstNodeToAdd);
+    m_GraphToAdd->AddLink( m_lastNodeToAdd, m_firstNodeToAdd );
-   m_GraphToAdd->SetGroup(m_groupType);
+    m_GraphToAdd->SetGroup( m_groupType );
-   m_GraphToAdd = NULL;
+    m_GraphToAdd = NULL;
-   m_lastNodeToAdd  = NULL;
+    m_lastNodeToAdd  = NULL;
-   m_firstNodeToAdd = NULL;
+    m_firstNodeToAdd = NULL;
 
-   return true;
+    return true;
 }
 
 bool Bool_Engine::StartPolygonGet()
 {
-   if (!m_graphlist->empty())
+    if ( !m_graphlist->empty() )
-   {
+    {
-      m_getGraph = (Graph*) m_graphlist->headitem();
+        m_getGraph = ( Graph* ) m_graphlist->headitem();
-      m_getLink  = m_getGraph->GetFirstLink();
+        m_getLink  = m_getGraph->GetFirstLink();
-      m_getNode  = m_getLink->GetBeginNode();
+        m_getNode  = m_getLink->GetBeginNode();
-      m_numPtsInPolygon = m_getGraph->GetNumberOfLinks();
+        m_numPtsInPolygon = m_getGraph->GetNumberOfLinks();
-      m_numNodesVisited = 0;
+        m_numNodesVisited = 0;
-      return true;
+        return true;
-   } 
+    }
-   else
+    else
-   {
+    {
-      return false;
+        return false;
-   }
+    }
 }
 
 bool Bool_Engine::PolygonHasMorePoints()
 {
     // see if first point
-    if (m_numNodesVisited == 0)
+    if ( m_numNodesVisited == 0 )
     {
         // don't need to touch the m_getNode
         m_numNodesVisited++;
         return true;
     }
 
-    if (m_numNodesVisited < m_numPtsInPolygon)
+    if ( m_numNodesVisited < m_numPtsInPolygon )
     {
         // traverse to the next node
-        m_getNode = m_getLink->GetOther(m_getNode);
+        m_getNode = m_getLink->GetOther( m_getNode );
-        m_getLink = m_getLink->Forth(m_getNode);
+        m_getLink = m_getLink->Forth( m_getNode );
 
         m_numNodesVisited++;
         return true;
@@ -539,26 +535,26 @@ void Bool_Engine::EndPolygonGet()
 
 double Bool_Engine::GetPolygonXPoint()
 {
-    return m_getNode->GetX()/m_GRID/m_DGRID;
+    return m_getNode->GetX() / m_GRID / m_DGRID;
 }
 
 double Bool_Engine::GetPolygonYPoint()
 {
-    return m_getNode->GetY()/m_GRID/m_DGRID;
+    return m_getNode->GetY() / m_GRID / m_DGRID;
 }
 
 bool Bool_Engine::GetHoleSegment()
 {
-     if (m_getLink->GetHole())
+    if ( m_getLink->GetHole() )
-		 return true;
+        return true;
-	 return false;
+    return false;
 }
 
 bool Bool_Engine::GetHoleConnectionSegment()
 {
-     if (m_getLink->GetHoleLink())
+    if ( m_getLink->GetHoleLink() )
-		 return true;
+        return true;
-	 return false;
+    return false;
 }
 
 kbEdgeType Bool_Engine::GetPolygonPointEdgeType()
@@ -575,34 +571,34 @@ kbEdgeType Bool_Engine::GetPolygonPointEdgeType()
 }
 
 
-void Bool_Engine::Write_Log(const char *msg1)
+void Bool_Engine::Write_Log( const char *msg1 )
 {
-   if (m_logfile == NULL)
+    if ( m_logfile == NULL )
-       return;
+        return;
 
-   fprintf(m_logfile,"%s \n",msg1);
+    fprintf( m_logfile, "%s \n", msg1 );
 }
 
-void Bool_Engine::Write_Log(const char *msg1, const char*msg2)
+void Bool_Engine::Write_Log( const char *msg1, const char*msg2 )
 {
-   if (m_logfile == NULL)
+    if ( m_logfile == NULL )
-       return;
+        return;
 
-   fprintf(m_logfile,"%s %s\n",msg1, msg2);
+    fprintf( m_logfile, "%s %s\n", msg1, msg2 );
 }
 
-void Bool_Engine::Write_Log(const char *fmt, double dval)
+void Bool_Engine::Write_Log( const char *fmt, double dval )
 {
-   if (m_logfile == NULL)
+    if ( m_logfile == NULL )
-       return;
+        return;
 
-   fprintf(m_logfile,fmt,dval);
+    fprintf( m_logfile, fmt, dval );
 }
 
-void Bool_Engine::Write_Log(const char *fmt, B_INT bval)
+void Bool_Engine::Write_Log( const char *fmt, B_INT bval )
 {
-   if (m_logfile == NULL)
+    if ( m_logfile == NULL )
-       return;
+        return;
 
-   fprintf(m_logfile,fmt,bval);
+    fprintf( m_logfile, fmt, bval );
 }

polygon/kbool/src/graphlst.cpp

@@ -1,97 +1,93 @@
-/*! \file ../src/graphlst.cpp
+/*! \file src/graphlst.cpp
     \brief Implements a list of graphs
-    \author Probably Klaas Holwerda 
+    \author Klaas Holwerda 
  
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda 
+    Copyright: 2001-2004 (C) Klaas Holwerda 
  
-    Licence: wxWidgets Licence
+    Licence: see kboollicense.txt 
  
-    RCS-ID: $Id: graphlst.cpp,v 1.8 2005/05/24 19:13:38 titato Exp $
+    RCS-ID: $Id: graphlst.cpp,v 1.3 2008/06/04 21:23:22 titato Exp $
 */
 
-#ifdef __GNUG__
-#pragma implementation 
-#endif
-
 //#include "debugdrv.h"
-#include "../include/booleng.h"
+#include "kbool/booleng.h"
-#include "../include/graphlst.h"
+#include "kbool/graphlst.h"
 
 //extern Debug_driver* _debug_driver;
 //this here is to initialize the static iterator of graphlist
 //with NOLIST constructor
 
-int 	graphsorterX( Graph *, Graph * );
+int  graphsorterX( Graph *, Graph * );
-int 	graphsorterY( Graph *, Graph * );
+int  graphsorterY( Graph *, Graph * );
 
-GraphList::GraphList(Bool_Engine* GC) 
+GraphList::GraphList( Bool_Engine* GC )
 {
-   _GC=GC;
+    _GC = GC;
 }
 
 GraphList::GraphList( GraphList* other )
 {
-   _GC = other->_GC;
+    _GC = other->_GC;
 
-   TDLI<Graph> _LI = TDLI<Graph>( other );
+    TDLI<Graph> _LI = TDLI<Graph>( other );
-	_LI.tohead();
+    _LI.tohead();
-	while (!_LI.hitroot())
+    while ( !_LI.hitroot() )
-	{
+    {
-      insend( new Graph( _LI.item() ) );
+        insend( new Graph( _LI.item() ) );
-		_LI++;
+        _LI++;
-	}
+    }
 }
 
 GraphList::~GraphList()
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	//first empty the graph
+    //first empty the graph
-	_LI.delete_all();
+    _LI.delete_all();
 }
 
 //prepare the graphlist for the boolean operations
 //group all graphs into ONE graph
-void GraphList::Prepare(Graph* total)
+void GraphList::Prepare( Graph* total )
 {
-   if (empty())
+    if ( empty() )
-      return;
+        return;
 
-   //round to grid and put in one graph
+    //round to grid and put in one graph
-	_GC->SetState("Simplify");
+    _GC->SetState( "Simplify" );
 
-	// Simplify all graphs in the list
+    // Simplify all graphs in the list
-	Simplify( (double) _GC->GetGrid() );
+    Simplify( ( double ) _GC->GetGrid() );
 
-   if ( ! _GC->GetOrientationEntryMode() )
+    if ( ! _GC->GetOrientationEntryMode() )
-   {
+    {
-      TDLI<Graph> _LI=TDLI<Graph>(this);
+        TDLI<Graph> _LI = TDLI<Graph>( this );
-      _LI.tohead();
+        _LI.tohead();
-      while (!_LI.hitroot())
+        while ( !_LI.hitroot() )
-      {
+        {
-			_LI.item()->MakeClockWise();
+            _LI.item()->MakeClockWise();
-         _LI++;
+            _LI++;
-      }
+        }
-   }
+    }
 
-	Renumber();
+    Renumber();
 
-	//the graplist contents will be transferred to one graph
+    //the graplist contents will be transferred to one graph
-	MakeOneGraph(total);
+    MakeOneGraph( total );
 }
 
 // the function will make from all the graphs in the graphlist one graph,
 // simply by throwing all the links in one graph, the graphnumbers will
 // not be changed
-void GraphList::MakeOneGraph(Graph* total)
+void GraphList::MakeOneGraph( Graph* total )
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	_LI.tohead();
+    _LI.tohead();
-	while(!_LI.hitroot())
+    while( !_LI.hitroot() )
-	{
+    {
-		total->TakeOver(_LI.item());
+        total->TakeOver( _LI.item() );
-		delete _LI.item();
+        delete _LI.item();
-		_LI.remove();
+        _LI.remove();
-	}
+    }
 }
 
 //
@@ -99,85 +95,85 @@ void GraphList::MakeOneGraph(Graph* total)
 //
 void GraphList::Renumber()
 {
-   if ( _GC->GetOrientationEntryMode() )
+    if ( _GC->GetOrientationEntryMode() )
-   {
+    {
-      TDLI<Graph> _LI=TDLI<Graph>(this);
+        TDLI<Graph> _LI = TDLI<Graph>( this );
-	   _LI.tohead();
+        _LI.tohead();
-	   while (!_LI.hitroot())
+        while ( !_LI.hitroot() )
-	   {
+        {
-         if ( _LI.item()->GetFirstLink()->Group() == GROUP_A )
+            if ( _LI.item()->GetFirstLink()->Group() == GROUP_A )
-		      _LI.item()->SetNumber(1);
+                _LI.item()->SetNumber( 1 );
-         else
+            else
-		      _LI.item()->SetNumber(2);
+                _LI.item()->SetNumber( 2 );
-		   _LI++;
+            _LI++;
-	   }
+        }
-   }
+    }
-   else
+    else
-   {
+    {
-	   unsigned int Number = 1;
+        unsigned int Number = 1;
-      TDLI<Graph> _LI=TDLI<Graph>(this);
+        TDLI<Graph> _LI = TDLI<Graph>( this );
-	   _LI.tohead();
+        _LI.tohead();
-	   while (!_LI.hitroot())
+        while ( !_LI.hitroot() )
-	   {
+        {
-		   _LI.item()->SetNumber(Number++);
+            _LI.item()->SetNumber( Number++ );
-		   _LI++;
+            _LI++;
-	   }
+        }
-   }
+    }
 }
 
 
 // Simplify the graphs
-void GraphList::Simplify(double marge)
+void GraphList::Simplify( double marge )
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	_LI.foreach_mf(&Graph::Reset_Mark_and_Bin);
+    _LI.foreach_mf( &Graph::Reset_Mark_and_Bin );
 
-	_LI.tohead();
+    _LI.tohead();
-	while (!_LI.hitroot())
+    while ( !_LI.hitroot() )
-	{
+    {
-		if (_LI.item()->Simplify( (B_INT) marge))
+        if ( _LI.item()->Simplify( ( B_INT ) marge ) )
-      { 
+        {
-			if (_LI.item()->GetNumberOfLinks() < 3)
+            if ( _LI.item()->GetNumberOfLinks() < 3 )
-				// delete this graph from the graphlist
+                // delete this graph from the graphlist
-         {
+            {
-            delete _LI.item();
+                delete _LI.item();
-            _LI.remove();
+                _LI.remove();
-         }
+            }
-      }
+        }
-		else
+        else
-			_LI++;
+            _LI++;
-	}
+    }
 }
 
 // Smoothen the graphs
-void GraphList::Smoothen(double marge)
+void GraphList::Smoothen( double marge )
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	_LI.foreach_mf(&Graph::Reset_Mark_and_Bin);
+    _LI.foreach_mf( &Graph::Reset_Mark_and_Bin );
 
-	_LI.tohead();
+    _LI.tohead();
-	while (!_LI.hitroot())
+    while ( !_LI.hitroot() )
-	{
+    {
-		if (_LI.item()->Smoothen( (B_INT) marge))
+        if ( _LI.item()->Smoothen( ( B_INT ) marge ) )
-      {
+        {
-			if (_LI.item()->GetNumberOfLinks() < 3)
+            if ( _LI.item()->GetNumberOfLinks() < 3 )
-			// delete this graph from the graphlist
+                // delete this graph from the graphlist
-         {
+            {
-            delete _LI.item();
+                delete _LI.item();
-            _LI.remove();
+                _LI.remove();
-         }
+            }
-      }
+        }
-		else
+        else
-			_LI++;
+            _LI++;
-	}
+    }
 }
 
 
 // Turn off all markers in all the graphs
 void GraphList::UnMarkAll()
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	_LI.foreach_mf(&Graph::Reset_Mark_and_Bin);
+    _LI.foreach_mf( &Graph::Reset_Mark_and_Bin );
 }
 
 //==============================================================================
@@ -188,209 +184,209 @@ void GraphList::UnMarkAll()
 
 void GraphList::Correction()
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	int todo=_LI.count();
+    int todo = _LI.count();
 
-   if ( _GC->GetInternalCorrectionFactor()) //not zero
+    if ( _GC->GetInternalCorrectionFactor() ) //not zero
-   {
+    {
-      _LI.tohead();
+        _LI.tohead();
-      for(int i=0; i<todo ; i++)
+        for( int i = 0; i < todo ; i++ )
-      {
+        {
-         //the input graph will be empty in the end
+            //the input graph will be empty in the end
-         GraphList *_correct=new GraphList(_GC);
+            GraphList *_correct = new GraphList( _GC );
-         {
+            {
+                _LI.item()->MakeClockWise();
+                _LI.item()->Correction( _correct, _GC->GetInternalCorrectionFactor() );
+
+                delete _LI.item();
+                _LI.remove();
+
+                //move corrected graphlist to result
+                while ( !_correct->empty() )
+                {
+                    //add to end
+                    _LI.insend( ( Graph* )_correct->headitem() );
+                    _correct->removehead();
+                }
+            }
+            delete _correct;
+        }
+    }
+}
+
+void GraphList::MakeRings()
+{
+    TDLI<Graph> _LI = TDLI<Graph>( this );
+    int todo = _LI.count();
+
+    _LI.tohead();
+    for( int i = 0; i < todo ; i++ )
+    {
+        //the input graph will be empty in the end
+        GraphList *_ring = new GraphList( _GC );
+        {
             _LI.item()->MakeClockWise();
-            _LI.item()->Correction(_correct,_GC->GetInternalCorrectionFactor());
+            _LI.item()->MakeRing( _ring, _GC->GetInternalCorrectionFactor() );
 
             delete _LI.item();
             _LI.remove();
 
-            //move corrected graphlist to result
+            //move created rings graphs to this
-            while (!_correct->empty())
+            while ( !_ring->empty() )
             {
-               //add to end
+                //add to end
-               _LI.insend((Graph*)_correct->headitem());
+                ( ( Graph* )_ring->headitem() )->MakeClockWise();
-               _correct->removehead();
+                _LI.insend( ( Graph* )_ring->headitem() );
+                _ring->removehead();
             }
-         }
+        }
-         delete _correct;
+        delete _ring;
-      }
+    }
-   }  
-   }
-
-void GraphList::MakeRings()
-{
-   TDLI<Graph> _LI=TDLI<Graph>(this);
-	int todo=_LI.count();
-
-	_LI.tohead();
-	for(int i=0; i<todo ; i++)
-	{
-		//the input graph will be empty in the end
-		GraphList *_ring=new GraphList(_GC);
-		{
-			_LI.item()->MakeClockWise();
-			_LI.item()->MakeRing(_ring,_GC->GetInternalCorrectionFactor());
-
-         delete _LI.item();
-			_LI.remove();
-
-			//move created rings graphs to this
-			while (!_ring->empty())
-			{
-				//add to end
-				((Graph*)_ring->headitem())->MakeClockWise();
-				_LI.insend((Graph*)_ring->headitem());
-				_ring->removehead();
-			}
-		}
-		delete _ring;
-	}
 
 }
 
 //merge the graphs in the list and return the merged result
 void GraphList::Merge()
 {
-   if (count()<=1)
+    if ( count() <= 1 )
-      return;
+        return;
 
-   {
+    {
-      TDLI<Graph> _LI=TDLI<Graph>(this);
+        TDLI<Graph> _LI = TDLI<Graph>( this );
-      _LI.tohead();
+        _LI.tohead();
-      while (!_LI.hitroot())
+        while ( !_LI.hitroot() )
-      {
+        {
-         _LI.item()->SetGroup(GROUP_A);
+            _LI.item()->SetGroup( GROUP_A );
-         _LI++;
+            _LI++;
-      }
+        }
-   }
+    }
 
-   Graph* _tomerge=new Graph(_GC);
+    Graph* _tomerge = new Graph( _GC );
 
-   Renumber();
+    Renumber();
 
-   //the graplist contents will be transferred to one graph
+    //the graplist contents will be transferred to one graph
-   MakeOneGraph(_tomerge);
+    MakeOneGraph( _tomerge );
-   //the original is empty now
+    //the original is empty now
 
-   _tomerge->Prepare(1);
+    _tomerge->Prepare( 1 );
-   _tomerge->Boolean(BOOL_OR,this);
+    _tomerge->Boolean( BOOL_OR, this );
 
-	delete _tomerge;
+    delete _tomerge;
 }
 
 #define TRIALS 30
 #define SAVEME 1
 
 //perform boolean operation on the graphs in the list
-void GraphList::Boolean(BOOL_OP operation, int intersectionRunsMax )
+void GraphList::Boolean( BOOL_OP operation, int intersectionRunsMax )
 {
-	_GC->SetState("Performing Boolean Operation");
+    _GC->SetState( "Performing Boolean Operation" );
 
-   if (count()==0)
+    if ( count() == 0 )
-         return;
+        return;
 
-	Graph* _prepared = new Graph(_GC);
+    Graph* _prepared = new Graph( _GC );
 
-   if (empty())
+    if ( empty() )
-      return;
+        return;
 
-   //round to grid and put in one graph
+    //round to grid and put in one graph
-	_GC->SetState("Simplify");
+    _GC->SetState( "Simplify" );
 
-   int intersectionruns = 1;
+    int intersectionruns = 1;
 
-   while ( intersectionruns <= intersectionRunsMax )
+    while ( intersectionruns <= intersectionRunsMax )
-   {
+    {
-      try
+        try
-	   {
+        {
-         Prepare( _prepared );
+            Prepare( _prepared );
 
-         if (_prepared->GetNumberOfLinks())
+            if ( _prepared->GetNumberOfLinks() )
-         {
+            {
-            //calculate intersections etc.
+                //calculate intersections etc.
-            _GC->SetState("prepare");
+                _GC->SetState( "prepare" );
-            _prepared->Prepare( intersectionruns );
+                _prepared->Prepare( intersectionruns );
-            //_prepared->writegraph(true);
+                //_prepared->writegraph(true);
-            _prepared->Boolean(operation,this);
+                _prepared->Boolean( operation, this );
-         }
+            }
-         intersectionruns = intersectionRunsMax +1;
+            intersectionruns = intersectionRunsMax + 1;
-      }
+        }
-	   catch (Bool_Engine_Error& error)
+        catch ( Bool_Engine_Error & error )
-	   {
+        {
 #if KBOOL_DEBUG
-         _prepared->WriteGraphKEY(_GC);
+            _prepared->WriteGraphKEY( _GC );
 #endif
-         intersectionruns++;
+            intersectionruns++;
-         if ( intersectionruns == intersectionRunsMax )
+            if ( intersectionruns == intersectionRunsMax )
-         {
+            {
-            _prepared->WriteGraphKEY(_GC);
+                _prepared->WriteGraphKEY( _GC );
-            _GC->info(error.GetErrorMessage(), "error");
+                _GC->info( error.GetErrorMessage(), "error" );
-		      throw error;
+                throw error;
-         }
+            }
-      }
+        }
-      catch(...)
+        catch( ... )
-      {
+        {
 
 #if KBOOL_DEBUG
-         _prepared->WriteGraphKEY(_GC);
+            _prepared->WriteGraphKEY( _GC );
 #endif
-         intersectionruns++;
+            intersectionruns++;
-         if ( intersectionruns == intersectionRunsMax )
+            if ( intersectionruns == intersectionRunsMax )
-         {
+            {
-            _prepared->WriteGraphKEY(_GC);
+                _prepared->WriteGraphKEY( _GC );
-            _GC->info("Unknown exception", "error");
+                _GC->info( "Unknown exception", "error" );
-		      throw;
+                throw;
-         }
+            }
-      }
+        }
-   }
+    }
 
-	delete _prepared;
+    delete _prepared;
 }
 
 
 void GraphList::WriteGraphs()
 {
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI = TDLI<Graph>( this );
-	_LI.tohead();
+    _LI.tohead();
-	while(!_LI.hitroot())
+    while( !_LI.hitroot() )
-	{
+    {
         _LI.item()->writegraph( false );
         _LI++;
-	}
+    }
 }
 
 void GraphList::WriteGraphsKEY( Bool_Engine* GC )
 {
-   FILE* file = fopen("graphkeyfile.key", "w");
+    FILE * file = fopen( "graphkeyfile.key", "w" );
 
-   fprintf(file,"\
+    fprintf( file, "\
-      HEADER 5; \
+             HEADER 5; \
-      BGNLIB; \
+             BGNLIB; \
-      LASTMOD {2-11-15  15:39:21}; \
+             LASTMOD {2-11-15  15:39:21}; \
-      LASTACC {2-11-15  15:39:21}; \
+             LASTACC {2-11-15  15:39:21}; \
-      LIBNAME trial; \
+             LIBNAME trial; \
-      UNITS; \
+             UNITS; \
-      USERUNITS 0.0001; PHYSUNITS 1e-009; \
+             USERUNITS 0.0001; PHYSUNITS 1e-009; \
-   \
+             \
-      BGNSTR;  \
+             BGNSTR;  \
-      CREATION {2-11-15  15:39:21}; \
+             CREATION {2-11-15  15:39:21}; \
-      LASTMOD  {2-11-15  15:39:21}; \
+             LASTMOD  {2-11-15  15:39:21}; \
-      STRNAME top; \
+             STRNAME top; \
-   ");
+             ");
 
-   TDLI<Graph> _LI=TDLI<Graph>(this);
+    TDLI<Graph> _LI=TDLI<Graph>(this);
-	_LI.tohead();
+    _LI.tohead();
-	while(!_LI.hitroot())
+    while(!_LI.hitroot())
-	{
+    {
         _LI.item()->WriteKEY( GC, file );
         _LI++;
-	}
+    }
 
-   fprintf(file,"\
+    fprintf(file,"\
-      ENDSTR top; \
+            ENDSTR top; \
-      ENDLIB; \
+            ENDLIB; \
-   ");
+            ");
 
-   fclose (file);
+    fclose (file);
 }

polygon/kbool/src/instonly.cpp

@@ -1,25 +1,25 @@
-/*! \file ../src/instonly.cpp
+/*! \file kbool/src/instonly.cpp
     \author Probably Klaas Holwerda
  
     Copyright: 2001-2004 (C) Probably Klaas Holwerda
  
     Licence: wxWidgets Licence
  
-    RCS-ID: $Id: instonly.cpp,v 1.5 2005/05/24 19:13:38 titato Exp $
+    RCS-ID: $Id: instonly.cpp,v 1.2 2006/11/05 14:59:31 titato Exp $
 */
 
 #ifdef __GNUG__
 #pragma option -Jgd
 
-#include "../include/_dl_itr.h"
+#include "kbool/_dl_itr.h"
-#include "../include/node.h"
+#include "kbool/node.h"
-#include "../include/record.h"
+#include "kbool/record.h"
-#include "../include/link.h"
+#include "kbool/link.h"
-#include "../include/_lnk_itr.h"
+#include "kbool/_lnk_itr.h"
-#include "../include/scanbeam.h"
+#include "kbool/scanbeam.h"
-#include "../include/graph.h"
+#include "kbool/graph.h"
-#include "../include/graphlst.h"
+#include "kbool/graphlst.h"
-//#include "../include/misc.h"
+//#include "kbool/misc.h"
 
 template class DL_Node<void *>;
 template class DL_Iter<void *>;

polygon/kbool/src/lpoint.cpp

@@ -1,150 +1,146 @@
-/*! \file ../src/lpoint.cpp
+/*! \file src/lpoint.cpp
     \brief Definition of GDSII LPoint type structure
-    \author Probably Klaas Holwerda
+    \author Klaas Holwerda
  
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda 
+    Copyright: 2001-2004 (C) Klaas Holwerda 
  
-    Licence: wxWidgets Licence
+    Licence: see kboollicense.txt 
  
-    RCS-ID: $Id: lpoint.cpp,v 1.4 2005/05/24 19:13:39 titato Exp $
+    RCS-ID: $Id: lpoint.cpp,v 1.3 2008/06/04 21:23:22 titato Exp $
 */
 
-#ifdef __GNUG__
+#include "kbool/lpoint.h"
-#pragma implementation 
-#endif
-
-#include "../include/lpoint.h"
 #include <math.h>
 
 // Constructors
 LPoint::LPoint()
 {
-	_x = 0;
+    _x = 0;
-	_y = 0;
+    _y = 0;
 }
 
 
-LPoint::LPoint(B_INT const X, B_INT const Y)
+LPoint::LPoint( B_INT const X, B_INT const Y )
 {
-	_x = X;
+    _x = X;
-	_y = Y;
+    _y = Y;
 }
 
 
-LPoint::LPoint(LPoint* const a_point)
+LPoint::LPoint( LPoint* const a_point )
 {
-	if (!a_point)
+    if ( !a_point )
-		throw Bool_Engine_Error("Cannot copy a NULL Point Object.\n\nCould not create a LPoint Object.",
+        throw Bool_Engine_Error( "Cannot copy a NULL Point Object.\n\nCould not create a LPoint Object.",
-						"Fatal Creation Error", 0, 1);
+                                 "Fatal Creation Error", 0, 1 );
-	_x = a_point->_x;
+    _x = a_point->_x;
-	_y = a_point->_y;
+    _y = a_point->_y;
 }
 
 
 B_INT LPoint::GetX()
 {
-	return _x;
+    return _x;
 }
 
 B_INT LPoint::GetY()
 {
-	return _y;
+    return _y;
 }
 
 
-void LPoint::SetX(B_INT a_point_x)
+void LPoint::SetX( B_INT a_point_x )
 {
-	_x = a_point_x;
+    _x = a_point_x;
 }
 
 
-void LPoint::SetY(B_INT a_point_y)
+void LPoint::SetY( B_INT a_point_y )
 {
-	_y = a_point_y;
+    _y = a_point_y;
 }
 
 
 LPoint LPoint::GetPoint()
 {
-	return *this;
+    return * this;
 }
 
 
-void LPoint::Set(const B_INT X,const B_INT Y)
+void LPoint::Set( const B_INT X, const B_INT Y )
 {
-	_x = X;
+    _x = X;
-	_y = Y;
+    _y = Y;
 }
 
 
-void LPoint::Set(const LPoint &a_point)
+void LPoint::Set( const LPoint &a_point )
 {
-	_x = a_point._x;
+    _x = a_point._x;
-	_y  =a_point._y;
+    _y  = a_point._y;
 }
 
-bool LPoint::Equal(const LPoint a_point, B_INT Marge)
+bool LPoint::Equal( const LPoint a_point, B_INT Marge )
 {
-	B_INT delta_x, delta_y;
+    B_INT delta_x, delta_y;
 
-	delta_x = babs((_x - a_point._x));
+    delta_x = babs( ( _x - a_point._x ) );
-	delta_y = babs((_y - a_point._y));
+    delta_y = babs( ( _y - a_point._y ) );
 
-	if ((delta_x <= Marge) && (delta_y <= Marge))
+    if ( ( delta_x <= Marge ) && ( delta_y <= Marge ) )
-		return true;
+        return true;
-	else
+    else
-		return false;
+        return false;
 }
 
 
-bool LPoint::Equal(const B_INT X, const B_INT Y, B_INT Marge)
+bool LPoint::Equal( const B_INT X, const B_INT Y, B_INT Marge )
 {
-	return (bool)((babs(_x - X) <= Marge) && (babs(_y - Y) <= Marge));
+    return ( bool )( ( babs( _x - X ) <= Marge ) && ( babs( _y - Y ) <= Marge ) );
 }
 
-bool LPoint::ShorterThan(const LPoint a_point, B_INT Marge)
+bool LPoint::ShorterThan( const LPoint a_point, B_INT Marge )
 {
-	double a,b;
+    double a, b;
-	a = (double) (a_point._x - _x);
+    a = ( double ) ( a_point._x - _x );
-	a*= a;
+    a *= a;
-	b = (double) (a_point._y - _y);
+    b = ( double ) ( a_point._y - _y );
-	b*= b;
+    b *= b;
 
-	return (bool) ( (a+b) <= Marge*Marge ? true : false ) ;
+    return ( bool ) ( ( a + b ) <= Marge * Marge ? true : false ) ;
 }
 
 
-bool LPoint::ShorterThan(const B_INT X, const B_INT Y, B_INT Marge)
+bool LPoint::ShorterThan( const B_INT X, const B_INT Y, B_INT Marge )
 {
-	double a,b;
+    double a, b;
-	a = (double) (X - _x);
+    a = ( double ) ( X - _x );
-	a*= a;
+    a *= a;
-	b = (double) (Y - _y);
+    b = ( double ) ( Y - _y );
-	b*= b;
+    b *= b;
 
-	return (bool) ( a+b <= Marge*Marge ? true : false ) ;
+    return ( bool ) ( a + b <= Marge * Marge ? true : false ) ;
 }
 
 
 // overload the assign (=) operator
 // usage : a_point = another_point;
 
-LPoint &LPoint::operator=(const LPoint &other_point)
+LPoint &LPoint::operator=( const LPoint &other_point )
 {
-	_x = other_point._x;
+    _x = other_point._x;
-	_y = other_point._y;
+    _y = other_point._y;
-	return *this;
+    return *this;
 }
 
 
 // overload the + operator
 // usage : a_point = point1 + point2;
 
-LPoint &LPoint::operator+(const LPoint &other_point)
+LPoint &LPoint::operator+( const LPoint &other_point )
 {
-	_x += other_point._x;
+    _x += other_point._x;
-	_y += other_point._y;
+    _y += other_point._y;
-	return *this;
+    return *this;
 }
 
 
@@ -152,51 +148,51 @@ LPoint &LPoint::operator+(const LPoint &other_point)
 // overload the - operator
 // usage : a_point = point1 - point2;
 
-LPoint &LPoint::operator-(const LPoint &other_point)
+LPoint &LPoint::operator-( const LPoint &other_point )
 {
-	_x -= other_point._x;
+    _x -= other_point._x;
-	_y -= other_point._y;
+    _y -= other_point._y;
-	return *this;
+    return *this;
 }
 
 
 // overload the * operator
 // usage: a_point = point1 * 100;
 
-LPoint &LPoint::operator*(int factor)
+LPoint &LPoint::operator*( int factor )
 {
-	_x *= factor;
+    _x *= factor;
-	_y *= factor;
+    _y *= factor;
-	return *this;
+    return *this;
 }
 
 
 // overload the / operator
 // usage: a_point = point1 / 100;
 
-LPoint &LPoint::operator/(int factor)
+LPoint &LPoint::operator/( int factor )
 {
-	_x /= factor;
+    _x /= factor;
-	_y /= factor;
+    _y /= factor;
-	return *this;
+    return *this;
 }
 
 
 // overload the compare (==) operator
 // usage: if (point1 == point2) { };
 
-int LPoint::operator==(const LPoint &other_point) const
+int LPoint::operator==( const LPoint &other_point ) const
 {
-	return ((other_point._x == _x) && (other_point._y == _y));
+    return ( ( other_point._x == _x ) && ( other_point._y == _y ) );
 }
 
 
 // overload the diffrent (!=) operator
 // usage: if (point1 != point2) { };
 
-int LPoint::operator!=(const LPoint &other_point) const
+int LPoint::operator!=( const LPoint &other_point ) const
 {
-	return ((other_point._x != _x) || (other_point._y != _y));
+    return ( ( other_point._x != _x ) || ( other_point._y != _y ) );
 }
 
 

polygon/kbool/src/makefile.include

@@ -1,3 +1,7 @@
+# makefile.include for kbool
+.cpp.o:
+	g++ -c -Wall -O2 -I../include -o $@ $*.cpp
+
 OBJECTS =\
     booleng.o\
     graph.o\

polygon/kbool/src/record.cpp

@@ -1,20 +1,16 @@
-/*! \file ../src/record.cpp
+/*! \file src/record.cpp
-    \author Probably Klaas Holwerda or Julian Smart
+    \author Klaas Holwerda or Julian Smart
  
-    Copyright: 2001-2004 (C) Probably Klaas Holwerda
+    Copyright: 2001-2004 (C) Klaas Holwerda
  
-    Licence: wxWidgets Licence
+    Licence: see kboollicense.txt 
  
-    RCS-ID: $Id: record.cpp,v 1.5 2005/05/24 19:13:39 titato Exp $
+    RCS-ID: $Id: record.cpp,v 1.3 2008/06/04 21:23:22 titato Exp $
 */
 
-#ifdef __GNUG__
+#include "kbool/booleng.h"
-#pragma implementation 
+#include "kbool/record.h"
-#endif
+#include "kbool/node.h"
-
-#include "../include/booleng.h"
-#include "../include/record.h"
-#include "../include/node.h"
 
 #include <stdlib.h>
 #include <math.h>
@@ -33,8 +29,7 @@
 //}
 
 Record::~Record()
-{
+{}
-}
 
 
 //void* Record::operator new(size_t size)
@@ -57,7 +52,7 @@ Record::~Record()
 //     return;
 //   }
 //
-//	free (recordptr);
+// free (recordptr);
 //}
 
 //void Record::deletepool()
@@ -69,289 +64,289 @@ Record::~Record()
 //   }
 //}
 
-Record::Record(KBoolLink* link,Bool_Engine* GC)
+Record::Record( KBoolLink* link, Bool_Engine* GC )
-   :_line(GC)
+        : _line( GC )
 {
-   _GC=GC;
+    _GC = GC;
-	_dir=GO_RIGHT;
+    _dir = GO_RIGHT;
-   _a=0;
+    _a = 0;
-   _b=0;
+    _b = 0;
-	_line.Set(link);
+    _line.Set( link );
-	_line.CalculateLineParameters();
+    _line.CalculateLineParameters();
 }
 
 
 //when the dimensions of a link for a record changes, its line parameters need to be recalculated
-void Record::SetNewLink(KBoolLink* link)
+void Record::SetNewLink( KBoolLink* link )
 {
-	_line.Set(link);
+    _line.Set( link );
-   _line.CalculateLineParameters();
+    _line.CalculateLineParameters();
 }
 
 //for beams calculate the ysp on the low scanline
-void Record::Calc_Ysp(Node* low)
+void Record::Calc_Ysp( Node* low )
 {
-	if ((LNK->GetEndNode() == low) || (LNK->GetBeginNode() == low))
+    if ( ( LNK->GetEndNode() == low ) || ( LNK->GetBeginNode() == low ) )
-   {
+    {
-      _ysp=low->GetY();
+        _ysp = low->GetY();
-      return;
+        return;
-   }
+    }
 
-   if	(LNK->GetEndNode()->GetX() == LNK->GetBeginNode()->GetX())
+    if ( LNK->GetEndNode()->GetX() == LNK->GetBeginNode()->GetX() )
-         _ysp=low->GetY(); //flatlink only in flatbeams
+        _ysp = low->GetY(); //flatlink only in flatbeams
-   else if (LNK->GetEndNode()->GetX() == low->GetX())
+    else if ( LNK->GetEndNode()->GetX() == low->GetX() )
-         _ysp=LNK->GetEndNode()->GetY();
+        _ysp = LNK->GetEndNode()->GetY();
-   else if (LNK->GetBeginNode()->GetX() == low->GetX())
+    else if ( LNK->GetBeginNode()->GetX() == low->GetX() )
-         _ysp=LNK->GetBeginNode()->GetY();
+        _ysp = LNK->GetBeginNode()->GetY();
-   else
+    else
-      	_ysp=_line.Calculate_Y_from_X(low->GetX());
+        _ysp = _line.Calculate_Y_from_X( low->GetX() );
 }
 
 //to set the _dir for new links in the beam
 void Record::Set_Flags()
 {
-	if (LNK->GetEndNode()->GetX()==LNK->GetBeginNode()->GetX()) //flatlink ?
+    if ( LNK->GetEndNode()->GetX() == LNK->GetBeginNode()->GetX() ) //flatlink ?
-	{  //only happens in flat beams
+    {  //only happens in flat beams
-		if (LNK->GetEndNode()->GetY() < LNK->GetBeginNode()->GetY())
+        if ( LNK->GetEndNode()->GetY() < LNK->GetBeginNode()->GetY() )
-			_dir=GO_RIGHT;
+            _dir = GO_RIGHT;
-		else
+        else
-			_dir=GO_LEFT;
+            _dir = GO_LEFT;
-	}
+    }
-	else
+    else
-	{
+    {
-		if (LNK->GetEndNode()->GetX() > LNK->GetBeginNode()->GetX())
+        if ( LNK->GetEndNode()->GetX() > LNK->GetBeginNode()->GetX() )
-			_dir=GO_RIGHT;
+            _dir = GO_RIGHT;
-		else
+        else
-			_dir=GO_LEFT;
+            _dir = GO_LEFT;
-	}
+    }
 }
 
 KBoolLink* Record::GetLink()
 {
-	return LNK;
+    return LNK;
 }
 
 B_INT Record::Ysp()
 {
-	return _ysp;
+    return _ysp;
 }
 
-void Record::SetYsp(B_INT ysp)
+void Record::SetYsp( B_INT ysp )
 {
-	_ysp=ysp;
+    _ysp = ysp;
 }
 
 DIRECTION Record::Direction()
 {
-	return DIRECTION(_dir);
+    return DIRECTION( _dir );
 }
 
-bool Record::Calc_Left_Right(Record* record_above_me)
+bool Record::Calc_Left_Right( Record* record_above_me )
 {
-   bool par=false;
+    bool par = false;
 
-   if (!record_above_me)   //null if no record above
+    if ( !record_above_me )   //null if no record above
-   { 	_a=0;_b=0;  }
+    {  _a = 0;_b = 0;  }
-   else
+    else
-   {
+    {
-   	_a=record_above_me->_a;
+        _a = record_above_me->_a;
-   	_b=record_above_me->_b;
+        _b = record_above_me->_b;
-   }
+    }
 
-   switch (_dir&1)
+    switch ( _dir & 1 )
-   {
+    {
-      case GO_LEFT	:	if (LNK->Group() == GROUP_A)
+        case GO_LEFT : if ( LNK->Group() == GROUP_A )
-                        {
+            {
-                           LNK->SetRightA((bool)(_a>0));
+                LNK->SetRightA( ( bool )( _a > 0 ) );
 
-                           if (_GC->GetWindingRule())
+                if ( _GC->GetWindingRule() )
-                              LNK->GetInc() ? _a++ : _a--;
+                    LNK->GetInc() ? _a++ : _a--;
-                           else
+                else
-                           {  //ALTERNATE
+                {  //ALTERNATE
-                              if (_a)
+                    if ( _a )
-                                 _a=0;
+                        _a = 0;
-                              else
+                    else
-                                 _a=1;
+                        _a = 1;
-                           }
+                }
 
-                           LNK->SetLeftA((bool)(_a>0));
+                LNK->SetLeftA( ( bool )( _a > 0 ) );
-                           LNK->SetLeftB((bool)(_b>0));
+                LNK->SetLeftB( ( bool )( _b > 0 ) );
-                           LNK->SetRightB((bool)(_b>0));
+                LNK->SetRightB( ( bool )( _b > 0 ) );
-                        }
+            }
-                        else
+            else
-                        {
+            {
-                           LNK->SetRightA((bool)(_a > 0));
+                LNK->SetRightA( ( bool )( _a > 0 ) );
-                           LNK->SetLeftA((bool)(_a>0));
+                LNK->SetLeftA( ( bool )( _a > 0 ) );
-                           LNK->SetRightB((bool)(_b>0));
+                LNK->SetRightB( ( bool )( _b > 0 ) );
 
-                           if (_GC->GetWindingRule())
+                if ( _GC->GetWindingRule() )
-                              LNK->GetInc() ? _b++ : _b--;
+                    LNK->GetInc() ? _b++ : _b--;
-                           else //ALTERNATE
+                else //ALTERNATE
-                           {
+                {
-                               if (_b)
+                    if ( _b )
-                                    _b=0;
+                        _b = 0;
-                               else
+                    else
-                                    _b=1;
+                        _b = 1;
-                           }
+                }
 
-                           LNK->SetLeftB((bool)(_b>0));
+                LNK->SetLeftB( ( bool )( _b > 0 ) );
-                        }
+            }
-                           break;
+            break;
-      case	GO_RIGHT	:	if (LNK->Group() == GROUP_A)
+        case GO_RIGHT : if ( LNK->Group() == GROUP_A )
-                        {
+            {
-                           LNK->SetLeftA((bool)(_a>0));
+                LNK->SetLeftA( ( bool )( _a > 0 ) );
 
-                           if (_GC->GetWindingRule())
+                if ( _GC->GetWindingRule() )
-                              LNK->GetInc() ? _a++ : _a--;
+                    LNK->GetInc() ? _a++ : _a--;
-                           else
+                else
-                           {  //ALTERNATE
+                {  //ALTERNATE
-                              if (_a)
+                    if ( _a )
-                                 _a=0;
+                        _a = 0;
-                              else
+                    else
-                                 _a=1;
+                        _a = 1;
-                           }
+                }
 
-                           LNK->SetRightA((bool)(_a>0));
+                LNK->SetRightA( ( bool )( _a > 0 ) );
-                           LNK->SetLeftB((bool)(_b>0));
+                LNK->SetLeftB( ( bool )( _b > 0 ) );
-                           LNK->SetRightB((bool)(_b>0));
+                LNK->SetRightB( ( bool )( _b > 0 ) );
-                        }
+            }
-                        else
+            else
-                        {
+            {
-                           LNK->SetRightA((bool)(_a>0));
+                LNK->SetRightA( ( bool )( _a > 0 ) );
-                           LNK->SetLeftA((bool)(_a>0));
+                LNK->SetLeftA( ( bool )( _a > 0 ) );
-                           LNK->SetLeftB((bool)(_b>0));
+                LNK->SetLeftB( ( bool )( _b > 0 ) );
 
-                           if (_GC->GetWindingRule())
+                if ( _GC->GetWindingRule() )
-                              LNK->GetInc() ? _b++ : _b--;
+                    LNK->GetInc() ? _b++ : _b--;
-                           else
+                else
-                           {  //ALTERNATE
+                {  //ALTERNATE
-                              if (_b)
+                    if ( _b )
-                                 _b=0;
+                        _b = 0;
-                              else
+                    else
-                                 _b=1;
+                        _b = 1;
-                           }
+                }
 
-                           LNK->SetRightB((bool)(_b>0));
+                LNK->SetRightB( ( bool )( _b > 0 ) );
-                        }
+            }
-                        break;
+            break;
-      default			:  _GC->error("Undefined Direction of link","function IScanBeam::Calc_Set_Left_Right()");
+        default   :  _GC->error( "Undefined Direction of link", "function IScanBeam::Calc_Set_Left_Right()" );
-                        break;
+            break;
-   }
+    }
 
 //THE NEXT WILL WORK for MOST windingrule polygons,
 //even when not taking into acount windingrule
 // not all
-/*
+    /*
-   switch (_dir&1)
+       switch (_dir&1)
-   {
+       {
-      case GO_LEFT	:	if (LNK->Group() == GROUP_A)
+          case GO_LEFT : if (LNK->Group() == GROUP_A)
-                        {
+                            {
-                           LNK->SetRightA((bool)(_a>0));
+                               LNK->SetRightA((bool)(_a>0));
      
-                           if (booleng->Get_WindingRule())
+                               if (booleng->Get_WindingRule())
-                              LNK->GetInc() ? _a++ : _a--;
+                                  LNK->GetInc() ? _a++ : _a--;
-                           else
+                               else
-                              _a--;
+                                  _a--;
      
-                           LNK->SetLeftA((bool)(_a>0));
+                               LNK->SetLeftA((bool)(_a>0));
-                           LNK->SetLeftB((bool)(_b>0));
+                               LNK->SetLeftB((bool)(_b>0));
-                           LNK->SetRightB((bool)(_b>0));
+                               LNK->SetRightB((bool)(_b>0));
-                        }
+                            }
-                        else
+                            else
-                        {
+                            {
-                           LNK->SetRightA((bool)(_a > 0));
+                               LNK->SetRightA((bool)(_a > 0));
-                           LNK->SetLeftA((bool)(_a>0));
+                               LNK->SetLeftA((bool)(_a>0));
-                           LNK->SetRightB((bool)(_b>0));
+                               LNK->SetRightB((bool)(_b>0));
      
-                           if (booleng->Get_WindingRule())
+                               if (booleng->Get_WindingRule())
-                              LNK->GetInc() ? _b++ : _b--;
+                                  LNK->GetInc() ? _b++ : _b--;
-                           else
+                               else
-                              _b--;
+                                  _b--;
      
-                           LNK->SetLeftB((bool)(_b>0));
+                               LNK->SetLeftB((bool)(_b>0));
-                        }
+                            }
-                           break;
+                               break;
-      case	GO_RIGHT	:	if (LNK->Group() == GROUP_A)
+          case GO_RIGHT : if (LNK->Group() == GROUP_A)
-                           {
+                               {
-                              LNK->SetLeftA((bool)(_a>0));
+                                  LNK->SetLeftA((bool)(_a>0));
      
-                              if (booleng->Get_WindingRule())
+                                  if (booleng->Get_WindingRule())
-                                 LNK->GetInc() ? _a++ : _a--;
+                                     LNK->GetInc() ? _a++ : _a--;
-                              else
+                                  else
-                                 _a++;
+                                     _a++;
      
-                              LNK->SetRightA((bool)(_a>0));
+                                  LNK->SetRightA((bool)(_a>0));
-                              LNK->SetLeftB((bool)(_b>0));
+                                  LNK->SetLeftB((bool)(_b>0));
-                              LNK->SetRightB((bool)(_b>0));
+                                  LNK->SetRightB((bool)(_b>0));
-                           }
+                               }
-                        else
+                            else
-                           {
+                               {
-                              LNK->SetRightA((bool)(_a>0));
+                                  LNK->SetRightA((bool)(_a>0));
-                              LNK->SetLeftA((bool)(_a>0));
+                                  LNK->SetLeftA((bool)(_a>0));
-                              LNK->SetLeftB((bool)(_b>0));
+                                  LNK->SetLeftB((bool)(_b>0));
      
-                              if (booleng->Get_WindingRule())
+                                  if (booleng->Get_WindingRule())
-                                 LNK->GetInc() ? _b++ : _b--;
+                                     LNK->GetInc() ? _b++ : _b--;
-                              else
+                                  else
-                                 _b++;
+                                     _b++;
      
-                              LNK->SetRightB((bool)(_b>0));
+                                  LNK->SetRightB((bool)(_b>0));
-                           }
+                               }
-                        break;
+                            break;
-      default			:  _messagehandler->error("Undefined Direction of link","function IScanBeam::Calc_Set_Left_Right()");
+          default   :  _messagehandler->error("Undefined Direction of link","function IScanBeam::Calc_Set_Left_Right()");
-                        break;
+                            break;
-   }
+       }
-*/
+    */
-   //if the records are parallel (same begin/endnodes)
+    //if the records are parallel (same begin/endnodes)
-   //the above link a/b flag are adjusted to the current a/b depth
+    //the above link a/b flag are adjusted to the current a/b depth
-   if (record_above_me && Equal(record_above_me))
+    if ( record_above_me && Equal( record_above_me ) )
-   {
+    {
-      par=true;
+        par = true;
-		LNK->Mark();
+        LNK->Mark();
-   	record_above_me->_a=_a;
+        record_above_me->_a = _a;
-   	record_above_me->_b=_b;
+        record_above_me->_b = _b;
-		if (Direction()== GO_LEFT)
+        if ( Direction() == GO_LEFT )
-		{
+        {
-         //set the bottom side  of the above link
+            //set the bottom side  of the above link
-         if (record_above_me->Direction()== GO_LEFT)
+            if ( record_above_me->Direction() == GO_LEFT )
-         {
+            {
-            record_above_me->LNK->SetLeftA(LNK->GetLeftA());
+                record_above_me->LNK->SetLeftA( LNK->GetLeftA() );
-            record_above_me->LNK->SetLeftB(LNK->GetLeftB());
+                record_above_me->LNK->SetLeftB( LNK->GetLeftB() );
-         }
+            }
-         else
+            else
-         {
+            {
-            record_above_me->LNK->SetRightA(LNK->GetLeftA());
+                record_above_me->LNK->SetRightA( LNK->GetLeftA() );
-            record_above_me->LNK->SetRightB(LNK->GetLeftB());
+                record_above_me->LNK->SetRightB( LNK->GetLeftB() );
-         }
+            }
-		}
+        }
-		else
+        else
-		{
+        {
-         //set the bottom side  of the above link
+            //set the bottom side  of the above link
-         if (record_above_me->Direction()== GO_LEFT)
+            if ( record_above_me->Direction() == GO_LEFT )
-         {
+            {
-            record_above_me->LNK->SetLeftA(LNK->GetRightA());
+                record_above_me->LNK->SetLeftA( LNK->GetRightA() );
-            record_above_me->LNK->SetLeftB(LNK->GetRightB());
+                record_above_me->LNK->SetLeftB( LNK->GetRightB() );
-         }
+            }
-         else
+            else
-         {
+            {
-            record_above_me->LNK->SetRightA(LNK->GetRightA());
+                record_above_me->LNK->SetRightA( LNK->GetRightA() );
-            record_above_me->LNK->SetRightB(LNK->GetRightB());
+                record_above_me->LNK->SetRightB( LNK->GetRightB() );
-         }
+            }
-		}
+        }
-   }
+    }
-   return par;
+    return par;
 }
 
-bool Record::Equal(Record *a)
+bool Record::Equal( Record *a )
 {
-	return((bool)( ( LNK->GetOther(a->LNK->GetBeginNode()) == a->LNK->GetEndNode())  &&
+    return( ( bool )( ( LNK->GetOther( a->LNK->GetBeginNode() ) == a->LNK->GetEndNode() )  &&
-						  ( LNK->GetOther(a->LNK->GetEndNode())   == a->LNK->GetBeginNode())  ));
+                      ( LNK->GetOther( a->LNK->GetEndNode() )   == a->LNK->GetBeginNode() )  ) );
 }
 
 
 KBoolLine* Record::GetLine()
 {
-	return &_line;
+    return & _line;
 }