From eec2638146e3e6c3e6a0e3e68cb98db0f75706ac Mon Sep 17 00:00:00 2001
From: hkrish <hari.exeption@gmail.com>
Date: Mon, 22 Apr 2013 11:55:44 +0200
Subject: [PATCH] more tests

---
 booleanStudy.html |  2 +-
 booleanTests.js   | 18 +++++++++++++++---
 2 files changed, 16 insertions(+), 4 deletions(-)

diff --git a/booleanStudy.html b/booleanStudy.html
index add3f2cc..38e9871b 100644
--- a/booleanStudy.html
+++ b/booleanStudy.html
@@ -23,7 +23,7 @@
 	</div>
 	<footer>
 		<p>Vector boolean operations on paperjs objects. <br />
-			Still under development, mostly written for clarity and compatibility, 
+			Still under development, mostly written for clarity and compatibility,
 			not optimised for performance, and has to be tested heavily.</p>
 		<p>--<br />
 			hari</p>
diff --git a/booleanTests.js b/booleanTests.js
index a63923c0..d988210b 100644
--- a/booleanTests.js
+++ b/booleanTests.js
@@ -128,15 +128,27 @@ function runTests() {
   pathB.addChild( npath );
   testBooleanStatic( pathA, pathB, caption );
 
+  caption = prepareTest( 'CompoundPaths 6 - holes and islands 3', container );
+  group  = paper.project.importSvg( document.getElementById( 'glyphsacirc' ) );
+  pathA = group.children[0];
+  pathB = new CompoundPath();
+  var npath = new Path.Circle([110, 110], 100);
+  pathB.addChild( npath );
+  npath = new Path.Circle([110, 110], 60);
+  pathB.addChild( npath );
+  npath = new Path.Circle([110, 110], 30);
+  pathB.addChild( npath );
+  testBooleanStatic( pathA, pathB, caption );
+
   // To resolve self intersection on a single path,
   // pass an empty second operand and do a Union operation
   caption = prepareTest( 'Self-intersecting paths 1 - Resolve self-intersection on single path', container );
-  pathA = new Path.Star(new Point(80, 110), 10, 20, 80);
+  pathA = new Path.Star(new Point(110, 110), 10, 20, 80);
   pathA.smooth();
   pathB = new Path();
   testBooleanStatic( pathA, pathB, caption, false, true, true, true );
 
-  caption = prepareTest( 'Self-intersecting paths 2 - Resolve self-intersection on single path', container );
+  caption = prepareTest( 'Self-intersecting paths 2 - Resolve self-intersecting CompoundPath', container );
   pathA = new CompoundPath();
   pathA.addChild( new Path.Circle([100, 110], 60) );
   pathA.addChild( new Path.Circle([160, 110], 30) );
@@ -166,7 +178,7 @@ var booleanStyle = {
 
 var pathStyleNormal = {
   strokeColor: new Color( 0, 0, 0 ),
-  fillColor: new Color( 0, 0, 0, 0.0 ),
+  fillColor: new Color( 0, 0, 0, 0.1 ),
   strokeWidth: 1
 };