[some comment updates and cleanup
Andreas Röver <roever@users.sourceforge.net>**20050818143609] {
hunk ./src/lib/disassembler.h 29
- * 1) construct the klass with the voxel space of the assembled puzzle,
- *    empty voxels should be 0xff, bieces should be enumerated continuously
- *    starting from 0
- * 2) call diassemble and evaluate the result
+ * 1) construct the class with whatever parameters the concrete subclass requires
+ * 2) call diassemble for each assembly found and evaluate the result
+ *
+ * some subclasses may be able to handle serveral assemblies, others may only
+ * disassembler one, that depends on the concrete disassembler you use
hunk ./src/lib/disassembler_0.cpp 229
- * to distinguish "good" and "bad" moves the function returns true, if less than halve of
- * the pieces need to be moved. This prevents the movement of the whole puzzle which
- * is rubbish.
+ * to distinguish "good" and "bad" moves the function returns true, if less maxPieces
+ * have to be moved, this value should not be larger than halve of the pieces in the puzzle
hunk ./src/lib/disassembler_0.cpp 428
-    if (st->is_piece_removed(i) == cond) {
+    if (st->is_piece_removed(i) == cond)
hunk ./src/lib/disassembler_0.cpp 431
-      else
-        if (group == 0)
-          group = puzzle->probGetPieceGroup(problem, pn[i]);
-        else
-          if (group != puzzle->probGetPieceGroup(problem, pn[i]))
-            return 0;
-    }
+      else if (group == 0)
+        group = puzzle->probGetPieceGroup(problem, pn[i]);
+      else if (group != puzzle->probGetPieceGroup(problem, pn[i]))
+        return 0;
hunk ./src/lib/disassembler_0.cpp 618
-  if (cache) delete cache;
+  delete cache;
hunk ./src/lib/disassembler_0.h 31
-/* this class implements a burr disassembler. the interface is simple:
- * 1) construct the klass with the voxel space of the assembled puzzle,
- *    empty voxels should be 0xff, bieces should be enumerated continuously
- *    starting from 0
- * 2) call diassemble and evaluate the result
+/* this class is a disassembler for the cube space.
+ *
+ * is is implemented using bill cuttlers algorithm, so please read there
+ * in case you are interested how it works. The comments are written with
+ * the thought that you know his algorithm
hunk ./src/lib/disassembler_0.h 65
-  /*
-   * find all possible movements of starting from the state given to init_find
+  /* find all possible movements of starting from the state given to init_find
hunk ./src/lib/disassembler_0.h 88
+  /* construct the disassembler for this concrete problem, is can not be
+   * changed, once you done that but you can analyse many assemblies for
+   * disassembability
+   */
hunk ./src/lib/disassembly.cpp 355
+
}
