ConcurrentBag.cs System::Collections::Concurrent::ConcurrentBag System System::Collections System::Collections::Concurrent // //ConcurrentBag.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; usingSystem.Collections.Generic; usingSystem.Diagnostics; usingSystem.Runtime.InteropServices; usingSystem.Threading; usingSystem.Threading.Tasks; namespaceSystem.Collections.Concurrent { [ComVisible(false)] [DebuggerDisplay("Count={Count}")] [DebuggerTypeProxy(typeof(CollectionDebuggerView<>))] publicclassConcurrentBag<T>:IProducerConsumerCollection<T>,IEnumerable<T>,IEnumerable { //Westorehintsinalong longhints; intcount; //Thecontainerareaiswherebagareaddedforeachthread ConcurrentDictionary<int, CyclicDeque<T>>container=newConcurrentDictionary<int, CyclicDeque<T>>(); //Thestagingareaiswherenon-emptybagarelocatedforfastiteration ConcurrentDictionary<int, CyclicDeque<T>>staging=newConcurrentDictionary<int, CyclicDeque<T>>(); publicConcurrentBag() { } publicConcurrentBag(IEnumerable<T>collection):this() { foreach(Titemincollection) Add(item); } publicvoidAdd(Titem) { intindex; CyclicDeque<T>bag=GetBag(outindex); bag.PushBottom(item); AddHint(index); Interlocked.Increment(refcount); } boolIProducerConsumerCollection<T>.TryAdd(Telement) { Add(element); returntrue; } publicboolTryTake(outTresult) { result=default(T); if(count==0) returnfalse; inthintIndex; CyclicDeque<T>bag=GetBag(outhintIndex,false); boolret=true; if(bag==null||bag.PopBottom(outresult)!=PopResult.Succeed){ varself=bag; foreach(varotherinstaging){ //Trytoretrievesomethingbasedonahint ret=TryGetHint(outhintIndex)&&(bag=container[hintIndex]).PopTop(outresult)==PopResult.Succeed; //Wefallbacktotestingourslot if(!ret&&other.Value!=self){ varstatus=other.Value.PopTop(outresult); while(status==PopResult.Abort) status=other.Value.PopTop(outresult); ret=status==PopResult.Succeed; hintIndex=other.Key; bag=other.Value; } //Ifwefoundsomething,stop if(ret) break; } } if(ret){ TidyBag(hintIndex,bag); Interlocked.Decrement(refcount); } returnret; } publicboolTryPeek(outTresult) { result=default(T); if(count==0) returnfalse; inthintIndex; CyclicDeque<T>bag=GetBag(outhintIndex,false); boolret=true; if(bag==null||!bag.PeekBottom(outresult)){ varself=bag; foreach(varotherinstaging){ //Trytoretrievesomethingbasedonahint ret=TryGetHint(outhintIndex)&&container[hintIndex].PeekTop(outresult); //Wefallbacktotestingourslot if(!ret&&other.Value!=self) ret=other.Value.PeekTop(outresult); //Ifwefoundsomething,stop if(ret) break; } } returnret; } voidAddHint(intindex) { //Weonlytakethreadindexthatcanbestoredin5bits(i.e.threadids1-15) if(index>0xF) return; varhs=hints; //Ifcasfailedthenwedon'tretry Interlocked.CompareExchange(refhints,(long)(((ulong)hs)<<4|(uint)index),(long)hs); } boolTryGetHint(outintindex) { /*Funnylittlethingtoknow,sincehintsisalong(becauseCAShasnoulongoverload), *ashift-rightoperationisanarithmeticshiftwhichmightsethigh-orderrightbits *to1insteadof0ifthenumberturnsnegative. */ varhs=hints; index=0; if(Interlocked.CompareExchange(refhints,(long)(((ulong)hs)>>4),hs)==hs) index=(int)(hs&0xF); returnindex>0; } publicintCount{ get{ returncount; } } publicboolIsEmpty{ get{ returncount==0; } } objectSystem.Collections.ICollection.SyncRoot{ get{ returnthis; } } boolSystem.Collections.ICollection.IsSynchronized{ get{ returntrue; } } IEnumeratorIEnumerable.GetEnumerator() { returnGetEnumeratorInternal(); } publicIEnumerator<T>GetEnumerator() { returnGetEnumeratorInternal(); } IEnumerator<T>GetEnumeratorInternal() { foreach(varbagincontainer) foreach(Titeminbag.Value.GetEnumerable()) yieldreturnitem; } voidSystem.Collections.ICollection.CopyTo(Arrayarray,intindex) { T[]a=arrayasT[]; if(a==null) return; CopyTo(a,index); } publicvoidCopyTo(T[]array,intindex) { intc=count; if(array.Length<c+index) thrownewInvalidOperationException("Arrayisnotbigenough"); CopyTo(array,index,c); } voidCopyTo(T[]array,intindex,intnum) { inti=index; foreach(Titeminthis){ if(i>=num) break; array[i++]=item; } } publicT[]ToArray() { intc=count; T[]temp=newT[c]; CopyTo(temp,0,c); returntemp; } intGetIndex() { returnThread.CurrentThread.ManagedThreadId; } CyclicDeque<T>GetBag(outintindex,boolcreateBag=true) { index=GetIndex(); CyclicDeque<T>value; if(container.TryGetValue(index,outvalue)) returnvalue; varbag=createBag?container.GetOrAdd(index,newCyclicDeque<T>()):null; if(bag!=null) staging.TryAdd(index,bag); returnbag; } voidTidyBag(intindex,CyclicDeque<T>bag) { if(bag!=null&&bag.IsEmpty){ if(staging.TryRemove(index,outbag)&&!bag.IsEmpty) staging.TryAdd(index,bag); } } } } #endif