ConcurrentQueue.cs System::Collections::Concurrent::ConcurrentQueue System::Collections::Concurrent::ConcurrentQueue::Node System System::Collections System::Collections::Concurrent //ConcurrentQueue.cs // //Copyright(c)2008Jé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.Threading; usingSystem.Collections; usingSystem.Collections.Generic; usingSystem.Runtime.Serialization; namespaceSystem.Collections.Concurrent { [System.Diagnostics.DebuggerDisplay("Count={Count}")] [System.Diagnostics.DebuggerTypeProxy(typeof(CollectionDebuggerView<>))] publicclassConcurrentQueue<T>:IProducerConsumerCollection<T>,IEnumerable<T>,ICollection, IEnumerable { classNode { publicTValue; publicNodeNext; } Nodehead=newNode(); Nodetail; intcount; publicConcurrentQueue() { tail=head; } publicConcurrentQueue(IEnumerable<T>collection):this() { foreach(Titemincollection) Enqueue(item); } publicvoidEnqueue(Titem) { Nodenode=newNode(); node.Value=item; NodeoldTail=null; NodeoldNext=null; boolupdate=false; while(!update){ oldTail=tail; oldNext=oldTail.Next; //Didtailwasalreadyupdated? if(tail==oldTail){ if(oldNext==null){ //Theplaceisforus update=AotInterlocked.CompareExchange(reftail.Next,node,null)==null; }else{ //anotherThreadalreadyusedtheplacesogivehimahandbyputtingtailwhereitshouldbe AotInterlocked.CompareExchange(reftail,oldNext,oldTail); } } } //Atthispointweaddedcorrectlyournode,nowwehavetoupdatetail.Ifitfailsthenitwillbedonebyanotherthread AotInterlocked.CompareExchange(reftail,node,oldTail); Interlocked.Increment(refcount); } boolIProducerConsumerCollection<T>.TryAdd(Titem) { Enqueue(item); returntrue; } publicboolTryDequeue(outTresult) { result=default(T); booladvanced=false; while(!advanced){ NodeoldHead=head; NodeoldTail=tail; NodeoldNext=oldHead.Next; if(oldHead==head){ //Emptycase? if(oldHead==oldTail){ //Thisshouldbefalsethen if(oldNext!=null){ //Ifnotthenthelinkedlistismalformed,updatetail AotInterlocked.CompareExchange(reftail,oldNext,oldTail); continue; } result=default(T); returnfalse; }else{ result=oldNext.Value; advanced=AotInterlocked.CompareExchange(refhead,oldNext,oldHead)==oldHead; } } } Interlocked.Decrement(refcount); returntrue; } publicboolTryPeek(outTresult) { if(IsEmpty){ result=default(T); returnfalse; } Nodefirst=head.Next; result=first.Value; returntrue; } internalvoidClear() { count=0; tail=head=newNode(); } IEnumeratorIEnumerable.GetEnumerator() { return(IEnumerator)InternalGetEnumerator(); } publicIEnumerator<T>GetEnumerator() { returnInternalGetEnumerator(); } IEnumerator<T>InternalGetEnumerator() { Nodemy_head=head; while((my_head=my_head.Next)!=null){ yieldreturnmy_head.Value; } } voidICollection.CopyTo(Arrayarray,intindex) { if(array==null) thrownewArgumentNullException("array"); if(array.Rank>1) thrownewArgumentException("Thearraycan'tbemultidimensional"); if(array.GetLowerBound(0)!=0) thrownewArgumentException("Thearrayneedstobe0-based"); T[]dest=arrayasT[]; if(dest==null) thrownewArgumentException("Thearraycannotbecasttothecollectionelementtype","array"); CopyTo(dest,index); } publicvoidCopyTo(T[]array,intindex) { if(array==null) thrownewArgumentNullException("array"); if(index<0) thrownewArgumentOutOfRangeException("index"); if(index>=array.Length) thrownewArgumentException("indexisequalsorgreatherthanarraylength","index"); IEnumerator<T>e=InternalGetEnumerator(); inti=index; while(e.MoveNext()){ if(i==array.Length-index) thrownewArgumentException("Thenumberofelememtsinthecollectionexceedsthecapacityofarray","array"); array[i++]=e.Current; } } publicT[]ToArray() { returnnewList<T>(this).ToArray(); } boolICollection.IsSynchronized{ get{returntrue;} } boolIProducerConsumerCollection<T>.TryTake(outTitem) { returnTryDequeue(outitem); } objectsyncRoot=newobject(); objectICollection.SyncRoot{ get{returnsyncRoot;} } publicintCount{ get{ returncount; } } publicboolIsEmpty{ get{ returncount==0; } } } } #endif