From af90a4ea281f25152048218720b3bcbdc3f9ea23 Mon Sep 17 00:00:00 2001
From: kabutz <heinz@javaspecialists.eu>
Date: Wed, 9 Jan 2013 20:37:30 +0200
Subject: [PATCH] Updated Copyright and added classes from Issue193

---
 javaspecialists.iml                           |   4 +-
 javaspecialists.ipr                           |  24 +-
 javaspecialists.iws                           | 830 +++++++----------
 pom.xml                                       |  68 +-
 .../tjsn/concurrency/AutoLock.java            |  60 ++
 .../interlocker/InterlockTask.java            |  24 +-
 .../concurrency/interlocker/Interlocker.java  |  28 +-
 .../concurrency/interlocker/Interlockers.java |  14 +-
 .../interlocker/impl/AtomicInterlocker.java   |  62 +-
 .../impl/ConditionInterlocker.java            |  88 +-
 .../interlocker/impl/LockFreeInterlocker.java |  50 +-
 .../impl/SemaphoreInterlocker.java            |  54 +-
 .../impl/WaitNotifyInterlocker.java           |  62 +-
 .../stripedexecutor/StripedCallable.java      |   2 +-
 .../StripedExecutorService.java               | 850 +++++++++---------
 .../stripedexecutor/StripedObject.java        |   4 +-
 .../stripedexecutor/StripedRunnable.java      |   2 +-
 .../tjsn/concurrency/util/FutureResult.java   |  32 +-
 .../tjsn/concurrency/util/SerialExecutor.java |  48 +-
 .../issue145/TristateCheckBoxTest.java        | 136 +--
 .../examples/issue187/ArrayBoundsTest.java    |  74 +-
 .../tjsn/examples/issue187/ClassCastTest.java |  68 +-
 .../issue187/DuplicateExceptionChecker.java   |  56 +-
 .../examples/issue187/MixedExeptionTest.java  | 102 +--
 .../examples/issue187/NullPointerTest.java    |  68 +-
 .../issue188/VirtualMachineLiveLock.java      | 116 +--
 .../examples/issue193/DenseMemoryUsage.java   |  44 +
 .../examples/issue193/FullMemoryUsage.java    |  33 +
 .../issue193/HighlyScalableTableFactory.java  |  28 +
 .../tjsn/examples/issue193/MemoryUsage.java   |  44 +
 .../objectfactories/BasicObjectFactory.java   |  27 +
 .../BigConcurrentHashMapFactory.java          |  29 +
 .../ConcurrentHashMapFactory.java             |  29 +
 .../DenseBigConcurrentHashMapFactory.java     |  29 +
 .../DenseConcurrentHashMapFactory.java        |  29 +
 .../objectfactories/DenseHashMapFactory.java  |  29 +
 .../DenseHashtableFactory.java                |  29 +
 .../DenseHighlyScalableTableFactory.java      |  28 +
 .../DenseSmallConcurrentHashMapFactory.java   |  29 +
 .../objectfactories/FullMapObjectFactory.java |  48 +
 .../objectfactories/HashMapFactory.java       |  29 +
 .../objectfactories/HashtableFactory.java     |  29 +
 .../HugeConcurrentHashMapFactory.java         |  29 +
 .../HugeConcurrentHashMapV8Factory.java       |  28 +
 .../objectfactories/IntegerObjectFactory.java |  28 +
 .../objectfactories/LongObjectFactory.java    |  28 +
 .../objectfactories/ReentrantLockFactory.java |  29 +
 .../SmallConcurrentHashMapFactory.java        |  29 +
 .../SynchronizedHashMapFactory.java           |  31 +
 .../tjsn/examples/issue198/Blinker.java       | 114 +--
 .../tjsn/examples/issue198/CloseToOne.java    |  28 +-
 .../tjsn/examples/issue198/CloseToOne2.java   |  18 +-
 .../tjsn/examples/issue198/FindRandom.java    | 142 +--
 .../tjsn/examples/issue198/MathTeaser.java    |  38 +-
 .../examples/issue201/FibonacciGenerator.java |  60 +-
 .../issue201/FibonacciGeneratorExample.java   |  52 +-
 .../tjsn/examples/issue203/FinallyJava.java   |  36 +-
 .../tjsn/examples/issue203/GoToJava.java      |  36 +-
 .../issue206/SerialExecutorExample.java       |  60 +-
 .../StripedExecutorServiceExample.java        |  54 +-
 .../tjsn/gui/TristateButtonModel.java         | 132 +--
 .../tjsn/gui/TristateCheckBox.java            | 176 ++--
 .../tjsn/gui/TristateState.java               |  34 +-
 .../tjsn/math/fibonacci/Fibonacci.java        |  34 +-
 .../tjsn/math/fibonacci/FibonacciCache.java   |  82 +-
 .../fibonacci/FibonacciFormulaBigInteger.java |  49 +-
 .../math/fibonacci/FibonacciFormulaLong.java  |  31 +-
 .../math/fibonacci/FibonacciIterative.java    |  24 +-
 .../math/fibonacci/FibonacciRecursive.java    |  16 +-
 .../fibonacci/FibonacciRecursiveBowbeer.java  | 104 +--
 .../fibonacci/FibonacciRecursiveDijkstra.java |  46 +-
 .../FibonacciRecursiveDijkstraKaratsuba.java  |  12 +-
 .../FibonacciRecursiveNonCaching.java         |  16 +-
 ...cciRecursiveParallelDijkstraKaratsuba.java | 138 +--
 .../math/fibonacci/FibonacciTakahashi.java    |  58 +-
 .../math/fibonacci/NonCachingFibonacci.java   |  20 +-
 .../tjsn/math/numbers/BasicKaratsuba.java     |  96 +-
 .../tjsn/math/numbers/BigIntegerUtils.java    |  24 +-
 .../tjsn/math/numbers/Karatsuba.java          |   6 +-
 .../tjsn/math/numbers/ParallelKaratsuba.java  | 174 ++--
 .../tjsn/memory/MemoryTestBench.java          |  64 ++
 .../tjsn/memory/ObjectFactory.java            |  23 +
 .../tjsn/concurrency/AutoLockTest.java        |  90 ++
 .../interlocker/EmptyInterlockTask.java       |  38 +-
 .../interlocker/EvenOddCorrectnessTest.java   | 102 +--
 .../interlocker/EvenOddPerformanceTest.java   | 110 +--
 .../InterleavedNumberTestingStrategy.java     |  86 +-
 .../RaceConditionTestingStrategy.java         |  60 +-
 .../interlocker/ThreadPrintingTask.java       |  38 +-
 .../concurrency/interlocker/VerifyResult.java |  44 +-
 .../StripedExecutorServiceTest.java           | 464 +++++-----
 .../examples/issue198/CloseToOne2Test.java    |  18 +-
 .../examples/issue198/CloseToOneTest.java     |  18 +-
 .../examples/issue198/FindRandomTest.java     |  24 +-
 .../tjsn/math/numbers/FibonacciTest.java      | 436 ++++-----
 .../tjsn/math/numbers/KaratsubaTest.java      | 204 ++---
 96 files changed, 4075 insertions(+), 3295 deletions(-)
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/concurrency/AutoLock.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BigConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseBigConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashtableFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseSmallConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/FullMapObjectFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashtableFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/LongObjectFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ReentrantLockFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SmallConcurrentHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java
 create mode 100644 src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java
 create mode 100644 src/test/java/eu/javaspecialists/tjsn/concurrency/AutoLockTest.java

diff --git a/javaspecialists.iml b/javaspecialists.iml
index 02eff2f..fd56927 100644
--- a/javaspecialists.iml
+++ b/javaspecialists.iml
@@ -6,10 +6,8 @@
     <content url="file://$MODULE_DIR$">
       <sourceFolder url="file://$MODULE_DIR$/src/main/java" isTestSource="false" />
       <sourceFolder url="file://$MODULE_DIR$/src/test/java" isTestSource="true" />
-      <sourceFolder url="file://$MODULE_DIR$/target/generated-test-sources/test-annotations" isTestSource="true" />
       <sourceFolder url="file://$MODULE_DIR$/target/generated-sources/annotations" isTestSource="false" />
       <excludeFolder url="file://$MODULE_DIR$/target/classes" />
-      <excludeFolder url="file://$MODULE_DIR$/target/maven-archiver" />
       <excludeFolder url="file://$MODULE_DIR$/target/surefire" />
       <excludeFolder url="file://$MODULE_DIR$/target/surefire-reports" />
       <excludeFolder url="file://$MODULE_DIR$/target/test-classes" />
@@ -18,6 +16,8 @@
     <orderEntry type="sourceFolder" forTests="false" />
     <orderEntry type="library" name="Maven: junit:junit:4.9" level="project" />
     <orderEntry type="library" name="Maven: org.hamcrest:hamcrest-core:1.1" level="project" />
+    <orderEntry type="library" name="Maven: high-scale-lib:high-scale-lib:1.1.2" level="project" />
+    <orderEntry type="library" name="Maven: jsr166e:jsr166e:0.1" level="project" />
   </component>
 </module>
 
diff --git a/javaspecialists.ipr b/javaspecialists.ipr
index 365fe87..2c282cd 100644
--- a/javaspecialists.ipr
+++ b/javaspecialists.ipr
@@ -5,6 +5,10 @@
   </component>
   <component name="CompilerConfiguration">
     <option name="DEFAULT_COMPILER" value="Javac" />
+    <excludeFromCompile>
+      <directory url="file://$PROJECT_DIR$/target/generated-sources/annotations" includeSubdirectories="true" />
+      <directory url="file://$PROJECT_DIR$/target/generated-test-sources/test-annotations" includeSubdirectories="true" />
+    </excludeFromCompile>
     <resourceExtensions />
     <wildcardResourcePatterns>
       <entry name="?*.properties" />
@@ -22,7 +26,7 @@
   </component>
   <component name="CopyrightManager" default="Apache2 - JavaSpecialists">
     <copyright>
-      <option name="notice" value="Copyright (C) 2000-2012 Heinz Max Kabutz&#10;&#10;See the NOTICE file distributed with this work for additional &#10;information regarding copyright ownership.  Heinz Max Kabutz licenses&#10;this file to you under the Apache License, Version 2.0 (the &quot;License&quot;);&#10;you may not use this file except in compliance with the License. You may&#10;obtain a copy of the License at&#10;&#10;http://www.apache.org/licenses/LICENSE-2.0&#10;&#10;Unless required by applicable law or agreed to in writing, software&#10;distributed under the License is distributed on an &quot;AS IS&quot; BASIS,&#10;WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.&#10;See the License for the specific language governing permissions and&#10;limitations under the License." />
+      <option name="notice" value="Copyright (C) 2000-2013 Heinz Max Kabutz&#10;&#10;See the NOTICE file distributed with this work for additional &#10;information regarding copyright ownership.  Heinz Max Kabutz licenses&#10;this file to you under the Apache License, Version 2.0 (the &quot;License&quot;);&#10;you may not use this file except in compliance with the License. You may&#10;obtain a copy of the License at&#10;&#10;http://www.apache.org/licenses/LICENSE-2.0&#10;&#10;Unless required by applicable law or agreed to in writing, software&#10;distributed under the License is distributed on an &quot;AS IS&quot; BASIS,&#10;WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.&#10;See the License for the specific language governing permissions and&#10;limitations under the License." />
       <option name="keyword" value="Copyright" />
       <option name="allowReplaceKeyword" value="" />
       <option name="myName" value="Apache2 - JavaSpecialists" />
@@ -37,6 +41,7 @@
   <component name="EntryPointsManager">
     <entry_points version="2.0" />
   </component>
+  <component name="IdProvider" IDEtalkID="717960C24EB8A32629F1B9F6C1A053FB" />
   <component name="JavacSettings">
     <option name="ADDITIONAL_OPTIONS_STRING" value="-target 1.7" />
   </component>
@@ -201,9 +206,6 @@
         <XML>
           <option name="XML_LEGACY_SETTINGS_IMPORTED" value="true" />
         </XML>
-        <ADDITIONAL_INDENT_OPTIONS fileType="haml">
-          <option name="INDENT_SIZE" value="2" />
-        </ADDITIONAL_INDENT_OPTIONS>
         <codeStyleSettings language="Groovy">
           <option name="LINE_COMMENT_AT_FIRST_COLUMN" value="false" />
           <option name="WRAP_COMMENTS" value="true" />
@@ -246,6 +248,20 @@
     <mapping directory="" vcs="Git" />
   </component>
   <component name="libraryTable">
+    <library name="Maven: high-scale-lib:high-scale-lib:1.1.2">
+      <CLASSES>
+        <root url="jar://$PROJECT_DIR$/lib/high-scale-lib.jar!/" />
+      </CLASSES>
+      <JAVADOC />
+      <SOURCES />
+    </library>
+    <library name="Maven: jsr166e:jsr166e:0.1">
+      <CLASSES>
+        <root url="jar://$PROJECT_DIR$/lib/jsr166e.jar!/" />
+      </CLASSES>
+      <JAVADOC />
+      <SOURCES />
+    </library>
     <library name="Maven: junit:junit:4.9">
       <CLASSES>
         <root url="jar://$MAVEN_REPOSITORY$/junit/junit/4.9/junit-4.9.jar!/" />
diff --git a/javaspecialists.iws b/javaspecialists.iws
index 7c8a267..2a74090 100644
--- a/javaspecialists.iws
+++ b/javaspecialists.iws
@@ -2,14 +2,107 @@
 <project version="4">
   <component name="ChangeListManager">
     <list id="5c447008-9653-4c89-b48a-29e2b5e8cf7c" name="Default" comment="Added test to check that the parallel fibonacci solution really does parallelize the work." />
-    <list default="true" id="ecd1422d-0b60-43c5-b99b-60eb800de7cc" name="New changelist" comment="Added comments to the StripedExecutorService.">
+    <list default="true" id="ecd1422d-0b60-43c5-b99b-60eb800de7cc" name="New changelist" comment="Added demos that show how the SerialExecutor works">
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/AutoLock.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BigConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseBigConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashtableFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseSmallConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/FullMapObjectFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashtableFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/LongObjectFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ReentrantLockFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SmallConcurrentHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java" />
+      <change type="NEW" beforePath="" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/AutoLockTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/javaspecialists.iml" afterPath="$PROJECT_DIR$/javaspecialists.iml" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/javaspecialists.ipr" afterPath="$PROJECT_DIR$/javaspecialists.ipr" />
       <change type="MODIFICATION" beforePath="$PROJECT_DIR$/javaspecialists.iws" afterPath="$PROJECT_DIR$/javaspecialists.iws" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/pom.xml" afterPath="$PROJECT_DIR$/pom.xml" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterlockTask.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterlockTask.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlocker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlocker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlockers.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlockers.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/AtomicInterlocker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/AtomicInterlocker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/ConditionInterlocker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/ConditionInterlocker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/LockFreeInterlocker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/LockFreeInterlocker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/SemaphoreInterlocker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/SemaphoreInterlocker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/WaitNotifyInterlocker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/WaitNotifyInterlocker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java" />
       <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedObject.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedObject.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedRunnable.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedRunnable.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java" />
       <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java" />
-      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemo.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemo.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ClassCastTest.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ClassCastTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/DuplicateExceptionChecker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/DuplicateExceptionChecker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/MixedExeptionTest.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/MixedExeptionTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/NullPointerTest.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/NullPointerTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue188/VirtualMachineLiveLock.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue188/VirtualMachineLiveLock.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/Blinker.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/Blinker.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/FindRandom.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/FindRandom.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/MathTeaser.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue198/MathTeaser.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGenerator.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGenerator.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGeneratorExample.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGeneratorExample.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue203/FinallyJava.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue203/FinallyJava.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue203/GoToJava.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue203/GoToJava.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorServiceExample.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorServiceExample.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/Fibonacci.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/Fibonacci.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciCache.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciCache.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaBigInteger.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaBigInteger.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaLong.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaLong.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciIterative.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciIterative.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursive.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursive.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveBowbeer.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveBowbeer.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstra.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstra.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstraKaratsuba.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstraKaratsuba.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveNonCaching.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveNonCaching.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveParallelDijkstraKaratsuba.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveParallelDijkstraKaratsuba.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciTakahashi.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciTakahashi.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/NonCachingFibonacci.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/NonCachingFibonacci.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/BasicKaratsuba.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/BasicKaratsuba.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/BigIntegerUtils.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/BigIntegerUtils.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/Karatsuba.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/Karatsuba.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/ParallelKaratsuba.java" afterPath="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/math/numbers/ParallelKaratsuba.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EmptyInterlockTask.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EmptyInterlockTask.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddCorrectnessTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddCorrectnessTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddPerformanceTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddPerformanceTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterleavedNumberTestingStrategy.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterleavedNumberTestingStrategy.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/RaceConditionTestingStrategy.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/RaceConditionTestingStrategy.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/ThreadPrintingTask.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/ThreadPrintingTask.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/VerifyResult.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/VerifyResult.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorServiceTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorServiceTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2Test.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2Test.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOneTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOneTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198/FindRandomTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198/FindRandomTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/math/numbers/FibonacciTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/math/numbers/FibonacciTest.java" />
+      <change type="MODIFICATION" beforePath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/math/numbers/KaratsubaTest.java" afterPath="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/math/numbers/KaratsubaTest.java" />
     </list>
     <ignored path="javaspecialists.iws" />
     <ignored path=".idea/workspace.xml" />
+    <file path="/Dummy.txt" changelist="ecd1422d-0b60-43c5-b99b-60eb800de7cc" time="1355415595630" ignored="false" />
     <option name="TRACKING_ENABLED" value="true" />
     <option name="SHOW_DIALOG" value="false" />
     <option name="HIGHLIGHT_CONFLICTS" value="true" />
@@ -79,7 +172,8 @@
     <groupTables value="false" />
   </component>
   <component name="DebuggerManager">
-    <breakpoint_any>
+    <breakpoint_rules default_suspend_policy="SuspendAll" />
+    <breakpoint_any default_suspend_policy="SuspendAll">
       <breakpoint>
         <option name="NOTIFY_CAUGHT" value="true" />
         <option name="NOTIFY_UNCAUGHT" value="true" />
@@ -111,110 +205,106 @@
         <option name="LOG_MESSAGE" value="" />
       </breakpoint>
     </breakpoint_any>
+    <ui_properties default_suspend_policy="SuspendAll" />
     <breakpoint_rules />
     <ui_properties />
   </component>
+  <component name="ExecutionTargetManager" SELECTED_TARGET="default_target" />
   <component name="FavoritesManager">
     <favorites_list name="javaspecialists" />
   </component>
   <component name="FileEditorManager">
     <leaf>
-      <file leaf-file-name="SerialExecutor.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java">
+      <file leaf-file-name="HugeConcurrentHashMapV8Factory.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="30" column="13" selection-start="1045" selection-end="1045" vertical-scroll-proportion="0.0">
+            <state line="23" column="43" selection-start="923" selection-end="923" vertical-scroll-proportion="0.0">
               <folding>
                 <element signature="imports" expanded="true" />
-                <marker date="1352819802000" expanded="true" signature="855:923" placeholder="/**...*/" />
-                <element signature="e#1376#1581#0" expanded="true" />
-                <element signature="e#1570#1571#0" expanded="true" />
               </folding>
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="StripedExecutorService.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java">
+      <file leaf-file-name="DenseMemoryUsage.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="41" column="13" selection-start="1587" selection-end="1587" vertical-scroll-proportion="0.0">
-              <folding>
-                <element signature="e#0#14236#0" expanded="true" />
-                <element signature="imports" expanded="true" />
-                <element signature="e#13161#13338#0" expanded="true" />
-                <element signature="e#13327#13328#0" expanded="true" />
-              </folding>
+            <state line="23" column="13" selection-start="927" selection-end="927" vertical-scroll-proportion="0.0">
+              <folding />
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="StripedCallable.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java">
+      <file leaf-file-name="FullMemoryUsage.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="28" column="17" selection-start="1012" selection-end="1012" vertical-scroll-proportion="0.0">
+            <state line="23" column="13" selection-start="927" selection-end="927" vertical-scroll-proportion="0.0">
               <folding />
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="Executor.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.7.0_09.jdk/Contents/Home/src.zip!/java/util/concurrent/Executor.java">
+      <file leaf-file-name="HighlyScalableTableFactory.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="127" column="17" selection-start="3266" selection-end="3266" vertical-scroll-proportion="0.0">
+            <state line="23" column="32" selection-start="914" selection-end="914" vertical-scroll-proportion="0.0">
               <folding />
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="StripedExecutorDemo.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorDemo.java">
+      <file leaf-file-name="MemoryTestBench.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="24" column="13" selection-start="919" selection-end="919" vertical-scroll-proportion="0.0">
-              <folding>
-                <element signature="imports" expanded="true" />
-              </folding>
+            <state line="23" column="39" selection-start="923" selection-end="923" vertical-scroll-proportion="0.0">
+              <folding />
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="SerialExecutorDemo.java" pinned="false" current="true" current-in-tab="true">
-        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemo.java">
+      <file leaf-file-name="BasicObjectFactory.java" pinned="false" current="true" current-in-tab="true">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="7" column="13" selection-start="187" selection-end="187" vertical-scroll-proportion="0.056338027">
+            <state line="8" column="2" selection-start="376" selection-end="376" vertical-scroll-proportion="0.29862475">
               <folding />
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="TristateCheckBoxTest.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java">
+      <file leaf-file-name="ObjectFactory.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="31" column="13" selection-start="1024" selection-end="1024" vertical-scroll-proportion="0.0">
+            <state line="20" column="17" selection-start="810" selection-end="810" vertical-scroll-proportion="0.0">
+              <folding />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="MemoryUsage.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="23" column="24" selection-start="927" selection-end="938" vertical-scroll-proportion="0.0">
               <folding>
-                <element signature="e#0#3875#0" expanded="true" />
                 <element signature="imports" expanded="true" />
-                <element signature="e#1144#2102#0" expanded="true" />
-                <element signature="e#2091#2092#0" expanded="true" />
-                <element signature="e#2293#2847#0" expanded="true" />
-                <element signature="e#2836#2837#0" expanded="true" />
-                <element signature="e#2888#3030#0" expanded="true" />
-                <element signature="e#3019#3020#0" expanded="true" />
-                <element signature="e#3139#3281#0" expanded="true" />
-                <element signature="e#3270#3271#0" expanded="true" />
-                <element signature="e#3388#3616#0" expanded="true" />
-                <element signature="e#3605#3606#0" expanded="true" />
               </folding>
             </state>
           </provider>
         </entry>
       </file>
-      <file leaf-file-name="JFrame.java" pinned="false" current="false" current-in-tab="false">
-        <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.7.0_09.jdk/Contents/Home/src.zip!/javax/swing/JFrame.java">
+      <file leaf-file-name="IntegerObjectFactory.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state line="126" column="28" selection-start="4414" selection-end="4414" vertical-scroll-proportion="0.0">
-              <folding>
-                <element signature="e#0#33290#0" expanded="false" />
-                <element signature="imports" expanded="false" />
-              </folding>
+            <state line="22" column="13" selection-start="875" selection-end="875" vertical-scroll-proportion="0.0">
+              <folding />
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file leaf-file-name="DenseHighlyScalableTableFactory.java" pinned="false" current="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java">
+          <provider selected="true" editor-type-id="text-editor">
+            <state line="23" column="32" selection-start="930" selection-end="930" vertical-scroll-proportion="0.0">
+              <folding />
             </state>
           </provider>
         </entry>
@@ -232,22 +322,22 @@
   <component name="IdeDocumentHistory">
     <option name="changedFiles">
       <list>
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemoBUg.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemo.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemoBug.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/adsf.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/asdf.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue145/asdf.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorDemo.java" />
-        <option value="/Library/Java/JavaVirtualMachines/jdk1.7.0_09.jdk/Contents/Home/src.zip!/java/util/concurrent/Executor.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java" />
-        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorExample.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseHashtableFactory.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseHighlyScalableTable.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMapObjectFactory.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseSmallConcurrentHashMapFactory.java" />
+        <option value="$PROJECT_DIR$/pom.xml" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashtableFactory.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTable.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapFactoryV8.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTable.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java" />
+        <option value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java" />
       </list>
     </option>
   </component>
@@ -280,8 +370,8 @@
   </component>
   <component name="ProjectFrameBounds">
     <option name="y" value="22" />
-    <option name="width" value="1777" />
-    <option name="height" value="1519" />
+    <option name="width" value="2556" />
+    <option name="height" value="1578" />
   </component>
   <component name="ProjectInspectionProfilesVisibleTreeState">
     <entry key="Project Default">
@@ -376,202 +466,32 @@
       <sortByType />
     </navigator>
     <panes>
-      <pane id="ProjectPane">
+      <pane id="PackagesPane">
         <subPane>
           <PATH>
             <PATH_ELEMENT>
               <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javax" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javax" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="swing" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="util" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="util" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="concurrent" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PackageViewProjectNode" />
             </PATH_ELEMENT>
-          </PATH>
-          <PATH>
             <PATH_ELEMENT>
               <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
+              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PackageViewModuleNode" />
             </PATH_ELEMENT>
           </PATH>
+        </subPane>
+      </pane>
+      <pane id="Scope">
+        <subPane subId="Project Files">
           <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="External Libraries" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="awt" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
+            <PATH_ELEMENT USER_OBJECT="Root">
+              <option name="myItemId" value="" />
+              <option name="myItemType" value="" />
             </PATH_ELEMENT>
           </PATH>
+        </subPane>
+      </pane>
+      <pane id="ProjectPane">
+        <subPane>
           <PATH>
             <PATH_ELEMENT>
               <option name="myItemId" value="javaspecialists" />
@@ -581,26 +501,6 @@
               <option name="myItemId" value="External Libraries" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ExternalLibrariesNode" />
             </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="&lt; 1.7 &gt;" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.NamedLibraryElementNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="rt.jar" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="awt" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="event" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
           </PATH>
           <PATH>
             <PATH_ELEMENT>
@@ -667,10 +567,6 @@
               <option name="myItemId" value="concurrency" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="stripedexecutor" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
           </PATH>
           <PATH>
             <PATH_ELEMENT>
@@ -686,7 +582,7 @@
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
-              <option name="myItemId" value="test" />
+              <option name="myItemId" value="main" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
@@ -698,7 +594,7 @@
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
-              <option name="myItemId" value="concurrency" />
+              <option name="myItemId" value="memory" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
           </PATH>
@@ -754,7 +650,7 @@
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
-              <option name="myItemId" value="gui" />
+              <option name="myItemId" value="examples" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
           </PATH>
@@ -788,7 +684,7 @@
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
-              <option name="myItemId" value="issue206" />
+              <option name="myItemId" value="issue193" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
           </PATH>
@@ -821,72 +717,12 @@
               <option name="myItemId" value="examples" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
-          </PATH>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="src" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="main" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="tjsn" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="concurrency" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="util" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-          </PATH>
-          <PATH>
             <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.ProjectViewProjectNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
+              <option name="myItemId" value="issue193" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
-              <option name="myItemId" value="src" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="main" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="tjsn" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="concurrency" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="stripedexecutor" />
+              <option name="myItemId" value="objectfactories" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
           </PATH>
@@ -900,52 +736,16 @@
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
             <PATH_ELEMENT>
-              <option name="myItemId" value="src" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="main" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="java" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="tjsn" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
-            </PATH_ELEMENT>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="concurrency" />
+              <option name="myItemId" value="lib" />
               <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PsiDirectoryNode" />
             </PATH_ELEMENT>
           </PATH>
         </subPane>
       </pane>
-      <pane id="PackagesPane">
-        <subPane>
-          <PATH>
-            <PATH_ELEMENT>
-              <option name="myItemId" value="javaspecialists" />
-              <option name="myItemType" value="com.intellij.ide.projectView.impl.nodes.PackageViewProjectNode" />
-            </PATH_ELEMENT>
-          </PATH>
-        </subPane>
-      </pane>
-      <pane id="Scope">
-        <subPane subId="Project Files">
-          <PATH>
-            <PATH_ELEMENT USER_OBJECT="Root">
-              <option name="myItemId" value="" />
-              <option name="myItemType" value="" />
-            </PATH_ELEMENT>
-          </PATH>
-        </subPane>
-      </pane>
     </panes>
   </component>
   <component name="PropertiesComponent">
-    <property name="last_directory_selection" value="$PROJECT_DIR$/src/main/java" />
+    <property name="last_directory_selection" value="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193" />
     <property name="GoToFile.includeJavaFiles" value="false" />
     <property name="project.structure.last.edited" value="Modules" />
     <property name="OverrideImplement.combined" value="true" />
@@ -953,7 +753,7 @@
     <property name="options.splitter.main.proportions" value="0.3" />
     <property name="recentsLimit" value="5" />
     <property name="MemberChooser.sorted" value="false" />
-    <property name="options.lastSelected" value="preferences.sourceCode" />
+    <property name="options.lastSelected" value="copyright.profiles" />
     <property name="project.structure.side.proportion" value="0.2" />
     <property name="MemberChooser.copyJavadoc" value="false" />
     <property name="GoToClass.toSaveIncludeLibraries" value="false" />
@@ -973,6 +773,7 @@
       <recent name="eu.javaspecialists.tjsn.math.numbers" />
     </key>
     <key name="CopyFile.RECENT_KEYS">
+      <recent name="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193" />
       <recent name="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue188" />
       <recent name="$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187" />
       <recent name="$PROJECT_DIR$/src/test/java/eu/javaspecialists/tjsn/examples/issue198" />
@@ -983,93 +784,112 @@
       <recent name="eu.javaspecialists.tjsn.math.numbers.BasicKaratsuba" />
     </key>
     <key name="CreateClassDialog.RecentsKey">
+      <recent name="eu.javaspecialists.tjsn.memory" />
       <recent name="eu.javaspecialists.tjsn.concurrency.util" />
       <recent name="eu.javaspecialists.tjsn.math.fibonacci" />
       <recent name="eu.javaspecialists.tjsn.math.numbers" />
     </key>
     <key name="MoveClassesOrPackagesDialog.RECENTS_KEY">
+      <recent name="eu.javaspecialists.tjsn.examples.issue193" />
+      <recent name="eu.javaspecialists.tjsn.examples.issue193.objectfactories" />
+      <recent name="eu.javaspecialists.tjsn.memory" />
       <recent name="eu.javaspecialists.tjsn.math.numbers" />
       <recent name="eu.javaspecialists.tjsn.math" />
-      <recent name="eu.javaspecialists.tjsn.concurrency.interlocker" />
-      <recent name="eu.javaspecialists.tjsn.concurrency" />
-      <recent name="eu.javaspecialists.tjsn.examples.issue187" />
     </key>
   </component>
-  <component name="RunManager" selected="Application.StripedExecutorExample">
-    <configuration default="false" name="StripedExecutorDemo" type="Application" factoryName="Application" temporary="true">
+  <component name="RunManager" selected="Application.MemoryUsage">
+    <configuration default="false" name="AutoLockTest.testLockingWithException" type="JUnit" factoryName="JUnit" temporary="true">
       <extension name="coverage" enabled="false" merge="false" runner="idea">
         <pattern>
-          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue206.*" />
+          <option name="PATTERN" value="eu.javaspecialists.tjsn.concurrency.*" />
           <option name="ENABLED" value="true" />
         </pattern>
       </extension>
-      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue206.StripedExecutorDemo" />
-      <option name="VM_PARAMETERS" />
-      <option name="PROGRAM_PARAMETERS" />
-      <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
+      <module name="javaspecialists" />
       <option name="ALTERNATIVE_JRE_PATH_ENABLED" value="false" />
       <option name="ALTERNATIVE_JRE_PATH" />
-      <option name="ENABLE_SWING_INSPECTOR" value="false" />
+      <option name="PACKAGE_NAME" value="eu.javaspecialists.tjsn.concurrency" />
+      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.concurrency.AutoLockTest" />
+      <option name="METHOD_NAME" value="testLockingWithException" />
+      <option name="TEST_OBJECT" value="method" />
+      <option name="VM_PARAMETERS" />
+      <option name="PARAMETERS" />
+      <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
       <option name="ENV_VARIABLES" />
       <option name="PASS_PARENT_ENVS" value="true" />
-      <module name="javaspecialists" />
+      <option name="TEST_SEARCH_SCOPE">
+        <value defaultName="moduleWithDependencies" />
+      </option>
       <envs />
+      <patterns />
       <RunnerSettings RunnerId="Run" />
       <ConfigurationWrapper RunnerId="Run" />
       <method />
     </configuration>
-    <configuration default="false" name="SerialExecutorDemoBug" type="Application" factoryName="Application" temporary="true">
+    <configuration default="false" name="AutoLockTest" type="JUnit" factoryName="JUnit" temporary="true">
       <extension name="coverage" enabled="false" merge="false" runner="idea">
         <pattern>
-          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue206.*" />
+          <option name="PATTERN" value="eu.javaspecialists.tjsn.concurrency.*" />
           <option name="ENABLED" value="true" />
         </pattern>
       </extension>
-      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue206.SerialExecutorDemoBug" />
-      <option name="VM_PARAMETERS" />
-      <option name="PROGRAM_PARAMETERS" />
-      <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
+      <module name="javaspecialists" />
       <option name="ALTERNATIVE_JRE_PATH_ENABLED" value="false" />
       <option name="ALTERNATIVE_JRE_PATH" />
-      <option name="ENABLE_SWING_INSPECTOR" value="false" />
+      <option name="PACKAGE_NAME" value="eu.javaspecialists.tjsn.concurrency" />
+      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.concurrency.AutoLockTest" />
+      <option name="METHOD_NAME" />
+      <option name="TEST_OBJECT" value="class" />
+      <option name="VM_PARAMETERS" />
+      <option name="PARAMETERS" />
+      <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
       <option name="ENV_VARIABLES" />
       <option name="PASS_PARENT_ENVS" value="true" />
-      <module name="javaspecialists" />
+      <option name="TEST_SEARCH_SCOPE">
+        <value defaultName="moduleWithDependencies" />
+      </option>
       <envs />
+      <patterns />
       <RunnerSettings RunnerId="Run" />
       <ConfigurationWrapper RunnerId="Run" />
       <method />
     </configuration>
-    <configuration default="false" name="TristateCheckBoxTest" type="Application" factoryName="Application" temporary="true">
+    <configuration default="false" name="AutoLockTest.testLockingWithInterrupt" type="JUnit" factoryName="JUnit" temporary="true">
       <extension name="coverage" enabled="false" merge="false" runner="idea">
         <pattern>
-          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue145.*" />
+          <option name="PATTERN" value="eu.javaspecialists.tjsn.concurrency.*" />
           <option name="ENABLED" value="true" />
         </pattern>
       </extension>
