Lines Matching refs:poolInstance
3934 __gshared TaskPool poolInstance; in version() local
3952 poolInstance = new TaskPool(2);
3953 scope(exit) poolInstance.stop();
3958 auto oldPriority = poolInstance.priority;
3959 poolInstance.priority = Thread.PRIORITY_MAX;
3960 assert(poolInstance.priority == Thread.PRIORITY_MAX);
3962 poolInstance.priority = Thread.PRIORITY_MIN;
3963 assert(poolInstance.priority == Thread.PRIORITY_MIN);
3965 poolInstance.priority = oldPriority;
3966 assert(poolInstance.priority == oldPriority);
3977 poolInstance.put(t);
3982 poolInstance.put(t2);
3988 poolInstance.put(st);
3993 poolInstance.put(st2);
4037 foreach (i, ref elem; poolInstance.parallel(arr))
4057 poolInstance.put(addTask);
4058 poolInstance.put(addScopedTask);
4065 foreach (i, elem; poolInstance.parallel(range))
4073 foreach (i, ref elem; poolInstance.parallel(logs))
4083 assert(poolInstance.amap!"a * a"([1,2,3,4,5]) == [1,4,9,16,25]);
4084 assert(poolInstance.amap!"a * a"([1,2,3,4,5], new long[5]) == [1,4,9,16,25]);
4085 assert(poolInstance.amap!("a * a", "-a")([1,2,3]) ==
4089 poolInstance.amap!("a * a", "-a")([1,2,3], tupleBuf);
4091 poolInstance.amap!("a * a", "-a")([1,2,3], 5, tupleBuf);
4097 poolInstance.amap!"a * 2"([1, 2, 3, 4, 5], ind);
4100 poolInstance.amap!"a / 2"(ind, ind);
4105 poolInstance.amap!"a * a"([1,2,3,4,5], buf);
4107 poolInstance.amap!"a * a"([1,2,3,4,5], 4, buf);
4110 assert(poolInstance.reduce!"a + b"([1]) == 1);
4111 assert(poolInstance.reduce!"a + b"([1,2,3,4]) == 10);
4112 assert(poolInstance.reduce!"a + b"(0.0, [1,2,3,4]) == 10);
4113 assert(poolInstance.reduce!"a + b"(0.0, [1,2,3,4], 1) == 10);
4114 assert(poolInstance.reduce!(min, max)([1,2,3,4]) == tuple(1, 4));
4115 assert(poolInstance.reduce!("a + b", "a * b")(tuple(0, 1), [1,2,3,4]) ==
4119 assert(poolInstance.reduce!"a + b"(0, iota(1000)) == serialAns);
4120 assert(poolInstance.reduce!"a + b"(iota(1000)) == serialAns);
4123 auto wl = poolInstance.workerLocalStorage(0);
4124 foreach (i; poolInstance.parallel(iota(1000), 1))
4130 auto parallelSum = poolInstance.reduce!"a + b"(wlRange);
4178 poolInstance.map!"a * a"(iota(30_000_001), 10_000),
4185 poolInstance.map!"a * a"(
4193 poolInstance.map!"a * a"(iota(3_000_001), 10_000)
4202 poolInstance.asyncBuf(filter!"a == a"(iota(1_000_002)))
4249 auto abuf = poolInstance.asyncBuf(iota(-1.0, 3_000_000), 100);
4250 auto temp = poolInstance.map!sqrt(
4253 auto lmchain = poolInstance.map!"a * a"(temp, 100, 5);
4267 abuf = poolInstance.asyncBuf(iota(-1.0, 1_000_000), 100);
4286 assert(poolInstance.workerIndex == 0);
4289 foreach (i; poolInstance.parallel(iota(1000), 1))
4311 poolInstance.reduce!reduceException(iota(3))
4320 poolInstance.amap!mapException(iota(3))
4325 auto m = poolInstance.map!mapException(iota(3)); in mapThrow()
4344 assertThrown!Exception(poolInstance.asyncBuf(ThrowingRange.init));
4360 poolInstance = new TaskPool(poolSize); in version()
4364 foreach (i; poolInstance.parallel( iota(0, numbers.length)) ) in version()
4379 foreach (num; poolInstance.parallel(myNumbers)) in version()
4385 uint[] squares = poolInstance.amap!"a * a"(numbers, 100); in version()
4394 poolInstance.put(sumFuture); in version()
4405 auto mySumParallel = poolInstance.reduce!"a + b"(numbers); in version()
4413 poolInstance.put(myTask); in version()
4418 foreach (i, letter; poolInstance.parallel(nestedOuter, 1)) in version()
4420 foreach (j, number; poolInstance.parallel(nestedInner, 1)) in version()
4426 poolInstance.stop(); in version()
4441 poolInstance = new TaskPool(poolSize); in version()
4444 stderr.writeln("Creator Raw Index: ", poolInstance.threadIndex); in version()
4445 assert(poolInstance.workerIndex() == 0); in version()
4448 auto workerLocalStorage = poolInstance.workerLocalStorage!uint(1); in version()
4449 foreach (i; poolInstance.parallel(iota(0U, 1_000_000))) in version()
4454 1_000_000 + poolInstance.size + 1); in version()
4460 foreach (thread; poolInstance.pool) in version()
4466 foreach (i; poolInstance.parallel( iota(0, 1_000_000), 100 )) in version()
4481 foreach (i; poolInstance.parallel( iota(0, matrix.length) )) in version()
4483 foreach (j; poolInstance.parallel( iota(0, matrix[0].length) )) in version()
4497 return poolInstance.amap!mySqrt(nums); in version()
4500 real[][] sqrtMatrix = poolInstance.amap!parallelSqrt(matrix); in version()
4517 poolInstance.put(saySuccess); in version()
4525 return poolInstance.reduce!"a + b"(input); in version()
4528 auto sumSqrt = poolInstance.reduce!"a + b"( in version()
4529 poolInstance.amap!parallelSum( in version()
4539 poolInstance.put(nanTask); in version()
4542 if (poolInstance.size > 0) in version()
4557 poolInstance.put(uselessTask); in version()
4586 foreach (ref elem; poolInstance.parallel(refRange)) in version()
4593 poolInstance.stop(); in version()