final solution of task public

StgSharp.Common/Mathematics/Linear/MatrixParallel.Publish.cs

@@ -1,6 +1,6 @@
 //-----------------------------------------------------------------------
 // -----------------------------------------------------------------------
-// file="MatrixParallel.TaskPublic.cs"
+// file="MatrixParallel.Publish.cs"
 // Project: StgSharp
 // AuthorGroup: Nitload Space
 // Copyright (c) Nitload Space. All rights reserved.
@@ -76,22 +76,9 @@ namespace StgSharp.Mathematics
             package->ElementSize = sizeof(T);
             package->ComputeMode = 3;
 
-            if ((c3 | c4) > 0) { } else
-            {
-                int
-                    small_4_size = c4 / LargeWrapCount,
-                    large_4_size = small_4_size + 1,
-                    small_3_size = c3 / LargeWrapCount,
-                    large_3_size = small_3_size + 1;
-                int
-                    large_4_count = c4 % LargeWrapCount,
-                    small_4_count = LargeWrapCount - large_4_count,
-                    large_3_count = c3 % LargeWrapCount,
-                    small_3_count = LargeWrapCount - large_3_count;
-                for (int i = 0; i < large_4_count; i++) { }
-
-                // TODO maybe a task slice method is good?
-            }
+            int baseCount = columnCount / length,
+                rem = columnCount % length;
+            if (baseCount == 0) { }
         }
 
     }