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
- InternalConfigHost.cs
- XmlEnumAttribute.cs
- EventLogInternal.cs
- CodeDefaultValueExpression.cs
- PackageStore.cs
- DataGridViewSelectedCellsAccessibleObject.cs
- NextPreviousPagerField.cs
- arc.cs
- StyleXamlParser.cs
- DisplayNameAttribute.cs
- SoapSchemaExporter.cs
- FaultCallbackWrapper.cs
- TableDesigner.cs
- VoiceInfo.cs
- PublisherIdentityPermission.cs
- ChainOfDependencies.cs
- mongolianshape.cs
- CqlIdentifiers.cs
- WorkflowInstanceAbortedRecord.cs
- PtsPage.cs
- Base64Encoder.cs
- DesignerForm.cs
- OletxDependentTransaction.cs
- LineGeometry.cs
- TakeQueryOptionExpression.cs
- ConstrainedDataObject.cs
- Metafile.cs
- GeneralTransformGroup.cs
- AmbientLight.cs
- Transform3D.cs
- FileLoadException.cs
- Decorator.cs
- Base64Stream.cs
- SerTrace.cs
- StorageEntityContainerMapping.cs
- ModuleConfigurationInfo.cs
- SeekStoryboard.cs
- Font.cs
- FontNamesConverter.cs
- DefaultValueTypeConverter.cs
- TreeNodeCollectionEditor.cs
- TimeStampChecker.cs
- PrintDialog.cs
- RegisteredScript.cs
- DocumentViewerBaseAutomationPeer.cs
- PropertyManager.cs
- ColorMap.cs
- DateTimeUtil.cs
- ScrollPattern.cs
- ScalarOps.cs
- CollectionsUtil.cs
- SafeNativeMethods.cs
- GPStream.cs
- SettingsSavedEventArgs.cs
- MultiView.cs
- DiffuseMaterial.cs
- ResourceExpressionBuilder.cs
- SendMailErrorEventArgs.cs
- WebPartsPersonalization.cs
- QuaternionRotation3D.cs
- ImageMetadata.cs
- SizeConverter.cs
- FragmentQueryProcessor.cs
- MsmqDiagnostics.cs
- WebHostedComPlusServiceHost.cs
- RemotingServices.cs
- ISO2022Encoding.cs
- NegatedConstant.cs
- BindingsCollection.cs
- ProfileInfo.cs
- sortedlist.cs
- ToolboxItem.cs
- WindowsFormsHostPropertyMap.cs
- MergePropertyDescriptor.cs
- DataObject.cs
- AssemblyCollection.cs
- XhtmlBasicPageAdapter.cs
- ApplyImportsAction.cs
- VectorCollection.cs
- Content.cs
- ProxyDataContractResolver.cs
- SequenceRange.cs
- ProtocolViolationException.cs
- BulletChrome.cs
- _CommandStream.cs
- ImageField.cs
- X509SecurityTokenAuthenticator.cs
- SortableBindingList.cs
- ParameterCollection.cs
- util.cs
- CardSpaceSelector.cs
- SizeAnimationUsingKeyFrames.cs
- SiteMapNodeItemEventArgs.cs
- ControlType.cs
- WebPartZoneAutoFormat.cs
- LocationSectionRecord.cs
- SqlDataSource.cs
- _AutoWebProxyScriptHelper.cs
- RichTextBoxAutomationPeer.cs
- ListView.cs