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
- BaseValidator.cs
- SamlAdvice.cs
- SelectorItemAutomationPeer.cs
- SettingsProviderCollection.cs
- GridViewItemAutomationPeer.cs
- ActivationArguments.cs
- ListInitExpression.cs
- TableRow.cs
- ResourceDisplayNameAttribute.cs
- Line.cs
- HyperLink.cs
- DataTemplateKey.cs
- TabControl.cs
- embossbitmapeffect.cs
- SelectionChangedEventArgs.cs
- ExtensionElementCollection.cs
- BrowserCapabilitiesCompiler.cs
- HelloMessage11.cs
- MembershipSection.cs
- StreamReader.cs
- LogConverter.cs
- XmlNodeList.cs
- CheckPair.cs
- UnsafeNativeMethods.cs
- ConstructorNeedsTagAttribute.cs
- MenuItemStyle.cs
- MemoryStream.cs
- TcpClientSocketManager.cs
- DiscoveryDocumentLinksPattern.cs
- ProfileSettings.cs
- CollectionBuilder.cs
- AmbientLight.cs
- EnumerableWrapperWeakToStrong.cs
- DbgUtil.cs
- NumberFormatInfo.cs
- TableColumnCollection.cs
- OciEnlistContext.cs
- FileSystemInfo.cs
- ViewStateModeByIdAttribute.cs
- ServerTooBusyException.cs
- TabletCollection.cs
- ScriptReferenceBase.cs
- BindingGroup.cs
- XamlReader.cs
- WebContext.cs
- DataGridTableCollection.cs
- ConfigurationPropertyAttribute.cs
- URI.cs
- WebPartEditVerb.cs
- Stroke.cs
- AnnouncementEndpoint.cs
- SqlConnection.cs
- StreamingContext.cs
- LinqDataView.cs
- ResourceAssociationSet.cs
- CngKeyBlobFormat.cs
- MeasurementDCInfo.cs
- ChangeToolStripParentVerb.cs
- FieldMetadata.cs
- PassportIdentity.cs
- MarshalByRefObject.cs
- BufferedConnection.cs
- diagnosticsswitches.cs
- GlyphTypeface.cs
- RoutedEventConverter.cs
- RewritingPass.cs
- MatrixTransform.cs
- ExpressionParser.cs
- CodeDirectoryCompiler.cs
- QuadraticEase.cs
- DataGridViewRowConverter.cs
- TextEditorParagraphs.cs
- ApplicationGesture.cs
- MimeFormImporter.cs
- RegistrationProxy.cs
- InternalSafeNativeMethods.cs
- CompareInfo.cs
- ComponentChangedEvent.cs
- EllipseGeometry.cs
- ClientBuildManagerTypeDescriptionProviderBridge.cs
- TextParagraph.cs
- ActivitySurrogate.cs
- AddInPipelineAttributes.cs
- XamlUtilities.cs
- ChineseLunisolarCalendar.cs
- Int16AnimationUsingKeyFrames.cs
- ListViewGroupItemCollection.cs
- RowToFieldTransformer.cs
- xmlfixedPageInfo.cs
- HandledMouseEvent.cs
- BitmapFrameDecode.cs
- StyleModeStack.cs
- MaterialGroup.cs
- TypeSemantics.cs
- PlainXmlSerializer.cs
- AssemblyCache.cs
- FunctionNode.cs
- XpsFontSubsetter.cs
- WebPartEditorApplyVerb.cs
- StorageInfo.cs