-      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue145.TristateCheckBoxTest" />
-      <option name="VM_PARAMETERS" />
-      <option name="PROGRAM_PARAMETERS" />
-      <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
+      <module name="javaspecialists" />
       <option name="ALTERNATIVE_JRE_PATH_ENABLED" value="false" />
       <option name="ALTERNATIVE_JRE_PATH" />
-      <option name="ENABLE_SWING_INSPECTOR" value="false" />
+      <option name="PACKAGE_NAME" value="eu.javaspecialists.tjsn.concurrency" />
+      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.concurrency.AutoLockTest" />
+      <option name="METHOD_NAME" value="testLockingWithInterrupt" />
+      <option name="TEST_OBJECT" value="method" />
+      <option name="VM_PARAMETERS" />
+      <option name="PARAMETERS" />
+      <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
       <option name="ENV_VARIABLES" />
       <option name="PASS_PARENT_ENVS" value="true" />
-      <module name="javaspecialists" />
+      <option name="TEST_SEARCH_SCOPE">
+        <value defaultName="moduleWithDependencies" />
+      </option>
       <envs />
+      <patterns />
       <RunnerSettings RunnerId="Run" />
       <ConfigurationWrapper RunnerId="Run" />
       <method />
     </configuration>
-    <configuration default="false" name="SerialExecutorExample" type="Application" factoryName="Application" temporary="true">
+    <configuration default="false" name="FullMemoryUsage" type="Application" factoryName="Application" temporary="true">
       <extension name="coverage" enabled="false" merge="false" runner="idea">
         <pattern>
-          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue206.*" />
+          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue193.*" />
           <option name="ENABLED" value="true" />
         </pattern>
       </extension>
-      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue206.SerialExecutorExample" />
+      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue193.FullMemoryUsage" />
       <option name="VM_PARAMETERS" />
       <option name="PROGRAM_PARAMETERS" />
       <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
@@ -1084,14 +904,14 @@
       <ConfigurationWrapper RunnerId="Run" />
       <method />
     </configuration>
-    <configuration default="false" name="StripedExecutorExample" type="Application" factoryName="Application" temporary="true">
+    <configuration default="false" name="MemoryUsage" type="Application" factoryName="Application" temporary="true">
       <extension name="coverage" enabled="false" merge="false" runner="idea">
         <pattern>
-          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue206.*" />
+          <option name="PATTERN" value="eu.javaspecialists.tjsn.examples.issue193.*" />
           <option name="ENABLED" value="true" />
         </pattern>
       </extension>
-      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue206.StripedExecutorExample" />
+      <option name="MAIN_CLASS_NAME" value="eu.javaspecialists.tjsn.examples.issue193.MemoryUsage" />
       <option name="VM_PARAMETERS" />
       <option name="PROGRAM_PARAMETERS" />
       <option name="WORKING_DIRECTORY" value="$PROJECT_DIR$" />
@@ -1167,7 +987,6 @@
         <option name="AntTarget" enabled="false" />
         <option name="BuildArtifacts" enabled="false" />
         <option name="Maven.BeforeRunTask" enabled="false" />
-        <option name="PhingTarget" enabled="false" />
       </method>
     </configuration>
     <configuration default="true" type="Applet" factoryName="Applet">
@@ -1186,7 +1005,6 @@
         <option name="BuildArtifacts" enabled="false" />
         <option name="Make" enabled="true" />
         <option name="Maven.BeforeRunTask" enabled="false" />
-        <option name="PhingTarget" enabled="false" />
       </method>
     </configuration>
     <configuration default="true" type="Application" factoryName="Application">
@@ -1207,7 +1025,6 @@
         <option name="BuildArtifacts" enabled="false" />
         <option name="Make" enabled="true" />
         <option name="Maven.BeforeRunTask" enabled="false" />
-        <option name="PhingTarget" enabled="false" />
       </method>
     </configuration>
     <configuration default="true" type="JUnit" factoryName="JUnit">
@@ -1234,15 +1051,14 @@
         <option name="BuildArtifacts" enabled="false" />
         <option name="Make" enabled="true" />
         <option name="Maven.BeforeRunTask" enabled="false" />
-        <option name="PhingTarget" enabled="false" />
       </method>
     </configuration>
     <list size="5">
-      <item index="0" class="java.lang.String" itemvalue="Application.StripedExecutorDemo" />
-      <item index="1" class="java.lang.String" itemvalue="Application.SerialExecutorDemoBug" />
-      <item index="2" class="java.lang.String" itemvalue="Application.TristateCheckBoxTest" />
-      <item index="3" class="java.lang.String" itemvalue="Application.SerialExecutorExample" />
-      <item index="4" class="java.lang.String" itemvalue="Application.StripedExecutorExample" />
+      <item index="0" class="java.lang.String" itemvalue="JUnit.AutoLockTest.testLockingWithException" />
+      <item index="1" class="java.lang.String" itemvalue="JUnit.AutoLockTest" />
+      <item index="2" class="java.lang.String" itemvalue="JUnit.AutoLockTest.testLockingWithInterrupt" />
+      <item index="3" class="java.lang.String" itemvalue="Application.FullMemoryUsage" />
+      <item index="4" class="java.lang.String" itemvalue="Application.MemoryUsage" />
     </list>
     <configuration name="&lt;template&gt;" type="WebApp" default="true" selected="false">
       <Host>localhost</Host>
@@ -1477,7 +1293,19 @@
       <created>1352747649414</created>
       <updated>1352747649414</updated>
     </task>
-    <option name="localTasksCounter" value="51" />
+    <task id="LOCAL-00051" summary="Added demos that show how the SerialExecutor works">
+      <created>1352819863107</created>
+      <updated>1352819863107</updated>
+    </task>
+    <task id="LOCAL-00052" summary="Added demos that show how the SerialExecutor works">
+      <created>1352824740051</created>
+      <updated>1352824740053</updated>
+    </task>
+    <task id="LOCAL-00053" summary="Added toString methods to the StripedExecutorService for debugging purposes.">
+      <created>1353228331774</created>
+      <updated>1353228331774</updated>
+    </task>
+    <option name="localTasksCounter" value="54" />
     <servers />
   </component>
   <component name="TodoView" selected-index="0">
@@ -1501,7 +1329,7 @@
     </todo-panel>
   </component>
   <component name="ToolWindowManager">
-    <frame x="0" y="22" width="1777" height="1519" extended-state="0" />
+    <frame x="0" y="22" width="2556" height="1578" extended-state="6" />
     <editor active="false" />
     <layout>
       <window_info id="Data Sources" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.32988048" sideWeight="0.5" order="3" side_tool="false" content_ui="tabs" />
@@ -1517,15 +1345,20 @@
       <window_info id="Structure" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="1" side_tool="true" content_ui="tabs" />
       <window_info id="Maven Projects" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.15251799" sideWeight="0.5072655" order="3" side_tool="false" content_ui="tabs" />
       <window_info id="Commander" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.4" sideWeight="0.5" order="0" side_tool="false" content_ui="tabs" />
-      <window_info id="Project" active="true" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.25014442" sideWeight="0.4892704" order="0" side_tool="false" content_ui="combo" />
-      <window_info id="Run" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.5107296" sideWeight="0.9621514" order="2" side_tool="false" content_ui="tabs" />
+      <window_info id="Project" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.21513945" sideWeight="0.38297874" order="0" side_tool="false" content_ui="combo" />
+      <window_info id="Run" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="true" weight="0.61702126" sideWeight="0.9621514" order="2" side_tool="false" content_ui="tabs" />
+      <window_info id="Database" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="3" side_tool="false" content_ui="tabs" />
+      <window_info id="IDEtalk Messages" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="8" side_tool="false" content_ui="tabs" />
+      <window_info id="IDEtalk" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="3" side_tool="false" content_ui="tabs" />
+      <window_info id="Coverage" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.3409091" sideWeight="0.43582705" order="3" side_tool="true" content_ui="tabs" />
+      <window_info id="Application Servers" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="8" side_tool="false" content_ui="tabs" />
+      <window_info id="Hierarchy" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="2" side_tool="false" content_ui="tabs" />
       <window_info id="Cvs" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="5" side_tool="false" content_ui="tabs" />
+      <window_info id="JetGradle" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="3" side_tool="false" content_ui="tabs" />
       <window_info id="Message" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.33" sideWeight="0.5" order="0" side_tool="false" content_ui="tabs" />
       <window_info id="Find" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.41215324" sideWeight="0.5" order="1" side_tool="false" content_ui="tabs" />
-      <window_info id="Coverage" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.3409091" sideWeight="0.43582705" order="3" side_tool="true" content_ui="tabs" />
       <window_info id="Web" active="false" anchor="left" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="2" side_tool="false" content_ui="tabs" />
       <window_info id="EJB" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="4" side_tool="false" content_ui="tabs" />
-      <window_info id="Hierarchy" active="false" anchor="right" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.25" sideWeight="0.5" order="2" side_tool="false" content_ui="tabs" />
       <window_info id="Inspection" active="false" anchor="bottom" auto_hide="false" internal_type="DOCKED" type="DOCKED" visible="false" weight="0.4" sideWeight="0.5" order="6" side_tool="false" content_ui="tabs" />
     </layout>
   </component>
@@ -1569,7 +1402,7 @@
     <option name="SHOW_VCS_ERROR_NOTIFICATIONS" value="true" />
     <option name="FORCE_NON_EMPTY_COMMENT" value="false" />
     <option name="CLEAR_INITIAL_COMMIT_MESSAGE" value="false" />
-    <option name="LAST_COMMIT_MESSAGE" value="Updated comments" />
+    <option name="LAST_COMMIT_MESSAGE" value="Added toString methods to the StripedExecutorService for debugging purposes." />
     <option name="MAKE_NEW_CHANGELIST_ACTIVE" value="true" />
     <option name="OPTIMIZE_IMPORTS_BEFORE_PROJECT_COMMIT" value="true" />
     <option name="CHECK_FILES_UP_TO_DATE_BEFORE_COMMIT" value="false" />
@@ -1582,8 +1415,6 @@
     <option name="UPDATE_GROUP_BY_CHANGELIST" value="false" />
     <option name="SHOW_FILE_HISTORY_AS_TREE" value="false" />
     <option name="FILE_HISTORY_SPLITTER_PROPORTION" value="0.6" />
-    <MESSAGE value="Added check for n &lt; 0." />
-    <MESSAGE value="Published under Apache 2.0 license" />
     <MESSAGE value="Added examples from newsletter #203" />
     <MESSAGE value="Removed Takahashi from test as it does not cancel fast enough." />
     <MESSAGE value="Added the FutureResult, based on Doug Lea's class and modified FibonacciCache according to Joe Bowbeer's suggestions" />
@@ -1607,6 +1438,8 @@
     <MESSAGE value="Added TristateCheckBox from newsletter #145." />
     <MESSAGE value="Updated reference to JFrame constant to instead point to WindowConstants" />
     <MESSAGE value="Updated comments" />
+    <MESSAGE value="Added demos that show how the SerialExecutor works" />
+    <MESSAGE value="Added toString methods to the StripedExecutorService for debugging purposes." />
   </component>
   <component name="XDebuggerManager">
     <breakpoint-manager />
@@ -1616,142 +1449,102 @@
     <option name="FILTER_TARGETS" value="false" />
   </component>
   <component name="editorHistoryManager">
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ReentrantLockFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="29" column="13" selection-start="1102" selection-end="1102" vertical-scroll-proportion="0.0">
-          <folding />
-        </state>
+        <state line="24" column="13" selection-start="913" selection-end="913" vertical-scroll-proportion="0.0" />
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SmallConcurrentHashMapFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="26" column="13" selection-start="916" selection-end="946" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="e#0#2461#0" expanded="false" />
-          </folding>
-        </state>
+        <state line="24" column="13" selection-start="907" selection-end="907" vertical-scroll-proportion="0.0" />
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="28" column="0" selection-start="953" selection-end="953" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="e#0#2799#0" expanded="true" />
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
+        <state line="24" column="13" selection-start="896" selection-end="896" vertical-scroll-proportion="0.0" />
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseSmallConcurrentHashMapFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="31" column="19" selection-start="1032" selection-end="1032" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="e#0#3946#0" expanded="true" />
-            <element signature="imports" expanded="true" />
-            <element signature="e#1197#1418#0" expanded="true" />
-            <element signature="e#1403#1404#0" expanded="true" />
-            <element signature="e#2052#2209#0" expanded="true" />
-            <element signature="e#2198#2199#0" expanded="true" />
-          </folding>
-        </state>
+        <state line="24" column="13" selection-start="907" selection-end="907" vertical-scroll-proportion="0.0" />
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BigConcurrentHashMapFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="25" column="0" selection-start="891" selection-end="891" vertical-scroll-proportion="0.0">
-          <folding />
-        </state>
+        <state line="24" column="13" selection-start="907" selection-end="907" vertical-scroll-proportion="0.0" />
       </provider>
     </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.7.0_09.jdk/Contents/Home/src.zip!/javax/swing/WindowConstants.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ConcurrentHashMapFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="47" column="32" selection-start="965" selection-end="980" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="e#0#2140#0" expanded="false" />
-          </folding>
-        </state>
+        <state line="24" column="13" selection-start="907" selection-end="907" vertical-scroll-proportion="0.0" />
       </provider>
     </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.7.0_09.jdk/Contents/Home/src.zip!/javax/swing/JFrame.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="126" column="28" selection-start="4414" selection-end="4414" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="e#0#33290#0" expanded="false" />
-            <element signature="imports" expanded="false" />
-          </folding>
+        <state line="23" column="32" selection-start="930" selection-end="930" vertical-scroll-proportion="0.0">
+          <folding />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="22" column="13" selection-start="875" selection-end="875" vertical-scroll-proportion="0.0" />
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="31" column="13" selection-start="1024" selection-end="1024" vertical-scroll-proportion="0.0">
+        <state line="23" column="43" selection-start="923" selection-end="923" vertical-scroll-proportion="0.0">
           <folding>
-            <element signature="e#0#3875#0" expanded="true" />
             <element signature="imports" expanded="true" />
-            <element signature="e#1144#2102#0" expanded="true" />
-            <element signature="e#2091#2092#0" expanded="true" />
-            <element signature="e#2293#2847#0" expanded="true" />
-            <element signature="e#2836#2837#0" expanded="true" />
-            <element signature="e#2888#3030#0" expanded="true" />
-            <element signature="e#3019#3020#0" expanded="true" />
-            <element signature="e#3139#3281#0" expanded="true" />
-            <element signature="e#3270#3271#0" expanded="true" />
-            <element signature="e#3388#3616#0" expanded="true" />
-            <element signature="e#3605#3606#0" expanded="true" />
           </folding>
         </state>
       </provider>
     </entry>
-    <entry file="jar:///Library/Java/JavaVirtualMachines/jdk1.7.0_09.jdk/Contents/Home/src.zip!/java/util/concurrent/Executor.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="127" column="17" selection-start="3266" selection-end="3266" vertical-scroll-proportion="0.0">
+        <state line="23" column="32" selection-start="914" selection-end="914" vertical-scroll-proportion="0.0">
           <folding />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="30" column="13" selection-start="1045" selection-end="1045" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="imports" expanded="true" />
-            <marker date="1352819802000" expanded="true" signature="855:923" placeholder="/**...*/" />
-            <element signature="e#1376#1581#0" expanded="true" />
-            <element signature="e#1570#1571#0" expanded="true" />
-          </folding>
+        <state line="20" column="17" selection-start="810" selection-end="810" vertical-scroll-proportion="0.0">
+          <folding />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state line="23" column="13" selection-start="927" selection-end="927" vertical-scroll-proportion="0.0" />
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="28" column="17" selection-start="1012" selection-end="1012" vertical-scroll-proportion="0.0">
+        <state line="23" column="13" selection-start="927" selection-end="927" vertical-scroll-proportion="0.0">
           <folding />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="41" column="13" selection-start="1587" selection-end="1587" vertical-scroll-proportion="0.0">
+        <state line="23" column="24" selection-start="927" selection-end="938" vertical-scroll-proportion="0.0">
           <folding>
-            <element signature="e#0#14236#0" expanded="true" />
             <element signature="imports" expanded="true" />
-            <element signature="e#13161#13338#0" expanded="true" />
-            <element signature="e#13327#13328#0" expanded="true" />
           </folding>
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorDemo.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="24" column="13" selection-start="919" selection-end="919" vertical-scroll-proportion="0.0">
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
+        <state line="23" column="39" selection-start="923" selection-end="923" vertical-scroll-proportion="0.0">
+          <folding />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorDemo.java">
+    <entry file="file://$PROJECT_DIR$/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state line="7" column="13" selection-start="187" selection-end="187" vertical-scroll-proportion="0.056338027">
+        <state line="8" column="2" selection-start="376" selection-end="376" vertical-scroll-proportion="0.29862475">
           <folding />
         </state>
       </provider>
@@ -1826,7 +1619,6 @@
             <option name="proportions">
               <list>
                 <option value="0.2" />
-                <option value="0.5" />
               </list>
             </option>
           </splitter-proportions>
diff --git a/pom.xml b/pom.xml
index 3d630eb..8608b03 100644
--- a/pom.xml
+++ b/pom.xml
@@ -1,6 +1,6 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <!--
-  ~ Copyright (C) 2000-2012 Heinz Max Kabutz
+  ~ Copyright (C) 2000-2013 Heinz Max Kabutz
   ~
   ~ See the NOTICE file distributed with this work for additional
   ~ information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -20,30 +20,48 @@
 <project xmlns="http://maven.apache.org/POM/4.0.0"
          xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
          xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
-    <modelVersion>4.0.0</modelVersion>
+  <modelVersion>4.0.0</modelVersion>
 
-    <groupId>javaspecialists</groupId>
-    <artifactId>javaspecialists</artifactId>
-    <version>0.1</version>
-    <dependencies>
-        <dependency>
-            <groupId>junit</groupId>
-            <artifactId>junit</artifactId>
-            <version>4.9</version>
-        </dependency>
-    </dependencies>
+  <groupId>javaspecialists</groupId>
+  <artifactId>javaspecialists</artifactId>
+  <version>0.1</version>
+  <dependencies>
+    <dependency>
+      <groupId>junit</groupId>
+      <artifactId>junit</artifactId>
+      <version>4.9</version>
+    </dependency>
 
