Code:
/ 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / Core / System / Linq / Parallel / Utils / Set.cs / 1305376 / Set.cs
// ==++== // // Copyright (c) Microsoft Corporation. All rights reserved. // // ==--== // =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ // // Util.cs // //[....] // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- using System.Collections.Generic; namespace System.Linq.Parallel { ////// A set for various operations. Shamelessly stolen from LINQ's source code. /// @ internal class Set { int[] buckets; Slot[] slots; int count; int freeList; IEqualityComparer comparer; internal Set() : this(null) { } internal Set(IEqualityComparer comparer) { if (comparer == null) comparer = EqualityComparer .Default; this.comparer = comparer; buckets = new int[7]; slots = new Slot[7]; freeList = -1; } // If value is not in set, add it and return true; otherwise return false internal bool Add(TElement value) { return !Find(value, true); } // Check whether value is in set internal bool Contains(TElement value) { return Find(value, false); } // If value is in set, remove it and return true; otherwise return false internal bool Remove(TElement value) { int hashCode = comparer.GetHashCode(value) & 0x7FFFFFFF; int bucket = hashCode % buckets.Length; int last = -1; for (int i = buckets[bucket] - 1; i >= 0; last = i, i = slots[i].next) { if (slots[i].hashCode == hashCode && comparer.Equals(slots[i].value, value)) { if (last < 0) { buckets[bucket] = slots[i].next + 1; } else { slots[last].next = slots[i].next; } slots[i].hashCode = -1; slots[i].value = default(TElement); slots[i].next = freeList; freeList = i; return true; } } return false; } internal bool Find(TElement value, bool add) { int hashCode = comparer.GetHashCode(value) & 0x7FFFFFFF; for (int i = buckets[hashCode % buckets.Length] - 1; i >= 0; i = slots[i].next) { if (slots[i].hashCode == hashCode && comparer.Equals(slots[i].value, value)) return true; } if (add) { int index; if (freeList >= 0) { index = freeList; freeList = slots[index].next; } else { if (count == slots.Length) Resize(); index = count; count++; } int bucket = hashCode % buckets.Length; slots[index].hashCode = hashCode; slots[index].value = value; slots[index].next = buckets[bucket] - 1; buckets[bucket] = index + 1; } return false; } void Resize() { int newSize = checked(count * 2 + 1); int[] newBuckets = new int[newSize]; Slot[] newSlots = new Slot[newSize]; Array.Copy(slots, 0, newSlots, 0, count); for (int i = 0; i < count; i++) { int bucket = newSlots[i].hashCode % newSize; newSlots[i].next = newBuckets[bucket] - 1; newBuckets[bucket] = i + 1; } buckets = newBuckets; slots = newSlots; } internal struct Slot { internal int hashCode; internal TElement value; internal int next; } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. // ==++== // // Copyright (c) Microsoft Corporation. All rights reserved. // // ==--== // =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ // // Util.cs // // [....] // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- using System.Collections.Generic; namespace System.Linq.Parallel { ////// A set for various operations. Shamelessly stolen from LINQ's source code. /// @ internal class Set { int[] buckets; Slot[] slots; int count; int freeList; IEqualityComparer comparer; internal Set() : this(null) { } internal Set(IEqualityComparer comparer) { if (comparer == null) comparer = EqualityComparer .Default; this.comparer = comparer; buckets = new int[7]; slots = new Slot[7]; freeList = -1; } // If value is not in set, add it and return true; otherwise return false internal bool Add(TElement value) { return !Find(value, true); } // Check whether value is in set internal bool Contains(TElement value) { return Find(value, false); } // If value is in set, remove it and return true; otherwise return false internal bool Remove(TElement value) { int hashCode = comparer.GetHashCode(value) & 0x7FFFFFFF; int bucket = hashCode % buckets.Length; int last = -1; for (int i = buckets[bucket] - 1; i >= 0; last = i, i = slots[i].next) { if (slots[i].hashCode == hashCode && comparer.Equals(slots[i].value, value)) { if (last < 0) { buckets[bucket] = slots[i].next + 1; } else { slots[last].next = slots[i].next; } slots[i].hashCode = -1; slots[i].value = default(TElement); slots[i].next = freeList; freeList = i; return true; } } return false; } internal bool Find(TElement value, bool add) { int hashCode = comparer.GetHashCode(value) & 0x7FFFFFFF; for (int i = buckets[hashCode % buckets.Length] - 1; i >= 0; i = slots[i].next) { if (slots[i].hashCode == hashCode && comparer.Equals(slots[i].value, value)) return true; } if (add) { int index; if (freeList >= 0) { index = freeList; freeList = slots[index].next; } else { if (count == slots.Length) Resize(); index = count; count++; } int bucket = hashCode % buckets.Length; slots[index].hashCode = hashCode; slots[index].value = value; slots[index].next = buckets[bucket] - 1; buckets[bucket] = index + 1; } return false; } void Resize() { int newSize = checked(count * 2 + 1); int[] newBuckets = new int[newSize]; Slot[] newSlots = new Slot[newSize]; Array.Copy(slots, 0, newSlots, 0, count); for (int i = 0; i < count; i++) { int bucket = newSlots[i].hashCode % newSize; newSlots[i].next = newBuckets[bucket] - 1; newBuckets[bucket] = i + 1; } buckets = newBuckets; slots = newSlots; } internal struct Slot { internal int hashCode; internal TElement value; internal int next; } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007.
Link Menu

