--- a/Implab/Parallels/ArrayTraits.cs	Thu Nov 14 01:15:07 2013 +0400
+++ b/Implab/Parallels/ArrayTraits.cs	Thu Feb 06 01:08:59 2014 +0400
@@ -168,45 +168,5 @@
             return promise.Anyway(() => semaphore.Dispose());
         }
 
-        /*
-        this method is pretty fast, but it may cause a stack overflow if an element transformation is made faster then the next operation is
-        be chained, in this case the syncronous callback invocation will occur
-        
-        public static Promise<TDst[]> ChainedMap2<TSrc, TDst>(this TSrc[] source, ChainedOperation<TSrc, TDst> transform, int threads) {
-            if (source == null)
-                throw new ArgumentNullException("source");
-            if (transform == null)
-                throw new ArgumentNullException("transform");
-            if (threads <= 0)
-                throw new ArgumentOutOfRangeException("Threads number must be greater then zero");
-
-            var promise = new Promise<TDst[]>();
-            var res = new TDst[source.Length];
-            var index = -1; // we will start with increment
-            var len = source.Length;
-            var pending = len;
-
-            Action<int> callback = null;
-            callback = (current) => {
-                if (current < len) {
-                    transform(source[current])
-                        .Then(
-                            x => {
-                                res[current] = x;
-                                if (Interlocked.Decrement(ref pending) == 0)
-                                    promise.Resolve(res);
-                                else
-                                    callback(Interlocked.Increment(ref index));
-                            },
-                            e => promise.Reject(e)
-                        );
-                }
-            };
-
-            for (int i = 0; i < threads; i++)
-                callback(Interlocked.Increment(ref index));
-            return promise;
-        }
-         */
     }
 }