-    <build>
-        <plugins>
-            <plugin>
-                <groupId>org.apache.maven.plugins</groupId>
-                <artifactId>maven-compiler-plugin</artifactId>
-                <version>2.4</version>
-                <configuration>
-                    <source>1.7</source>
-                    <target>1.7</target>
-                </configuration>
-            </plugin>
-        </plugins>
-    </build>
+    <dependency>
+      <groupId>high-scale-lib</groupId>
+      <artifactId>high-scale-lib</artifactId>
+      <version>1.1.2</version>
+      <scope>system</scope>
+      <systemPath>${basedir}/lib/high-scale-lib.jar</systemPath>
+    </dependency>
+
+    <dependency>
+      <groupId>jsr166e</groupId>
+      <artifactId>jsr166e</artifactId>
+      <version>0.1</version>
+      <scope>system</scope>
+      <systemPath>${basedir}/lib/jsr166e.jar</systemPath>
+    </dependency>
+
+
+  </dependencies>
+
+  <build>
+    <plugins>
+      <plugin>
+        <groupId>org.apache.maven.plugins</groupId>
+        <artifactId>maven-compiler-plugin</artifactId>
+        <version>2.4</version>
+        <configuration>
+          <source>1.7</source>
+          <target>1.7</target>
+        </configuration>
+      </plugin>
+    </plugins>
+  </build>
 </project>
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/AutoLock.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/AutoLock.java
new file mode 100644
index 0000000..7d48b90
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/AutoLock.java
@@ -0,0 +1,60 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.concurrency;
+
+import java.util.concurrent.locks.*;
+
+/**
+ * From http://www.javaspecialists.eu/archive/Issue190.html
+ */
+public class AutoLock implements AutoCloseable {
+  public static AutoLock lock(Lock lock) {
+    return new AutoLockNormal(lock);
+  }
+
+  public static AutoLock lockInterruptibly(Lock lock)
+      throws InterruptedException {
+    return new AutoLockInterruptibly(lock);
+  }
+
+  private final Lock lock;
+
+  public void close() {
+    lock.unlock();
+  }
+
+  private AutoLock(Lock lock) {
+    this.lock = lock;
+  }
+
+  private static class AutoLockNormal extends AutoLock {
+    public AutoLockNormal(Lock lock) {
+      super(lock);
+      lock.lock();
+    }
+  }
+
+  private static class AutoLockInterruptibly extends AutoLock {
+    public AutoLockInterruptibly(Lock lock)
+        throws InterruptedException {
+      super(lock);
+      lock.lockInterruptibly();
+    }
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterlockTask.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterlockTask.java
index 820a20e..4455323 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterlockTask.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterlockTask.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,18 +26,18 @@
  * @author Dr Heinz M. Kabutz
  */
 public interface InterlockTask<T> {
-    boolean isDone();
+  boolean isDone();
 
-    /**
-     * The call() method is called interleaved by the the threads in a
-     * round-robin fashion.
-     */
-    void call();
+  /**
+   * The call() method is called interleaved by the the threads in a
+   * round-robin fashion.
+   */
+  void call();
 
-    /**
-     * Returns the result after all the call()'s have completed.
-     */
-    T get();
+  /**
+   * Returns the result after all the call()'s have completed.
+   */
+  T get();
 
-    void reset();
+  void reset();
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlocker.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlocker.java
index 00e356a..e1e7222 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlocker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlocker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,19 +28,19 @@
  * @author Dr Heinz M. Kabutz
  */
 public abstract class Interlocker {
-    protected abstract Runnable[] getRunnables(InterlockTask task);
+  protected abstract Runnable[] getRunnables(InterlockTask task);
 
-    public final <T> T execute(InterlockTask<T> task)
-            throws InterruptedException {
-        Runnable[] jobs = getRunnables(task);
-        Thread[] threads = new Thread[jobs.length];
-        for (int i = 0; i < threads.length; i++) {
-            threads[i] = new Thread(jobs[i]);
-            threads[i].start();
-        }
-        for (Thread thread : threads) {
-            thread.join();
-        }
-        return task.get();
+  public final <T> T execute(InterlockTask<T> task)
+      throws InterruptedException {
+    Runnable[] jobs = getRunnables(task);
+    Thread[] threads = new Thread[jobs.length];
+    for (int i = 0; i < threads.length; i++) {
+      threads[i] = new Thread(jobs[i]);
+      threads[i].start();
     }
+    for (Thread thread : threads) {
+      thread.join();
+    }
+    return task.get();
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlockers.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlockers.java
index c30ceaf..7b31f44 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlockers.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/Interlockers.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,11 +29,11 @@
  * @author Dr Heinz M. Kabutz
  */
 public class Interlockers {
-    public static Interlocker createLockFreeInterlocker() {
-        return new LockFreeInterlocker();
-    }
+  public static Interlocker createLockFreeInterlocker() {
+    return new LockFreeInterlocker();
+  }
 
-    public static Interlocker createBlockingInterlocker() {
-        return new SemaphoreInterlocker();
-    }
+  public static Interlocker createBlockingInterlocker() {
+    return new SemaphoreInterlocker();
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/AtomicInterlocker.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/AtomicInterlocker.java
index 537da70..331ab79 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/AtomicInterlocker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/AtomicInterlocker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -31,40 +31,40 @@
  * @author Dr Heinz M. Kabutz
  */
 public class AtomicInterlocker extends Interlocker {
-    private enum Turn {
-        EVEN, ODD
-    }
+  private enum Turn {
+    EVEN, ODD
+  }
 
-    private static class Job implements Runnable {
-        private final InterlockTask task;
-        private final AtomicReference<Turn> nextTurn;
-        private final Turn turn;
-        private final Turn next;
+  private static class Job implements Runnable {
+    private final InterlockTask task;
+    private final AtomicReference<Turn> nextTurn;
+    private final Turn turn;
+    private final Turn next;
 
-        private Job(InterlockTask task, AtomicReference<Turn> nextTurn, Turn turn) {
-            this.task = task;
-            this.nextTurn = nextTurn;
-            this.turn = turn;
-            next = Turn.values()[(turn.ordinal() + 1) % Turn.values().length];
-        }
+    private Job(InterlockTask task, AtomicReference<Turn> nextTurn, Turn turn) {
+      this.task = task;
+      this.nextTurn = nextTurn;
+      this.turn = turn;
+      next = Turn.values()[(turn.ordinal() + 1) % Turn.values().length];
+    }
 
-        public void run() {
-            while (!task.isDone()) {
-                while (!task.isDone() && nextTurn.get() != turn) {
-                    // spin
-                }
-                if (task.isDone()) return;
-                task.call();
-                nextTurn.set(next);
-            }
+    public void run() {
+      while (!task.isDone()) {
+        while (!task.isDone() && nextTurn.get() != turn) {
+          // spin
         }
+        if (task.isDone()) return;
+        task.call();
+        nextTurn.set(next);
+      }
     }
+  }
 
-    protected Runnable[] getRunnables(InterlockTask task) {
-        AtomicReference<Turn> nextTurn = new AtomicReference<Turn>(Turn.EVEN);
-        return new Runnable[]{
-                new Job(task, nextTurn, Turn.EVEN),
-                new Job(task, nextTurn, Turn.ODD)
-        };
-    }
+  protected Runnable[] getRunnables(InterlockTask task) {
+    AtomicReference<Turn> nextTurn = new AtomicReference<Turn>(Turn.EVEN);
+    return new Runnable[]{
+        new Job(task, nextTurn, Turn.EVEN),
+        new Job(task, nextTurn, Turn.ODD)
+    };
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/ConditionInterlocker.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/ConditionInterlocker.java
index 35ba97a..e1c7a20 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/ConditionInterlocker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/ConditionInterlocker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -31,55 +31,55 @@
  * @author Dr Heinz M. Kabutz
  */
 public class ConditionInterlocker extends Interlocker {
-    // does not have to be volatile as all access is lock protected
-    private boolean evenHasNextTurn = true;
+  // does not have to be volatile as all access is lock protected
+  private boolean evenHasNextTurn = true;
 
-    private class Job implements Runnable {
-        private final InterlockTask task;
-        private final boolean even;
-        private final Lock lock;
-        private final Condition firstCondition;
-        private final Condition secondCondition;
+  private class Job implements Runnable {
+    private final InterlockTask task;
+    private final boolean even;
+    private final Lock lock;
+    private final Condition firstCondition;
+    private final Condition secondCondition;
 
-        Job(InterlockTask task, boolean even, Lock lock,
-            Condition firstCondition, Condition secondCondition) {
-            this.task = task;
-            this.even = even;
-            this.lock = lock;
-            this.firstCondition = firstCondition;
-            this.secondCondition = secondCondition;
-        }
+    Job(InterlockTask task, boolean even, Lock lock,
+        Condition firstCondition, Condition secondCondition) {
+      this.task = task;
+      this.even = even;
+      this.lock = lock;
+      this.firstCondition = firstCondition;
+      this.secondCondition = secondCondition;
+    }
 
-        public void run() {
-            try {
-                while (!task.isDone()) {
-                    lock.lock();
-                    try {
-                        while (!task.isDone() && (even ^ evenHasNextTurn)) {
-                            firstCondition.await();
-                        }
-                        if (task.isDone()) return;
-                        task.call();
-                        evenHasNextTurn = !evenHasNextTurn;
-                        secondCondition.signal();
-                    } finally {
-                        lock.unlock();
-                    }
-                }
-            } catch (InterruptedException e) {
-                Thread.currentThread().interrupt();
+    public void run() {
+      try {
+        while (!task.isDone()) {
+          lock.lock();
+          try {
+            while (!task.isDone() && (even ^ evenHasNextTurn)) {
+              firstCondition.await();
             }
+            if (task.isDone()) return;
+            task.call();
+            evenHasNextTurn = !evenHasNextTurn;
+            secondCondition.signal();
+          } finally {
+            lock.unlock();
+          }
         }
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
     }
+  }
 
-    protected Runnable[] getRunnables(InterlockTask task) {
-        Lock lock = new ReentrantLock();
-        Condition even_condition = lock.newCondition();
-        Condition odd_condition = lock.newCondition();
+  protected Runnable[] getRunnables(InterlockTask task) {
+    Lock lock = new ReentrantLock();
+    Condition even_condition = lock.newCondition();
+    Condition odd_condition = lock.newCondition();
 
-        return new Runnable[]{
-                new Job(task, true, lock, even_condition, odd_condition),
-                new Job(task, false, lock, odd_condition, even_condition)
-        };
-    }
+    return new Runnable[]{
+        new Job(task, true, lock, even_condition, odd_condition),
+        new Job(task, false, lock, odd_condition, even_condition)
+    };
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/LockFreeInterlocker.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/LockFreeInterlocker.java
index 11e1c54..dd6999c 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/LockFreeInterlocker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/LockFreeInterlocker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,34 +29,34 @@
  * @author Dr Heinz M. Kabutz
  */
 public class LockFreeInterlocker extends Interlocker {
-    private volatile boolean evenHasNextTurn = true;
+  private volatile boolean evenHasNextTurn = true;
 
-    private class Job implements Runnable {
-        private final InterlockTask task;
-        private final boolean even;
+  private class Job implements Runnable {
+    private final InterlockTask task;
+    private final boolean even;
 
-        private Job(InterlockTask task, boolean even) {
-            this.task = task;
-            this.even = even;
-        }
+    private Job(InterlockTask task, boolean even) {
+      this.task = task;
+      this.even = even;
+    }
 
-        public void run() {
-            while (!task.isDone()) {
-                while (even ^ evenHasNextTurn) {
-                    // spin
-                }
-                if (task.isDone()) {
-                    return;
-                }
-                task.call();
-                evenHasNextTurn = !even;
-            }
+    public void run() {
+      while (!task.isDone()) {
+        while (even ^ evenHasNextTurn) {
+          // spin
         }
+        if (task.isDone()) {
+          return;
+        }
+        task.call();
+        evenHasNextTurn = !even;
+      }
     }
+  }
 
-    protected Runnable[] getRunnables(InterlockTask task) {
-        return new Runnable[]{
-                new Job(task, true), new Job(task, false)
-        };
-    }
+  protected Runnable[] getRunnables(InterlockTask task) {
+    return new Runnable[]{
+        new Job(task, true), new Job(task, false)
+    };
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/SemaphoreInterlocker.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/SemaphoreInterlocker.java
index c323b5e..a21f676 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/SemaphoreInterlocker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/SemaphoreInterlocker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -31,34 +31,34 @@
  * @author Dr Heinz M. Kabutz
  */
 public class SemaphoreInterlocker extends Interlocker {
-    private static class Job implements Runnable {
-        private final InterlockTask task;
-        private final Semaphore first;
-        private final Semaphore second;
+  private static class Job implements Runnable {
+    private final InterlockTask task;
+    private final Semaphore first;
+    private final Semaphore second;
 
-        public Job(InterlockTask task,
-                   Semaphore first, Semaphore second) {
-            this.task = task;
-            this.first = first;
-            this.second = second;
-        }
-
-        public void run() {
-            while (!task.isDone()) {
-                first.acquireUninterruptibly();
-                if (task.isDone()) return;
-                task.call();
-                second.release();
-            }
-        }
+    public Job(InterlockTask task,
+               Semaphore first, Semaphore second) {
+      this.task = task;
+      this.first = first;
+      this.second = second;
     }
 
-    protected Runnable[] getRunnables(InterlockTask task) {
-        Semaphore even = new Semaphore(1);
-        Semaphore odd = new Semaphore(0);
-        return new Runnable[]{
-                new Job(task, even, odd),
-                new Job(task, odd, even)
-        };
+    public void run() {
+      while (!task.isDone()) {
+        first.acquireUninterruptibly();
+        if (task.isDone()) return;
+        task.call();
+        second.release();
+      }
     }
+  }
+
+  protected Runnable[] getRunnables(InterlockTask task) {
+    Semaphore even = new Semaphore(1);
+    Semaphore odd = new Semaphore(0);
+    return new Runnable[]{
+        new Job(task, even, odd),
+        new Job(task, odd, even)
+    };
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/WaitNotifyInterlocker.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/WaitNotifyInterlocker.java
index c379b6e..fe32a9e 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/WaitNotifyInterlocker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/interlocker/impl/WaitNotifyInterlocker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,41 +29,41 @@
  * @author Dr Heinz M. Kabutz
  */
 public class WaitNotifyInterlocker extends Interlocker {
-    private boolean evenHasNextTurn = true;
-    private final Object lock = new Object();
+  private boolean evenHasNextTurn = true;
+  private final Object lock = new Object();
 
-    private class Job implements Runnable {
-        private final InterlockTask task;
-        private final boolean even;
+  private class Job implements Runnable {
+    private final InterlockTask task;
+    private final boolean even;
 
-        Job(InterlockTask task, boolean even) {
-            this.task = task;
-            this.even = even;
-        }
+    Job(InterlockTask task, boolean even) {
+      this.task = task;
+      this.even = even;
+    }
 
-        public void run() {
-            try {
-                while (!task.isDone()) {
-                    synchronized (lock) {
-                        while (!task.isDone() && (even ^ evenHasNextTurn)) {
-                            lock.wait();
-                        }
-                        if (task.isDone()) return;
-                        task.call();
-                        evenHasNextTurn = !evenHasNextTurn;
-                        lock.notify();
-                    }
-                }
-            } catch (InterruptedException e) {
-                Thread.currentThread().interrupt();
+    public void run() {
+      try {
+        while (!task.isDone()) {
+          synchronized (lock) {
+            while (!task.isDone() && (even ^ evenHasNextTurn)) {
+              lock.wait();
             }
+            if (task.isDone()) return;
+            task.call();
+            evenHasNextTurn = !evenHasNextTurn;
+            lock.notify();
+          }
         }
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
     }
+  }
 
-    protected Runnable[] getRunnables(InterlockTask task) {
-        return new Runnable[]{
-                new Job(task, true),
-                new Job(task, false)
-        };
-    }
+  protected Runnable[] getRunnables(InterlockTask task) {
+    return new Runnable[]{
+        new Job(task, true),
+        new Job(task, false)
+    };
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java
index f0cca8b..f99f0c5 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedCallable.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java
index 6759d3b..3a51d2d 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorService.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -40,473 +40,473 @@
  * @author Dr Heinz M. Kabutz
  */
 public class StripedExecutorService extends AbstractExecutorService {
-    /**
-     * The wrapped ExecutorService that will actually execute our
-     * tasks.
-     */
-    private final ExecutorService executor;
-
-    /**
-     * The lock prevents shutdown from being called in the middle
-     * of a submit.  It also guards the executors IdentityHashMap.
-     */
-    private final ReentrantLock lock = new ReentrantLock();
-
-    /**
-     * This condition allows us to cleanly terminate this executor
-     * service.
-     */
-    private final Condition terminating = lock.newCondition();
-
-    /**
-     * Whenever a new StripedObject is submitted to the pool, it
-     * is added to this IdentityHashMap.  As soon as the
-     * SerialExecutor is empty, the entry is removed from the map,
-     * in order to avoid a memory leak.
-     */
-    private final Map<Object, SerialExecutor> executors =
-            new IdentityHashMap<>();
-
-    /**
-     * The default submit() method creates a new FutureTask and
-     * wraps our StripedRunnable with it.  We thus need to
-     * remember the stripe object somewhere.  In our case, we will
-     * do this inside the ThreadLocal "stripes".  Before the
-     * thread returns from submitting the runnable, it will always
-     * remove the thread local entry.
-     */
-    private final static ThreadLocal<Object> stripes =
-            new ThreadLocal<>();
-
-    /**
-     * Valid states are RUNNING and SHUTDOWN.  We rely on the
-     * underlying executor service for the remaining states.
-     */
-    private State state = State.RUNNING;
-
-    private static enum State {
-        RUNNING, SHUTDOWN
+  /**
+   * The wrapped ExecutorService that will actually execute our
+   * tasks.
+   */
+  private final ExecutorService executor;
+
+  /**
+   * The lock prevents shutdown from being called in the middle
+   * of a submit.  It also guards the executors IdentityHashMap.
+   */
+  private final ReentrantLock lock = new ReentrantLock();
+
+  /**
+   * This condition allows us to cleanly terminate this executor
+   * service.
+   */
+  private final Condition terminating = lock.newCondition();
+
+  /**
+   * Whenever a new StripedObject is submitted to the pool, it
+   * is added to this IdentityHashMap.  As soon as the
+   * SerialExecutor is empty, the entry is removed from the map,
+   * in order to avoid a memory leak.
+   */
+  private final Map<Object, SerialExecutor> executors =
+      new IdentityHashMap<>();
+
+  /**
+   * The default submit() method creates a new FutureTask and
+   * wraps our StripedRunnable with it.  We thus need to
+   * remember the stripe object somewhere.  In our case, we will
+   * do this inside the ThreadLocal "stripes".  Before the
+   * thread returns from submitting the runnable, it will always
+   * remove the thread local entry.
+   */
+  private final static ThreadLocal<Object> stripes =
+      new ThreadLocal<>();
+
+  /**
+   * Valid states are RUNNING and SHUTDOWN.  We rely on the
+   * underlying executor service for the remaining states.
+   */
+  private State state = State.RUNNING;
+
+  private static enum State {
+    RUNNING, SHUTDOWN
+  }
+
+  /**
+   * The constructor taking executors is private, since we do
+   * not want users to shutdown their executors directly,
+   * otherwise jobs might get stuck in our queues.
+   *
+   * @param executor the executor service that we use to execute
+   *                 the tasks
+   */
+  private StripedExecutorService(ExecutorService executor) {
+    this.executor = executor;
+  }
+
+  /**
+   * This constructs a StripedExecutorService that wraps a
+   * cached thread pool.
+   */
+  public StripedExecutorService() {
+    this(Executors.newCachedThreadPool());
+  }
+
+  /**
+   * This constructs a StripedExecutorService that wraps a fixed
+   * thread pool with the given number of threads.
+   */
+  public StripedExecutorService(int numberOfThreads) {
+    this(Executors.newFixedThreadPool(numberOfThreads));
+  }
+
+  /**
+   * If the runnable also implements StripedObject, we store the
+   * stripe object in a thread local, since the actual runnable
+   * will be wrapped with a FutureTask.
+   */
+  protected <T> RunnableFuture<T> newTaskFor(
+      Runnable runnable, T value) {
+    saveStripedObject(runnable);
+    return super.newTaskFor(runnable, value);
+  }
+
+  /**
+   * If the callable also implements StripedObject, we store the
+   * stripe object in a thread local, since the actual callable
+   * will be wrapped with a FutureTask.
+   */
+  protected <T> RunnableFuture<T> newTaskFor(
+      Callable<T> callable) {
+    saveStripedObject(callable);
+    return super.newTaskFor(callable);
+  }
+
+  /**
+   * Saves the stripe in a ThreadLocal until we can use it to
+   * schedule the task into our pool.
+   */
+  private void saveStripedObject(Object task) {
+    if (isStripedObject(task)) {
+      stripes.set(((StripedObject) task).getStripe());
     }
-
-    /**
-     * The constructor taking executors is private, since we do
-     * not want users to shutdown their executors directly,
-     * otherwise jobs might get stuck in our queues.
-     *
-     * @param executor the executor service that we use to execute
-     *                 the tasks
-     */
-    private StripedExecutorService(ExecutorService executor) {
-        this.executor = executor;
+  }
+
+  /**
+   * Returns true if the object implements the StripedObject
+   * interface.
+   */
+  private static boolean isStripedObject(Object o) {
+    return o instanceof StripedObject;
+  }
+
+  /**
+   * Delegates the call to submit(task, null).
+   */
+  public Future<?> submit(Runnable task) {
+    return submit(task, null);
+  }
+
+  /**
+   * If the task is a StripedObject, we execute it in-order by
+   * its stripe, otherwise we submit it directly to the wrapped
+   * executor.  If the pool is not running, we throw a
+   * RejectedExecutionException.
+   */
+  public <T> Future<T> submit(Runnable task, T result) {
+    lock.lock();
+    try {
+      checkPoolIsRunning();
+      if (isStripedObject(task)) {
+        return super.submit(task, result);
+      } else { // bypass the serial executors
+        return executor.submit(task, result);
+      }
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * This constructs a StripedExecutorService that wraps a
-     * cached thread pool.
-     */
-    public StripedExecutorService() {
-        this(Executors.newCachedThreadPool());
+  }
+
+  /**
+   * If the task is a StripedObject, we execute it in-order by
+   * its stripe, otherwise we submit it directly to the wrapped
+   * executor.  If the pool is not running, we throw a
+   * RejectedExecutionException.
+   */
+  public <T> Future<T> submit(Callable<T> task) {
+    lock.lock();
+    try {
+      checkPoolIsRunning();
+      if (isStripedObject(task)) {
+        return super.submit(task);
+      } else { // bypass the serial executors
+        return executor.submit(task);
+      }
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * This constructs a StripedExecutorService that wraps a fixed
-     * thread pool with the given number of threads.
-     */
-    public StripedExecutorService(int numberOfThreads) {
-        this(Executors.newFixedThreadPool(numberOfThreads));
+  }
+
+  /**
+   * Throws a RejectedExecutionException if the state is not
+   * RUNNING.
+   */
+  private void checkPoolIsRunning() {
+    assert lock.isHeldByCurrentThread();
+    if (state != State.RUNNING) {
+      throw new RejectedExecutionException(
+          "executor not running");
     }
-
-    /**
-     * If the runnable also implements StripedObject, we store the
-     * stripe object in a thread local, since the actual runnable
-     * will be wrapped with a FutureTask.
-     */
-    protected <T> RunnableFuture<T> newTaskFor(
-            Runnable runnable, T value) {
-        saveStripedObject(runnable);
-        return super.newTaskFor(runnable, value);
+  }
+
+  /**
+   * Executes the command.  If command implements StripedObject,
+   * we execute it with a SerialExecutor.  This method can be
+   * called directly by clients or it may be called by the
+   * AbstractExecutorService's submit() methods. In that case,
+   * we check whether the stripes thread local has been set.  If
+   * it is, we remove it and use it to determine the
+   * StripedObject and execute it with a SerialExecutor.  If no
+   * StripedObject is set, we instead pass the command to the
+   * wrapped ExecutorService directly.
+   */
+  public void execute(Runnable command) {
+    lock.lock();
+    try {
+      checkPoolIsRunning();
+      Object stripe = getStripe(command);
+      if (stripe != null) {
+        SerialExecutor ser_exec = executors.get(stripe);
+        if (ser_exec == null) {
+          executors.put(stripe, ser_exec =
+              new SerialExecutor(stripe));
+        }
+        ser_exec.execute(command);
+      } else {
+        executor.execute(command);
+      }
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * If the callable also implements StripedObject, we store the
-     * stripe object in a thread local, since the actual callable
-     * will be wrapped with a FutureTask.
-     */
-    protected <T> RunnableFuture<T> newTaskFor(
-            Callable<T> callable) {
-        saveStripedObject(callable);
-        return super.newTaskFor(callable);
+  }
+
+  /**
+   * We get the stripe object either from the Runnable if it
+   * also implements StripedObject, or otherwise from the thread
+   * local temporary storage.  Result may be null.
+   */
+  private Object getStripe(Runnable command) {
+    Object stripe;
+    if (command instanceof StripedObject) {
+      stripe = (((StripedObject) command).getStripe());
+    } else {
+      stripe = stripes.get();
     }
-
-    /**
-     * Saves the stripe in a ThreadLocal until we can use it to
-     * schedule the task into our pool.
-     */
-    private void saveStripedObject(Object task) {
-        if (isStripedObject(task)) {
-            stripes.set(((StripedObject) task).getStripe());
-        }
+    stripes.remove();
+    return stripe;
+  }
+
+  /**
+   * Shuts down the StripedExecutorService.  No more tasks will
+   * be submitted.  If the map of SerialExecutors is empty, we
+   * shut down the wrapped executor.
+   */
+  public void shutdown() {
+    lock.lock();
+    try {
+      state = State.SHUTDOWN;
+      if (executors.isEmpty()) {
+        executor.shutdown();
+      }
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * Returns true if the object implements the StripedObject
-     * interface.
-     */
-    private static boolean isStripedObject(Object o) {
-        return o instanceof StripedObject;
+  }
+
+  /**
+   * All the tasks in each of the SerialExecutors are drained
+   * to a list, as well as the tasks inside the wrapped
+   * ExecutorService.  This is then returned to the user.  Also,
+   * the shutdownNow method of the wrapped executor is called.
+   */
+  public List<Runnable> shutdownNow() {
+    lock.lock();
+    try {
+      shutdown();
+      List<Runnable> result = new ArrayList<>();
+      for (SerialExecutor ser_ex : executors.values()) {
+        ser_ex.tasks.drainTo(result);
+      }
+      result.addAll(executor.shutdownNow());
+      return result;
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * Delegates the call to submit(task, null).
-     */
-    public Future<?> submit(Runnable task) {
-        return submit(task, null);
+  }
+
+  /**
+   * Returns true if shutdown() or shutdownNow() have been
+   * called; false otherwise.
+   */
+  public boolean isShutdown() {
+    lock.lock();
+    try {
+      return state == State.SHUTDOWN;
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * If the task is a StripedObject, we execute it in-order by
-     * its stripe, otherwise we submit it directly to the wrapped
-     * executor.  If the pool is not running, we throw a
-     * RejectedExecutionException.
-     */
-    public <T> Future<T> submit(Runnable task, T result) {
-        lock.lock();
-        try {
-            checkPoolIsRunning();
-            if (isStripedObject(task)) {
-                return super.submit(task, result);
-            } else { // bypass the serial executors
-                return executor.submit(task, result);
-            }
-        } finally {
-            lock.unlock();
-        }
+  }
+
+  /**
+   * Returns true if this pool has been terminated, that is, all
+   * the SerialExecutors are empty and the wrapped
+   * ExecutorService has been terminated.
+   */
+  public boolean isTerminated() {
+    lock.lock();
+    try {
+      if (state == State.RUNNING) return false;
+      for (SerialExecutor executor : executors.values()) {
+        if (!executor.isEmpty()) return false;
+      }
+      return executor.isTerminated();
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * If the task is a StripedObject, we execute it in-order by
-     * its stripe, otherwise we submit it directly to the wrapped
-     * executor.  If the pool is not running, we throw a
-     * RejectedExecutionException.
-     */
-    public <T> Future<T> submit(Callable<T> task) {
-        lock.lock();
-        try {
-            checkPoolIsRunning();
-            if (isStripedObject(task)) {
-                return super.submit(task);
-            } else { // bypass the serial executors
-                return executor.submit(task);
-            }
-        } finally {
-            lock.unlock();
-        }
+  }
+
+  /**
+   * Returns true if the wrapped ExecutorService terminates
+   * within the allotted amount of time.
+   */
+  public boolean awaitTermination(long timeout, TimeUnit unit)
+      throws InterruptedException {
+    lock.lock();
+    try {
+      long waitUntil = System.nanoTime() + unit.toNanos(timeout);
+      long remainingTime;
+      while ((remainingTime = waitUntil - System.nanoTime()) > 0
+          && !executors.isEmpty()) {
+        terminating.awaitNanos(remainingTime);
+      }
+      if (remainingTime <= 0) return false;
+      if (executors.isEmpty()) {
+        return executor.awaitTermination(
+            remainingTime, TimeUnit.NANOSECONDS);
+      }
+      return false;
+    } finally {
+      lock.unlock();
     }
-
-    /**
-     * Throws a RejectedExecutionException if the state is not
-     * RUNNING.
-     */
-    private void checkPoolIsRunning() {
-        assert lock.isHeldByCurrentThread();
-        if (state != State.RUNNING) {
-            throw new RejectedExecutionException(
-                    "executor not running");
-        }
+  }
+
+  /**
+   * As soon as a SerialExecutor is empty, we remove it from the
+   * executors map.  We might thus remove the SerialExecutors
+   * more quickly than necessary, but at least we can avoid a
+   * memory leak.
+   */
+  private void removeEmptySerialExecutor(Object stripe,
+                                         SerialExecutor ser_ex) {
+    assert ser_ex == executors.get(stripe);
+    assert lock.isHeldByCurrentThread();
+    assert ser_ex.isEmpty();
+
+    executors.remove(stripe);
+    terminating.signalAll();
+    if (state == State.SHUTDOWN && executors.isEmpty()) {
+      executor.shutdown();
     }
-
-    /**
-     * Executes the command.  If command implements StripedObject,
-     * we execute it with a SerialExecutor.  This method can be
-     * called directly by clients or it may be called by the
-     * AbstractExecutorService's submit() methods. In that case,
-     * we check whether the stripes thread local has been set.  If
-     * it is, we remove it and use it to determine the
-     * StripedObject and execute it with a SerialExecutor.  If no
-     * StripedObject is set, we instead pass the command to the
-     * wrapped ExecutorService directly.
-     */
-    public void execute(Runnable command) {
-        lock.lock();
-        try {
-            checkPoolIsRunning();
-            Object stripe = getStripe(command);
-            if (stripe != null) {
-                SerialExecutor ser_exec = executors.get(stripe);
-                if (ser_exec == null) {
-                    executors.put(stripe, ser_exec =
-                            new SerialExecutor(stripe));
-                }
-                ser_exec.execute(command);
-            } else {
-                executor.execute(command);
-            }
-        } finally {
-            lock.unlock();
-        }
+  }
+
+  /**
+   * Prints information about current state of this executor, the
+   * wrapped executor and the serial executors.
+   */
+  public String toString() {
+    lock.lock();
+    try {
+      return "StripedExecutorService: state=" + state + ", " +
+          "executor=" + executor + ", " +
+          "serialExecutors=" + executors;
+    } finally {
+      lock.unlock();
     }
 
+  }
+
+  /**
+   * This field is used for conditional compilation.  If it is
+   * false, then the finalize method is an empty method, in
+   * which case the SerialExecutor will not be registered with
+   * the Finalizer.
+   */
+  private static boolean DEBUG = false;
+
+  /**
+   * SerialExecutor is based on the construct with the same name
+   * described in the {@link Executor} JavaDocs.  The difference
+   * with our SerialExecutor is that it can be terminated.  It
+   * also removes itself automatically once the queue is empty.
+   */
+  private class SerialExecutor implements Executor {
     /**
-     * We get the stripe object either from the Runnable if it
-     * also implements StripedObject, or otherwise from the thread
-     * local temporary storage.  Result may be null.
+     * The queue of unexecuted tasks.
      */
-    private Object getStripe(Runnable command) {
-        Object stripe;
-        if (command instanceof StripedObject) {
-            stripe = (((StripedObject) command).getStripe());
-        } else {
-            stripe = stripes.get();
-        }
-        stripes.remove();
-        return stripe;
-    }
-
+    private final BlockingQueue<Runnable> tasks =
+        new LinkedBlockingQueue<>();
     /**
-     * Shuts down the StripedExecutorService.  No more tasks will
-     * be submitted.  If the map of SerialExecutors is empty, we
-     * shut down the wrapped executor.
+     * The runnable that we are currently busy with.
      */
-    public void shutdown() {
-        lock.lock();
-        try {
-            state = State.SHUTDOWN;
-            if (executors.isEmpty()) {
-                executor.shutdown();
-            }
-        } finally {
-            lock.unlock();
-        }
-    }
-
+    private Runnable active;
     /**
-     * All the tasks in each of the SerialExecutors are drained
-     * to a list, as well as the tasks inside the wrapped
-     * ExecutorService.  This is then returned to the user.  Also,
-     * the shutdownNow method of the wrapped executor is called.
+     * The stripe that this SerialExecutor was defined for.  It
+     * is needed so that we can remove this executor from the
+     * map once it is empty.
      */
-    public List<Runnable> shutdownNow() {
-        lock.lock();
-        try {
-            shutdown();
-            List<Runnable> result = new ArrayList<>();
-            for (SerialExecutor ser_ex : executors.values()) {
-                ser_ex.tasks.drainTo(result);
-            }
-            result.addAll(executor.shutdownNow());
-            return result;
-        } finally {
-            lock.unlock();
-        }
-    }
+    private final Object stripe;
 
     /**
-     * Returns true if shutdown() or shutdownNow() have been
-     * called; false otherwise.
+     * Creates a SerialExecutor for a particular stripe.
      */
-    public boolean isShutdown() {
-        lock.lock();
-        try {
-            return state == State.SHUTDOWN;
-        } finally {
-            lock.unlock();
-        }
+    private SerialExecutor(Object stripe) {
+      this.stripe = stripe;
+      if (DEBUG) {
+        System.out.println("SerialExecutor created " + stripe);
+      }
     }
 
     /**
-     * Returns true if this pool has been terminated, that is, all
-     * the SerialExecutors are empty and the wrapped
-     * ExecutorService has been terminated.
+     * We use finalize() only for debugging purposes.  If
+     * DEBUG==false, the body of the method will be compiled
+     * away, thus rendering it a trivial finalize() method,
+     * which means that the object will not incur any overhead
+     * since it won't be registered with the Finalizer.
      */
-    public boolean isTerminated() {
-        lock.lock();
-        try {
-            if (state == State.RUNNING) return false;
-            for (SerialExecutor executor : executors.values()) {
-                if (!executor.isEmpty()) return false;
-            }
-            return executor.isTerminated();
-        } finally {
-            lock.unlock();
-        }
+    protected void finalize() throws Throwable {
+      if (DEBUG) {
+        System.out.println("SerialExecutor finalized " + stripe);
+        super.finalize();
+      }
     }
 
     /**
-     * Returns true if the wrapped ExecutorService terminates
-     * within the allotted amount of time.
+     * For every task that is executed, we add() a wrapper to
+     * the queue of tasks that will run the current task and
+     * then schedule the next task in the queue.
      */
-    public boolean awaitTermination(long timeout, TimeUnit unit)
-            throws InterruptedException {
-        lock.lock();
-        try {
-            long waitUntil = System.nanoTime() + unit.toNanos(timeout);
-            long remainingTime;
-            while ((remainingTime = waitUntil - System.nanoTime()) > 0
-                    && !executors.isEmpty()) {
-                terminating.awaitNanos(remainingTime);
-            }
-            if (remainingTime <= 0) return false;
-            if (executors.isEmpty()) {
-                return executor.awaitTermination(
-                        remainingTime, TimeUnit.NANOSECONDS);
+    public void execute(final Runnable r) {
+      lock.lock();
+      try {
+        tasks.add(new Runnable() {
+          public void run() {
+            try {
+              r.run();
+            } finally {
+              scheduleNext();
             }
-            return false;
-        } finally {
-            lock.unlock();
+          }
+        });
+        if (active == null) {
+          scheduleNext();
         }
+      } finally {
+        lock.unlock();
+      }
     }
 
     /**
-     * As soon as a SerialExecutor is empty, we remove it from the
-     * executors map.  We might thus remove the SerialExecutors
-     * more quickly than necessary, but at least we can avoid a
-     * memory leak.
+     * Schedules the next task for this stripe.  Should only be
+     * called if active == null or if we are finished executing
+     * the currently active task.
      */
-    private void removeEmptySerialExecutor(Object stripe,
-                                           SerialExecutor ser_ex) {
-        assert ser_ex == executors.get(stripe);
-        assert lock.isHeldByCurrentThread();
-        assert ser_ex.isEmpty();
-
-        executors.remove(stripe);
-        terminating.signalAll();
-        if (state == State.SHUTDOWN && executors.isEmpty()) {
-            executor.shutdown();
+    private void scheduleNext() {
+      lock.lock();
+      try {
+        if ((active = tasks.poll()) != null) {
+          executor.execute(active);
+          terminating.signalAll();
+        } else {
+          removeEmptySerialExecutor(stripe, this);
         }
+      } finally {
+        lock.unlock();
+      }
     }
 
     /**
-     * Prints information about current state of this executor, the
-     * wrapped executor and the serial executors.
+     * Returns true if the list is empty and there is no task
+     * currently executing.
      */
-    public String toString() {
-        lock.lock();
-        try {
-            return "StripedExecutorService: state=" + state + ", " +
-                    "executor=" + executor + ", " +
-                    "serialExecutors=" + executors;
-        } finally {
-            lock.unlock();
-        }
-
+    public boolean isEmpty() {
+      lock.lock();
+      try {
+        return active == null && tasks.isEmpty();
+      } finally {
+        lock.unlock();
+      }
     }
 
-    /**
-     * This field is used for conditional compilation.  If it is
-     * false, then the finalize method is an empty method, in
-     * which case the SerialExecutor will not be registered with
-     * the Finalizer.
-     */
-    private static boolean DEBUG = false;
-
-    /**
-     * SerialExecutor is based on the construct with the same name
-     * described in the {@link Executor} JavaDocs.  The difference
-     * with our SerialExecutor is that it can be terminated.  It
-     * also removes itself automatically once the queue is empty.
-     */
-    private class SerialExecutor implements Executor {
-        /**
-         * The queue of unexecuted tasks.
-         */
-        private final BlockingQueue<Runnable> tasks =
-                new LinkedBlockingQueue<>();
-        /**
-         * The runnable that we are currently busy with.
-         */
-        private Runnable active;
-        /**
-         * The stripe that this SerialExecutor was defined for.  It
-         * is needed so that we can remove this executor from the
-         * map once it is empty.
-         */
-        private final Object stripe;
-
-        /**
-         * Creates a SerialExecutor for a particular stripe.
-         */
-        private SerialExecutor(Object stripe) {
-            this.stripe = stripe;
-            if (DEBUG) {
-                System.out.println("SerialExecutor created " + stripe);
-            }
-        }
-
-        /**
-         * We use finalize() only for debugging purposes.  If
-         * DEBUG==false, the body of the method will be compiled
-         * away, thus rendering it a trivial finalize() method,
-         * which means that the object will not incur any overhead
-         * since it won't be registered with the Finalizer.
-         */
-        protected void finalize() throws Throwable {
-            if (DEBUG) {
-                System.out.println("SerialExecutor finalized " + stripe);
-                super.finalize();
-            }
-        }
-
-        /**
-         * For every task that is executed, we add() a wrapper to
-         * the queue of tasks that will run the current task and
-         * then schedule the next task in the queue.
-         */
-        public void execute(final Runnable r) {
-            lock.lock();
-            try {
-                tasks.add(new Runnable() {
-                    public void run() {
-                        try {
-                            r.run();
-                        } finally {
-                            scheduleNext();
-                        }
-                    }
-                });
-                if (active == null) {
-                    scheduleNext();
-                }
-            } finally {
-                lock.unlock();
-            }
-        }
-
-        /**
-         * Schedules the next task for this stripe.  Should only be
-         * called if active == null or if we are finished executing
-         * the currently active task.
-         */
-        private void scheduleNext() {
-            lock.lock();
-            try {
-                if ((active = tasks.poll()) != null) {
-                    executor.execute(active);
-                    terminating.signalAll();
-                } else {
-                    removeEmptySerialExecutor(stripe, this);
-                }
-            } finally {
-                lock.unlock();
-            }
-        }
-
-        /**
-         * Returns true if the list is empty and there is no task
-         * currently executing.
-         */
-        public boolean isEmpty() {
-            lock.lock();
-            try {
-                return active == null && tasks.isEmpty();
-            } finally {
-                lock.unlock();
-            }
-        }
-
-        public String toString() {
-            assert lock.isHeldByCurrentThread();
-            return "SerialExecutor: active=" + active + ", " +
-                    "tasks=" + tasks;
-        }
+    public String toString() {
+      assert lock.isHeldByCurrentThread();
+      return "SerialExecutor: active=" + active + ", " +
+          "tasks=" + tasks;
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedObject.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedObject.java
index 29a231e..d1ca149 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedObject.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedObject.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,5 +27,5 @@
  * @see StripedExecutorService
  */
 public interface StripedObject {
-    Object getStripe();
+  Object getStripe();
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedRunnable.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedRunnable.java
index 24aa112..7ecf91f 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedRunnable.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedRunnable.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java
index 03638f7..3f57d98 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/util/FutureResult.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,24 +28,24 @@
  */
 
 public class FutureResult<V> {
-    private V value;
+  private V value;
 
-    private boolean ready;
+  private boolean ready;
 
-    public synchronized V get() throws InterruptedException {
-        while (!ready) {
-            wait(100);
-        }
-        return value;
+  public synchronized V get() throws InterruptedException {
+    while (!ready) {
+      wait(100);
     }
+    return value;
+  }
 
-    public synchronized void set(V newValue) {
-        value = newValue;
-        ready = true;
-        notifyAll();
-    }
+  public synchronized void set(V newValue) {
+    value = newValue;
+    ready = true;
+    notifyAll();
+  }
 
-    public synchronized boolean isReady() {
-        return ready;
-    }
+  public synchronized boolean isReady() {
+    return ready;
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java b/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java
index 0517fdc..9c2227f 100644
--- a/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java
+++ b/src/main/java/eu/javaspecialists/tjsn/concurrency/util/SerialExecutor.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,33 +28,33 @@
  * @see java.util.concurrent.Executor
  */
 public class SerialExecutor implements Executor {
-    private final Queue<Runnable> tasks = new ArrayDeque<>();
-    private final Executor executor;
-    private Runnable active;
+  private final Queue<Runnable> tasks = new ArrayDeque<>();
+  private final Executor executor;
+  private Runnable active;
 
-    public SerialExecutor(Executor executor) {
-        this.executor = executor;
-    }
+  public SerialExecutor(Executor executor) {
+    this.executor = executor;
+  }
 
-    public synchronized void execute(final Runnable r) {
-        // add() should be used instead of offer()
-        tasks.add(new Runnable() {
-            public void run() {
-                try {
-                    r.run();
-                } finally {
-                    scheduleNext();
-                }
-            }
-        });
-        if (active == null) {
-            scheduleNext();
+  public synchronized void execute(final Runnable r) {
+    // add() should be used instead of offer()
+    tasks.add(new Runnable() {
+      public void run() {
+        try {
+          r.run();
+        } finally {
+          scheduleNext();
         }
+      }
+    });
+    if (active == null) {
+      scheduleNext();
     }
+  }
 
-    protected synchronized void scheduleNext() {
-        if ((active = tasks.poll()) != null) {
-            executor.execute(active);
-        }
+  protected synchronized void scheduleNext() {
+    if ((active = tasks.poll()) != null) {
+      executor.execute(active);
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java
index bfe05fe..f4cfcec 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue145/TristateCheckBoxTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -30,74 +30,74 @@
  * @author Dr Heinz M. Kabutz
  */
 public class TristateCheckBoxTest {
-    public static void main(String args[]) throws Exception {
-        SwingUtilities.invokeLater(new Runnable() {
-            public void run() {
-                JFrame frame = new JFrame("TristateCheckBoxTest");
-                frame.setLayout(new GridLayout(0, 1, 15, 15));
-                UIManager.LookAndFeelInfo[] lfs =
-                        UIManager.getInstalledLookAndFeels();
-                for (UIManager.LookAndFeelInfo lf : lfs) {
-                    System.out.println("Look&Feel " + lf.getName());
-                    try {
-                        UIManager.setLookAndFeel(lf.getClassName());
-                    } catch (RuntimeException e) {
-                        throw e;
-                    } catch (Exception e) {
-                        throw new IllegalStateException(e);
-                    }
-                    frame.add(makePanel());
-                }
-                frame.setDefaultCloseOperation(WindowConstants.EXIT_ON_CLOSE);
-                frame.pack();
-                frame.setVisible(true);
-            }
-        });
-    }
+  public static void main(String args[]) throws Exception {
+    SwingUtilities.invokeLater(new Runnable() {
+      public void run() {
+        JFrame frame = new JFrame("TristateCheckBoxTest");
+        frame.setLayout(new GridLayout(0, 1, 15, 15));
+        UIManager.LookAndFeelInfo[] lfs =
+            UIManager.getInstalledLookAndFeels();
+        for (UIManager.LookAndFeelInfo lf : lfs) {
+          System.out.println("Look&Feel " + lf.getName());
+          try {
+            UIManager.setLookAndFeel(lf.getClassName());
+          } catch (RuntimeException e) {
+            throw e;
+          } catch (Exception e) {
+            throw new IllegalStateException(e);
+          }
+          frame.add(makePanel());
+        }
+        frame.setDefaultCloseOperation(WindowConstants.EXIT_ON_CLOSE);
+        frame.pack();
+        frame.setVisible(true);
+      }
+    });
+  }
 
-    private static JPanel makePanel() {
-        final TristateCheckBox tristateBox = new TristateCheckBox(
-                "Tristate checkbox");
-        tristateBox.addItemListener(new ItemListener() {
-            public void itemStateChanged(ItemEvent e) {
-                switch (tristateBox.getState()) {
-                    case SELECTED:
-                        System.out.println("Selected");
-                        break;
-                    case DESELECTED:
-                        System.out.println("Not Selected");
-                        break;
-                    case INDETERMINATE:
-                        System.out.println("Tristate Selected");
-                        break;
-                }
-            }
-        });
-        tristateBox.addActionListener(new ActionListener() {
-            public void actionPerformed(ActionEvent e) {
-                System.out.println(e);
-            }
-        });
-        final JCheckBox normalBox = new JCheckBox("Normal checkbox");
-        normalBox.addActionListener(new ActionListener() {
-            public void actionPerformed(ActionEvent e) {
-                System.out.println(e);
-            }
-        });
+  private static JPanel makePanel() {
+    final TristateCheckBox tristateBox = new TristateCheckBox(
+        "Tristate checkbox");
+    tristateBox.addItemListener(new ItemListener() {
+      public void itemStateChanged(ItemEvent e) {
+        switch (tristateBox.getState()) {
+          case SELECTED:
+            System.out.println("Selected");
+            break;
+          case DESELECTED:
+            System.out.println("Not Selected");
+            break;
+          case INDETERMINATE:
+            System.out.println("Tristate Selected");
+            break;
+        }
+      }
+    });
+    tristateBox.addActionListener(new ActionListener() {
+      public void actionPerformed(ActionEvent e) {
+        System.out.println(e);
+      }
+    });
+    final JCheckBox normalBox = new JCheckBox("Normal checkbox");
+    normalBox.addActionListener(new ActionListener() {
+      public void actionPerformed(ActionEvent e) {
+        System.out.println(e);
+      }
+    });
 
-        final JCheckBox enabledBox = new JCheckBox("Enable", true);
-        enabledBox.addItemListener(new ItemListener() {
-            public void itemStateChanged(ItemEvent e) {
-                tristateBox.setEnabled(enabledBox.isSelected());
-                normalBox.setEnabled(enabledBox.isSelected());
-            }
-        });
+    final JCheckBox enabledBox = new JCheckBox("Enable", true);
+    enabledBox.addItemListener(new ItemListener() {
+      public void itemStateChanged(ItemEvent e) {
+        tristateBox.setEnabled(enabledBox.isSelected());
+        normalBox.setEnabled(enabledBox.isSelected());
+      }
+    });
 
-        JPanel panel = new JPanel(new GridLayout(0, 1, 5, 5));
-        panel.add(new JLabel(UIManager.getLookAndFeel().getName()));
-        panel.add(tristateBox);
-        panel.add(normalBox);
-        panel.add(enabledBox);
-        return panel;
-    }
+    JPanel panel = new JPanel(new GridLayout(0, 1, 5, 5));
+    panel.add(new JLabel(UIManager.getLookAndFeel().getName()));
+    panel.add(tristateBox);
+    panel.add(normalBox);
+    panel.add(enabledBox);
+    return panel;
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java
index 7d0fbf5..6030423 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ArrayBoundsTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,50 +27,50 @@
  * @author Dr Heinz M. Kabutz
  */
 public class ArrayBoundsTest extends DuplicateExceptionChecker {
-    private static final Object[] randomObjects =
-            new Object[1000 * 1000];
+  private static final Object[] randomObjects =
+      new Object[1000 * 1000];
 
-    private static final int[] randomIndexes =
-            new int[1000 * 1000];
+  private static final int[] randomIndexes =
+      new int[1000 * 1000];
 
-    private static final String[] randomStrings =
-            new String[1000 * 1000];
+  private static final String[] randomStrings =
+      new String[1000 * 1000];
 
 
-    public static void main(String[] args) {
-        ArrayBoundsTest test = new ArrayBoundsTest();
-        test.fillArrays(0.01);
-        test.test();
-    }
+  public static void main(String[] args) {
+    ArrayBoundsTest test = new ArrayBoundsTest();
+    test.fillArrays(0.01);
+    test.test();
+  }
 
-    public void notifyOfDuplicate(Exception e) {
-        super.notifyOfDuplicate(e);
-        System.exit(1);
-    }
+  public void notifyOfDuplicate(Exception e) {
+    super.notifyOfDuplicate(e);
+    System.exit(1);
+  }
 
-    private void fillArrays(double probabilityIndexIsOut) {
-        Random random = new Random(0);
-        for (int i = 0; i < randomObjects.length; i++) {
-            randomObjects[i] = new Integer(i);
-            randomIndexes[i] = random.nextInt(i);
-            if (random.nextDouble() < probabilityIndexIsOut) {
-                randomIndexes[i] = -randomIndexes[i];
-            }
-        }
-        Arrays.fill(randomStrings, null);
+  private void fillArrays(double probabilityIndexIsOut) {
+    Random random = new Random(0);
+    for (int i = 0; i < randomObjects.length; i++) {
+      randomObjects[i] = new Integer(i);
+      randomIndexes[i] = random.nextInt(i);
+      if (random.nextDouble() < probabilityIndexIsOut) {
+        randomIndexes[i] = -randomIndexes[i];
+      }
     }
+    Arrays.fill(randomStrings, null);
+  }
 
-    private void test() {
-        for (int i = 0; i < 100; i++) {
-            for (int j = 0; j < randomObjects.length; j++) {
-                try {
-                    int index = randomIndexes[j];
-                    randomStrings[index] = randomObjects[index].toString();
-                } catch (ArrayIndexOutOfBoundsException e) {
-                    randomStrings[j] = null;
-                    handleException(e);
-                }
-            }
+  private void test() {
+    for (int i = 0; i < 100; i++) {
+      for (int j = 0; j < randomObjects.length; j++) {
+        try {
+          int index = randomIndexes[j];
+          randomStrings[index] = randomObjects[index].toString();
+        } catch (ArrayIndexOutOfBoundsException e) {
+          randomStrings[j] = null;
+          handleException(e);
         }
+      }
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ClassCastTest.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ClassCastTest.java
index f17a9b0..99f6302 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ClassCastTest.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/ClassCastTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,45 +26,45 @@
  * @author Dr Heinz M. Kabutz
  */
 public class ClassCastTest extends DuplicateExceptionChecker {
-    private final Object[] randomObjects =
-            new Object[1000 * 1000];
+  private final Object[] randomObjects =
+      new Object[1000 * 1000];
 
-    private final String[] randomStrings =
-            new String[1000 * 1000];
+  private final String[] randomStrings =
+      new String[1000 * 1000];
 
-    public static void main(String[] args) {
-        ClassCastTest npt = new ClassCastTest();
-        npt.fillArrays(0.01);
-        npt.test();
-    }
+  public static void main(String[] args) {
+    ClassCastTest npt = new ClassCastTest();
+    npt.fillArrays(0.01);
+    npt.test();
+  }
 
-    public void notifyOfDuplicate(Exception e) {
-        super.notifyOfDuplicate(e);
-        System.exit(1);
-    }
+  public void notifyOfDuplicate(Exception e) {
+    super.notifyOfDuplicate(e);
+    System.exit(1);
+  }
 
-    private void fillArrays(double probabilityObjectIsNull) {
-        Random random = new Random(0);
-        for (int i = 0; i < randomObjects.length; i++) {
-            if (random.nextDouble() < probabilityObjectIsNull) {
-                randomObjects[i] = new Float(i);
-            } else {
-                randomObjects[i] = new Integer(i);
-            }
-        }
-        Arrays.fill(randomStrings, null);
+  private void fillArrays(double probabilityObjectIsNull) {
+    Random random = new Random(0);
+    for (int i = 0; i < randomObjects.length; i++) {
+      if (random.nextDouble() < probabilityObjectIsNull) {
+        randomObjects[i] = new Float(i);
+      } else {
+        randomObjects[i] = new Integer(i);
+      }
     }
+    Arrays.fill(randomStrings, null);
+  }
 
-    private void test() {
-        for (int i = 0; i < 100; i++) {
-            for (int j = 0; j < randomObjects.length; j++) {
-                try {
-                    randomStrings[j] = ((Integer) randomObjects[j]).toString();
-                } catch (ClassCastException e) {
-                    randomStrings[j] = null;
-                    handleException(e);
-                }
-            }
+  private void test() {
+    for (int i = 0; i < 100; i++) {
+      for (int j = 0; j < randomObjects.length; j++) {
+        try {
+          randomStrings[j] = ((Integer) randomObjects[j]).toString();
+        } catch (ClassCastException e) {
+          randomStrings[j] = null;
+          handleException(e);
         }
+      }
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/DuplicateExceptionChecker.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/DuplicateExceptionChecker.java
index 3831039..6a20d63 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/DuplicateExceptionChecker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/DuplicateExceptionChecker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,37 +26,37 @@
  * @author Dr Heinz M. Kabutz
  */
 public class DuplicateExceptionChecker {
-    private final IdentityHashMap<Exception, Boolean> previous =
-            new IdentityHashMap<>();
+  private final IdentityHashMap<Exception, Boolean> previous =
+      new IdentityHashMap<>();
 
-    public void handleException(Exception e) {
-        checkForDuplicates(e);
-    }
+  public void handleException(Exception e) {
+    checkForDuplicates(e);
+  }
 
-    private void checkForDuplicates(Exception e) {
-        Boolean hadPrevious = previous.get(e);
-        if (hadPrevious == null) {
-            previous.put(e, false);
-        } else if (!hadPrevious) {
-            notifyOfDuplicate(e);
-            previous.put(e, true);
-        }
+  private void checkForDuplicates(Exception e) {
+    Boolean hadPrevious = previous.get(e);
+    if (hadPrevious == null) {
+      previous.put(e, false);
+    } else if (!hadPrevious) {
+      notifyOfDuplicate(e);
+      previous.put(e, true);
     }
+  }
 
-    public void notifyOfDuplicate(Exception e) {
-        System.err.println("Duplicate Exception: " + e.getClass());
-        System.err.println("count = " + count(e));
-        e.printStackTrace();
-    }
+  public void notifyOfDuplicate(Exception e) {
+    System.err.println("Duplicate Exception: " + e.getClass());
+    System.err.println("count = " + count(e));
+    e.printStackTrace();
+  }
 
-    private int count(Exception e) {
-        int count = 0;
-        Class exceptionType = e.getClass();
-        for (Exception exception : previous.keySet()) {
-            if (exception.getClass() == exceptionType) {
-                count++;
-            }
-        }
-        return count;
+  private int count(Exception e) {
+    int count = 0;
+    Class exceptionType = e.getClass();
+    for (Exception exception : previous.keySet()) {
+      if (exception.getClass() == exceptionType) {
+        count++;
+      }
     }
+    return count;
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/MixedExeptionTest.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/MixedExeptionTest.java
index e5e7fe5..25e56ed 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/MixedExeptionTest.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/MixedExeptionTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,67 +26,67 @@
  * @author Dr Heinz M. Kabutz
  */
 public class MixedExeptionTest extends DuplicateExceptionChecker {
-    private static final Object[] randomObjects =
-            new Object[1000 * 1000];
+  private static final Object[] randomObjects =
+      new Object[1000 * 1000];
 
-    private static final int[] randomIndexes =
-            new int[1000 * 1000];
+  private static final int[] randomIndexes =
+      new int[1000 * 1000];
 
-    private static final String[] randomStrings =
-            new String[1000 * 1000];
+  private static final String[] randomStrings =
+      new String[1000 * 1000];
 
 
-    public static void main(String[] args) {
-        MixedExeptionTest test = new MixedExeptionTest();
-        test.fillArrays(0.01);
-        test.test();
-    }
+  public static void main(String[] args) {
+    MixedExeptionTest test = new MixedExeptionTest();
+    test.fillArrays(0.01);
+    test.test();
+  }
 
-    private int duplicates = 0;
+  private int duplicates = 0;
 
-    public void notifyOfDuplicate(Exception e) {
-        super.notifyOfDuplicate(e);
-        duplicates++;
-        if (duplicates == 3) {
-            System.exit(1);
-        }
+  public void notifyOfDuplicate(Exception e) {
+    super.notifyOfDuplicate(e);
+    duplicates++;
+    if (duplicates == 3) {
+      System.exit(1);
     }
+  }
 
-    private void fillArrays(double probabilityIndexIsOut) {
-        Random random = new Random(0);
-        for (int i = 0; i < randomObjects.length; i++) {
-            randomObjects[i] = new Integer(i);
-            randomIndexes[i] = random.nextInt(i);
-            if (random.nextDouble() < probabilityIndexIsOut) {
-                switch (i % 3) {
-                    case 0:
-                        randomIndexes[i] = -randomIndexes[i];
-                        break;
-                    case 1:
-                        randomObjects[i] = null;
-                        break;
-                    case 2:
-                        randomObjects[i] = new Float(i);
-                        break;
-                }
-            }
+  private void fillArrays(double probabilityIndexIsOut) {
+    Random random = new Random(0);
+    for (int i = 0; i < randomObjects.length; i++) {
+      randomObjects[i] = new Integer(i);
+      randomIndexes[i] = random.nextInt(i);
+      if (random.nextDouble() < probabilityIndexIsOut) {
+        switch (i % 3) {
+          case 0:
+            randomIndexes[i] = -randomIndexes[i];
+            break;
+          case 1:
+            randomObjects[i] = null;
+            break;
+          case 2:
+            randomObjects[i] = new Float(i);
+            break;
         }
-        Arrays.fill(randomStrings, null);
+      }
     }
+    Arrays.fill(randomStrings, null);
+  }
 
-    private void test() {
-        for (int i = 0; i < 100; i++) {
-            for (int j = 0; j < randomObjects.length; j++) {
-                try {
-                    int index = randomIndexes[j];
-                    randomStrings[index] =
-                            ((Integer) randomObjects[index]).toString();
-                } catch (Exception e) {
-                    randomStrings[j] = null;
-                    handleException(e);
-                    e.printStackTrace();
-                }
-            }
+  private void test() {
+    for (int i = 0; i < 100; i++) {
+      for (int j = 0; j < randomObjects.length; j++) {
+        try {
+          int index = randomIndexes[j];
+          randomStrings[index] =
+              ((Integer) randomObjects[index]).toString();
+        } catch (Exception e) {
+          randomStrings[j] = null;
+          handleException(e);
+          e.printStackTrace();
         }
+      }
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/NullPointerTest.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/NullPointerTest.java
index 14ab369..df340c2 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue187/NullPointerTest.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue187/NullPointerTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,45 +26,45 @@
  * @author Dr Heinz M. Kabutz
  */
 public class NullPointerTest extends DuplicateExceptionChecker {
-    private final Object[] randomObjects =
-            new Object[1000 * 1000];
+  private final Object[] randomObjects =
+      new Object[1000 * 1000];
 
-    private final String[] randomStrings =
-            new String[1000 * 1000];
+  private final String[] randomStrings =
+      new String[1000 * 1000];
 
-    public static void main(String[] args) {
-        NullPointerTest npt = new NullPointerTest();
-        npt.fillArrays(0.01);
-        npt.test();
-    }
+  public static void main(String[] args) {
+    NullPointerTest npt = new NullPointerTest();
+    npt.fillArrays(0.01);
+    npt.test();
+  }
 
-    public void notifyOfDuplicate(Exception e) {
-        super.notifyOfDuplicate(e);
-        System.exit(1);
-    }
+  public void notifyOfDuplicate(Exception e) {
+    super.notifyOfDuplicate(e);
+    System.exit(1);
+  }
 
-    private void fillArrays(double probabilityObjectIsNull) {
-        Random random = new Random(0);
-        for (int i = 0; i < randomObjects.length; i++) {
-            if (random.nextDouble() < probabilityObjectIsNull) {
-                randomObjects[i] = null;
-            } else {
-                randomObjects[i] = new Integer(i);
-            }
-        }
-        Arrays.fill(randomStrings, null);
+  private void fillArrays(double probabilityObjectIsNull) {
+    Random random = new Random(0);
+    for (int i = 0; i < randomObjects.length; i++) {
+      if (random.nextDouble() < probabilityObjectIsNull) {
+        randomObjects[i] = null;
+      } else {
+        randomObjects[i] = new Integer(i);
+      }
     }
+    Arrays.fill(randomStrings, null);
+  }
 
-    private void test() {
-        for (int i = 0; i < 100; i++) {
-            for (int j = 0; j < randomObjects.length; j++) {
-                try {
-                    randomStrings[j] = randomObjects[j].toString();
-                } catch (NullPointerException e) {
-                    randomStrings[j] = null;
-                    handleException(e);
-                }
-            }
+  private void test() {
+    for (int i = 0; i < 100; i++) {
+      for (int j = 0; j < randomObjects.length; j++) {
+        try {
+          randomStrings[j] = randomObjects[j].toString();
+        } catch (NullPointerException e) {
+          randomStrings[j] = null;
+          handleException(e);
         }
+      }
     }
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue188/VirtualMachineLiveLock.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue188/VirtualMachineLiveLock.java
index b343065..0c9347a 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue188/VirtualMachineLiveLock.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue188/VirtualMachineLiveLock.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -31,76 +31,76 @@
  */
 
 public class VirtualMachineLiveLock {
-    private static final boolean BROKEN = true;
+  private static final boolean BROKEN = true;
 
-    public volatile boolean evenHasNextTurn = true;
+  public volatile boolean evenHasNextTurn = true;
 
-    private class InterleavedTask implements Runnable {
-        private final boolean even;
+  private class InterleavedTask implements Runnable {
+    private final boolean even;
 
-        InterleavedTask(boolean even) {
-            this.even = even;
-        }
+    InterleavedTask(boolean even) {
+      this.even = even;
+    }
 
-        public void run() {
-            while (!isDone()) {
-                // busy wait - tends to hang up the process.
-                while (BROKEN ?
-                        even && !evenHasNextTurn || !even && evenHasNextTurn
-                        : even ^ evenHasNextTurn) ;
-                if (isDone()) {
-                    return;
-                }
-                call();
-                evenHasNextTurn = !even;
-            }
+    public void run() {
+      while (!isDone()) {
+        // busy wait - tends to hang up the process.
+        while (BROKEN ?
+            even && !evenHasNextTurn || !even && evenHasNextTurn
+            : even ^ evenHasNextTurn) ;
+        if (isDone()) {
+          return;
         }
+        call();
+        evenHasNextTurn = !even;
+      }
     }
+  }
 
-    private final int upto = 50;
-    private volatile int count;
+  private final int upto = 50;
+  private volatile int count;
 
-    public boolean isDone() {
-        return count >= upto;
-    }
+  public boolean isDone() {
+    return count >= upto;
+  }
 
-    public void call() {
-        int temp = count + 1;
-        sleepQuietly();
-        count = temp;
-        System.out.println("temp = " + temp);
-    }
+  public void call() {
+    int temp = count + 1;
+    sleepQuietly();
+    count = temp;
+    System.out.println("temp = " + temp);
+  }
 
-    private void sleepQuietly() {
-        try {
-            Thread.sleep(100);
-        } catch (InterruptedException e) {
-            Thread.currentThread().interrupt();
-        }
+  private void sleepQuietly() {
+    try {
+      Thread.sleep(100);
+    } catch (InterruptedException e) {
+      Thread.currentThread().interrupt();
     }
+  }
 
-    public static void main(String[] args) throws InterruptedException {
-        Timer timer = new Timer(true);
-        timer.schedule(new TimerTask() {
-            public void run() {
-                System.out.println("VM still alive (a bit)");
-            }
-        }, 1000, 1000);
+  public static void main(String[] args) throws InterruptedException {
+    Timer timer = new Timer(true);
+    timer.schedule(new TimerTask() {
+      public void run() {
+        System.out.println("VM still alive (a bit)");
+      }
+    }, 1000, 1000);
 
-        VirtualMachineLiveLock vmll = new VirtualMachineLiveLock();
-        vmll.check();
-    }
+    VirtualMachineLiveLock vmll = new VirtualMachineLiveLock();
+    vmll.check();
+  }
 
-    private void check() throws InterruptedException {
-        Thread[] threads = {
-                new Thread(new InterleavedTask(true)),
-                new Thread(new InterleavedTask(false)),
-        };
-        for (Thread thread : threads) {
-            thread.start();
-        }
-        for (Thread thread : threads) {
-            thread.join();
-        }
+  private void check() throws InterruptedException {
+    Thread[] threads = {
+        new Thread(new InterleavedTask(true)),
+        new Thread(new InterleavedTask(false)),
+    };
+    for (Thread thread : threads) {
+      thread.start();
+    }
+    for (Thread thread : threads) {
+      thread.join();
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java
new file mode 100644
index 0000000..00bf281
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/DenseMemoryUsage.java
@@ -0,0 +1,44 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193;
+
+import eu.javaspecialists.tjsn.examples.issue193.objectfactories.*;
+import eu.javaspecialists.tjsn.memory.*;
+
+public class DenseMemoryUsage {
+  public static void main(String[] args) {
+    MemoryTestBench mtb = new MemoryTestBench();
+    System.out.println("Normal Fill Factor of 0.75 with 10 elements");
+    mtb.showMemoryUsage(new FullMapObjectFactory(new HashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new HashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new ConcurrentHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new SmallConcurrentHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new BigConcurrentHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new HashtableFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new HighlyScalableTableFactory(), 10));
+
+    System.out.println("Dense Fill Factor of 1.33 with 10 elements");
+    mtb.showMemoryUsage(new FullMapObjectFactory(new DenseHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new DenseConcurrentHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new DenseSmallConcurrentHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new DenseBigConcurrentHashMapFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new DenseHashtableFactory(), 10));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new DenseHighlyScalableTableFactory(), 10));
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java
new file mode 100644
index 0000000..d8bb9a2
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/FullMemoryUsage.java
@@ -0,0 +1,33 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193;
+
+import eu.javaspecialists.tjsn.examples.issue193.objectfactories.*;
+import eu.javaspecialists.tjsn.memory.*;
+
+public class FullMemoryUsage {
+  public static void main(String[] args) {
+    MemoryTestBench mtb = new MemoryTestBench();
+    mtb.showMemoryUsage(new FullMapObjectFactory(new ConcurrentHashMapFactory()));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new SmallConcurrentHashMapFactory()));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new BigConcurrentHashMapFactory()));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new HashtableFactory()));
+    mtb.showMemoryUsage(new FullMapObjectFactory(new HighlyScalableTableFactory()));
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java
new file mode 100644
index 0000000..323f813
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/HighlyScalableTableFactory.java
@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193;
+
+import eu.javaspecialists.tjsn.memory.*;
+import org.cliffc.high_scale_lib.*;
+
+public class HighlyScalableTableFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new NonBlockingHashMap();
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java
new file mode 100644
index 0000000..b73349b
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/MemoryUsage.java
@@ -0,0 +1,44 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193;
+
+import eu.javaspecialists.tjsn.examples.issue193.objectfactories.*;
+import eu.javaspecialists.tjsn.memory.*;
+
+public class MemoryUsage {
+  public static void main(String[] args) {
+    MemoryTestBench mtb = new MemoryTestBench();
+    mtb.showMemoryUsage(new BasicObjectFactory());
+    mtb.showMemoryUsage(new LongObjectFactory());
+    mtb.showMemoryUsage(new IntegerObjectFactory());
+
+    mtb.showMemoryUsage(new HashMapFactory());
+    mtb.showMemoryUsage(new SynchronizedHashMapFactory());
+    mtb.showMemoryUsage(new HashtableFactory());
+
+    mtb.showMemoryUsage(new ReentrantLockFactory());
+    mtb.showMemoryUsage(new ConcurrentHashMapFactory());
+    mtb.showMemoryUsage(new SmallConcurrentHashMapFactory());
+    mtb.showMemoryUsage(new BigConcurrentHashMapFactory());
+    mtb.showMemoryUsage(new HugeConcurrentHashMapFactory());
+    mtb.showMemoryUsage(new HugeConcurrentHashMapV8Factory());
+
+    mtb.showMemoryUsage(new HighlyScalableTableFactory());
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java
new file mode 100644
index 0000000..59c4f29
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BasicObjectFactory.java
@@ -0,0 +1,27 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+public class BasicObjectFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new Object();
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BigConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BigConcurrentHashMapFactory.java
new file mode 100644
index 0000000..74f1b3b
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/BigConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class BigConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap(16, .75f, 256);
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ConcurrentHashMapFactory.java
new file mode 100644
index 0000000..38a28a1
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class ConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap();
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseBigConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseBigConcurrentHashMapFactory.java
new file mode 100644
index 0000000..65eb3c7
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseBigConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class DenseBigConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap(16, 1.33f, 256);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseConcurrentHashMapFactory.java
new file mode 100644
index 0000000..d7befb3
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class DenseConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap(16, 1.33f, 16);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashMapFactory.java
new file mode 100644
index 0000000..94e1c51
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.*;
+
+public class DenseHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new HashMap(16, 1.33f);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashtableFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashtableFactory.java
new file mode 100644
index 0000000..095243e
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHashtableFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.*;
+
+public class DenseHashtableFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new Hashtable(16, 1.33f);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java
new file mode 100644
index 0000000..ad35bbe
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseHighlyScalableTableFactory.java
@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+import org.cliffc.high_scale_lib.*;
+
+public class DenseHighlyScalableTableFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new NonBlockingHashMap(16);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseSmallConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseSmallConcurrentHashMapFactory.java
new file mode 100644
index 0000000..5c6daaf
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/DenseSmallConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class DenseSmallConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap(16, 1.33f, 2);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/FullMapObjectFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/FullMapObjectFactory.java
new file mode 100644
index 0000000..e38f431
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/FullMapObjectFactory.java
@@ -0,0 +1,48 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.*;
+
+public class FullMapObjectFactory implements ObjectFactory {
+  private final ObjectFactory factory;
+  private final int numberOfElements;
+
+  public FullMapObjectFactory(ObjectFactory factory, int numberOfElements) {
+    this.factory = factory;
+    this.numberOfElements = numberOfElements;
+  }
+
+  public FullMapObjectFactory(ObjectFactory factory) {
+    this(factory, 100);
+  }
+
+  public Object makeObject() {
+    return fill((Map) factory.makeObject());
+  }
+
+  protected Map fill(Map map) {
+    for (int i = 0; i < numberOfElements; i++) {
+      map.put(i, "dummy");
+    }
+    return map;
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashMapFactory.java
new file mode 100644
index 0000000..e402e37
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.*;
+
+public class HashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new HashMap();
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashtableFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashtableFactory.java
new file mode 100644
index 0000000..a6b4eaa
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HashtableFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.*;
+
+public class HashtableFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new Hashtable();
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapFactory.java
new file mode 100644
index 0000000..dae57c4
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class HugeConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap(16, .75f, 4096);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java
new file mode 100644
index 0000000..dc69cf0
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/HugeConcurrentHashMapV8Factory.java
@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+import jsr166e.*;
+
+public class HugeConcurrentHashMapV8Factory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMapV8(16, .75f, 4096);
+  }
+}
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java
new file mode 100644
index 0000000..05c9301
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/IntegerObjectFactory.java
@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+public class IntegerObjectFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new Integer(333);
+  }
+}
+
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/LongObjectFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/LongObjectFactory.java
new file mode 100644
index 0000000..52d2391
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/LongObjectFactory.java
@@ -0,0 +1,28 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+public class LongObjectFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new Long(333L);
+  }
+}
+
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ReentrantLockFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ReentrantLockFactory.java
new file mode 100644
index 0000000..7f5a0ed
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/ReentrantLockFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.locks.*;
+
+public class ReentrantLockFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ReentrantLock();
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SmallConcurrentHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SmallConcurrentHashMapFactory.java
new file mode 100644
index 0000000..cc00a98
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SmallConcurrentHashMapFactory.java
@@ -0,0 +1,29 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.concurrent.*;
+
+public class SmallConcurrentHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return new ConcurrentHashMap(16, .75f, 2);
+  }
+}
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java
new file mode 100644
index 0000000..ce20ef5
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue193/objectfactories/SynchronizedHashMapFactory.java
@@ -0,0 +1,31 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.examples.issue193.objectfactories;
+
+import eu.javaspecialists.tjsn.memory.*;
+
+import java.util.*;
+
+public class SynchronizedHashMapFactory implements ObjectFactory {
+  public Object makeObject() {
+    return Collections.synchronizedMap(new HashMap());
+  }
+}
+
+
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/Blinker.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/Blinker.java
index 548d66a..b902e30 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/Blinker.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/Blinker.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -34,65 +34,65 @@
  * @author Dr Heinz M. Kabutz
  */
 public class Blinker extends JFrame {
-    public Blinker() {
-        setLayout(new GridLayout(0, 4));
-    }
+  public Blinker() {
+    setLayout(new GridLayout(0, 4));
+  }
 
-    private void addButtons(int buttons, final int blinks) {
-        final Phaser phaser = new Phaser(buttons) {
-            protected boolean onAdvance(int phase, int parties) {
-                return phase >= blinks - 1 || parties == 0;
-            }
-        };
-        for (int i = 0; i < buttons; i++) {
-            final JComponent comp = new JButton("Button " + i);
-            comp.setOpaque(true);
-            final Color defaultColor = comp.getBackground();
-            changeColor(comp, defaultColor);
-            add(comp);
-            new Thread() {
-                public void run() {
-                    Random rand = ThreadLocalRandom.current();
-                    try {
-                        Thread.sleep(1000);
-                        do {
-                            Color newColor = new Color(rand.nextInt());
-                            changeColor(comp, newColor);
-                            Thread.sleep(500 + rand.nextInt(3000));
-                            changeColor(comp, defaultColor);
-                            Toolkit.getDefaultToolkit().beep();
-                            Thread.sleep(2000);
-                            phaser.arriveAndAwaitAdvance();
-                        } while (!phaser.isTerminated());
-                    } catch (InterruptedException e) {
-                        Thread.currentThread().interrupt();
-                    }
-                }
-            }.start();
+  private void addButtons(int buttons, final int blinks) {
+    final Phaser phaser = new Phaser(buttons) {
+      protected boolean onAdvance(int phase, int parties) {
+        return phase >= blinks - 1 || parties == 0;
+      }
+    };
+    for (int i = 0; i < buttons; i++) {
+      final JComponent comp = new JButton("Button " + i);
+      comp.setOpaque(true);
+      final Color defaultColor = comp.getBackground();
+      changeColor(comp, defaultColor);
+      add(comp);
+      new Thread() {
+        public void run() {
+          Random rand = ThreadLocalRandom.current();
+          try {
+            Thread.sleep(1000);
+            do {
+              Color newColor = new Color(rand.nextInt());
+              changeColor(comp, newColor);
+              Thread.sleep(500 + rand.nextInt(3000));
+              changeColor(comp, defaultColor);
+              Toolkit.getDefaultToolkit().beep();
+              Thread.sleep(2000);
+              phaser.arriveAndAwaitAdvance();
+            } while (!phaser.isTerminated());
+          } catch (InterruptedException e) {
+            Thread.currentThread().interrupt();
+          }
         }
+      }.start();
     }
+  }
 
-    private void changeColor(
-            final JComponent comp, final Color color) {
-        SwingUtilities.invokeLater(new Runnable() {
-            public void run() {
-                comp.setBackground(color);
-                invalidate();
-                repaint();
-            }
-        });
-    }
+  private void changeColor(
+      final JComponent comp, final Color color) {
+    SwingUtilities.invokeLater(new Runnable() {
+      public void run() {
+        comp.setBackground(color);
+        invalidate();
+        repaint();
+      }
+    });
+  }
 
-    public static void main(String[] args) {
-        SwingUtilities.invokeLater(new Runnable() {
-            public void run() {
-                Blinker blinker = new Blinker();
-                blinker.addButtons(20, 3);
-                blinker.pack();
-                blinker.setVisible(true);
-                blinker.setDefaultCloseOperation(
-                        WindowConstants.EXIT_ON_CLOSE);
-            }
-        });
-    }
+  public static void main(String[] args) {
+    SwingUtilities.invokeLater(new Runnable() {
+      public void run() {
+        Blinker blinker = new Blinker();
+        blinker.addButtons(20, 3);
+        blinker.pack();
+        blinker.setVisible(true);
+        blinker.setDefaultCloseOperation(
+            WindowConstants.EXIT_ON_CLOSE);
+      }
+    });
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne.java
index 41b44b5..62d5784 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -24,22 +24,22 @@
  * @author Dr Heinz M. Kabutz
  */
 public class CloseToOne {
-    public static double makeDouble(long first, long second) {
-        return ((first << 27) + second) / (double) (1L << 53);
-    }
+  public static double makeDouble(long first, long second) {
+    return ((first << 27) + second) / (double) (1L << 53);
+  }
 
-    public static void main(String[] args) {
+  public static void main(String[] args) {
 
-        long first = (1 << 26) - 1;
-        long second = (1 << 27) - 1;
+    long first = (1 << 26) - 1;
+    long second = (1 << 27) - 1;
 
-        System.out.println(makeDouble(first, second));
-        System.out.println((int) (makeDouble(first, second) + 1));
+    System.out.println(makeDouble(first, second));
+    System.out.println((int) (makeDouble(first, second) + 1));
 
-        second--;
-        System.out.println(makeDouble(first, second));
-        System.out.println((int) (makeDouble(first, second) + 1));
+    second--;
+    System.out.println(makeDouble(first, second));
+    System.out.println((int) (makeDouble(first, second) + 1));
 
-        System.out.println((((1L << 53) - 1)) / (double) (1L << 53));
-    }
+    System.out.println((((1L << 53) - 1)) / (double) (1L << 53));
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2.java
index d809bb1..48bed15 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -24,12 +24,12 @@
  * @author Dr Heinz M. Kabutz
  */
 public class CloseToOne2 {
-    public static void main(String[] args) {
-        double d = 0.999999993;
-        System.out.println("d = " + d);
-        int i = (int) (1 + d);
-        System.out.println("i = " + i);
-        int j = (int) (100_000_000 + d);
-        System.out.println("j = " + j);
-    }
+  public static void main(String[] args) {
+    double d = 0.999999993;
+    System.out.println("d = " + d);
+    int i = (int) (1 + d);
+    System.out.println("i = " + i);
+    int j = (int) (100_000_000 + d);
+    System.out.println("j = " + j);
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/FindRandom.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/FindRandom.java
index 2114306..5d1f0f2 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/FindRandom.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/FindRandom.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -24,81 +24,81 @@
  * @author Dr Wolfgang Laun, Dr Heinz M. Kabutz
  */
 public class FindRandom {
-    private final static long multiplier = 0x5DEECE66DL;
-    private final static long addend = 0xBL;
-    private final static long mask = (1L << 48) - 1;
+  private final static long multiplier = 0x5DEECE66DL;
+  private final static long addend = 0xBL;
+  private final static long mask = (1L << 48) - 1;
 
-    public static double makeDouble(long pre, long post) {
-        return ((pre << 27) + post) / (double) (1L << 53);
-    }
+  public static double makeDouble(long pre, long post) {
+    return ((pre << 27) + post) / (double) (1L << 53);
+  }
 
-    private static long setbits(int len, int off) {
-        long res = (1L << len) - 1;
-        return res << off;
-    }
+  private static long setbits(int len, int off) {
+    long res = (1L << len) - 1;
+    return res << off;
+  }
 
-    /**
-     * A random double is composed from two successive random integers. The
-     * most
-     * significant 26 bits of the first one are taken and concatenated with the
-     * most significant 27 bits of the second one. (ms(ri1,26)) << 27 +
-     * (ms(ri2,27)) This is divided by (double)(1L << 53) to obtain a result in
-     * [0.0, 1.0). To find the maximum random double, we assume that
-     * (ms(ri1,m26)) is a maximum (all 1b) and vary the remaining 22 bits from
-     * 0
-     * to m22, inclusive. Assuming this to be ri1, we perform the calculation
-     * according to Random.next() to obtain is successor, our ri2. The maximum
-     * of the most significant 27 bits of all ri2 would then be the second part
-     * of the maximum 53-bit integer used for a double random's mantissa.
-     */
-    public static double findMaxDouble() {
-        long ones = setbits(26, 22);
-        System.out.println("ones: " + Long.toHexString(ones));
-        long maxpost = setbits(22, 0);
-        System.out.println("maxpost: " + Long.toHexString(maxpost));
-        long maxintw = 0;
-        for (long post = 0; post <= maxpost; post++) {
-            long oldseed = ones + post;
-            long nextseed = (oldseed * multiplier + addend) & mask;
-            long intw = nextseed >>> (48 - 27);
-            if (intw > maxintw) {
-                maxintw = intw;
-            }
-        }
-        System.out.println("maxintw: " + Long.toHexString(maxintw));
-        long b26 = setbits(26, 0);
-        System.out.println("b26: " + Long.toHexString(b26));
-        double d = makeDouble(b26, maxintw);
-        System.out.println("max. double: " +
-                Double.toHexString(d) + " = " + d);
-        return d;
+  /**
+   * A random double is composed from two successive random integers. The
+   * most
+   * significant 26 bits of the first one are taken and concatenated with the
+   * most significant 27 bits of the second one. (ms(ri1,26)) << 27 +
+   * (ms(ri2,27)) This is divided by (double)(1L << 53) to obtain a result in
+   * [0.0, 1.0). To find the maximum random double, we assume that
+   * (ms(ri1,m26)) is a maximum (all 1b) and vary the remaining 22 bits from
+   * 0
+   * to m22, inclusive. Assuming this to be ri1, we perform the calculation
+   * according to Random.next() to obtain is successor, our ri2. The maximum
+   * of the most significant 27 bits of all ri2 would then be the second part
+   * of the maximum 53-bit integer used for a double random's mantissa.
+   */
+  public static double findMaxDouble() {
+    long ones = setbits(26, 22);
+    System.out.println("ones: " + Long.toHexString(ones));
+    long maxpost = setbits(22, 0);
+    System.out.println("maxpost: " + Long.toHexString(maxpost));
+    long maxintw = 0;
+    for (long post = 0; post <= maxpost; post++) {
+      long oldseed = ones + post;
+      long nextseed = (oldseed * multiplier + addend) & mask;
+      long intw = nextseed >>> (48 - 27);
+      if (intw > maxintw) {
+        maxintw = intw;
+      }
     }
+    System.out.println("maxintw: " + Long.toHexString(maxintw));
+    long b26 = setbits(26, 0);
+    System.out.println("b26: " + Long.toHexString(b26));
+    double d = makeDouble(b26, maxintw);
+    System.out.println("max. double: " +
+        Double.toHexString(d) + " = " + d);
+    return d;
+  }
 
-    public static double findMinDouble() {
-        long b26 = 0L;
-        long zeroes = 0L;
-        long maxpost = setbits(22, 0);
-        long minintw = 0x7fffffffffffffffL;
-        for (int post = 0; post < maxpost; post++) {
-            long oldseed = zeroes + post;
-            long nextseed = (oldseed * multiplier + addend) & mask;
-            long intw = nextseed >>> (48 - 27);
-            if (intw < minintw) {
-                minintw = intw;
-            }
-        }
-        System.out.println("minintw: " + minintw);
-        double d = makeDouble(b26, minintw);
-        System.out.println("min. double: " +
-                Double.toHexString(d) + " = " + d);
-        return d;
+  public static double findMinDouble() {
+    long b26 = 0L;
+    long zeroes = 0L;
+    long maxpost = setbits(22, 0);
+    long minintw = 0x7fffffffffffffffL;
+    for (int post = 0; post < maxpost; post++) {
+      long oldseed = zeroes + post;
+      long nextseed = (oldseed * multiplier + addend) & mask;
+      long intw = nextseed >>> (48 - 27);
+      if (intw < minintw) {
+        minintw = intw;
+      }
     }
+    System.out.println("minintw: " + minintw);
+    double d = makeDouble(b26, minintw);
+    System.out.println("min. double: " +
+        Double.toHexString(d) + " = " + d);
+    return d;
+  }
 
-    public static void main(String[] args) {
-        findMaxDouble();
-        double belowOne = Math.nextAfter(1.0, 0.0);
-        System.out.println("Biggest double below 1.0 is: " +
-                Double.toHexString(belowOne) + " = " + belowOne);
-        findMinDouble();
-    }
+  public static void main(String[] args) {
+    findMaxDouble();
+    double belowOne = Math.nextAfter(1.0, 0.0);
+    System.out.println("Biggest double below 1.0 is: " +
+        Double.toHexString(belowOne) + " = " + belowOne);
+    findMinDouble();
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/MathTeaser.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/MathTeaser.java
index e9b035f..257bdfe 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue198/MathTeaser.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue198/MathTeaser.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,25 +26,25 @@
  * @author Dr Heinz M. Kabutz
  */
 public class MathTeaser {
-    public static void main(String[] args) {
-        final Random random = new Random();
-        Thread seeder = new Thread() {
-            public void run() {
-                while (true) {
-                    random.setSeed(51102269); // causes 2^26-1 as next(26)
-                    random.setSeed(223209395); // causes 2^27-1 as next(27)
-                }
-            }
-        };
-        seeder.setDaemon(true);
-        seeder.start();
-
+  public static void main(String[] args) {
+    final Random random = new Random();
+    Thread seeder = new Thread() {
+      public void run() {
         while (true) {
-            double num = random.nextDouble();
-            if ((int) (num + 1) == 2) {
-                System.out.println("Yes, random.nextDouble() can: " + num);
-                break;
-            }
+          random.setSeed(51102269); // causes 2^26-1 as next(26)
+          random.setSeed(223209395); // causes 2^27-1 as next(27)
         }
+      }
+    };
+    seeder.setDaemon(true);
+    seeder.start();
+
+    while (true) {
+      double num = random.nextDouble();
+      if ((int) (num + 1) == 2) {
+        System.out.println("Yes, random.nextDouble() can: " + num);
+        break;
+      }
     }
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGenerator.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGenerator.java
index 786370b..b318263 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGenerator.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGenerator.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,39 +29,39 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciGenerator {
-    private final Fibonacci fib;
+  private final Fibonacci fib;
 
-    public FibonacciGenerator(Fibonacci fib) {
-        this.fib = fib;
-    }
-
-    public void findFib(int n) throws InterruptedException {
-        System.out.printf("Searching for Fibonacci(%,d)%n", n);
-        long time = System.currentTimeMillis();
-        BigInteger num = fib.calculate(n);
-        time = System.currentTimeMillis() - time;
-        printProof(num);
-        System.out.printf("  Time to calculate %d ms%n%n", time);
-    }
+  public FibonacciGenerator(Fibonacci fib) {
+    this.fib = fib;
+  }
 
-    private void printProof(BigInteger num) {
-        System.out.printf("  Number of bits: %d%n", num.bitLength());
-        byte[] numHex = num.toByteArray();
-        System.out.print("  First 10 bytes: ");
-        for (int i = 0; i < 10; i++) {
-            System.out.printf(" %02x", numHex[i]);
-        }
-        System.out.println();
+  public void findFib(int n) throws InterruptedException {
+    System.out.printf("Searching for Fibonacci(%,d)%n", n);
+    long time = System.currentTimeMillis();
+    BigInteger num = fib.calculate(n);
+    time = System.currentTimeMillis() - time;
+    printProof(num);
+    System.out.printf("  Time to calculate %d ms%n%n", time);
+  }
 
-        System.out.print("  Last 10 bytes:  ");
-        for (int i = numHex.length - 10; i < numHex.length; i++) {
-            System.out.printf(" %02x", numHex[i]);
-        }
-        System.out.println();
+  private void printProof(BigInteger num) {
+    System.out.printf("  Number of bits: %d%n", num.bitLength());
+    byte[] numHex = num.toByteArray();
+    System.out.print("  First 10 bytes: ");
+    for (int i = 0; i < 10; i++) {
+      System.out.printf(" %02x", numHex[i]);
+    }
+    System.out.println();
 
-        Checksum ck = new Adler32();
-        ck.update(numHex, 0, numHex.length);
-        System.out.printf("  Adler32 Checksum: 0x%016x%n", ck.getValue());
+    System.out.print("  Last 10 bytes:  ");
+    for (int i = numHex.length - 10; i < numHex.length; i++) {
+      System.out.printf(" %02x", numHex[i]);
     }
+    System.out.println();
+
+    Checksum ck = new Adler32();
+    ck.update(numHex, 0, numHex.length);
+    System.out.printf("  Adler32 Checksum: 0x%016x%n", ck.getValue());
+  }
 
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGeneratorExample.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGeneratorExample.java
index 5fc10ec..4585268 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGeneratorExample.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue201/FibonacciGeneratorExample.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,33 +28,33 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciGeneratorExample {
-    private static ForkJoinPool pool = new ForkJoinPool(
-            Runtime.getRuntime().availableProcessors() * 4);
+  private static ForkJoinPool pool = new ForkJoinPool(
+      Runtime.getRuntime().availableProcessors() * 4);
 
-    public static void main(String[] args) throws InterruptedException {
-        int[] ns;
-        if (args.length != 0) {
-            ns = new int[args.length];
-            for (int i = 0; i < ns.length; i++) {
-                ns[i] = Integer.parseInt(args[i]);
-            }
-        } else {
-            ns = new int[]{
-                    1_000_000,
-                    10_000_000,
-                    100_000_000, // takes a bit long
-                    1_000_000_000, // takes a bit long
-            };
-        }
-        test(new FibonacciRecursiveBowbeer(pool), ns);
-        //test(new FibonacciRecursiveParallelDijkstraKaratsuba(pool), ns);
+  public static void main(String[] args) throws InterruptedException {
+    int[] ns;
+    if (args.length != 0) {
+      ns = new int[args.length];
+      for (int i = 0; i < ns.length; i++) {
+        ns[i] = Integer.parseInt(args[i]);
+      }
+    } else {
+      ns = new int[]{
+          1_000_000,
+          10_000_000,
+          100_000_000, // takes a bit long
+          1_000_000_000, // takes a bit long
+      };
     }
+    test(new FibonacciRecursiveBowbeer(pool), ns);
+    //test(new FibonacciRecursiveParallelDijkstraKaratsuba(pool), ns);
+  }
 
-    private static void test(Fibonacci fib, int... ns) throws InterruptedException {
-        for (int n : ns) {
-            FibonacciGenerator fibgen = new FibonacciGenerator(fib);
-            fibgen.findFib(n);
-            System.out.println(pool);
-        }
+  private static void test(Fibonacci fib, int... ns) throws InterruptedException {
+    for (int n : ns) {
+      FibonacciGenerator fibgen = new FibonacciGenerator(fib);
+      fibgen.findFib(n);
+      System.out.println(pool);
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue203/FinallyJava.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue203/FinallyJava.java
index ba72d88..3f18fac 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue203/FinallyJava.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue203/FinallyJava.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,23 +29,23 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FinallyJava {
-    public void foo() {
-        try {
-            if (ThreadLocalRandom.current().nextBoolean()) {
-                System.out.println("First random true");
-                return;
-            }
-            if (ThreadLocalRandom.current().nextBoolean()) {
-                System.out.println("Second random true");
-                return;
-            }
-            System.out.println("Both randoms false");
-        } finally {
-            System.out.println("Done");
-        }
+  public void foo() {
+    try {
+      if (ThreadLocalRandom.current().nextBoolean()) {
+        System.out.println("First random true");
+        return;
+      }
+      if (ThreadLocalRandom.current().nextBoolean()) {
+        System.out.println("Second random true");
+        return;
+      }
+      System.out.println("Both randoms false");
+    } finally {
+      System.out.println("Done");
     }
+  }
 
-    public static void main(String[] args) {
-        new FinallyJava().foo();
-    }
+  public static void main(String[] args) {
+    new FinallyJava().foo();
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue203/GoToJava.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue203/GoToJava.java
index 904dbfb..aa12653 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue203/GoToJava.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue203/GoToJava.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,23 +29,23 @@
  * @author Dr Heinz M. Kabutz
  */
 public class GoToJava {
-    public void foo() {
-        here:
-        {
-            if (ThreadLocalRandom.current().nextBoolean()) {
-                System.out.println("First random true");
-                break here;
-            }
-            if (ThreadLocalRandom.current().nextBoolean()) {
-                System.out.println("Second random true");
-                break here;
-            }
-            System.out.println("Both randoms false");
-        }
-        System.out.println("Done");
+  public void foo() {
+    here:
+    {
+      if (ThreadLocalRandom.current().nextBoolean()) {
+        System.out.println("First random true");
+        break here;
+      }
+      if (ThreadLocalRandom.current().nextBoolean()) {
+        System.out.println("Second random true");
+        break here;
+      }
+      System.out.println("Both randoms false");
     }
+    System.out.println("Done");
+  }
 
-    public static void main(String[] args) {
-        new GoToJava().foo();
-    }
+  public static void main(String[] args) {
+    new GoToJava().foo();
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java
index 14a3bbe..4472f8d 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue206/SerialExecutorExample.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -32,37 +32,37 @@
  * @author Dr Heinz M. Kabutz
  */
 public class SerialExecutorExample {
-    private static final int UPTO = 10;
+  private static final int UPTO = 10;
 
-    public static void main(String[] args) {
-        ExecutorService cached = Executors.newCachedThreadPool();
-        test(new SerialExecutor(cached));
-        test(cached);
-        cached.shutdown();
-    }
+  public static void main(String[] args) {
+    ExecutorService cached = Executors.newCachedThreadPool();
+    test(new SerialExecutor(cached));
+    test(cached);
+    cached.shutdown();
+  }
 
-    private static void test(Executor executor) {
-        final Vector<Integer> call_sequence = new Vector<>();
-        final Phaser phaser = new Phaser(1);
-        for (int i = 0; i < UPTO; i++) {
-            phaser.register();
-            final int tempI = i;
-            executor.execute(new Runnable() {
-                public void run() {
-                    try {
-                        TimeUnit.MILLISECONDS.sleep(
-                                ThreadLocalRandom.current().nextInt(2, 10)
-                        );
-                    } catch (InterruptedException e) {
-                        Thread.currentThread().interrupt();
-                    }
-                    call_sequence.add(tempI);
-                    phaser.arrive();
-                }
-            });
+  private static void test(Executor executor) {
+    final Vector<Integer> call_sequence = new Vector<>();
+    final Phaser phaser = new Phaser(1);
+    for (int i = 0; i < UPTO; i++) {
+      phaser.register();
+      final int tempI = i;
+      executor.execute(new Runnable() {
+        public void run() {
+          try {
+            TimeUnit.MILLISECONDS.sleep(
+                ThreadLocalRandom.current().nextInt(2, 10)
+            );
+          } catch (InterruptedException e) {
+            Thread.currentThread().interrupt();
+          }
+          call_sequence.add(tempI);
+          phaser.arrive();
         }
-        // we need to wait until all the jobs are done
-        phaser.arriveAndAwaitAdvance();
-        System.out.println(call_sequence);
+      });
     }
+    // we need to wait until all the jobs are done
+    phaser.arriveAndAwaitAdvance();
+    System.out.println(call_sequence);
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorServiceExample.java b/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorServiceExample.java
index 3b15f5b..f3a4fef 100644
--- a/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorServiceExample.java
+++ b/src/main/java/eu/javaspecialists/tjsn/examples/issue206/StripedExecutorServiceExample.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -32,35 +32,35 @@
  * @author Dr Heinz M. Kabutz
  */
 public class StripedExecutorServiceExample {
-    private static final int UPTO = 10;
+  private static final int UPTO = 10;
 
-    public static void main(String[] args)
-            throws InterruptedException {
-        test(new StripedExecutorService());
-        test(Executors.newCachedThreadPool());
-    }
+  public static void main(String[] args)
+      throws InterruptedException {
+    test(new StripedExecutorService());
+    test(Executors.newCachedThreadPool());
+  }
 
-    private static void test(ExecutorService pool)
-            throws InterruptedException {
-        final Vector<Integer> call_sequence = new Vector<>();
-        for (int i = 0; i < UPTO; i++) {
-            final int tempI = i;
-            pool.submit(new StripedCallable<Void>() {
-                public Void call() throws Exception {
-                    TimeUnit.MILLISECONDS.sleep(
-                            ThreadLocalRandom.current().nextInt(2, 10)
-                    );
-                    call_sequence.add(tempI);
-                    return null;
-                }
+  private static void test(ExecutorService pool)
+      throws InterruptedException {
+    final Vector<Integer> call_sequence = new Vector<>();
+    for (int i = 0; i < UPTO; i++) {
+      final int tempI = i;
+      pool.submit(new StripedCallable<Void>() {
+        public Void call() throws Exception {
+          TimeUnit.MILLISECONDS.sleep(
+              ThreadLocalRandom.current().nextInt(2, 10)
+          );
+          call_sequence.add(tempI);
+          return null;
+        }
 
-                public Object getStripe() {
-                    return call_sequence;
-                }
-            });
+        public Object getStripe() {
+          return call_sequence;
         }
-        pool.shutdown();
-        while (!pool.awaitTermination(1, TimeUnit.SECONDS)) ;
-        System.out.println(call_sequence);
+      });
     }
+    pool.shutdown();
+    while (!pool.awaitTermination(1, TimeUnit.SECONDS)) ;
+    System.out.println(call_sequence);
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java b/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java
index 783dcbd..6029190 100644
--- a/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java
+++ b/src/main/java/eu/javaspecialists/tjsn/gui/TristateButtonModel.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,72 +27,72 @@
  * @author Dr Heinz M. Kabutz
  */
 public class TristateButtonModel extends ToggleButtonModel {
-    private TristateState state = TristateState.DESELECTED;
-
-    public TristateButtonModel(TristateState state) {
-        setState(state);
-    }
-
-    public TristateButtonModel() {
-        this(TristateState.DESELECTED);
+  private TristateState state = TristateState.DESELECTED;
+
+  public TristateButtonModel(TristateState state) {
+    setState(state);
+  }
+
+  public TristateButtonModel() {
+    this(TristateState.DESELECTED);
+  }
+
+  public void setIndeterminate() {
+    setState(TristateState.INDETERMINATE);
+  }
+
+  public boolean isIndeterminate() {
+    return state == TristateState.INDETERMINATE;
+  }
+
+  // Overrides of superclass methods
+  public void setEnabled(boolean enabled) {
+    super.setEnabled(enabled);
+    // Restore state display
+    displayState();
+  }
+
+  public void setSelected(boolean selected) {
+    setState(selected ?
+        TristateState.SELECTED : TristateState.DESELECTED);
+  }
+
+  // Empty overrides of superclass methods
+  public void setArmed(boolean b) {
+  }
+
+  public void setPressed(boolean b) {
+  }
+
+  void iterateState() {
+    setState(state.next());
+  }
+
+  private void setState(TristateState state) {
+    //Set internal state
+    this.state = state;
+    displayState();
+    if (state == TristateState.INDETERMINATE && isEnabled()) {
+      // force the events to fire
+
+      // Send ChangeEvent
+      fireStateChanged();
+
+      // Send ItemEvent
+      int indeterminate = 3;
+      fireItemStateChanged(new ItemEvent(
+          this, ItemEvent.ITEM_STATE_CHANGED, this,
+          indeterminate));
     }
+  }
 
-    public void setIndeterminate() {
-        setState(TristateState.INDETERMINATE);
-    }
-
-    public boolean isIndeterminate() {
-        return state == TristateState.INDETERMINATE;
-    }
+  private void displayState() {
+    super.setSelected(state != TristateState.DESELECTED);
+    super.setArmed(state == TristateState.INDETERMINATE);
+    super.setPressed(state == TristateState.INDETERMINATE);
+  }
 
-    // Overrides of superclass methods
-    public void setEnabled(boolean enabled) {
-        super.setEnabled(enabled);
-        // Restore state display
-        displayState();
-    }
-
-    public void setSelected(boolean selected) {
-        setState(selected ?
-                TristateState.SELECTED : TristateState.DESELECTED);
-    }
-
-    // Empty overrides of superclass methods
-    public void setArmed(boolean b) {
-    }
-
-    public void setPressed(boolean b) {
-    }
-
-    void iterateState() {
-        setState(state.next());
-    }
-
-    private void setState(TristateState state) {
-        //Set internal state
-        this.state = state;
-        displayState();
-        if (state == TristateState.INDETERMINATE && isEnabled()) {
-            // force the events to fire
-
-            // Send ChangeEvent
-            fireStateChanged();
-
-            // Send ItemEvent
-            int indeterminate = 3;
-            fireItemStateChanged(new ItemEvent(
-                    this, ItemEvent.ITEM_STATE_CHANGED, this,
-                    indeterminate));
-        }
-    }
-
-    private void displayState() {
-        super.setSelected(state != TristateState.DESELECTED);
-        super.setArmed(state == TristateState.INDETERMINATE);
-        super.setPressed(state == TristateState.INDETERMINATE);
-    }
-
-    public TristateState getState() {
-        return state;
-    }
+  public TristateState getState() {
+    return state;
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java b/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java
index 9170997..fd4fb45 100644
--- a/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java
+++ b/src/main/java/eu/javaspecialists/tjsn/gui/TristateCheckBox.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -30,93 +30,93 @@
  * @author Dr Heinz M. Kabutz
  */
 public final class TristateCheckBox extends JCheckBox {
-    // Listener on model changes to maintain correct focusability
-    private final ChangeListener enableListener =
-            new ChangeListener() {
-                public void stateChanged(ChangeEvent e) {
-                    TristateCheckBox.this.setFocusable(
-                            getModel().isEnabled());
-                }
-            };
-
-    public TristateCheckBox(String text) {
-        this(text, null, TristateState.DESELECTED);
-    }
-
-    public TristateCheckBox(String text, Icon icon,
-                            TristateState initial) {
-        super(text, icon);
-
-        //Set default single model
-        setModel(new TristateButtonModel(initial));
-
-        // override action behaviour
-        super.addMouseListener(new MouseAdapter() {
-            public void mousePressed(MouseEvent e) {
-                TristateCheckBox.this.iterateState();
-            }
-        });
-        ActionMap actions = new ActionMapUIResource();
-        actions.put("pressed", new AbstractAction() {
-            public void actionPerformed(ActionEvent e) {
-                TristateCheckBox.this.iterateState();
-            }
-        });
-        actions.put("released", null);
-        SwingUtilities.replaceUIActionMap(this, actions);
-    }
-
-    // Next two methods implement new API by delegation to model
-    public void setIndeterminate() {
-        getTristateModel().setIndeterminate();
-    }
-
-    public boolean isIndeterminate() {
-        return getTristateModel().isIndeterminate();
-    }
-
-    public TristateState getState() {
-        return getTristateModel().getState();
-    }
-
-    //Overrides superclass method
-    public void setModel(ButtonModel newModel) {
-        super.setModel(newModel);
-
-        //Listen for enable changes
-        if (model instanceof TristateButtonModel)
-            model.addChangeListener(enableListener);
-    }
-
-    //Empty override of superclass method
-    public void addMouseListener(MouseListener l) {
-    }
-
-    // Mostly delegates to model
-    private void iterateState() {
-        //Maybe do nothing at all?
-        if (!getModel().isEnabled()) return;
-
-        grabFocus();
-
-        // Iterate state
-        getTristateModel().iterateState();
-
-        // Fire ActionEvent
-        int modifiers = 0;
-        AWTEvent currentEvent = EventQueue.getCurrentEvent();
-        if (currentEvent instanceof InputEvent) {
-            modifiers = ((InputEvent) currentEvent).getModifiers();
-        } else if (currentEvent instanceof ActionEvent) {
-            modifiers = ((ActionEvent) currentEvent).getModifiers();
+  // Listener on model changes to maintain correct focusability
+  private final ChangeListener enableListener =
+      new ChangeListener() {
+        public void stateChanged(ChangeEvent e) {
+          TristateCheckBox.this.setFocusable(
+              getModel().isEnabled());
         }
-        fireActionPerformed(new ActionEvent(this,
-                ActionEvent.ACTION_PERFORMED, getText(),
-                System.currentTimeMillis(), modifiers));
-    }
-
-    //Convenience cast
-    public TristateButtonModel getTristateModel() {
-        return (TristateButtonModel) super.getModel();
+      };
+
+  public TristateCheckBox(String text) {
+    this(text, null, TristateState.DESELECTED);
+  }
+
+  public TristateCheckBox(String text, Icon icon,
+                          TristateState initial) {
+    super(text, icon);
+
+    //Set default single model
+    setModel(new TristateButtonModel(initial));
+
+    // override action behaviour
+    super.addMouseListener(new MouseAdapter() {
+      public void mousePressed(MouseEvent e) {
+        TristateCheckBox.this.iterateState();
+      }
+    });
+    ActionMap actions = new ActionMapUIResource();
+    actions.put("pressed", new AbstractAction() {
+      public void actionPerformed(ActionEvent e) {
+        TristateCheckBox.this.iterateState();
+      }
+    });
+    actions.put("released", null);
+    SwingUtilities.replaceUIActionMap(this, actions);
+  }
+
+  // Next two methods implement new API by delegation to model
+  public void setIndeterminate() {
+    getTristateModel().setIndeterminate();
+  }
+
+  public boolean isIndeterminate() {
+    return getTristateModel().isIndeterminate();
+  }
+
+  public TristateState getState() {
+    return getTristateModel().getState();
+  }
+
+  //Overrides superclass method
+  public void setModel(ButtonModel newModel) {
+    super.setModel(newModel);
+
+    //Listen for enable changes
+    if (model instanceof TristateButtonModel)
+      model.addChangeListener(enableListener);
+  }
+
+  //Empty override of superclass method
+  public void addMouseListener(MouseListener l) {
+  }
+
+  // Mostly delegates to model
+  private void iterateState() {
+    //Maybe do nothing at all?
+    if (!getModel().isEnabled()) return;
+
+    grabFocus();
+
+    // Iterate state
+    getTristateModel().iterateState();
+
+    // Fire ActionEvent
+    int modifiers = 0;
+    AWTEvent currentEvent = EventQueue.getCurrentEvent();
+    if (currentEvent instanceof InputEvent) {
+      modifiers = ((InputEvent) currentEvent).getModifiers();
+    } else if (currentEvent instanceof ActionEvent) {
+      modifiers = ((ActionEvent) currentEvent).getModifiers();
     }
+    fireActionPerformed(new ActionEvent(this,
+        ActionEvent.ACTION_PERFORMED, getText(),
+        System.currentTimeMillis(), modifiers));
+  }
+
+  //Convenience cast
+  public TristateButtonModel getTristateModel() {
+    return (TristateButtonModel) super.getModel();
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java b/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java
index bc5d5df..37346be 100644
--- a/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java
+++ b/src/main/java/eu/javaspecialists/tjsn/gui/TristateState.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -24,21 +24,21 @@
  * @author Dr Heinz M. Kabutz
  */
 public enum TristateState {
-    SELECTED {
-        public TristateState next() {
-            return INDETERMINATE;
-        }
-    },
-    INDETERMINATE {
-        public TristateState next() {
-            return DESELECTED;
-        }
-    },
-    DESELECTED {
-        public TristateState next() {
-            return SELECTED;
-        }
-    };
+  SELECTED {
+    public TristateState next() {
+      return INDETERMINATE;
+    }
+  },
+  INDETERMINATE {
+    public TristateState next() {
+      return DESELECTED;
+    }
+  },
+  DESELECTED {
+    public TristateState next() {
+      return SELECTED;
+    }
+  };
 
-    public abstract TristateState next();
+  public abstract TristateState next();
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/Fibonacci.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/Fibonacci.java
index 5f672ce..6f210b5 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/Fibonacci.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/Fibonacci.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -26,26 +26,26 @@
  * @author Dr Heinz M. Kabutz
  */
 public abstract class Fibonacci {
-    private final FibonacciCache cache;
+  private final FibonacciCache cache;
 
-    protected Fibonacci(FibonacciCache cache) {
-        this.cache = cache;
-    }
+  protected Fibonacci(FibonacciCache cache) {
+    this.cache = cache;
+  }
 
-    public Fibonacci() {
-        this(null);
-    }
+  public Fibonacci() {
+    this(null);
+  }
 
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (cache == null) return doActualCalculate(n);
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (cache == null) return doActualCalculate(n);
 
-        BigInteger result = cache.get(n);
-        if (result == null) {
-            cache.put(n, result = doActualCalculate(n));
-        }
-        return result;
+    BigInteger result = cache.get(n);
+    if (result == null) {
+      cache.put(n, result = doActualCalculate(n));
     }
+    return result;
+  }
 
-    protected abstract BigInteger doActualCalculate(int n)
-            throws InterruptedException;
+  protected abstract BigInteger doActualCalculate(int n)
+      throws InterruptedException;
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciCache.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciCache.java
index ce68c42..f0fb115 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciCache.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciCache.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -40,48 +40,48 @@
  * @author Dr Heinz M. Kabutz, Joe Bowbeer
  */
 final class FibonacciCache {
-    private final ConcurrentMap<Integer, FutureResult<BigInteger>> cache =
-            new ConcurrentHashMap<>();
+  private final ConcurrentMap<Integer, FutureResult<BigInteger>> cache =
+      new ConcurrentHashMap<>();
 
-    public BigInteger get(int n) throws InterruptedException {
-        //System.out.println("Thread " + Thread.currentThread() + " attempting to get(" + n + ") on FibonacciCache");
-        FutureResult<BigInteger> result = new FutureResult<>();
-        FutureResult<BigInteger> pending = cache.putIfAbsent(n, result);
-        if (pending != null) {
-            //System.out.println("Thread " + Thread.currentThread() + " waiting for pending get(" + n + ") on FibonacciCache");
-            return pending.get();
-        }
-        FutureResult<BigInteger> nMinusOne = cache.get(n - 1);
-        FutureResult<BigInteger> nMinusTwo = cache.get(n - 2);
-        if (isReady(nMinusOne) && isReady(nMinusTwo)) {
-            //System.out.println("Thread " + Thread.currentThread() + " adding two lower values");
-            BigInteger value = nMinusOne.get().add(nMinusTwo.get());
-            put(n, value);
-            return value;
-        }
-        FutureResult<BigInteger> nPlusOne = cache.get(n + 1);
-        FutureResult<BigInteger> nPlusTwo = cache.get(n + 2);
-        if (isReady(nPlusOne) && isReady(nPlusTwo)) {
-            //System.out.println("Thread " + Thread.currentThread() + " adding two higher values");
-            BigInteger value = nPlusTwo.get().subtract(nPlusOne.get());
-            put(n, value);
-            return value;
-        }
-        if (isReady(nPlusOne) && isReady(nMinusOne)) {
-            //System.out.println("Thread " + Thread.currentThread() + " adding two surrounding values");
-            BigInteger value = nPlusOne.get().subtract(nMinusOne.get());
-            put(n, value);
-            return value;
-        }
-        return null;
+  public BigInteger get(int n) throws InterruptedException {
+    //System.out.println("Thread " + Thread.currentThread() + " attempting to get(" + n + ") on FibonacciCache");
+    FutureResult<BigInteger> result = new FutureResult<>();
+    FutureResult<BigInteger> pending = cache.putIfAbsent(n, result);
+    if (pending != null) {
+      //System.out.println("Thread " + Thread.currentThread() + " waiting for pending get(" + n + ") on FibonacciCache");
+      return pending.get();
     }
-
-    private boolean isReady(FutureResult<BigInteger> result) {
-        return result != null && result.isReady();
+    FutureResult<BigInteger> nMinusOne = cache.get(n - 1);
+    FutureResult<BigInteger> nMinusTwo = cache.get(n - 2);
+    if (isReady(nMinusOne) && isReady(nMinusTwo)) {
+      //System.out.println("Thread " + Thread.currentThread() + " adding two lower values");
+      BigInteger value = nMinusOne.get().add(nMinusTwo.get());
+      put(n, value);
+      return value;
     }
-
-    public BigInteger put(int n, BigInteger value) {
-        cache.get(n).set(value);
-        return value;
+    FutureResult<BigInteger> nPlusOne = cache.get(n + 1);
+    FutureResult<BigInteger> nPlusTwo = cache.get(n + 2);
+    if (isReady(nPlusOne) && isReady(nPlusTwo)) {
+      //System.out.println("Thread " + Thread.currentThread() + " adding two higher values");
+      BigInteger value = nPlusTwo.get().subtract(nPlusOne.get());
+      put(n, value);
+      return value;
+    }
+    if (isReady(nPlusOne) && isReady(nMinusOne)) {
+      //System.out.println("Thread " + Thread.currentThread() + " adding two surrounding values");
+      BigInteger value = nPlusOne.get().subtract(nMinusOne.get());
+      put(n, value);
+      return value;
     }
+    return null;
+  }
+
+  private boolean isReady(FutureResult<BigInteger> result) {
+    return result != null && result.isReady();
+  }
+
+  public BigInteger put(int n, BigInteger value) {
+    cache.get(n).set(value);
+    return value;
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaBigInteger.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaBigInteger.java
index e5fe085..2768f3f 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaBigInteger.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaBigInteger.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,29 +29,30 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciFormulaBigInteger extends NonCachingFibonacci {
-    private static final BigDecimal root5 = new BigDecimal("" +
-            "2.23606797749978969640917366873127623544061835961152572427089724" +
-            "5410520925637804899414414408378782274969508176150773783504253267" +
-            "7244470738635863601215334527088667781731918791658112766453226398" +
-            "5658053576135041753378");
-    private static final BigDecimal PHI = root5.add(new BigDecimal(1)).
-            divide(new BigDecimal(2));
-    private static final BigDecimal PSI = root5.subtract(new BigDecimal(1)).
-            divide(new BigDecimal(2));
-    private static final int MAXIMUM_PRECISE_NUMBER = 1000;
+  private static final BigDecimal root5 = new BigDecimal("" +
+      "2.23606797749978969640917366873127623544061835961152572427089724" +
+      "5410520925637804899414414408378782274969508176150773783504253267" +
+      "7244470738635863601215334527088667781731918791658112766453226398" +
+      "5658053576135041753378");
+  private static final BigDecimal PHI = root5.add(new BigDecimal(1)).
+      divide(new BigDecimal(2));
+  private static final BigDecimal PSI = root5.subtract(new BigDecimal(1)).
+      divide(new BigDecimal(2));
+  private static final int MAXIMUM_PRECISE_NUMBER = 1000;
 
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        if (n < 0) throw new IllegalArgumentException();
-        if (n > MAXIMUM_PRECISE_NUMBER) throw new IllegalArgumentException(
-                "Precision loss after " + MAXIMUM_PRECISE_NUMBER);
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    if (n < 0) throw new IllegalArgumentException();
+    if (n > MAXIMUM_PRECISE_NUMBER)
+      throw new IllegalArgumentException(
+          "Precision loss after " + MAXIMUM_PRECISE_NUMBER);
 
-        BigDecimal phiToTheN = PHI.pow(n);
-        if (Thread.interrupted()) throw new InterruptedException();
-        BigDecimal psiToTheN = PSI.pow(n);
-        if (Thread.interrupted()) throw new InterruptedException();
-        BigDecimal phiMinusPsi = phiToTheN.subtract(psiToTheN);
-        BigDecimal result = phiMinusPsi.divide(root5, 0, RoundingMode.UP);
-        return result.toBigInteger();
-    }
+    BigDecimal phiToTheN = PHI.pow(n);
+    if (Thread.interrupted()) throw new InterruptedException();
+    BigDecimal psiToTheN = PSI.pow(n);
+    if (Thread.interrupted()) throw new InterruptedException();
+    BigDecimal phiMinusPsi = phiToTheN.subtract(psiToTheN);
+    BigDecimal result = phiMinusPsi.divide(root5, 0, RoundingMode.UP);
+    return result.toBigInteger();
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaLong.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaLong.java
index ac79f74..2fbda07 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaLong.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciFormulaLong.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -30,20 +30,21 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciFormulaLong extends NonCachingFibonacci {
-    private static final double root5 = Math.sqrt(5);
-    private static final double PHI = (1 + root5) / 2;
-    private static final double PSI = (1 - root5) / 2;
-    private static final int MAXIMUM_PRECISE_NUMBER = 71;
+  private static final double root5 = Math.sqrt(5);
+  private static final double PHI = (1 + root5) / 2;
+  private static final double PSI = (1 - root5) / 2;
+  private static final int MAXIMUM_PRECISE_NUMBER = 71;
 
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        if (n < 0) throw new IllegalArgumentException();
-        if (n > MAXIMUM_PRECISE_NUMBER) throw new IllegalArgumentException(
-                "Precision loss after " + MAXIMUM_PRECISE_NUMBER);
-        return new BigInteger(Long.toString(fibWithFormula(n)));
-    }
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    if (n < 0) throw new IllegalArgumentException();
+    if (n > MAXIMUM_PRECISE_NUMBER)
+      throw new IllegalArgumentException(
+          "Precision loss after " + MAXIMUM_PRECISE_NUMBER);
+    return new BigInteger(Long.toString(fibWithFormula(n)));
+  }
 
-    private static long fibWithFormula(int n) {
-        return (long) ((Math.pow(PHI, n) - Math.pow(PSI, n)) / root5);
-    }
+  private static long fibWithFormula(int n) {
+    return (long) ((Math.pow(PHI, n) - Math.pow(PSI, n)) / root5);
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciIterative.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciIterative.java
index 39e0552..fce2dd1 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciIterative.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciIterative.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,16 +28,16 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciIterative extends NonCachingFibonacci {
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (n < 0) throw new IllegalArgumentException();
-        BigInteger n0 = BigInteger.ZERO;
-        BigInteger n1 = BigInteger.ONE;
-        for (int i = 0; i < n; i++) {
-            if (Thread.interrupted()) throw new InterruptedException();
-            BigInteger temp = n1;
-            n1 = n1.add(n0);
-            n0 = temp;
-        }
-        return n0;
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (n < 0) throw new IllegalArgumentException();
+    BigInteger n0 = BigInteger.ZERO;
+    BigInteger n1 = BigInteger.ONE;
+    for (int i = 0; i < n; i++) {
+      if (Thread.interrupted()) throw new InterruptedException();
+      BigInteger temp = n1;
+      n1 = n1.add(n0);
+      n0 = temp;
     }
+    return n0;
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursive.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursive.java
index a2dd9f6..3bbcc6d 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursive.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursive.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -31,11 +31,11 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciRecursive extends Fibonacci {
-    public BigInteger doActualCalculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        if (n < 0) throw new IllegalArgumentException();
-        if (n == 0) return BigInteger.ZERO;
-        if (n == 1) return BigInteger.ONE;
-        return calculate(n - 1).add(calculate(n - 2));
-    }
+  public BigInteger doActualCalculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    if (n < 0) throw new IllegalArgumentException();
+    if (n == 0) return BigInteger.ZERO;
+    if (n == 1) return BigInteger.ONE;
+    return calculate(n - 1).add(calculate(n - 2));
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveBowbeer.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveBowbeer.java
index 902ba0a..68ca49a 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveBowbeer.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveBowbeer.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -32,65 +32,65 @@
  */
 public class FibonacciRecursiveBowbeer extends Fibonacci {
 
-    private final Map<Integer, BigInteger> values = new HashMap<>();
+  private final Map<Integer, BigInteger> values = new HashMap<>();
 
-    private final Map<BigInteger, BigInteger> squares = new HashMap<>();
+  private final Map<BigInteger, BigInteger> squares = new HashMap<>();
 
-    private final Karatsuba karatsuba;
+  private final Karatsuba karatsuba;
 
-    public FibonacciRecursiveBowbeer(ForkJoinPool pool) {
-        this(new ParallelKaratsuba(pool));
-    }
+  public FibonacciRecursiveBowbeer(ForkJoinPool pool) {
+    this(new ParallelKaratsuba(pool));
+  }
 
-    public FibonacciRecursiveBowbeer() {
-        this(new ForkJoinPool());
-    }
+  public FibonacciRecursiveBowbeer() {
+    this(new ForkJoinPool());
+  }
 
-    public FibonacciRecursiveBowbeer(Karatsuba karatsuba) {
-        this.karatsuba = karatsuba;
-    }
+  public FibonacciRecursiveBowbeer(Karatsuba karatsuba) {
+    this.karatsuba = karatsuba;
+  }
 
-    @Override
-    protected BigInteger doActualCalculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        if (n == 0) {
-            return BigInteger.ZERO;
-        }
-        if (n == 1) {
-            return BigInteger.ONE;
-        }
-        int left = (n + 1) / 2;
-        int right = left - 1;
-        BigInteger fibRight = values.get(right);
-        if (fibRight == null) {
-            fibRight = doActualCalculate(right);
-        }
-        BigInteger fibLeft = values.get(left);
-        if (fibLeft == null) {
-            fibLeft = doActualCalculate(left);
-        }
-        BigInteger result;
-        if ((n & 1) == 0) {
-            // f(2n) = (2 * f(n-1) + f(n)) * f(n)
-            result = multiply(fibLeft, fibLeft.add(fibRight.shiftLeft(1)));
-        } else {
-            // f(2n-1) = f(n-1)^2 + f(n)^2
-            result = square(fibLeft).add(square(fibRight));
-        }
-        values.put(n, result);
-        return result;
+  @Override
+  protected BigInteger doActualCalculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    if (n == 0) {
+      return BigInteger.ZERO;
     }
-
-    protected BigInteger multiply(BigInteger x, BigInteger y) {
-        return karatsuba.multiply(x, y);
+    if (n == 1) {
+      return BigInteger.ONE;
     }
+    int left = (n + 1) / 2;
+    int right = left - 1;
+    BigInteger fibRight = values.get(right);
+    if (fibRight == null) {
+      fibRight = doActualCalculate(right);
+    }
+    BigInteger fibLeft = values.get(left);
+    if (fibLeft == null) {
+      fibLeft = doActualCalculate(left);
+    }
+    BigInteger result;
+    if ((n & 1) == 0) {
+      // f(2n) = (2 * f(n-1) + f(n)) * f(n)
+      result = multiply(fibLeft, fibLeft.add(fibRight.shiftLeft(1)));
+    } else {
+      // f(2n-1) = f(n-1)^2 + f(n)^2
+      result = square(fibLeft).add(square(fibRight));
+    }
+    values.put(n, result);
+    return result;
+  }
+
+  protected BigInteger multiply(BigInteger x, BigInteger y) {
+    return karatsuba.multiply(x, y);
+  }
 
-    protected BigInteger square(BigInteger num) {
-        BigInteger result = squares.get(num);
-        if (result == null) {
-            result = karatsuba.square(num);
-            squares.put(num, result);
-        }
-        return result;
+  protected BigInteger square(BigInteger num) {
+    BigInteger result = squares.get(num);
+    if (result == null) {
+      result = karatsuba.square(num);
+      squares.put(num, result);
     }
+    return result;
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstra.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstra.java
index d9b08bc..1caf637 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstra.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstra.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,29 +27,29 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciRecursiveDijkstra extends Fibonacci {
-    public BigInteger doActualCalculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        if (n == 0) return BigInteger.ZERO;
-        if (n == 1) return BigInteger.ONE;
-        if (n % 2 == 1) {
-            // f(2n-1) = f(n-1)^2 + f(n)^2
-            int left = (n + 1) / 2;
-            int right = (n + 1) / 2 - 1;
-            return square(calculate(left)).add(square(calculate(right)));
-        } else {
-            // f(2n) = (2 * f(n-1) + f(n)) * f(n)
-            int n_ = n / 2;
-            BigInteger fn = calculate(n_);
-            BigInteger fn_1 = calculate(n_ - 1);
-            return (fn_1.add(fn_1).add(fn)).multiply(fn);
-        }
+  public BigInteger doActualCalculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    if (n == 0) return BigInteger.ZERO;
+    if (n == 1) return BigInteger.ONE;
+    if (n % 2 == 1) {
+      // f(2n-1) = f(n-1)^2 + f(n)^2
+      int left = (n + 1) / 2;
+      int right = (n + 1) / 2 - 1;
+      return square(calculate(left)).add(square(calculate(right)));
+    } else {
+      // f(2n) = (2 * f(n-1) + f(n)) * f(n)
+      int n_ = n / 2;
+      BigInteger fn = calculate(n_);
+      BigInteger fn_1 = calculate(n_ - 1);
+      return (fn_1.add(fn_1).add(fn)).multiply(fn);
     }
+  }
 
-    protected BigInteger multiply(BigInteger bi0, BigInteger bi1) {
-        return bi0.multiply(bi1);
-    }
+  protected BigInteger multiply(BigInteger bi0, BigInteger bi1) {
+    return bi0.multiply(bi1);
+  }
 
-    protected BigInteger square(BigInteger num) {
-        return multiply(num, num);
-    }
+  protected BigInteger square(BigInteger num) {
+    return multiply(num, num);
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstraKaratsuba.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstraKaratsuba.java
index cf44d4f..a080427 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstraKaratsuba.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveDijkstraKaratsuba.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -33,10 +33,10 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciRecursiveDijkstraKaratsuba
-        extends FibonacciRecursiveDijkstra {
-    private final Karatsuba karatsuba = new BasicKaratsuba();
+    extends FibonacciRecursiveDijkstra {
+  private final Karatsuba karatsuba = new BasicKaratsuba();
 
-    protected BigInteger multiply(BigInteger bi0, BigInteger bi1) {
-        return karatsuba.multiply(bi0, bi1);
-    }
+  protected BigInteger multiply(BigInteger bi0, BigInteger bi1) {
+    return karatsuba.multiply(bi0, bi1);
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveNonCaching.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveNonCaching.java
index 861321d..5e956ef 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveNonCaching.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveNonCaching.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,11 +28,11 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciRecursiveNonCaching extends NonCachingFibonacci {
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        if (n < 0) throw new IllegalArgumentException();
-        if (n == 0) return BigInteger.ZERO;
-        if (n == 1) return BigInteger.ONE;
-        return calculate(n - 1).add(calculate(n - 2));
-    }
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    if (n < 0) throw new IllegalArgumentException();
+    if (n == 0) return BigInteger.ZERO;
+    if (n == 1) return BigInteger.ONE;
+    return calculate(n - 1).add(calculate(n - 2));
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveParallelDijkstraKaratsuba.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveParallelDijkstraKaratsuba.java
index 228ff1f..dff159f 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveParallelDijkstraKaratsuba.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciRecursiveParallelDijkstraKaratsuba.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -44,81 +44,81 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciRecursiveParallelDijkstraKaratsuba
-        extends NonCachingFibonacci {
-    public static final String SEQUENTIAL_THRESHOLD_PROPERTY_NAME =
-            "eu.javaspecialists.tjsn.math.fibonacci.SequentialThreshold";
-    private final static int SEQUENTIAL_THRESHOLD = Integer.getInteger(
-            SEQUENTIAL_THRESHOLD_PROPERTY_NAME, 10000);
-    private final FibonacciCache cache = new FibonacciCache();
-    private final Fibonacci sequential =
-            new FibonacciRecursiveDijkstraKaratsuba();
-    private final ForkJoinPool pool;
-    private final Karatsuba karatsuba;
+    extends NonCachingFibonacci {
+  public static final String SEQUENTIAL_THRESHOLD_PROPERTY_NAME =
+      "eu.javaspecialists.tjsn.math.fibonacci.SequentialThreshold";
+  private final static int SEQUENTIAL_THRESHOLD = Integer.getInteger(
+      SEQUENTIAL_THRESHOLD_PROPERTY_NAME, 10000);
+  private final FibonacciCache cache = new FibonacciCache();
+  private final Fibonacci sequential =
+      new FibonacciRecursiveDijkstraKaratsuba();
+  private final ForkJoinPool pool;
+  private final Karatsuba karatsuba;
 
-    public FibonacciRecursiveParallelDijkstraKaratsuba(ForkJoinPool pool) {
-        this.pool = pool;
-        karatsuba = new ParallelKaratsuba(pool);
-    }
+  public FibonacciRecursiveParallelDijkstraKaratsuba(ForkJoinPool pool) {
+    this.pool = pool;
+    karatsuba = new ParallelKaratsuba(pool);
+  }
 
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        BigInteger result = pool.invoke(new FibonacciTask(n));
-        if (result == null) throw new InterruptedException();
-        return result;
-    }
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    BigInteger result = pool.invoke(new FibonacciTask(n));
+    if (result == null) throw new InterruptedException();
+    return result;
+  }
 
-    private class FibonacciTask extends RecursiveTask<BigInteger> {
-        private final int n;
-
-        private FibonacciTask(int n) {
-            this.n = n;
-        }
+  private class FibonacciTask extends RecursiveTask<BigInteger> {
+    private final int n;
 
-        protected BigInteger compute() {
-            try {
-                BigInteger result = cache.get(n);
-                if (result != null) {
-                    return result;
-                }
-                //System.out.println("Computing fib(" + n + ")");
+    private FibonacciTask(int n) {
+      this.n = n;
+    }
 
-                if (n < SEQUENTIAL_THRESHOLD) {
-                    result = sequential.calculate(n);
-                } else {
-                    if (n % 2 == 1) {
-                        // f(2n-1) = f(n-1)^2 + f(n)^2
-                        int left = (n + 1) / 2;
-                        int right = (n + 1) / 2 - 1;
-                        FibonacciTask f0 = new FibonacciTask(left);
-                        FibonacciTask f1 = new FibonacciTask(right);
-                        f1.fork();
-                        BigInteger bi0 = f0.invoke();
-                        BigInteger bi1 = f1.join();
-                        if (isCancelled()) return null;
-                        result = square(bi1).add(square(bi0));
-                    } else {
-                        // f(2n) = (2 * f(n-1) + f(n)) * f(n)
-                        int n_ = n / 2;
-                        FibonacciTask f0 = new FibonacciTask(n_);
-                        FibonacciTask f1 = new FibonacciTask(n_ - 1);
-                        f1.fork();
-                        BigInteger bi0 = f0.invoke();
-                        BigInteger bi1 = f1.join();
-                        if (isCancelled()) return null;
-                        result = karatsuba.multiply(bi1.add(bi1).add(bi0), bi0);
-                    }
-                }
-                //System.out.println("Adding result of fib(" + n + ") to cache");
-                cache.put(n, result);
-                return result;
-            } catch (InterruptedException e) {
-                cancel(true);
-                return null;
-            }
+    protected BigInteger compute() {
+      try {
+        BigInteger result = cache.get(n);
+        if (result != null) {
+          return result;
         }
+        //System.out.println("Computing fib(" + n + ")");
 
-        private BigInteger square(BigInteger num) {
-            return karatsuba.multiply(num, num);
+        if (n < SEQUENTIAL_THRESHOLD) {
+          result = sequential.calculate(n);
+        } else {
+          if (n % 2 == 1) {
+            // f(2n-1) = f(n-1)^2 + f(n)^2
+            int left = (n + 1) / 2;
+            int right = (n + 1) / 2 - 1;
+            FibonacciTask f0 = new FibonacciTask(left);
+            FibonacciTask f1 = new FibonacciTask(right);
+            f1.fork();
+            BigInteger bi0 = f0.invoke();
+            BigInteger bi1 = f1.join();
+            if (isCancelled()) return null;
+            result = square(bi1).add(square(bi0));
+          } else {
+            // f(2n) = (2 * f(n-1) + f(n)) * f(n)
+            int n_ = n / 2;
+            FibonacciTask f0 = new FibonacciTask(n_);
+            FibonacciTask f1 = new FibonacciTask(n_ - 1);
+            f1.fork();
+            BigInteger bi0 = f0.invoke();
+            BigInteger bi1 = f1.join();
+            if (isCancelled()) return null;
+            result = karatsuba.multiply(bi1.add(bi1).add(bi0), bi0);
+          }
         }
+        //System.out.println("Adding result of fib(" + n + ") to cache");
+        cache.put(n, result);
+        return result;
+      } catch (InterruptedException e) {
+        cancel(true);
+        return null;
+      }
+    }
+
+    private BigInteger square(BigInteger num) {
+      return karatsuba.multiply(num, num);
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciTakahashi.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciTakahashi.java
index 681cab1..ec4dfd9 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciTakahashi.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/FibonacciTakahashi.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -21,37 +21,37 @@
 import java.math.*;
 
 public class FibonacciTakahashi extends NonCachingFibonacci {
-    private static final BigInteger SIX = new BigInteger("6");
-    private static final BigInteger FIVE = new BigInteger("5");
+  private static final BigInteger SIX = new BigInteger("6");
+  private static final BigInteger FIVE = new BigInteger("5");
 
-    public BigInteger calculate(int n) throws InterruptedException {
-        if (Thread.interrupted()) throw new InterruptedException();
-        BigInteger F = BigInteger.ONE;
-        BigInteger L = BigInteger.ONE;
+  public BigInteger calculate(int n) throws InterruptedException {
+    if (Thread.interrupted()) throw new InterruptedException();
+    BigInteger F = BigInteger.ONE;
+    BigInteger L = BigInteger.ONE;
 
-        int sign = -2;
-        int exp = (int) Math.floor((Math.log(n) / Math.log(2)));
-        int mask = (int) Math.pow(2, exp);
-        for (int i = 0; i < exp - 1; i++) {
-            if (Thread.interrupted()) throw new InterruptedException();
-            mask = mask >> 1;
-            BigInteger F2 = F.pow(2);
-            BigInteger FL2 = F.add(L).pow(2);
-            F = FL2.subtract(F2.multiply(SIX)).shiftRight(1).subtract(
-                    new BigInteger("" + sign));
+    int sign = -2;
+    int exp = (int) Math.floor((Math.log(n) / Math.log(2)));
+    int mask = (int) Math.pow(2, exp);
+    for (int i = 0; i < exp - 1; i++) {
+      if (Thread.interrupted()) throw new InterruptedException();
+      mask = mask >> 1;
+      BigInteger F2 = F.pow(2);
+      BigInteger FL2 = F.add(L).pow(2);
+      F = FL2.subtract(F2.multiply(SIX)).shiftRight(1).subtract(
+          new BigInteger("" + sign));
 
-            if ((n & mask) != 0) {
-                BigInteger temp = FL2.shiftRight(2).add(F2);
-                L = temp.add(F.shiftLeft(1));
-                F = temp;
-            } else
-                L = F2.multiply(FIVE).add(new BigInteger("" + sign));
+      if ((n & mask) != 0) {
+        BigInteger temp = FL2.shiftRight(2).add(F2);
+        L = temp.add(F.shiftLeft(1));
+        F = temp;
+      } else
+        L = F2.multiply(FIVE).add(new BigInteger("" + sign));
 
-            sign = (n & mask) != 0 ? -2 : 2;
-        }
-        if ((n & (mask >> 1)) == 0)
-            return F.multiply(L);
-        else
-            return F.add(L).shiftRight(1).multiply(L).subtract(BigInteger.valueOf(sign >> 1));
+      sign = (n & mask) != 0 ? -2 : 2;
     }
+    if ((n & (mask >> 1)) == 0)
+      return F.multiply(L);
+    else
+      return F.add(L).shiftRight(1).multiply(L).subtract(BigInteger.valueOf(sign >> 1));
+  }
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/NonCachingFibonacci.java b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/NonCachingFibonacci.java
index a6fa20b..ae95c5f 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/NonCachingFibonacci.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/fibonacci/NonCachingFibonacci.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,15 +27,15 @@
  * @author Dr Heinz M. Kabutz
  */
 public abstract class NonCachingFibonacci extends Fibonacci {
-    protected NonCachingFibonacci() {
-        super(null);
-    }
+  protected NonCachingFibonacci() {
+    super(null);
+  }
 
-    public final BigInteger doActualCalculate(int n)
-            throws InterruptedException {
-        throw new UnsupportedOperationException();
-    }
+  public final BigInteger doActualCalculate(int n)
+      throws InterruptedException {
+    throw new UnsupportedOperationException();
+  }
 
-    public abstract BigInteger calculate(int n)
-            throws InterruptedException;
+  public abstract BigInteger calculate(int n)
+      throws InterruptedException;
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/numbers/BasicKaratsuba.java b/src/main/java/eu/javaspecialists/tjsn/math/numbers/BasicKaratsuba.java
index 18ab87a..dcfe539 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/numbers/BasicKaratsuba.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/numbers/BasicKaratsuba.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -54,62 +54,62 @@
  * @author Joe Bowbeer
  */
 public class BasicKaratsuba implements Karatsuba {
-    public static final String THRESHOLD_PROPERTY_NAME =
-            "eu.javaspecialists.tjsn.math.numbers.BasicKaratsubaThreshold";
-    private static final int THRESHOLD = Integer.getInteger(
-            THRESHOLD_PROPERTY_NAME, 1000);
+  public static final String THRESHOLD_PROPERTY_NAME =
+      "eu.javaspecialists.tjsn.math.numbers.BasicKaratsubaThreshold";
+  private static final int THRESHOLD = Integer.getInteger(
+      THRESHOLD_PROPERTY_NAME, 1000);
 
-    public BigInteger multiply(BigInteger x, BigInteger y) {
-        int m = java.lang.Math.min(x.bitLength(), y.bitLength()) / 2;
-        if (m <= THRESHOLD)
-            return x.multiply(y);
+  public BigInteger multiply(BigInteger x, BigInteger y) {
+    int m = java.lang.Math.min(x.bitLength(), y.bitLength()) / 2;
+    if (m <= THRESHOLD)
+      return x.multiply(y);
 
-        // x = x1 * 2^m + x0
-        // y = y1 * 2^m + y0
-        BigInteger[] xs = BigIntegerUtils.split(x, m);
-        BigInteger[] ys = BigIntegerUtils.split(y, m);
+    // x = x1 * 2^m + x0
+    // y = y1 * 2^m + y0
+    BigInteger[] xs = BigIntegerUtils.split(x, m);
+    BigInteger[] ys = BigIntegerUtils.split(y, m);
 
-        // xy = (x1 * 2^m + x0)(y1 * 2^m + y0) = z2 * 2^2m + z1 * 2^m + z0
-        // where:
-        // z2 = x1 * y1
-        // z0 = x0 * y0
-        // z1 = x1 * y0 + x0 * y1 = (x1 + x0)(y1 + y0) - z2 - z0
-        BigInteger z2 = multiply(xs[0], ys[0]);
-        BigInteger z0 = multiply(xs[1], ys[1]);
-        BigInteger z1 = multiply(add(xs), add(ys)).
-                subtract(z2).subtract(z0);
+    // xy = (x1 * 2^m + x0)(y1 * 2^m + y0) = z2 * 2^2m + z1 * 2^m + z0
+    // where:
+    // z2 = x1 * y1
+    // z0 = x0 * y0
+    // z1 = x1 * y0 + x0 * y1 = (x1 + x0)(y1 + y0) - z2 - z0
+    BigInteger z2 = multiply(xs[0], ys[0]);
+    BigInteger z0 = multiply(xs[1], ys[1]);
+    BigInteger z1 = multiply(add(xs), add(ys)).
+        subtract(z2).subtract(z0);
 
-        // result = z2 * 2^2m + z1 * 2^m + z0
-        return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
-    }
+    // result = z2 * 2^2m + z1 * 2^m + z0
+    return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
+  }
 
 
-    /**
-     * Optimizes the square of large numbers using the Karatsuba algorithm.
-     *
-     * @author Joe Bowbeer
-     */
-    public BigInteger square(BigInteger x) {
+  /**
+   * Optimizes the square of large numbers using the Karatsuba algorithm.
+   *
+   * @author Joe Bowbeer
+   */
+  public BigInteger square(BigInteger x) {
 
-        int m = x.bitLength() / 2;
-        if (m <= THRESHOLD * 2) {
-            return x.pow(2);
-        }
+    int m = x.bitLength() / 2;
+    if (m <= THRESHOLD * 2) {
+      return x.pow(2);
+    }
 
-        // x = x1 * 2^m + x0
-        BigInteger[] xs = split(x, m);
+    // x = x1 * 2^m + x0
+    BigInteger[] xs = split(x, m);
 
-        // x^2 = (x1 * 2^m + x0)(x1 * 2^m + x0) = z2 * 2^2m + z1 * 2^m + z0
-        // where:
-        // z2 = x1 * x1
-        // z0 = x0 * x0
-        // z1 = x1 * x0 + x0 * x1 = (x1 + x0)(x1 + x0) - z2 - z0
-        BigInteger z2 = square(xs[0]);
-        BigInteger z0 = square(xs[1]);
-        BigInteger z1 = square(add(xs)).subtract(z2).subtract(z0);
+    // x^2 = (x1 * 2^m + x0)(x1 * 2^m + x0) = z2 * 2^2m + z1 * 2^m + z0
+    // where:
+    // z2 = x1 * x1
+    // z0 = x0 * x0
+    // z1 = x1 * x0 + x0 * x1 = (x1 + x0)(x1 + x0) - z2 - z0
+    BigInteger z2 = square(xs[0]);
+    BigInteger z0 = square(xs[1]);
+    BigInteger z1 = square(add(xs)).subtract(z2).subtract(z0);
 
-        // result = z2 * 2^2m + z1 * 2^m + z0
-        return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
-    }
+    // result = z2 * 2^2m + z1 * 2^m + z0
+    return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
+  }
 
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/numbers/BigIntegerUtils.java b/src/main/java/eu/javaspecialists/tjsn/math/numbers/BigIntegerUtils.java
index 7c4bcb6..5ba7e6c 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/numbers/BigIntegerUtils.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/numbers/BigIntegerUtils.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,17 +27,17 @@
  * @author Dr Heinz M. Kabutz
  */
 class BigIntegerUtils {
-    public static BigInteger add(BigInteger... ints) {
-        BigInteger sum = ints[0];
-        for (int i = 1; i < ints.length; i++) {
-            sum = sum.add(ints[i]);
-        }
-        return sum;
+  public static BigInteger add(BigInteger... ints) {
+    BigInteger sum = ints[0];
+    for (int i = 1; i < ints.length; i++) {
+      sum = sum.add(ints[i]);
     }
+    return sum;
+  }
 
-    public static BigInteger[] split(BigInteger x, int m) {
-        BigInteger left = x.shiftRight(m);
-        BigInteger right = x.subtract(left.shiftLeft(m));
-        return new BigInteger[]{left, right};
-    }
+  public static BigInteger[] split(BigInteger x, int m) {
+    BigInteger left = x.shiftRight(m);
+    BigInteger right = x.subtract(left.shiftLeft(m));
+    return new BigInteger[]{left, right};
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/numbers/Karatsuba.java b/src/main/java/eu/javaspecialists/tjsn/math/numbers/Karatsuba.java
index 819d12f..d75d291 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/numbers/Karatsuba.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/numbers/Karatsuba.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,7 +29,7 @@
  * @author Dr Heinz M. Kabutz
  */
 public interface Karatsuba {
-    BigInteger multiply(BigInteger x, BigInteger y);
+  BigInteger multiply(BigInteger x, BigInteger y);
 
-    BigInteger square(BigInteger x);
+  BigInteger square(BigInteger x);
 }
diff --git a/src/main/java/eu/javaspecialists/tjsn/math/numbers/ParallelKaratsuba.java b/src/main/java/eu/javaspecialists/tjsn/math/numbers/ParallelKaratsuba.java
index 981af0d..2e46cb7 100644
--- a/src/main/java/eu/javaspecialists/tjsn/math/numbers/ParallelKaratsuba.java
+++ b/src/main/java/eu/javaspecialists/tjsn/math/numbers/ParallelKaratsuba.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -37,98 +37,98 @@
  * @author Joe Bowbeer
  */
 public class ParallelKaratsuba implements Karatsuba {
-    public static final String THRESHOLD_PROPERTY_NAME =
-            "eu.javaspecialists.tjsn.math.numbers.ParallelKaratsubaThreshold";
-    private static final int THRESHOLD = Integer.getInteger(
-            THRESHOLD_PROPERTY_NAME, 1000);
-    private final ForkJoinPool pool;
-
-    public ParallelKaratsuba(ForkJoinPool pool) {
-        this.pool = pool;
+  public static final String THRESHOLD_PROPERTY_NAME =
+      "eu.javaspecialists.tjsn.math.numbers.ParallelKaratsubaThreshold";
+  private static final int THRESHOLD = Integer.getInteger(
+      THRESHOLD_PROPERTY_NAME, 1000);
+  private final ForkJoinPool pool;
+
+  public ParallelKaratsuba(ForkJoinPool pool) {
+    this.pool = pool;
+  }
+
+  public BigInteger multiply(BigInteger x, BigInteger y) {
+    return pool.invoke(new MultiplyTask(x, y));
+  }
+
+  public BigInteger square(BigInteger x) {
+    return pool.invoke(new SquareTask(x));
+  }
+
+  private static class MultiplyTask extends RecursiveTask<BigInteger> {
+    private final BigInteger x, y;
+
+    public MultiplyTask(BigInteger x, BigInteger y) {
+      this.x = x;
+      this.y = y;
     }
 
-    public BigInteger multiply(BigInteger x, BigInteger y) {
-        return pool.invoke(new MultiplyTask(x, y));
+    protected BigInteger compute() {
+      int m = (Math.min(x.bitLength(), y.bitLength()) / 2);
+      if (m <= THRESHOLD) {
+        return x.multiply(y);
+      }
+
+      // x = x1 * 2^m + x0
+      // y = y1 * 2^m + y0
+      BigInteger[] xs = split(x, m);
+      BigInteger[] ys = split(y, m);
+
+      // xy = (x1 * 2^m + x0)(y1 * 2^m + y0) = z2 * 2^2m + z1 * 2^m + z0
+      // where:
+      // z2 = x1 * y1
+      // z0 = x0 * y0
+      // z1 = x1 * y0 + x0 * y1 = (x1 + x0)(y1 + y0) - z2 - z0
+      MultiplyTask z2task = new MultiplyTask(xs[0], ys[0]);
+      MultiplyTask z0task = new MultiplyTask(xs[1], ys[1]);
+      MultiplyTask z1task = new MultiplyTask(add(xs), add(ys));
+
+      z0task.fork();
+      z2task.fork();
+      BigInteger z0, z2;
+      BigInteger z1 = z1task.invoke().subtract(
+          z2 = z2task.join()).subtract(z0 = z0task.join());
+
+      // result = z2 * 2^2m + z1 * 2^m + z0
+      return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
     }
+  }
 
-    public BigInteger square(BigInteger x) {
-        return pool.invoke(new SquareTask(x));
-    }
+  private static class SquareTask extends RecursiveTask<BigInteger> {
+    private final BigInteger x;
 
-    private static class MultiplyTask extends RecursiveTask<BigInteger> {
-        private final BigInteger x, y;
-
-        public MultiplyTask(BigInteger x, BigInteger y) {
-            this.x = x;
-            this.y = y;
-        }
-
-        protected BigInteger compute() {
-            int m = (Math.min(x.bitLength(), y.bitLength()) / 2);
-            if (m <= THRESHOLD) {
-                return x.multiply(y);
-            }
-
-            // x = x1 * 2^m + x0
-            // y = y1 * 2^m + y0
-            BigInteger[] xs = split(x, m);
-            BigInteger[] ys = split(y, m);
-
-            // xy = (x1 * 2^m + x0)(y1 * 2^m + y0) = z2 * 2^2m + z1 * 2^m + z0
-            // where:
-            // z2 = x1 * y1
-            // z0 = x0 * y0
-            // z1 = x1 * y0 + x0 * y1 = (x1 + x0)(y1 + y0) - z2 - z0
-            MultiplyTask z2task = new MultiplyTask(xs[0], ys[0]);
-            MultiplyTask z0task = new MultiplyTask(xs[1], ys[1]);
-            MultiplyTask z1task = new MultiplyTask(add(xs), add(ys));
-
-            z0task.fork();
-            z2task.fork();
-            BigInteger z0, z2;
-            BigInteger z1 = z1task.invoke().subtract(
-                    z2 = z2task.join()).subtract(z0 = z0task.join());
-
-            // result = z2 * 2^2m + z1 * 2^m + z0
-            return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
-        }
+    public SquareTask(BigInteger x) {
+      this.x = x;
     }
 
-    private static class SquareTask extends RecursiveTask<BigInteger> {
-        private final BigInteger x;
-
-        public SquareTask(BigInteger x) {
-            this.x = x;
-        }
-
-        @Override
-        protected BigInteger compute() {
-
-            int m = x.bitLength() / 2;
-            if (m <= THRESHOLD * 2) {
-                return x.pow(2);
-            }
-
-            // x = x1 * 2^m + x0
-            BigInteger[] xs = split(x, m);
-
-            // x^2 = (x1 * 2^m + x0)(x1 * 2^m + x0) = z2 * 2^2m + z1 * 2^m + z0
-            // where:
-            // z2 = x1 * x1
-            // z0 = x0 * x0
-            // z1 = x1 * x0 + x0 * x1 = (x1 + x0)(x1 + x0) - z2 - z0
-            SquareTask z2task = new SquareTask(xs[0]);
-            SquareTask z0task = new SquareTask(xs[1]);
-            SquareTask z1task = new SquareTask(add(xs));
-
-            z0task.fork();
-            z2task.fork();
-            BigInteger z0, z2;
-            BigInteger z1 = z1task.invoke().subtract(
-                    z2 = z2task.join()).subtract(z0 = z0task.join());
-
-            // result = z2 * 2^2m + z1 * 2^m + z0
-            return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
-        }
+    @Override
+    protected BigInteger compute() {
+
+      int m = x.bitLength() / 2;
+      if (m <= THRESHOLD * 2) {
+        return x.pow(2);
+      }
+
+      // x = x1 * 2^m + x0
+      BigInteger[] xs = split(x, m);
+
+      // x^2 = (x1 * 2^m + x0)(x1 * 2^m + x0) = z2 * 2^2m + z1 * 2^m + z0
+      // where:
+      // z2 = x1 * x1
+      // z0 = x0 * x0
+      // z1 = x1 * x0 + x0 * x1 = (x1 + x0)(x1 + x0) - z2 - z0
+      SquareTask z2task = new SquareTask(xs[0]);
+      SquareTask z0task = new SquareTask(xs[1]);
+      SquareTask z1task = new SquareTask(add(xs));
+
+      z0task.fork();
+      z2task.fork();
+      BigInteger z0, z2;
+      BigInteger z1 = z1task.invoke().subtract(
+          z2 = z2task.join()).subtract(z0 = z0task.join());
+
+      // result = z2 * 2^2m + z1 * 2^m + z0
+      return z2.shiftLeft(2 * m).add(z1.shiftLeft(m)).add(z0);
     }
+  }
 }
\ No newline at end of file
diff --git a/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java b/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java
new file mode 100644
index 0000000..7353962
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/memory/MemoryTestBench.java
@@ -0,0 +1,64 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.memory;
+
+/**
+ * From newsletter 193
+ * (http://www.javaspecialists.eu/archive/Issue193.html).  Used
+ * to estimate memory usage by objects.
+ *
+ * @see eu.javaspecialists.tjsn.examples.issue193.MemoryUsage
+ */
+public class MemoryTestBench {
+  public long calculateMemoryUsage(ObjectFactory factory) {
+    Object handle = factory.makeObject();
+    long memory = usedMemory();
+    handle = null;
+    lotsOfGC();
+    memory = usedMemory();
+    handle = factory.makeObject();
+    lotsOfGC();
+    return usedMemory() - memory;
+  }
+
+  private long usedMemory() {
+    return Runtime.getRuntime().totalMemory() -
+        Runtime.getRuntime().freeMemory();
+  }
+
+  private void lotsOfGC() {
+    for (int i = 0; i < 20; i++) {
+      System.gc();
+      try {
+        Thread.sleep(100);
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
+    }
+  }
+
+  public void showMemoryUsage(ObjectFactory factory) {
+    long mem = calculateMemoryUsage(factory);
+    System.out.println(
+        factory.getClass().getSimpleName() + " produced " +
+            factory.makeObject().getClass().getSimpleName() +
+            " which took " + mem + " bytes");
+  }
+}
+
diff --git a/src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java b/src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java
new file mode 100644
index 0000000..50d97b7
--- /dev/null
+++ b/src/main/java/eu/javaspecialists/tjsn/memory/ObjectFactory.java
@@ -0,0 +1,23 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.memory;
+
+public interface ObjectFactory {
+  Object makeObject();
+}
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/AutoLockTest.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/AutoLockTest.java
new file mode 100644
index 0000000..74c1a0e
--- /dev/null
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/AutoLockTest.java
@@ -0,0 +1,90 @@
+/*
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
+ *
+ * See the NOTICE file distributed with this work for additional
+ * information regarding copyright ownership.  Heinz Max Kabutz licenses
+ * this file to you under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License. You may
+ * obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package eu.javaspecialists.tjsn.concurrency;
+
+import org.junit.*;
+
+import java.util.concurrent.*;
+import java.util.concurrent.locks.*;
+
+import static org.junit.Assert.*;
+
+public class AutoLockTest {
+  @Test
+  public void testSimpleLocking() {
+    ReentrantLock lock = new ReentrantLock();
+    assertFalse(lock.isHeldByCurrentThread());
+    try (AutoLock al = AutoLock.lock(lock)) {
+      assertTrue(lock.isHeldByCurrentThread());
+    }
+    assertFalse(lock.isHeldByCurrentThread());
+  }
+
+  @Test
+  public void testSimpleLockingWithInterrupt() throws InterruptedException {
+    ReentrantLock lock = new ReentrantLock();
+    assertFalse(lock.isHeldByCurrentThread());
+    try (AutoLock al = AutoLock.lockInterruptibly(lock)) {
+      assertTrue(lock.isHeldByCurrentThread());
+    }
+    assertFalse(lock.isHeldByCurrentThread());
+  }
+
+  @Test
+  public void testLockingWithException() {
+    ReentrantLock lock = new ReentrantLock();
+    assertFalse(lock.isHeldByCurrentThread());
+    try {
+      try (AutoLock al = AutoLock.lock(lock)) {
+        assertTrue(lock.isHeldByCurrentThread());
+        throw new OutOfMemoryError();
+      }
+    } catch (Throwable t) {
+      assertFalse(lock.isHeldByCurrentThread());
+    }
+  }
+
+  @Test
+  public void testLockingWithInterrupt() throws InterruptedException {
+    final ReentrantLock lock = new ReentrantLock();
+    final BlockingQueue<Boolean> result = new LinkedBlockingQueue<>();
+    assertFalse(lock.isHeldByCurrentThread());
+    try (AutoLock al = AutoLock.lock(lock)) {
+      assertTrue(lock.isHeldByCurrentThread());
+      ExecutorService pool = Executors.newFixedThreadPool(1);
+      Future<Void> future = pool.submit(new Callable<Void>() {
+        public Void call() {
+          try (AutoLock al = AutoLock.lockInterruptibly(lock)) {
+            assertTrue(lock.isHeldByCurrentThread());
+          } catch (InterruptedException e) {
+            assertFalse(lock.isHeldByCurrentThread());
+            result.add(Boolean.TRUE);
+          } finally {
+            assertFalse(lock.isHeldByCurrentThread());
+          }
+          return null;
+        }
+      });
+      Thread.sleep(10);
+      future.cancel(true);
+      assertTrue(result.poll(100, TimeUnit.MILLISECONDS));
+    }
+    assertFalse(lock.isHeldByCurrentThread());
+  }
+}
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EmptyInterlockTask.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EmptyInterlockTask.java
index a09fbb1..56e347f 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EmptyInterlockTask.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EmptyInterlockTask.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,27 +28,27 @@
  * @author Dr Heinz M. Kabutz
  */
 public class EmptyInterlockTask implements
-        InterlockTask<Integer> {
-    public final int upto;
-    private volatile int count;
+    InterlockTask<Integer> {
+  public final int upto;
+  private volatile int count;
 
-    public EmptyInterlockTask(int upto) {
-        this.upto = upto;
-    }
+  public EmptyInterlockTask(int upto) {
+    this.upto = upto;
+  }
 
-    public boolean isDone() {
-        return count >= upto;
-    }
+  public boolean isDone() {
+    return count >= upto;
+  }
 
-    public void call() {
-        count++;
-    }
+  public void call() {
+    count++;
+  }
 
-    public Integer get() {
-        return count;
-    }
+  public Integer get() {
+    return count;
+  }
 
-    public void reset() {
-        count = 0;
-    }
+  public void reset() {
+    count = 0;
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddCorrectnessTest.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddCorrectnessTest.java
index 6a16a7b..7d8fa51 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddCorrectnessTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddCorrectnessTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -34,63 +34,63 @@
  */
 public class EvenOddCorrectnessTest {
 
-    private final Interlocker[] executors = {
-            new LockFreeInterlocker(),
-            new AtomicInterlocker(),
-            new ConditionInterlocker(),
-            new WaitNotifyInterlocker(),
-            new SemaphoreInterlocker(),
-    };
+  private final Interlocker[] executors = {
+      new LockFreeInterlocker(),
+      new AtomicInterlocker(),
+      new ConditionInterlocker(),
+      new WaitNotifyInterlocker(),
+      new SemaphoreInterlocker(),
+  };
 
-    @Test
-    public void testInterlockedPrinting() throws InterruptedException {
-        for (Interlocker executor : executors) {
-            check(5, executor, new ThreadPrintingTask(5));
-        }
+  @Test
+  public void testInterlockedPrinting() throws InterruptedException {
+    for (Interlocker executor : executors) {
+      check(5, executor, new ThreadPrintingTask(5));
     }
+  }
 
-    @Test
-    public void testDifferentNumbersOfInterlocking() throws InterruptedException {
-        int[] uptos = {
-                0, -1, Integer.MIN_VALUE, 1, 2, 3, 4, 5, 11, 12, 1000,
-        };
-        for (int upto : uptos) {
-            for (Interlocker executor : executors) {
-                check(upto, executor, new EmptyInterlockTask(upto));
-            }
-        }
+  @Test
+  public void testDifferentNumbersOfInterlocking() throws InterruptedException {
+    int[] uptos = {
+        0, -1, Integer.MIN_VALUE, 1, 2, 3, 4, 5, 11, 12, 1000,
+    };
+    for (int upto : uptos) {
+      for (Interlocker executor : executors) {
+        check(upto, executor, new EmptyInterlockTask(upto));
+      }
     }
+  }
 
-    @Test
-    public void testInterlockingCalls() throws InterruptedException {
-        int upto = 1000;
-        for (Interlocker executor : executors) {
-            InterlockTask<VerifyResult> task = new InterleavedNumberTestingStrategy(upto);
-            System.out.printf("Testing %s(%d) with %s%n",
-                    task.getClass().getSimpleName(), upto,
-                    executor.getClass().getSimpleName());
-            VerifyResult result = executor.execute(task);
-            assertTrue(result.isSuccess());
-        }
+  @Test
+  public void testInterlockingCalls() throws InterruptedException {
+    int upto = 1000;
+    for (Interlocker executor : executors) {
+      InterlockTask<VerifyResult> task = new InterleavedNumberTestingStrategy(upto);
+      System.out.printf("Testing %s(%d) with %s%n",
+          task.getClass().getSimpleName(), upto,
+          executor.getClass().getSimpleName());
+      VerifyResult result = executor.execute(task);
+      assertTrue(result.isSuccess());
     }
+  }
 
-    @Test
-    public void testForRaceConditionsWithSleep() throws InterruptedException {
-        ThreadLocalRandom rand = ThreadLocalRandom.current();
-        for (int i = 0; i < 4; i++) {
-            int upto = rand.nextInt(10) + 40;
-            for (Interlocker executor : executors) {
-                check(upto, executor, new RaceConditionTestingStrategy(upto));
-            }
-        }
+  @Test
+  public void testForRaceConditionsWithSleep() throws InterruptedException {
+    ThreadLocalRandom rand = ThreadLocalRandom.current();
+    for (int i = 0; i < 4; i++) {
+      int upto = rand.nextInt(10) + 40;
+      for (Interlocker executor : executors) {
+        check(upto, executor, new RaceConditionTestingStrategy(upto));
+      }
     }
+  }
 
-    private void check(int upto, Interlocker executor, InterlockTask<Integer> task) throws InterruptedException {
-        System.out.printf("Testing %s(%d) with %s%n",
-                task.getClass().getSimpleName(), upto,
-                executor.getClass().getSimpleName());
-        executor.execute(task);
-        int result = task.get();
-        assertEquals(Math.max(0, upto), result);
-    }
+  private void check(int upto, Interlocker executor, InterlockTask<Integer> task) throws InterruptedException {
+    System.out.printf("Testing %s(%d) with %s%n",
+        task.getClass().getSimpleName(), upto,
+        executor.getClass().getSimpleName());
+    executor.execute(task);
+    int result = task.get();
+    assertEquals(Math.max(0, upto), result);
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddPerformanceTest.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddPerformanceTest.java
index aceba5a..03054f9 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddPerformanceTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/EvenOddPerformanceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -35,69 +35,69 @@
  */
 public class EvenOddPerformanceTest {
 
-    private final Interlocker[] executors = {
-            new LockFreeInterlocker(),
-            new AtomicInterlocker(),
-            new ConditionInterlocker(),
-            new WaitNotifyInterlocker(),
-            new SemaphoreInterlocker(),
-    };
+  private final Interlocker[] executors = {
+      new LockFreeInterlocker(),
+      new AtomicInterlocker(),
+      new ConditionInterlocker(),
+      new WaitNotifyInterlocker(),
+      new SemaphoreInterlocker(),
+  };
 
-    @Test
-    public void testFastInterlocking() throws InterruptedException {
-        // warm-up
-        raceExecutors();
-        raceExecutors();
-        // real race
-        List<InterlockerResult> results = raceExecutors();
+  @Test
+  public void testFastInterlocking() throws InterruptedException {
+    // warm-up
+    raceExecutors();
+    raceExecutors();
+    // real race
+    List<InterlockerResult> results = raceExecutors();
 
-        for (InterlockerResult result : results) {
-            System.out.println(result.interlockerClass.getSimpleName() + " in " + result.time + "ms");
-        }
-
-        checkLockFreeAreFastest(results);
+    for (InterlockerResult result : results) {
+      System.out.println(result.interlockerClass.getSimpleName() + " in " + result.time + "ms");
     }
 
-    private List<InterlockerResult> raceExecutors() throws InterruptedException {
-        List<InterlockerResult> results = new ArrayList<>(executors.length);
-        for (Interlocker executor : executors) {
-            InterlockTask<?> task = new EmptyInterlockTask(100 * 1000);
-            long time = System.currentTimeMillis();
-            executor.execute(task);
-            time = System.currentTimeMillis() - time;
-            results.add(new InterlockerResult(executor, time));
-        }
-        Collections.sort(results);
-        return results;
-    }
+    checkLockFreeAreFastest(results);
+  }
 
-    private void checkLockFreeAreFastest(List<InterlockerResult> results) {
-        Iterator<InterlockerResult> it = results.iterator();
-        assertTrue(it.next().isLockFree());
-        assertTrue(it.next().isLockFree());
-        assertFalse(it.next().isLockFree());
-        assertFalse(it.next().isLockFree());
-        assertFalse(it.next().isLockFree());
-        assertFalse(it.hasNext());
+  private List<InterlockerResult> raceExecutors() throws InterruptedException {
+    List<InterlockerResult> results = new ArrayList<>(executors.length);
+    for (Interlocker executor : executors) {
+      InterlockTask<?> task = new EmptyInterlockTask(100 * 1000);
+      long time = System.currentTimeMillis();
+      executor.execute(task);
+      time = System.currentTimeMillis() - time;
+      results.add(new InterlockerResult(executor, time));
     }
+    Collections.sort(results);
+    return results;
+  }
 
-    private static class InterlockerResult implements Comparable<InterlockerResult> {
-        private final Class<? extends Interlocker> interlockerClass;
-        private final long time;
+  private void checkLockFreeAreFastest(List<InterlockerResult> results) {
+    Iterator<InterlockerResult> it = results.iterator();
+    assertTrue(it.next().isLockFree());
+    assertTrue(it.next().isLockFree());
+    assertFalse(it.next().isLockFree());
+    assertFalse(it.next().isLockFree());
+    assertFalse(it.next().isLockFree());
+    assertFalse(it.hasNext());
+  }
 
-        private InterlockerResult(Interlocker interlocker, long time) {
-            this.interlockerClass = interlocker.getClass();
-            this.time = time;
-        }
+  private static class InterlockerResult implements Comparable<InterlockerResult> {
+    private final Class<? extends Interlocker> interlockerClass;
+    private final long time;
 
-        @Override
-        public int compareTo(InterlockerResult o) {
-            return Long.compare(time, o.time);
-        }
+    private InterlockerResult(Interlocker interlocker, long time) {
+      this.interlockerClass = interlocker.getClass();
+      this.time = time;
+    }
+
+    @Override
+    public int compareTo(InterlockerResult o) {
+      return Long.compare(time, o.time);
+    }
 
-        private boolean isLockFree() {
-            return interlockerClass == AtomicInterlocker.class ||
-                    interlockerClass == LockFreeInterlocker.class;
-        }
+    private boolean isLockFree() {
+      return interlockerClass == AtomicInterlocker.class ||
+          interlockerClass == LockFreeInterlocker.class;
     }
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterleavedNumberTestingStrategy.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterleavedNumberTestingStrategy.java
index 21b4fc7..adc390d 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterleavedNumberTestingStrategy.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/InterleavedNumberTestingStrategy.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -30,52 +30,52 @@
  * @author Dr Heinz M. Kabutz
  */
 public class InterleavedNumberTestingStrategy implements
-        InterlockTask<VerifyResult> {
-    public final int upto;
-    private final Map<Integer, Thread> numbers =
-            new LinkedHashMap<Integer, Thread>();
-    private final AtomicInteger count = new AtomicInteger(0);
+    InterlockTask<VerifyResult> {
+  public final int upto;
+  private final Map<Integer, Thread> numbers =
+      new LinkedHashMap<Integer, Thread>();
+  private final AtomicInteger count = new AtomicInteger(0);
 
-    public InterleavedNumberTestingStrategy(int upto) {
-        this.upto = upto;
-    }
+  public InterleavedNumberTestingStrategy(int upto) {
+    this.upto = upto;
+  }
 
-    public boolean isDone() {
-        return count.get() >= upto;
-    }
+  public boolean isDone() {
+    return count.get() >= upto;
+  }
 
-    public void call() {
-        int next = count.getAndIncrement();
-        numbers.put(next, Thread.currentThread());
-    }
+  public void call() {
+    int next = count.getAndIncrement();
+    numbers.put(next, Thread.currentThread());
+  }
 
-    public VerifyResult get() {
-        if (numbers.size() < upto) {
-            return new VerifyResult("Only " + numbers.size() +
-                    " numbers were entered");
-        }
-        Object previous = null;
-        int i = 0;
-        for (Map.Entry<Integer, Thread> entry : numbers.entrySet()) {
-            if (i != entry.getKey()) {
-                return new VerifyResult("numbers out of sequence");
-            }
-            if (entry.getValue() == previous) {
-                return new VerifyResult("Did not alternate threads");
-            }
-            previous = entry.getValue();
-            i++;
-        }
-        Set<Thread> values = new HashSet<Thread>(numbers.values());
-        if (values.size() != 2) {
-            return new VerifyResult(
-                    "More than two threads were inserting values");
-        }
-        return new VerifyResult();
+  public VerifyResult get() {
+    if (numbers.size() < upto) {
+      return new VerifyResult("Only " + numbers.size() +
+          " numbers were entered");
     }
-
-    public void reset() {
-        numbers.clear();
-        count.set(0);
+    Object previous = null;
+    int i = 0;
+    for (Map.Entry<Integer, Thread> entry : numbers.entrySet()) {
+      if (i != entry.getKey()) {
+        return new VerifyResult("numbers out of sequence");
+      }
+      if (entry.getValue() == previous) {
+        return new VerifyResult("Did not alternate threads");
+      }
+      previous = entry.getValue();
+      i++;
+    }
+    Set<Thread> values = new HashSet<Thread>(numbers.values());
+    if (values.size() != 2) {
+      return new VerifyResult(
+          "More than two threads were inserting values");
     }
+    return new VerifyResult();
+  }
+
+  public void reset() {
+    numbers.clear();
+    count.set(0);
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/RaceConditionTestingStrategy.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/RaceConditionTestingStrategy.java
index d63daf6..c536c61 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/RaceConditionTestingStrategy.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/RaceConditionTestingStrategy.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,36 +27,36 @@
  * @author Dr Heinz M. Kabutz
  */
 public class RaceConditionTestingStrategy implements InterlockTask<Integer> {
-    private final int upto;
-    private volatile int count;
-
-    public RaceConditionTestingStrategy(int upto) {
-        this.upto = upto;
+  private final int upto;
+  private volatile int count;
+
+  public RaceConditionTestingStrategy(int upto) {
+    this.upto = upto;
+  }
+
+  public boolean isDone() {
+    return count >= upto;
+  }
+
+  public void call() {
+    int temp = count + 1;
+    sleepQuietly();
+    count = temp;
+  }
+
+  private void sleepQuietly() {
+    try {
+      Thread.sleep(10);
+    } catch (InterruptedException e) {
+      Thread.currentThread().interrupt();
     }
+  }
 
-    public boolean isDone() {
-        return count >= upto;
-    }
+  public Integer get() {
+    return count;
+  }
 
-    public void call() {
-        int temp = count + 1;
-        sleepQuietly();
-        count = temp;
-    }
-
-    private void sleepQuietly() {
-        try {
-            Thread.sleep(10);
-        } catch (InterruptedException e) {
-            Thread.currentThread().interrupt();
-        }
-    }
-
-    public Integer get() {
-        return count;
-    }
-
-    public void reset() {
-        count = 0;
-    }
+  public void reset() {
+    count = 0;
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/ThreadPrintingTask.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/ThreadPrintingTask.java
index e8efc60..16ae467 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/ThreadPrintingTask.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/ThreadPrintingTask.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -29,27 +29,27 @@
  * @author Dr Heinz M. Kabutz
  */
 public class ThreadPrintingTask implements InterlockTask<Integer> {
-    private final int upto;
-    private AtomicInteger row = new AtomicInteger(0);
+  private final int upto;
+  private AtomicInteger row = new AtomicInteger(0);
 
-    public ThreadPrintingTask(int upto) {
-        this.upto = upto;
-    }
+  public ThreadPrintingTask(int upto) {
+    this.upto = upto;
+  }
 
-    public boolean isDone() {
-        return row.get() >= upto;
-    }
+  public boolean isDone() {
+    return row.get() >= upto;
+  }
 
-    public void call() {
-        System.out.println(Thread.currentThread().getName());
-        row.incrementAndGet();
-    }
+  public void call() {
+    System.out.println(Thread.currentThread().getName());
+    row.incrementAndGet();
+  }
 
-    public Integer get() {
-        return upto;
-    }
+  public Integer get() {
+    return upto;
+  }
 
-    public void reset() {
-        row.set(0);
-    }
+  public void reset() {
+    row.set(0);
+  }
 }
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/VerifyResult.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/VerifyResult.java
index 86bdb4e..a88925a 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/VerifyResult.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/interlocker/VerifyResult.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -27,31 +27,31 @@
  * @author Dr Heinz M. Kabutz
  */
 public class VerifyResult {
-    private final boolean success;
-    private final String failReason;
+  private final boolean success;
+  private final String failReason;
 
-    private VerifyResult(boolean success, String failReason) {
-        this.success = success;
-        this.failReason = failReason;
-    }
+  private VerifyResult(boolean success, String failReason) {
+    this.success = success;
+    this.failReason = failReason;
+  }
 
-    public VerifyResult(String failReason) {
-        this(false, failReason);
-    }
+  public VerifyResult(String failReason) {
+    this(false, failReason);
+  }
 
-    public VerifyResult() {
-        this(true, null);
-    }
+  public VerifyResult() {
+    this(true, null);
+  }
 
-    public boolean isSuccess() {
-        return success;
-    }
+  public boolean isSuccess() {
+    return success;
+  }
 
-    public String getFailReason() {
-        return failReason;
-    }
+  public String getFailReason() {
+    return failReason;
+  }
 
-    public String toString() {
-        return success ? "Success" : "Failure - " + failReason;
-    }
+  public String toString() {
+    return success ? "Success" : "Failure - " + failReason;
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorServiceTest.java b/src/test/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorServiceTest.java
index 735da04..e3c29f3 100644
--- a/src/test/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorServiceTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/concurrency/stripedexecutor/StripedExecutorServiceTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -30,283 +30,283 @@
  * @author Heinz Kabutz
  */
 public class StripedExecutorServiceTest {
-    @Before
-    public void initialize() {
-        TestRunnable.outOfSequence =
-                TestUnstripedRunnable.outOfSequence =
-                        TestFastRunnable.outOfSequence = false;
+  @Before
+  public void initialize() {
+    TestRunnable.outOfSequence =
+        TestUnstripedRunnable.outOfSequence =
+            TestFastRunnable.outOfSequence = false;
+  }
+
+  @Test
+  public void testSingleStripeRunnable() throws InterruptedException {
+    ExecutorService pool = new StripedExecutorService();
+    Object stripe = new Object();
+    AtomicInteger actual = new AtomicInteger(0);
+    for (int i = 0; i < 100; i++) {
+      pool.submit(new TestRunnable(stripe, actual, i));
     }
-
-    @Test
-    public void testSingleStripeRunnable() throws InterruptedException {
+    assertFalse(pool.isTerminated());
+    assertFalse(pool.isShutdown());
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.HOURS));
+    assertFalse("Expected no out-of-sequence runnables to execute",
+        TestRunnable.outOfSequence);
+    assertTrue(pool.isTerminated());
+  }
+
+  @Test
+  public void testShutdown() throws InterruptedException {
+    ThreadGroup group = new ThreadGroup("stripetestgroup");
+    Thread starter = new Thread(group, "starter") {
+      public void run() {
         ExecutorService pool = new StripedExecutorService();
         Object stripe = new Object();
         AtomicInteger actual = new AtomicInteger(0);
         for (int i = 0; i < 100; i++) {
-            pool.submit(new TestRunnable(stripe, actual, i));
+          pool.submit(new TestRunnable(stripe, actual, i));
         }
-        assertFalse(pool.isTerminated());
-        assertFalse(pool.isShutdown());
         pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.HOURS));
-        assertFalse("Expected no out-of-sequence runnables to execute",
-                TestRunnable.outOfSequence);
-        assertTrue(pool.isTerminated());
+      }
+    };
+    starter.start();
+    starter.join();
+
+    for (int i = 0; i < 100; i++) {
+      if (group.activeCount() == 0) return;
+      Thread.sleep(100);
     }
 
-    @Test
-    public void testShutdown() throws InterruptedException {
-        ThreadGroup group = new ThreadGroup("stripetestgroup");
-        Thread starter = new Thread(group, "starter") {
-            public void run() {
-                ExecutorService pool = new StripedExecutorService();
-                Object stripe = new Object();
-                AtomicInteger actual = new AtomicInteger(0);
-                for (int i = 0; i < 100; i++) {
-                    pool.submit(new TestRunnable(stripe, actual, i));
-                }
-                pool.shutdown();
-            }
-        };
-        starter.start();
-        starter.join();
-
-        for (int i = 0; i < 100; i++) {
-            if (group.activeCount() == 0) return;
-            Thread.sleep(100);
-        }
+    assertEquals(0, group.activeCount());
+  }
 
-        assertEquals(0, group.activeCount());
+  @Test
+  public void testShutdownNow() throws InterruptedException {
+    ExecutorService pool = new StripedExecutorService();
+    Object stripe = new Object();
+    AtomicInteger actual = new AtomicInteger(0);
+    for (int i = 0; i < 100; i++) {
+      pool.submit(new TestRunnable(stripe, actual, i));
     }
+    Thread.sleep(500);
+    assertFalse(pool.isTerminated());
+    Collection<Runnable> unfinishedJobs = pool.shutdownNow();
 
-    @Test
-    public void testShutdownNow() throws InterruptedException {
-        ExecutorService pool = new StripedExecutorService();
-        Object stripe = new Object();
-        AtomicInteger actual = new AtomicInteger(0);
-        for (int i = 0; i < 100; i++) {
-            pool.submit(new TestRunnable(stripe, actual, i));
-        }
-        Thread.sleep(500);
-        assertFalse(pool.isTerminated());
-        Collection<Runnable> unfinishedJobs = pool.shutdownNow();
+    assertTrue(pool.isShutdown());
+    assertTrue(pool.awaitTermination(1, TimeUnit.MINUTES));
+    assertTrue(pool.isTerminated());
 
-        assertTrue(pool.isShutdown());
-        assertTrue(pool.awaitTermination(1, TimeUnit.MINUTES));
-        assertTrue(pool.isTerminated());
+    assertTrue(unfinishedJobs.size() > 0);
 
-        assertTrue(unfinishedJobs.size() > 0);
+    assertEquals(100, unfinishedJobs.size() + actual.intValue());
+  }
 
-        assertEquals(100, unfinishedJobs.size() + actual.intValue());
-    }
+  @Test
+  public void testSingleStripeCallableWithCompletionService() throws InterruptedException, ExecutionException {
+    ExecutorService pool = new StripedExecutorService();
+    final CompletionService<Integer> cs = new ExecutorCompletionService<>(
+        pool
+    );
 
-    @Test
-    public void testSingleStripeCallableWithCompletionService() throws InterruptedException, ExecutionException {
-        ExecutorService pool = new StripedExecutorService();
-        final CompletionService<Integer> cs = new ExecutorCompletionService<>(
-                pool
-        );
-
-        Thread testSubmitter = new Thread("TestSubmitter") {
-            public void run() {
-                Object stripe = new Object();
-                for (int i = 0; i < 50; i++) {
-                    cs.submit(new TestCallable(stripe, i));
-                }
-                try {
-                    Thread.sleep(2000);
-                } catch (InterruptedException e) {
-                    interrupt();
-                }
-                for (int i = 50; i < 100; i++) {
-                    cs.submit(new TestCallable(stripe, i));
-                }
-            }
-        };
-        testSubmitter.start();
-
-        for (int i = 0; i < 100; i++) {
-            int actual = cs.take().get().intValue();
-            System.out.println("Retrieved " + actual);
-            assertEquals(i, actual);
+    Thread testSubmitter = new Thread("TestSubmitter") {
+      public void run() {
+        Object stripe = new Object();
+        for (int i = 0; i < 50; i++) {
+          cs.submit(new TestCallable(stripe, i));
         }
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.HOURS));
-        testSubmitter.join();
-    }
-
-    @Test
-    public void testUnstripedRunnable() throws InterruptedException {
-        ExecutorService pool = new StripedExecutorService();
-        AtomicInteger actual = new AtomicInteger(0);
-        for (int i = 0; i < 100; i++) {
-            pool.submit(new TestUnstripedRunnable(actual, i));
+        try {
+          Thread.sleep(2000);
+        } catch (InterruptedException e) {
+          interrupt();
         }
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.HOURS));
-
-        assertTrue("Expected at least some out-of-sequence runnables to execute",
-                TestUnstripedRunnable.outOfSequence);
+        for (int i = 50; i < 100; i++) {
+          cs.submit(new TestCallable(stripe, i));
+        }
+      }
+    };
+    testSubmitter.start();
+
+    for (int i = 0; i < 100; i++) {
+      int actual = cs.take().get().intValue();
+      System.out.println("Retrieved " + actual);
+      assertEquals(i, actual);
     }
-
-    @Test
-    public void testMultipleStripes() throws InterruptedException {
-        final ExecutorService pool = new StripedExecutorService();
-        ExecutorService producerPool = Executors.newCachedThreadPool();
-        for (int i = 0; i < 20; i++) {
-            producerPool.submit(new Runnable() {
-                public void run() {
-                    Object stripe = new Object();
-                    AtomicInteger actual = new AtomicInteger(0);
-                    for (int i = 0; i < 100; i++) {
-                        pool.submit(new TestRunnable(stripe, actual, i));
-                    }
-                }
-            });
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.HOURS));
+    testSubmitter.join();
+  }
+
+  @Test
+  public void testUnstripedRunnable() throws InterruptedException {
+    ExecutorService pool = new StripedExecutorService();
+    AtomicInteger actual = new AtomicInteger(0);
+    for (int i = 0; i < 100; i++) {
+      pool.submit(new TestUnstripedRunnable(actual, i));
+    }
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.HOURS));
+
+    assertTrue("Expected at least some out-of-sequence runnables to execute",
+        TestUnstripedRunnable.outOfSequence);
+  }
+
+  @Test
+  public void testMultipleStripes() throws InterruptedException {
+    final ExecutorService pool = new StripedExecutorService();
+    ExecutorService producerPool = Executors.newCachedThreadPool();
+    for (int i = 0; i < 20; i++) {
+      producerPool.submit(new Runnable() {
+        public void run() {
+          Object stripe = new Object();
+          AtomicInteger actual = new AtomicInteger(0);
+          for (int i = 0; i < 100; i++) {
+            pool.submit(new TestRunnable(stripe, actual, i));
+          }
         }
-        producerPool.shutdown();
-
-        while (!producerPool.awaitTermination(1, TimeUnit.MINUTES)) ;
-
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.DAYS));
-        assertFalse("Expected no out-of-sequence runnables to execute",
-                TestRunnable.outOfSequence);
+      });
     }
+    producerPool.shutdown();
 
+    while (!producerPool.awaitTermination(1, TimeUnit.MINUTES)) ;
 
-    @Test
-    public void testMultipleFastStripes() throws InterruptedException {
-        final ExecutorService pool = new StripedExecutorService();
-        ExecutorService producerPool = Executors.newCachedThreadPool();
-        for (int i = 0; i < 20; i++) {
-            producerPool.submit(new Runnable() {
-                public void run() {
-                    Object stripe = new Object();
-                    AtomicInteger actual = new AtomicInteger(0);
-                    for (int i = 0; i < 100; i++) {
-                        pool.submit(new TestFastRunnable(stripe, actual, i));
-                    }
-                }
-            });
-        }
-        producerPool.shutdown();
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.DAYS));
+    assertFalse("Expected no out-of-sequence runnables to execute",
+        TestRunnable.outOfSequence);
+  }
 
-        while (!producerPool.awaitTermination(1, TimeUnit.MINUTES)) ;
 
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.DAYS));
-        assertFalse("Expected no out-of-sequence runnables to execute",
-                TestFastRunnable.outOfSequence);
+  @Test
+  public void testMultipleFastStripes() throws InterruptedException {
+    final ExecutorService pool = new StripedExecutorService();
+    ExecutorService producerPool = Executors.newCachedThreadPool();
+    for (int i = 0; i < 20; i++) {
+      producerPool.submit(new Runnable() {
+        public void run() {
+          Object stripe = new Object();
+          AtomicInteger actual = new AtomicInteger(0);
+          for (int i = 0; i < 100; i++) {
+            pool.submit(new TestFastRunnable(stripe, actual, i));
+          }
+        }
+      });
     }
+    producerPool.shutdown();
 
+    while (!producerPool.awaitTermination(1, TimeUnit.MINUTES)) ;
 
-    public static class TestRunnable implements StripedRunnable {
-        private final Object stripe;
-        private final AtomicInteger stripeSequence;
-        private final int expected;
-        private static volatile boolean outOfSequence = false;
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.DAYS));
+    assertFalse("Expected no out-of-sequence runnables to execute",
+        TestFastRunnable.outOfSequence);
+  }
 
-        public TestRunnable(Object stripe, AtomicInteger stripeSequence, int expected) {
-            this.stripe = stripe;
-            this.stripeSequence = stripeSequence;
-            this.expected = expected;
-        }
 
-        public Object getStripe() {
-            return stripe;
-        }
+  public static class TestRunnable implements StripedRunnable {
+    private final Object stripe;
+    private final AtomicInteger stripeSequence;
+    private final int expected;
+    private static volatile boolean outOfSequence = false;
 
-        public void run() {
-            try {
-                ThreadLocalRandom rand = ThreadLocalRandom.current();
-                Thread.sleep(rand.nextInt(10) + 10);
-            } catch (InterruptedException e) {
-                Thread.currentThread().interrupt();
-            }
-            int actual = stripeSequence.getAndIncrement();
-            if (actual != expected) {
-                outOfSequence = true;
-            }
-            System.out.printf("Execute strip %h %d %d%n", stripe, actual, expected);
-            assertEquals("out of sequence", actual, expected);
-        }
+    public TestRunnable(Object stripe, AtomicInteger stripeSequence, int expected) {
+      this.stripe = stripe;
+      this.stripeSequence = stripeSequence;
+      this.expected = expected;
     }
 
-    public static class TestFastRunnable implements StripedRunnable {
-        private final Object stripe;
-        private final AtomicInteger stripeSequence;
-        private final int expected;
-        private static volatile boolean outOfSequence = false;
+    public Object getStripe() {
+      return stripe;
+    }
 
-        public TestFastRunnable(Object stripe, AtomicInteger stripeSequence, int expected) {
-            this.stripe = stripe;
-            this.stripeSequence = stripeSequence;
-            this.expected = expected;
-        }
+    public void run() {
+      try {
+        ThreadLocalRandom rand = ThreadLocalRandom.current();
+        Thread.sleep(rand.nextInt(10) + 10);
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
+      int actual = stripeSequence.getAndIncrement();
+      if (actual != expected) {
+        outOfSequence = true;
+      }
+      System.out.printf("Execute strip %h %d %d%n", stripe, actual, expected);
+      assertEquals("out of sequence", actual, expected);
+    }
+  }
+
+  public static class TestFastRunnable implements StripedRunnable {
+    private final Object stripe;
+    private final AtomicInteger stripeSequence;
+    private final int expected;
+    private static volatile boolean outOfSequence = false;
+
+    public TestFastRunnable(Object stripe, AtomicInteger stripeSequence, int expected) {
+      this.stripe = stripe;
+      this.stripeSequence = stripeSequence;
+      this.expected = expected;
+    }
 
-        public Object getStripe() {
-            return stripe;
-        }
+    public Object getStripe() {
+      return stripe;
+    }
 
-        public void run() {
-            int actual = stripeSequence.getAndIncrement();
-            if (actual != expected) {
-                outOfSequence = true;
-            }
-            System.out.printf("Execute strip %h %d %d%n", stripe, actual, expected);
-            assertEquals("out of sequence", actual, expected);
-        }
+    public void run() {
+      int actual = stripeSequence.getAndIncrement();
+      if (actual != expected) {
+        outOfSequence = true;
+      }
+      System.out.printf("Execute strip %h %d %d%n", stripe, actual, expected);
+      assertEquals("out of sequence", actual, expected);
     }
+  }
 
-    public static class TestCallable implements StripedCallable<Integer> {
-        private final Object stripe;
-        private final int expected;
+  public static class TestCallable implements StripedCallable<Integer> {
+    private final Object stripe;
+    private final int expected;
 
-        public TestCallable(Object stripe, int expected) {
-            this.stripe = stripe;
-            this.expected = expected;
-        }
+    public TestCallable(Object stripe, int expected) {
+      this.stripe = stripe;
+      this.expected = expected;
+    }
 
-        public Object getStripe() {
-            return stripe;
-        }
+    public Object getStripe() {
+      return stripe;
+    }
 
-        public Integer call() throws Exception {
-            try {
-                ThreadLocalRandom rand = ThreadLocalRandom.current();
-                Thread.sleep(rand.nextInt(10) + 10);
-            } catch (InterruptedException e) {
-                Thread.currentThread().interrupt();
-            }
-            return expected;
-        }
+    public Integer call() throws Exception {
+      try {
+        ThreadLocalRandom rand = ThreadLocalRandom.current();
+        Thread.sleep(rand.nextInt(10) + 10);
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
+      return expected;
     }
+  }
 
-    public static class TestUnstripedRunnable implements Runnable {
-        private final AtomicInteger stripeSequence;
-        private final int expected;
-        private static volatile boolean outOfSequence = false;
+  public static class TestUnstripedRunnable implements Runnable {
+    private final AtomicInteger stripeSequence;
+    private final int expected;
+    private static volatile boolean outOfSequence = false;
 
-        public TestUnstripedRunnable(AtomicInteger stripeSequence, int expected) {
-            this.stripeSequence = stripeSequence;
-            this.expected = expected;
-        }
+    public TestUnstripedRunnable(AtomicInteger stripeSequence, int expected) {
+      this.stripeSequence = stripeSequence;
+      this.expected = expected;
+    }
 
-        public void run() {
-            try {
-                ThreadLocalRandom rand = ThreadLocalRandom.current();
-                Thread.sleep(rand.nextInt(10) + 10);
-            } catch (InterruptedException e) {
-                Thread.currentThread().interrupt();
-            }
-            int actual = stripeSequence.getAndIncrement();
-            if (actual != expected) {
-                outOfSequence = true;
-            }
-            System.out.println("Execute unstriped " + actual + ", " + expected);
-        }
+    public void run() {
+      try {
+        ThreadLocalRandom rand = ThreadLocalRandom.current();
+        Thread.sleep(rand.nextInt(10) + 10);
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
+      int actual = stripeSequence.getAndIncrement();
+      if (actual != expected) {
+        outOfSequence = true;
+      }
+      System.out.println("Execute unstriped " + actual + ", " + expected);
     }
+  }
 
 
 }
diff --git a/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2Test.java b/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2Test.java
index bbbe6aa..bf7d571 100644
--- a/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2Test.java
+++ b/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOne2Test.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,12 +28,12 @@
  * @author Dr Heinz M. Kabutz
  */
 public class CloseToOne2Test {
-    @Test
-    public void testWithLargeIntAddition() {
-        double d = 0.999999993;
-        int i = (int) (1 + d);
-        assertEquals(1, i);
-        int j = (int) (100_000_000 + d);
-        assertEquals(100_000_001, j);
-    }
+  @Test
+  public void testWithLargeIntAddition() {
+    double d = 0.999999993;
+    int i = (int) (1 + d);
+    assertEquals(1, i);
+    int j = (int) (100_000_000 + d);
+    assertEquals(100_000_001, j);
+  }
 }
diff --git a/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOneTest.java b/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOneTest.java
index 4ca540d..493302d 100644
--- a/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOneTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/examples/issue198/CloseToOneTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,15 +28,15 @@
  * @author Dr Heinz M. Kabutz
  */
 public class CloseToOneTest {
-    @Test
-    public void testClosestToOne() {
-        long first = (1 << 26) - 1;
-        long second = (1 << 27) - 1;
+  @Test
+  public void testClosestToOne() {
+    long first = (1 << 26) - 1;
+    long second = (1 << 27) - 1;
 
-        assertEquals(2, (int) (CloseToOne.makeDouble(first, second) + 1));
+    assertEquals(2, (int) (CloseToOne.makeDouble(first, second) + 1));
 
-        second--;
+    second--;
 
-        assertEquals(1, (int) (CloseToOne.makeDouble(first, second) + 1));
-    }
+    assertEquals(1, (int) (CloseToOne.makeDouble(first, second) + 1));
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/examples/issue198/FindRandomTest.java b/src/test/java/eu/javaspecialists/tjsn/examples/issue198/FindRandomTest.java
index b3891d9..6e1b07c 100644
--- a/src/test/java/eu/javaspecialists/tjsn/examples/issue198/FindRandomTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/examples/issue198/FindRandomTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -28,16 +28,16 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FindRandomTest {
-    @Test
-    public void testThatMinBiggerOrEqualToZero() {
-        double minDouble = FindRandom.findMinDouble();
-        assertTrue(minDouble >= 0.0);
-        assertTrue(minDouble < 1.0);
-    }
+  @Test
+  public void testThatMinBiggerOrEqualToZero() {
+    double minDouble = FindRandom.findMinDouble();
+    assertTrue(minDouble >= 0.0);
+    assertTrue(minDouble < 1.0);
+  }
 
-    @Test
-    public void testThatMaxLessThanOne() {
-        double maxDouble = FindRandom.findMaxDouble();
-        assertTrue(maxDouble < 1.0);
-    }
+  @Test
+  public void testThatMaxLessThanOne() {
+    double maxDouble = FindRandom.findMaxDouble();
+    assertTrue(maxDouble < 1.0);
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/math/numbers/FibonacciTest.java b/src/test/java/eu/javaspecialists/tjsn/math/numbers/FibonacciTest.java
index d9c5150..53821f1 100644
--- a/src/test/java/eu/javaspecialists/tjsn/math/numbers/FibonacciTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/math/numbers/FibonacciTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -36,243 +36,243 @@
  * @author Dr Heinz M. Kabutz
  */
 public class FibonacciTest {
-    private static ForkJoinPool pool = new ForkJoinPool();
+  private static ForkJoinPool pool = new ForkJoinPool();
 
-    private final static Fibonacci[] FIBONACCIS = {
-            new FibonacciFormulaLong(),
-            new FibonacciRecursiveNonCaching(),
-            new FibonacciIterative(),
-            new FibonacciRecursive(),
-            new FibonacciRecursiveDijkstra(),
-            new FibonacciRecursiveDijkstraKaratsuba(),
-            new FibonacciRecursiveParallelDijkstraKaratsuba(pool),
-            new FibonacciFormulaBigInteger(),
-            new FibonacciRecursiveBowbeer(pool),
+  private final static Fibonacci[] FIBONACCIS = {
+      new FibonacciFormulaLong(),
+      new FibonacciRecursiveNonCaching(),
+      new FibonacciIterative(),
+      new FibonacciRecursive(),
+      new FibonacciRecursiveDijkstra(),
+      new FibonacciRecursiveDijkstraKaratsuba(),
+      new FibonacciRecursiveParallelDijkstraKaratsuba(pool),
+      new FibonacciFormulaBigInteger(),
+      new FibonacciRecursiveBowbeer(pool),
 //            new FibonacciTakahashi(),
-    };
+  };
 
-    @Test
-    public void testSmallCorrectness() throws InterruptedException {
-        for (Fibonacci fibonacci : FIBONACCIS) {
-            checkSmallCorrectness(fibonacci);
-        }
+  @Test
+  public void testSmallCorrectness() throws InterruptedException {
+    for (Fibonacci fibonacci : FIBONACCIS) {
+      checkSmallCorrectness(fibonacci);
     }
+  }
 
-    private void checkSmallCorrectness(Fibonacci fibonacci) throws InterruptedException {
-        int n = 0;
-        assertEquals(BigInteger.ZERO, fibonacci.calculate(n++));
-        assertEquals(BigInteger.ONE, fibonacci.calculate(n++));
-        assertEquals(BigInteger.ONE, fibonacci.calculate(n++));
-        assertEquals(new BigInteger("2"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("3"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("5"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("8"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("13"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("21"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("34"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("55"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("89"), fibonacci.calculate(n++));
-        assertEquals(new BigInteger("144"), fibonacci.calculate(n++));
-    }
+  private void checkSmallCorrectness(Fibonacci fibonacci) throws InterruptedException {
+    int n = 0;
+    assertEquals(BigInteger.ZERO, fibonacci.calculate(n++));
+    assertEquals(BigInteger.ONE, fibonacci.calculate(n++));
+    assertEquals(BigInteger.ONE, fibonacci.calculate(n++));
+    assertEquals(new BigInteger("2"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("3"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("5"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("8"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("13"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("21"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("34"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("55"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("89"), fibonacci.calculate(n++));
+    assertEquals(new BigInteger("144"), fibonacci.calculate(n++));
+  }
 
-    @Test
-    public void testLargeCorrectness() throws InterruptedException {
-        for (Fibonacci fibonacci : FIBONACCIS) {
-            try {
-                checkLargeCorrectness(fibonacci, 1, TimeUnit.SECONDS);
-            } catch (TimeoutException e) {
-                System.out.println(fibonacci.getClass().getSimpleName() +
-                        " timed out on large calculation " + e.getMessage());
-            } catch (IllegalArgumentException e) {
-                System.out.println(fibonacci.getClass().getSimpleName() +
-                        " issue with calculation: " + e.getMessage());
-            } catch (StackOverflowError e) {
-                System.out.println(fibonacci.getClass().getSimpleName() +
-                        " issue with calculation - StackOverflowError");
-            }
-        }
+  @Test
+  public void testLargeCorrectness() throws InterruptedException {
+    for (Fibonacci fibonacci : FIBONACCIS) {
+      try {
+        checkLargeCorrectness(fibonacci, 1, TimeUnit.SECONDS);
+      } catch (TimeoutException e) {
+        System.out.println(fibonacci.getClass().getSimpleName() +
+            " timed out on large calculation " + e.getMessage());
+      } catch (IllegalArgumentException e) {
+        System.out.println(fibonacci.getClass().getSimpleName() +
+            " issue with calculation: " + e.getMessage());
+      } catch (StackOverflowError e) {
+        System.out.println(fibonacci.getClass().getSimpleName() +
+            " issue with calculation - StackOverflowError");
+      }
     }
+  }
 
-    private void checkLargeCorrectness(Fibonacci fibonacci,
-                                       int timeout, TimeUnit unit)
-            throws TimeoutException, InterruptedException {
-        BigInteger result;
-        result = executeAsynchronously(fibonacci, 71, timeout, unit);
-        assertEquals(new BigInteger("308061521170129"), result);
-        result = executeAsynchronously(fibonacci, 72, timeout, unit);
-        assertEquals(new BigInteger("498454011879264"), result);
-        result = executeAsynchronously(fibonacci, 400, timeout, unit);
-        assertEquals(new BigInteger("176023680645013966468226945392411250770" +
-                "384383304492191886725992896575345044216019675"), result);
-        result = executeAsynchronously(fibonacci, 700, timeout, unit);
-        assertEquals(new BigInteger("874708149557528462039784130175713273423" +
-                "67240967697381074230432592527501911290377655628227150878427" +
-                "331693193369109193672330777527943718169105124275"), result);
-        result = executeAsynchronously(fibonacci, 1000, timeout, unit);
-        assertEquals(new BigInteger("434665576869374564356885276750406258025" +
-                "64660517371780402481729089536555417949051890403879840079255" +
-                "16929592259308032263477520968962323987332247116164299644090" +
-                "6533187938298969649928516003704476137795166849228875"), result);
-        result = executeAsynchronously(fibonacci, 10_000, timeout, unit);
-        assertEquals(new BigInteger("336447648764317832666216120051075433103" +
-                "02148460680063906564769974680081442166662368155595513633734" +
-                "02558206533268083615937373479048386526826304089246305643188" +
-                "73545443695598274916066020998841839338646527313000888302692" +
-                "35673613135117579297437854413752130520504347701602264758318" +
-                "90652789085515436615958298727968298751063120057542878345321" +
-                "55151038708182989697916131278562650331954871402142875326981" +
-                "87962046936097879900350962302291026368131493195275630227837" +
-                "62844154036058440257211433496118002309120828704608892396232" +
-                "88354615057765832712525460935911282039252853934346209042452" +
-                "48929403901706233888991085841065183173360437470737908552631" +
-                "76432573399371287193758774689747992630583706574283016163740" +
-                "89691784263786242128352581128205163702980893320999057079200" +
-                "64367426202389783111470054074998459250360633560933883831923" +
-                "38678305613643535189213327973290813373264265263398976392272" +
-                "34078829281779535805709936910491754708089318410561463223382" +
-                "17465637321248226383092103297701648054726243842374862411453" +
-                "09381220656491403275108664339451751216152654536133311131404" +
-                "24368548051067658434935238369596534280717687753283482343455" +
-                "57366719731392746273629108210679280784718035329131176778924" +
-                "65908993863545932789452377767440619224033763867400402133034" +
-                "32974969020283281459334188268176838930720036347956231171031" +
-                "01291953169794607632737589253530772552375943788434504067715" +
-                "55577905645044301664011946258097221672975861502696844314695" +
-                "20346149322911059706762432685159928347098912847067408620085" +
-                "87135016260312071903172086094081298321581077282076353186624" +
-                "61127824553720853236530577595643007251774431505153960090516" +
-                "86032203491632226408852488524331580515348496224348482993809" +
-                "05070483482449327453732624567755879089187190803662058009594" +
-                "74315005240253270974699531877072437682590741993963226598414" +
-                "74981936092852239450397071654431564213281576889080587831834" +
-                "04917434556270520223564846495196112460268313970975069382648" +
-                "70661326450766507461151267752274862159864253071129844118262" +
-                "26610571635150692600298617049454250474913781151541399415506" +
-                "71256271197133252763631939606902895650288268608362241082050" +
-                "562430701794976171121233066073310059947366875"), result);
-
-        result = executeAsynchronously(fibonacci, 1_000_000, timeout, unit);
-        assertEquals(694241, result.bitLength());
-
-        /*
-        turns out that add() is faster than shift or multiply
-        BigInteger TWO = new BigInteger("2");
+  private void checkLargeCorrectness(Fibonacci fibonacci,
+                                     int timeout, TimeUnit unit)
+      throws TimeoutException, InterruptedException {
+    BigInteger result;
+    result = executeAsynchronously(fibonacci, 71, timeout, unit);
+    assertEquals(new BigInteger("308061521170129"), result);
+    result = executeAsynchronously(fibonacci, 72, timeout, unit);
+    assertEquals(new BigInteger("498454011879264"), result);
+    result = executeAsynchronously(fibonacci, 400, timeout, unit);
+    assertEquals(new BigInteger("176023680645013966468226945392411250770" +
+        "384383304492191886725992896575345044216019675"), result);
+    result = executeAsynchronously(fibonacci, 700, timeout, unit);
+    assertEquals(new BigInteger("874708149557528462039784130175713273423" +
+        "67240967697381074230432592527501911290377655628227150878427" +
+        "331693193369109193672330777527943718169105124275"), result);
+    result = executeAsynchronously(fibonacci, 1000, timeout, unit);
+    assertEquals(new BigInteger("434665576869374564356885276750406258025" +
+        "64660517371780402481729089536555417949051890403879840079255" +
+        "16929592259308032263477520968962323987332247116164299644090" +
+        "6533187938298969649928516003704476137795166849228875"), result);
+    result = executeAsynchronously(fibonacci, 10_000, timeout, unit);
+    assertEquals(new BigInteger("336447648764317832666216120051075433103" +
+        "02148460680063906564769974680081442166662368155595513633734" +
+        "02558206533268083615937373479048386526826304089246305643188" +
+        "73545443695598274916066020998841839338646527313000888302692" +
+        "35673613135117579297437854413752130520504347701602264758318" +
+        "90652789085515436615958298727968298751063120057542878345321" +
+        "55151038708182989697916131278562650331954871402142875326981" +
+        "87962046936097879900350962302291026368131493195275630227837" +
+        "62844154036058440257211433496118002309120828704608892396232" +
+        "88354615057765832712525460935911282039252853934346209042452" +
+        "48929403901706233888991085841065183173360437470737908552631" +
+        "76432573399371287193758774689747992630583706574283016163740" +
+        "89691784263786242128352581128205163702980893320999057079200" +
+        "64367426202389783111470054074998459250360633560933883831923" +
+        "38678305613643535189213327973290813373264265263398976392272" +
+        "34078829281779535805709936910491754708089318410561463223382" +
+        "17465637321248226383092103297701648054726243842374862411453" +
+        "09381220656491403275108664339451751216152654536133311131404" +
+        "24368548051067658434935238369596534280717687753283482343455" +
+        "57366719731392746273629108210679280784718035329131176778924" +
+        "65908993863545932789452377767440619224033763867400402133034" +
+        "32974969020283281459334188268176838930720036347956231171031" +
+        "01291953169794607632737589253530772552375943788434504067715" +
+        "55577905645044301664011946258097221672975861502696844314695" +
+        "20346149322911059706762432685159928347098912847067408620085" +
+        "87135016260312071903172086094081298321581077282076353186624" +
+        "61127824553720853236530577595643007251774431505153960090516" +
+        "86032203491632226408852488524331580515348496224348482993809" +
+        "05070483482449327453732624567755879089187190803662058009594" +
+        "74315005240253270974699531877072437682590741993963226598414" +
+        "74981936092852239450397071654431564213281576889080587831834" +
+        "04917434556270520223564846495196112460268313970975069382648" +
+        "70661326450766507461151267752274862159864253071129844118262" +
+        "26610571635150692600298617049454250474913781151541399415506" +
+        "71256271197133252763631939606902895650288268608362241082050" +
+        "562430701794976171121233066073310059947366875"), result);
 
-        Karatsuba bkar = new BasicKaratsuba();
-        ForkJoinPool pool = new ForkJoinPool();
-        Karatsuba pkar = new ParallelKaratsuba(pool);
+    result = executeAsynchronously(fibonacci, 1_000_000, timeout, unit);
+    assertEquals(694241, result.bitLength());
 
-        assertEquals(result.shiftLeft(1), result.multiply(TWO));
-        assertEquals(result.shiftLeft(1), result.add(result));
-        assertEquals(result.shiftLeft(1), bkar.multiply(result, TWO));
-        assertEquals(result.shiftLeft(1), pkar.multiply(result, TWO));
+    /*
+    turns out that add() is faster than shift or multiply
+    BigInteger TWO = new BigInteger("2");
 
-        for (int j = 0; j < 10; j++) {
-            long time;
-            time = System.currentTimeMillis();
-            for (int i = 0; i < 10000; i++) {
-                result.multiply(TWO);
-            }
-            time = System.currentTimeMillis() - time;
-            System.out.println("Multiply by TWO = " + time);
+    Karatsuba bkar = new BasicKaratsuba();
+    ForkJoinPool pool = new ForkJoinPool();
+    Karatsuba pkar = new ParallelKaratsuba(pool);
 
-            time = System.currentTimeMillis();
-            for (int i = 0; i < 10000; i++) {
-                result.shiftLeft(1);
-            }
-            time = System.currentTimeMillis() - time;
-            System.out.println("Left shift = " + time);
+    assertEquals(result.shiftLeft(1), result.multiply(TWO));
+    assertEquals(result.shiftLeft(1), result.add(result));
+    assertEquals(result.shiftLeft(1), bkar.multiply(result, TWO));
+    assertEquals(result.shiftLeft(1), pkar.multiply(result, TWO));
 
-            time = System.currentTimeMillis();
-            for (int i = 0; i < 10000; i++) {
-                result.add(result);
-            }
-            time = System.currentTimeMillis() - time;
-            System.out.println("add = " + time);
+    for (int j = 0; j < 10; j++) {
+        long time;
+        time = System.currentTimeMillis();
+        for (int i = 0; i < 10000; i++) {
+            result.multiply(TWO);
+        }
+        time = System.currentTimeMillis() - time;
+        System.out.println("Multiply by TWO = " + time);
 
-            time = System.currentTimeMillis();
-            for (int i = 0; i < 10000; i++) {
-                bkar.multiply(result, TWO);
-            }
-            time = System.currentTimeMillis() - time;
-            System.out.println("BasicKaratsuba = " + time);
+        time = System.currentTimeMillis();
+        for (int i = 0; i < 10000; i++) {
+            result.shiftLeft(1);
+        }
+        time = System.currentTimeMillis() - time;
+        System.out.println("Left shift = " + time);
 
-            time = System.currentTimeMillis();
-            for (int i = 0; i < 10000; i++) {
-                pkar.multiply(result, TWO);
-            }
-            time = System.currentTimeMillis() - time;
-            System.out.println("ParallelKaratsuba = " + time);
+        time = System.currentTimeMillis();
+        for (int i = 0; i < 10000; i++) {
+            result.add(result);
         }
-        pool.shutdown();
-        //*/
+        time = System.currentTimeMillis() - time;
+        System.out.println("add = " + time);
 
-    }
+        time = System.currentTimeMillis();
+        for (int i = 0; i < 10000; i++) {
+            bkar.multiply(result, TWO);
+        }
+        time = System.currentTimeMillis() - time;
+        System.out.println("BasicKaratsuba = " + time);
 
-    private BigInteger executeAsynchronously(final Fibonacci fibonacci,
-                                             final int n,
-                                             long timeout, TimeUnit unit)
-            throws TimeoutException, InterruptedException {
-        long time = System.currentTimeMillis();
-        ExecutorService pool = Executors.newSingleThreadExecutor();
-        Future<BigInteger> result = pool.submit(new Callable<BigInteger>() {
-            @Override
-            public BigInteger call() throws Exception {
-                return fibonacci.calculate(n);
-            }
-        });
-        pool.shutdown();
-        try {
-            BigInteger answer = result.get(timeout, unit);
-            time = System.currentTimeMillis() - time;
-            System.out.println(fibonacci.getClass().getSimpleName() +
-                    " calculated fib(" + n + ") in " + time + "ms");
-            return answer;
-        } catch (InterruptedException e) {
-            throw e;
-        } catch (TimeoutException e) {
-            throw new TimeoutException("n=" + n);
-        } catch (ExecutionException e) {
-            try {
-                throw e.getCause();
-            } catch (RuntimeException re) {
-                throw re;
-            } catch (Error er) {
-                throw er;
-            } catch (Throwable throwable) {
-                throw new IllegalStateException(throwable);
-            }
-        } finally {
-            pool.shutdownNow();
-            try {
-                assertTrue(pool.awaitTermination(1, TimeUnit.MINUTES));
-            } catch (InterruptedException e) {
-                Thread.currentThread().interrupt();
-            }
+        time = System.currentTimeMillis();
+        for (int i = 0; i < 10000; i++) {
+            pkar.multiply(result, TWO);
         }
+        time = System.currentTimeMillis() - time;
+        System.out.println("ParallelKaratsuba = " + time);
     }
+    pool.shutdown();
+    //*/
 
-    @Test
-    public void testParallelExecution() throws InterruptedException {
-        System.out.println("Creating F/J Pool with 128 threads");
-        final ForkJoinPool pool = new ForkJoinPool(128);
-        Fibonacci fib = new FibonacciRecursiveParallelDijkstraKaratsuba(pool);
-        Timer timer = new Timer();
-        timer.schedule(new TimerTask() {
-            @Override
-            public void run() {
-                System.out.println("pool = " + pool);
-            }
-        }, 1000, 1000);
-        long time = System.currentTimeMillis();
-        System.out.println("Trying to calculate fib(2000000)");
-        BigInteger value = fib.calculate(2_000_000);
-        assertEquals(1388483, value.bitLength());
-        time = System.currentTimeMillis() - time;
-        System.out.println("Solved fib(2_000_000) in " + time + "ms parallel");
-        System.out.println(pool);
-        assertEquals(128, pool.getParallelism());
-        timer.cancel();
-        pool.shutdown();
+  }
+
+  private BigInteger executeAsynchronously(final Fibonacci fibonacci,
+                                           final int n,
+                                           long timeout, TimeUnit unit)
+      throws TimeoutException, InterruptedException {
+    long time = System.currentTimeMillis();
+    ExecutorService pool = Executors.newSingleThreadExecutor();
+    Future<BigInteger> result = pool.submit(new Callable<BigInteger>() {
+      @Override
+      public BigInteger call() throws Exception {
+        return fibonacci.calculate(n);
+      }
+    });
+    pool.shutdown();
+    try {
+      BigInteger answer = result.get(timeout, unit);
+      time = System.currentTimeMillis() - time;
+      System.out.println(fibonacci.getClass().getSimpleName() +
+          " calculated fib(" + n + ") in " + time + "ms");
+      return answer;
+    } catch (InterruptedException e) {
+      throw e;
+    } catch (TimeoutException e) {
+      throw new TimeoutException("n=" + n);
+    } catch (ExecutionException e) {
+      try {
+        throw e.getCause();
+      } catch (RuntimeException re) {
+        throw re;
+      } catch (Error er) {
+        throw er;
+      } catch (Throwable throwable) {
+        throw new IllegalStateException(throwable);
+      }
+    } finally {
+      pool.shutdownNow();
+      try {
+        assertTrue(pool.awaitTermination(1, TimeUnit.MINUTES));
+      } catch (InterruptedException e) {
+        Thread.currentThread().interrupt();
+      }
     }
+  }
+
+  @Test
+  public void testParallelExecution() throws InterruptedException {
+    System.out.println("Creating F/J Pool with 128 threads");
+    final ForkJoinPool pool = new ForkJoinPool(128);
+    Fibonacci fib = new FibonacciRecursiveParallelDijkstraKaratsuba(pool);
+    Timer timer = new Timer();
+    timer.schedule(new TimerTask() {
+      @Override
+      public void run() {
+        System.out.println("pool = " + pool);
+      }
+    }, 1000, 1000);
+    long time = System.currentTimeMillis();
+    System.out.println("Trying to calculate fib(2000000)");
+    BigInteger value = fib.calculate(2_000_000);
+    assertEquals(1388483, value.bitLength());
+    time = System.currentTimeMillis() - time;
+    System.out.println("Solved fib(2_000_000) in " + time + "ms parallel");
+    System.out.println(pool);
+    assertEquals(128, pool.getParallelism());
+    timer.cancel();
+    pool.shutdown();
+  }
 }
\ No newline at end of file
diff --git a/src/test/java/eu/javaspecialists/tjsn/math/numbers/KaratsubaTest.java b/src/test/java/eu/javaspecialists/tjsn/math/numbers/KaratsubaTest.java
index 69837aa..a7d5474 100644
--- a/src/test/java/eu/javaspecialists/tjsn/math/numbers/KaratsubaTest.java
+++ b/src/test/java/eu/javaspecialists/tjsn/math/numbers/KaratsubaTest.java
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2000-2012 Heinz Max Kabutz
+ * Copyright (C) 2000-2013 Heinz Max Kabutz
  *
  * See the NOTICE file distributed with this work for additional
  * information regarding copyright ownership.  Heinz Max Kabutz licenses
@@ -32,112 +32,112 @@
  * @author Dr Heinz M. Kabutz
  */
 public class KaratsubaTest {
-    @Test
-    public void testKaratsubaEqualsBigIntegerMultiply() throws InterruptedException {
-        checkKaratsubaEqualsBigIntegerMultiply(new BasicKaratsuba());
-        ForkJoinPool pool = new ForkJoinPool();
-        checkKaratsubaEqualsBigIntegerMultiply(new ParallelKaratsuba(pool));
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
-        System.out.println("pool = " + pool);
+  @Test
+  public void testKaratsubaEqualsBigIntegerMultiply() throws InterruptedException {
+    checkKaratsubaEqualsBigIntegerMultiply(new BasicKaratsuba());
+    ForkJoinPool pool = new ForkJoinPool();
+    checkKaratsubaEqualsBigIntegerMultiply(new ParallelKaratsuba(pool));
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
+    System.out.println("pool = " + pool);
+  }
+
+  private void checkKaratsubaEqualsBigIntegerMultiply(Karatsuba karatsuba) {
+    for (int N = 1; N <= 100_000; N *= 10) {
+      BigInteger a = new BigInteger(N, ThreadLocalRandom.current());
+      BigInteger b = new BigInteger(N, ThreadLocalRandom.current());
+      BigInteger c = karatsuba.multiply(a, b);
+      BigInteger d = a.multiply(b);
+      assertEquals(c, d);
     }
-
-    private void checkKaratsubaEqualsBigIntegerMultiply(Karatsuba karatsuba) {
-        for (int N = 1; N <= 100_000; N *= 10) {
-            BigInteger a = new BigInteger(N, ThreadLocalRandom.current());
-            BigInteger b = new BigInteger(N, ThreadLocalRandom.current());
-            BigInteger c = karatsuba.multiply(a, b);
-            BigInteger d = a.multiply(b);
-            assertEquals(c, d);
-        }
-    }
-
-    @Test
-    public void testNegativeKaratsubaEqualsBigIntegerMultiply() throws InterruptedException {
-        checkNegativeKaratsubaEqualsBigIntegerMultiply(new BasicKaratsuba());
-        ForkJoinPool pool = new ForkJoinPool();
-        checkNegativeKaratsubaEqualsBigIntegerMultiply(new ParallelKaratsuba(pool));
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
-        System.out.println("pool = " + pool);
+  }
+
+  @Test
+  public void testNegativeKaratsubaEqualsBigIntegerMultiply() throws InterruptedException {
+    checkNegativeKaratsubaEqualsBigIntegerMultiply(new BasicKaratsuba());
+    ForkJoinPool pool = new ForkJoinPool();
+    checkNegativeKaratsubaEqualsBigIntegerMultiply(new ParallelKaratsuba(pool));
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
+    System.out.println("pool = " + pool);
+  }
+
+  public void checkNegativeKaratsubaEqualsBigIntegerMultiply(Karatsuba karatsuba) {
+    BigInteger a, b;
+
+    ThreadLocalRandom rnd = ThreadLocalRandom.current();
+    a = new BigInteger(10_000, rnd);
+    b = new BigInteger(10_000, rnd).negate();
+    assertEquals(a.multiply(b), karatsuba.multiply(a, b));
+
+    a = new BigInteger(10_000, rnd).negate();
+    b = new BigInteger(10_000, rnd);
+    assertEquals(a.multiply(b), karatsuba.multiply(a, b));
+
+    a = new BigInteger(10_000, rnd).negate();
+    b = new BigInteger(10_000, rnd).negate();
+    assertEquals(a.multiply(b), karatsuba.multiply(a, b));
+  }
+
+  @Test
+  public void testKaratsubaPerformance() throws InterruptedException {
+    checkKaratsubaPerformance(new BasicKaratsuba());
+    ForkJoinPool pool = new ForkJoinPool();
+    checkKaratsubaPerformance(new ParallelKaratsuba(pool));
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
+    System.out.println("pool = " + pool);
+  }
+
+  public void checkKaratsubaPerformance(Karatsuba karatsuba) {
+    int N = 1_000_000;
+    BigInteger a = new BigInteger(N, ThreadLocalRandom.current());
+    BigInteger b = new BigInteger(N, ThreadLocalRandom.current());
+
+    for (int warmup = 0; warmup < 3; warmup++) {
+      karatsuba.multiply(a, b);
+      a.multiply(b);
     }
 
-    public void checkNegativeKaratsubaEqualsBigIntegerMultiply(Karatsuba karatsuba) {
-        BigInteger a, b;
-
-        ThreadLocalRandom rnd = ThreadLocalRandom.current();
-        a = new BigInteger(10_000, rnd);
-        b = new BigInteger(10_000, rnd).negate();
-        assertEquals(a.multiply(b), karatsuba.multiply(a, b));
-
-        a = new BigInteger(10_000, rnd).negate();
-        b = new BigInteger(10_000, rnd);
-        assertEquals(a.multiply(b), karatsuba.multiply(a, b));
-
-        a = new BigInteger(10_000, rnd).negate();
-        b = new BigInteger(10_000, rnd).negate();
-        assertEquals(a.multiply(b), karatsuba.multiply(a, b));
-    }
-
-    @Test
-    public void testKaratsubaPerformance() throws InterruptedException {
-        checkKaratsubaPerformance(new BasicKaratsuba());
-        ForkJoinPool pool = new ForkJoinPool();
-        checkKaratsubaPerformance(new ParallelKaratsuba(pool));
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
-        System.out.println("pool = " + pool);
-    }
+    long karatsuba_time = System.currentTimeMillis();
+    karatsuba.multiply(a, b);
+    karatsuba_time = System.currentTimeMillis() - karatsuba_time;
 
-    public void checkKaratsubaPerformance(Karatsuba karatsuba) {
-        int N = 1_000_000;
-        BigInteger a = new BigInteger(N, ThreadLocalRandom.current());
-        BigInteger b = new BigInteger(N, ThreadLocalRandom.current());
+    long multiply_time = System.currentTimeMillis();
+    a.multiply(b);
+    multiply_time = System.currentTimeMillis() - multiply_time;
 
-        for (int warmup = 0; warmup < 3; warmup++) {
-            karatsuba.multiply(a, b);
-            a.multiply(b);
-        }
-
-        long karatsuba_time = System.currentTimeMillis();
-        karatsuba.multiply(a, b);
-        karatsuba_time = System.currentTimeMillis() - karatsuba_time;
-
-        long multiply_time = System.currentTimeMillis();
-        a.multiply(b);
-        multiply_time = System.currentTimeMillis() - multiply_time;
-
-        System.out.println("karatsuba_time = " + karatsuba_time);
-        System.out.println("multiply_time = " + multiply_time);
-        assertTrue(multiply_time > karatsuba_time);
-    }
-
-    @Test
-    public void testKaratsubaSquare() throws InterruptedException {
-        for (int i = 0; i < 10; i++) {
-            test();
-        }
-    }
-
-    private void test() throws InterruptedException {
-        ForkJoinPool pool = new ForkJoinPool();
-        BigInteger a = new BigInteger(1_000_000, ThreadLocalRandom.current());
-        BigInteger squareOfA = a.pow(2);
-        checkKaratsubaSquare(a, squareOfA, new BasicKaratsuba());
-        checkKaratsubaSquare(a, squareOfA, new ParallelKaratsuba(pool));
-        pool.shutdown();
-        assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
-        System.out.println("pool = " + pool);
-    }
+    System.out.println("karatsuba_time = " + karatsuba_time);
+    System.out.println("multiply_time = " + multiply_time);
+    assertTrue(multiply_time > karatsuba_time);
+  }
 
-    private void checkKaratsubaSquare(BigInteger a, BigInteger squareOfA, Karatsuba karatsuba) {
-        long time = System.currentTimeMillis();
-        assertEquals(squareOfA, karatsuba.square(a));
-        time = System.currentTimeMillis() - time;
-        System.out.println("Time for " + karatsuba.getClass().getSimpleName() + " square: " + time);
-        time = System.currentTimeMillis();
-        assertEquals(squareOfA, karatsuba.multiply(a, a));
-        time = System.currentTimeMillis() - time;
-        System.out.println("Time for " + karatsuba.getClass().getSimpleName() + " multiply: " + time);
+  @Test
+  public void testKaratsubaSquare() throws InterruptedException {
+    for (int i = 0; i < 10; i++) {
+      test();
     }
+  }
+
+  private void test() throws InterruptedException {
+    ForkJoinPool pool = new ForkJoinPool();
+    BigInteger a = new BigInteger(1_000_000, ThreadLocalRandom.current());
+    BigInteger squareOfA = a.pow(2);
+    checkKaratsubaSquare(a, squareOfA, new BasicKaratsuba());
+    checkKaratsubaSquare(a, squareOfA, new ParallelKaratsuba(pool));
+    pool.shutdown();
+    assertTrue(pool.awaitTermination(1, TimeUnit.SECONDS));
+    System.out.println("pool = " + pool);
+  }
+
+  private void checkKaratsubaSquare(BigInteger a, BigInteger squareOfA, Karatsuba karatsuba) {
+    long time = System.currentTimeMillis();
+    assertEquals(squareOfA, karatsuba.square(a));
+    time = System.currentTimeMillis() - time;
+    System.out.println("Time for " + karatsuba.getClass().getSimpleName() + " square: " + time);
+    time = System.currentTimeMillis();
+    assertEquals(squareOfA, karatsuba.multiply(a, a));
+    time = System.currentTimeMillis() - time;
+    System.out.println("Time for " + karatsuba.getClass().getSimpleName() + " multiply: " + time);
+  }
 }
\ No newline at end of file