This book is available now!
Buy at Amazon US or
Buy at Amazon UK
- XmlBindingWorker.cs
- AudioDeviceOut.cs
- ContextBase.cs
- Configuration.cs
- TextTreeRootTextBlock.cs
- UpdateException.cs
- Literal.cs
- ControlEvent.cs
- XomlCompilerHelpers.cs
- SafeNativeMethodsCLR.cs
- FormsAuthenticationTicket.cs
- PageRanges.cs
- WorkflowFileItem.cs
- AggregateNode.cs
- XmlMtomWriter.cs
- ConsumerConnectionPointCollection.cs
- GACMembershipCondition.cs
- sqlstateclientmanager.cs
- LinearQuaternionKeyFrame.cs
- figurelengthconverter.cs
- CallContext.cs
- DataControlFieldsEditor.cs
- AsyncPostBackErrorEventArgs.cs
- TextViewElement.cs
- RawMouseInputReport.cs
- RelationshipConverter.cs
- SequenceRangeCollection.cs
- PageThemeBuildProvider.cs
- HttpCacheParams.cs
- CardSpaceException.cs
- GroupItem.cs
- SourceFileBuildProvider.cs
- RectAnimationBase.cs
- FloaterParaClient.cs
- MultiBindingExpression.cs
- UnsafeNativeMethods.cs
- ThemeInfoAttribute.cs
- PassportAuthentication.cs
- PolyBezierSegmentFigureLogic.cs
- PkcsMisc.cs
- isolationinterop.cs
- HwndHost.cs
- webbrowsersite.cs
- ToolBarPanel.cs
- DTCTransactionManager.cs
- SHA512.cs
- KeyValuePair.cs
- FileLoadException.cs
- Image.cs
- ListViewItemMouseHoverEvent.cs
- CompleteWizardStep.cs
- tibetanshape.cs
- CellCreator.cs
- AppDomainShutdownMonitor.cs
- SeekStoryboard.cs
- EncryptedData.cs
- SurrogateSelector.cs
- GPPOINT.cs
- KerberosTicketHashIdentifierClause.cs
- ProviderConnectionPointCollection.cs
- DBCommand.cs
- MetabaseReader.cs
- HotSpot.cs
- LogReservationCollection.cs
- ProgressiveCrcCalculatingStream.cs
- FacetDescriptionElement.cs
- XmlSerializer.cs
- ScrollViewerAutomationPeer.cs
- ResourceManagerWrapper.cs
- DataRowChangeEvent.cs
- MetafileHeader.cs
- MessageHeaderInfoTraceRecord.cs
- RadioButton.cs
- TimelineCollection.cs
- FacetDescription.cs
- ListViewSortEventArgs.cs
- DefaultWorkflowTransactionService.cs
- FrameworkContentElement.cs
- HttpRequest.cs
- OdbcEnvironmentHandle.cs
- ProtocolsSection.cs
- TabletDevice.cs
- SafeBuffer.cs
- ListItemCollection.cs
- CompModSwitches.cs
- X509ScopedServiceCertificateElement.cs
- Point3DCollectionConverter.cs
- ListView.cs
- InputReport.cs
- SmtpNetworkElement.cs
- XXXOnTypeBuilderInstantiation.cs
- Scripts.cs
- GenerateHelper.cs
- DayRenderEvent.cs
- GroupBox.cs
- AdRotator.cs
- ISO2022Encoding.cs
- DrawingServices.cs
- CharEntityEncoderFallback.cs
- ToolbarAUtomationPeer.cs