p u b l i c s t a t i c P a r a l l e l Loop R e s u lt F o r ( i n t froml n c l u s iv e , int to E x c l u s ive, int s t e p , Action < i nt , P a r a l l e lState> body , T a s kManager t a s kManage r , T a s k C reat ionOpt ions options public s t a t i c P a r a l l e l Loop R e s u l t F o r < T L oc a l > ( int from l n c l u s ive, int toExc l u s ive , int step , F u n c < TLoc a l > t h read Loc a l l n it , Action < i nt , P a r a l lelState<TLoc a l body , Action < T Loc a l > t h readLoc a l F i n a l l y , Tas kMa nager t a s kManage r , Tas kCreat ionOpt ions options

I I Many overloa d s of F o r omitted p u b l i c s t a t i c P a r a l l e l Loop R e s u l t F o r ( long froml n c l u s ive, long toExc l u s ive , Act ion < long> body

p u b l i c s t a t i c P a r a l l e l Loo p R e s u l t F o r ( l o n g from l n c l u s iv e , long t o E x c l u s ive , long step , Action < lo n g , P a r a l lelState> body , Ta s kManager t a s kManager, T a s k C reat ionOpt ions opt ion s

p u b l i c s t a t i c Para l lel Loo p Re s u lt F o r < T Loc a l > ( long from l n c l u s ive, long t o E x c l u s iv e , long step, F u n c <TLoc a l > t h readLoc a l l n i t , Action < long, P a r a l lelState<TLoc a l Act ion < T Loc a l > t h read Loc a l F i n a l l y , Ta s kManager t a s kMa n a g e r , T a s k C reationOpt ions o p t i o n s

bod y ,

I I M a n y overloa d s of F o r64 omitted p u b l i c s t a t i c P a r a l l e l Loop R e s u lt F o r E a c h < TSou r c e > (

I E numera b l e < TSou r c e > s o u r c e , Act i o n < TSou r c e > body ); p u b l i c stat i c P a r a l lel Loop R e s u lt F o r E a c h < TSou r c e > ( I E n um e r a b l e < TSou r c e > sou r c e , Act i o n < TSo u r c e , i n t , P a r a l l e lStat e > body , T a s kMa n a g e r t a s kManage r , T a s k C reationOpt i o n s options ); public s t a t i c P a r a l l e l Loop R e s u lt F o r E a c h < TSou r c e , TLoc a l > ( I E numerable<TSo u r c e > sou r c e , F u n c < T L oc a l > t h read Loc a l l n it , Act io n < TSou r c e , int , P a r a l lelState<TLoc a l body , Act ion< TLoc a l > t h read Loc a l F i n a l l y , T a s kMa n a g e r t a s kManage r , T a s k C reat ionOpt i o n s options ); I I Many ove rload s of ForEach omitted p u b l i c s t a t i c void I nvoke ( pa r a m s Action [ ] a c t i o n s ) ; p u b l i c s t a t i c void I nvoke ( Action [ ] a c t ion s , T a s kManager m a n a g e r , T a s k C reat ionOpt ions options ); }

Each of these APIs offers several overloads to accommodate slightly dif ferent ways in which they can be used For example, each of the different APIs offers a way to plug in a custom Ta s kM a n a g e r and set of Ta s kC r e a t i o n O pt i o n s Many, many overloads have been omitted t o save space; instead, the simplest and most general purpose are shown All of these APIs are structured, however, meaning that the tasks they generate internally will have completed before the time the API returns This ensures that any exceptions thrown from actions invoked within are propagated correctly out of the call to the specific method The goal of the F o r API is to allow easy replacement of existing for loops, and similarly with F o r E a c h, to allow easy replacement of existing f o r e a c h loops They take a simple Ac t i o n < T > delegate, where T is i n t for the 32-bit overloads, l o n g in the case of the 64-bit overloads, and TSo u r c e in the case of F o r E a c h < TSou r c e >