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
- CodeBlockBuilder.cs
- TraceLevelStore.cs
- ByteStreamGeometryContext.cs
- RandomNumberGenerator.cs
- BindingList.cs
- StringExpressionSet.cs
- ConditionalAttribute.cs
- StaticFileHandler.cs
- QueryCacheManager.cs
- Panel.cs
- GenericAuthenticationEventArgs.cs
- SymDocumentType.cs
- _Events.cs
- DataListItem.cs
- ServiceModelEnumValidatorAttribute.cs
- CngKey.cs
- PageTextBox.cs
- TraceUtility.cs
- QilVisitor.cs
- AlphaSortedEnumConverter.cs
- InfiniteTimeSpanConverter.cs
- MenuItemStyle.cs
- IgnoreSectionHandler.cs
- TrackingMemoryStreamFactory.cs
- HealthMonitoringSectionHelper.cs
- ExceptionRoutedEventArgs.cs
- RequestDescription.cs
- recordstatefactory.cs
- WebUtil.cs
- ThicknessKeyFrameCollection.cs
- MetadataPropertyCollection.cs
- Binding.cs
- NavigationWindowAutomationPeer.cs
- NamespaceDecl.cs
- ToolStripLocationCancelEventArgs.cs
- XmlWellformedWriter.cs
- HandledMouseEvent.cs
- CommandDesigner.cs
- ResourceDescriptionAttribute.cs
- DoubleCollectionConverter.cs
- DataSourceSelectArguments.cs
- FieldNameLookup.cs
- NameTable.cs
- MachineKey.cs
- UidManager.cs
- XPathBinder.cs
- XsltFunctions.cs
- COM2EnumConverter.cs
- InputScope.cs
- ValidationHelpers.cs
- HttpListenerException.cs
- PrtCap_Public_Simple.cs
- StreamInfo.cs
- LinkLabelLinkClickedEvent.cs
- AdornedElementPlaceholder.cs
- SHA256.cs
- GuidTagList.cs
- DataSourceSelectArguments.cs
- XpsFilter.cs
- MultiPageTextView.cs
- MatrixStack.cs
- CustomAttribute.cs
- PrimarySelectionGlyph.cs
- SafeRightsManagementHandle.cs
- DataViewManagerListItemTypeDescriptor.cs
- Control.cs
- QuadraticBezierSegment.cs
- SqlMethods.cs
- Context.cs
- DataRecordInternal.cs
- OperationResponse.cs
- DiscoveryViaBehavior.cs
- XmlLoader.cs
- AutomationFocusChangedEventArgs.cs
- AppDomainManager.cs
- ConnectionsZone.cs
- RegisteredScript.cs
- CompiledELinqQueryState.cs
- Utils.cs
- FacetEnabledSchemaElement.cs
- StringUtil.cs
- XmlReflectionMember.cs
- StandardRuntimeEnumValidatorAttribute.cs
- CommandEventArgs.cs
- QilReplaceVisitor.cs
- ItemCheckEvent.cs
- PolyBezierSegment.cs
- BufferedStream.cs
- TimeSpanConverter.cs
- TcpClientSocketManager.cs
- Missing.cs
- NotSupportedException.cs
- documentsequencetextview.cs
- XPathNode.cs
- ConsumerConnectionPointCollection.cs
- XPathSelectionIterator.cs
- Timeline.cs
- DBProviderConfigurationHandler.cs
- TextEditorLists.cs
- CachingHintValidation.cs