CyclicDeque.cs System::Threading::Tasks::CircularArray System System::Threading System::Threading::Tasks // //CyclicDeque.cs // //Author: //Jérémie"Garuma"Laval<jeremie.laval@gmail.com> // //Copyright(c)2009Jérémie"Garuma"Laval // //Permissionisherebygranted,freeofcharge,toanypersonobtainingacopy //ofthissoftwareandassociateddocumentationfiles(the"Software"),todeal //intheSoftwarewithoutrestriction,includingwithoutlimitationtherights //touse,copy,modify,merge,publish,distribute,sublicense,and/orsell //copiesoftheSoftware,andtopermitpersonstowhomtheSoftwareis //furnishedtodoso,subjecttothefollowingconditions: // //Theabovecopyrightnoticeandthispermissionnoticeshallbeincludedin //allcopiesorsubstantialportionsoftheSoftware. // //THESOFTWAREISPROVIDED"ASIS",WITHOUTWARRANTYOFANYKIND,EXPRESSOR //IMPLIED,INCLUDINGBUTNOTLIMITEDTOTHEWARRANTIESOFMERCHANTABILITY, //FITNESSFORAPARTICULARPURPOSEANDNONINFRINGEMENT.INNOEVENTSHALLTHE //AUTHORSORCOPYRIGHTHOLDERSBELIABLEFORANYCLAIM,DAMAGESOROTHER //LIABILITY,WHETHERINANACTIONOFCONTRACT,TORTOROTHERWISE,ARISINGFROM, //OUTOFORINCONNECTIONWITHTHESOFTWAREORTHEUSEOROTHERDEALINGSIN //THESOFTWARE. #ifNET_4_0||UNITY_5_3_OR_NEWER usingSystem; usingSystem.Collections.Generic; usingSystem.Threading; #ifINSIDE_MONO_PARALLEL namespaceMono.Threading.Tasks #else namespaceSystem.Threading.Tasks #endif { #ifINSIDE_MONO_PARALLEL public #endif classCyclicDeque<T>:IConcurrentDeque<T> { constintBaseSize=11; longbottom; longtop; longupperBound; CircularArray<T>array=newCircularArray<T>(BaseSize); publicvoidPushBottom(Tobj) { /*Readisimplementedasasimpleloadoperationon64bits *sononeedtomakethedistinctionourselves */ longb=Interlocked.Read(refbottom); vara=array; //Takecareofgrowing if(b-upperBound>=a.Size-1){ upperBound=Interlocked.Read(reftop); a=a.Grow(b,upperBound); array=a; } //Registerthenewvalue a.segment[b%a.size]=obj; Interlocked.Increment(refbottom); } publicPopResultPopBottom(outTobj) { obj=default(T); longb=Interlocked.Decrement(refbottom); vara=array; longt=Interlocked.Read(reftop); longsize=b-t; if(size<0){ //Setbottomtot Interlocked.Add(refbottom,t-b); returnPopResult.Empty; } obj=a.segment[b%a.size]; if(size>0) returnPopResult.Succeed; Interlocked.Add(refbottom,t+1-b); if(Interlocked.CompareExchange(reftop,t+1,t)!=t) returnPopResult.Empty; returnPopResult.Succeed; } publicboolPeekBottom(outTobj) { obj=default(T); longb=Interlocked.Decrement(refbottom); vara=array; longt=Interlocked.Read(reftop); longsize=b-t; if(size<0) returnfalse; obj=a.segment[b%a.size]; returntrue; } publicPopResultPopTop(outTobj) { obj=default(T); longt=Interlocked.Read(reftop); longb=Interlocked.Read(refbottom); if(b-t<=0) returnPopResult.Empty; if(Interlocked.CompareExchange(reftop,t+1,t)!=t) returnPopResult.Abort; vara=array; obj=a.segment[t%a.size]; returnPopResult.Succeed; } internalboolPeekTop(outTobj) { obj=default(T); longt=Interlocked.Read(reftop); longb=Interlocked.Read(refbottom); if(b-t<=0) returnfalse; vara=array; obj=a.segment[t%a.size]; returntrue; } publicIEnumerable<T>GetEnumerable() { vara=array; returna.GetEnumerable(bottom,reftop); } publicboolIsEmpty{ get{ longt=Interlocked.Read(reftop); longb=Interlocked.Read(refbottom); returnb-t<=0; } } } internalclassCircularArray<T> { readonlyintbaseSize; publicreadonlyintsize; publicreadonlyT[]segment; publicCircularArray(intbaseSize) { this.baseSize=baseSize; this.size=1<<baseSize; this.segment=newT[size]; } publiclongSize{ get{ returnsize; } } publicTthis[longindex]{ get{ returnsegment[index%size]; } set{ segment[index%size]=value; } } publicCircularArray<T>Grow(longbottom,longtop) { vargrow=newCircularArray<T>(baseSize+1); for(longi=top;i<bottom;i++){ grow.segment[i]=segment[i%size]; } returngrow; } publicIEnumerable<T>GetEnumerable(longbottom,reflongtop) { longinstantTop=top; T[]slice=newT[bottom-instantTop]; intdestIndex=-1; for(longi=instantTop;i<bottom;i++) slice[++destIndex]=segment[i%size]; returnRealGetEnumerable(slice,bottom,top,instantTop); } IEnumerable<T>RealGetEnumerable(T[]slice,longbottom,longrealTop,longinitialTop) { intdestIndex=(int)(realTop-initialTop-1); for(longi=realTop;i<bottom;++i) yieldreturnslice[++destIndex]; } } } #endif