Code:
/ 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / Core / System / Linq / Parallel / QueryOperators / Inlined / LongMinMaxAggregationOperator.cs / 1305376 / LongMinMaxAggregationOperator.cs
// ==++== // // Copyright (c) Microsoft Corporation. All rights reserved. // // ==--== // =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ // // LongMinMaxAggregationOperator.cs // //[....] // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- using System.Collections.Generic; using System.Diagnostics.Contracts; using System.Threading; namespace System.Linq.Parallel { ////// An inlined min/max aggregation and its enumerator, for longs. /// internal sealed class LongMinMaxAggregationOperator : InlinedAggregationOperator{ private readonly int m_sign; // The sign (-1 for min, 1 for max). //---------------------------------------------------------------------------------------- // Constructs a new instance of a min/max associative operator. // internal LongMinMaxAggregationOperator(IEnumerable child, int sign) : base(child) { Contract.Assert(sign == -1 || sign == 1, "invalid sign"); m_sign = sign; } //--------------------------------------------------------------------------------------- // Executes the entire query tree, and aggregates the intermediate results into the // final result based on the binary operators and final reduction. // // Return Value: // The single result of aggregation. // protected override long InternalAggregate(ref Exception singularExceptionToThrow) { // Because the final reduction is typically much cheaper than the intermediate // reductions over the individual partitions, and because each parallel partition // will do a lot of work to produce a single output element, we prefer to turn off // pipelining, and process the final reductions serially. using (IEnumerator enumerator = GetEnumerator(ParallelMergeOptions.FullyBuffered, true)) { // Throw an error for empty results. if (!enumerator.MoveNext()) { singularExceptionToThrow = new InvalidOperationException(SR.GetString(SR.NoElements)); return default(long); } long best = enumerator.Current; // Based on the sign, do either a min or max reduction. if (m_sign == -1) { while (enumerator.MoveNext()) { long current = enumerator.Current; if (current < best) { best = current; } } } else { while (enumerator.MoveNext()) { long current = enumerator.Current; if (current > best) { best = current; } } } return best; } } //--------------------------------------------------------------------------------------- // Creates an enumerator that is used internally for the final aggregation step. // protected override QueryOperatorEnumerator CreateEnumerator ( int index, int count, QueryOperatorEnumerator source, object sharedData, CancellationToken cancellationToken) { return new LongMinMaxAggregationOperatorEnumerator (source, index, m_sign, cancellationToken); } //--------------------------------------------------------------------------------------- // This enumerator type encapsulates the intermediary aggregation over the underlying // (possibly partitioned) data source. // private class LongMinMaxAggregationOperatorEnumerator : InlinedAggregationOperatorEnumerator { private QueryOperatorEnumerator m_source; // The source data. private int m_sign; // The sign for comparisons (-1 means min, 1 means max). //---------------------------------------------------------------------------------------- // Instantiates a new aggregation operator. // internal LongMinMaxAggregationOperatorEnumerator(QueryOperatorEnumerator source, int partitionIndex, int sign, CancellationToken cancellationToken) : base(partitionIndex, cancellationToken) { Contract.Assert(source != null); m_source = source; m_sign = sign; } //--------------------------------------------------------------------------------------- // Tallies up the min/max of the underlying data source, walking the entire thing the first // time MoveNext is called on this object. // protected override bool MoveNextCore(ref long currentElement) { // Based on the sign, do either a min or max reduction. QueryOperatorEnumerator source = m_source; TKey keyUnused = default(TKey); if (source.MoveNext(ref currentElement, ref keyUnused)) { int i = 0; // We just scroll through the enumerator and find the min or max. if (m_sign == -1) { long elem = default(long); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem < currentElement) { currentElement = elem; } } } else { long elem = default(long); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem > currentElement) { currentElement = elem; } } } // The sum has been calculated. Now just return. return true; } return false; } //---------------------------------------------------------------------------------------- // Dispose of resources associated with the underlying enumerator. // protected override void Dispose(bool disposing) { Contract.Assert(m_source != null); m_source.Dispose(); } } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. // ==++== // // Copyright (c) Microsoft Corporation. All rights reserved. // // ==--== // =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ // // LongMinMaxAggregationOperator.cs // // [....] // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- using System.Collections.Generic; using System.Diagnostics.Contracts; using System.Threading; namespace System.Linq.Parallel { ////// An inlined min/max aggregation and its enumerator, for longs. /// internal sealed class LongMinMaxAggregationOperator : InlinedAggregationOperator{ private readonly int m_sign; // The sign (-1 for min, 1 for max). //---------------------------------------------------------------------------------------- // Constructs a new instance of a min/max associative operator. // internal LongMinMaxAggregationOperator(IEnumerable child, int sign) : base(child) { Contract.Assert(sign == -1 || sign == 1, "invalid sign"); m_sign = sign; } //--------------------------------------------------------------------------------------- // Executes the entire query tree, and aggregates the intermediate results into the // final result based on the binary operators and final reduction. // // Return Value: // The single result of aggregation. // protected override long InternalAggregate(ref Exception singularExceptionToThrow) { // Because the final reduction is typically much cheaper than the intermediate // reductions over the individual partitions, and because each parallel partition // will do a lot of work to produce a single output element, we prefer to turn off // pipelining, and process the final reductions serially. using (IEnumerator enumerator = GetEnumerator(ParallelMergeOptions.FullyBuffered, true)) { // Throw an error for empty results. if (!enumerator.MoveNext()) { singularExceptionToThrow = new InvalidOperationException(SR.GetString(SR.NoElements)); return default(long); } long best = enumerator.Current; // Based on the sign, do either a min or max reduction. if (m_sign == -1) { while (enumerator.MoveNext()) { long current = enumerator.Current; if (current < best) { best = current; } } } else { while (enumerator.MoveNext()) { long current = enumerator.Current; if (current > best) { best = current; } } } return best; } } //--------------------------------------------------------------------------------------- // Creates an enumerator that is used internally for the final aggregation step. // protected override QueryOperatorEnumerator CreateEnumerator ( int index, int count, QueryOperatorEnumerator source, object sharedData, CancellationToken cancellationToken) { return new LongMinMaxAggregationOperatorEnumerator (source, index, m_sign, cancellationToken); } //--------------------------------------------------------------------------------------- // This enumerator type encapsulates the intermediary aggregation over the underlying // (possibly partitioned) data source. // private class LongMinMaxAggregationOperatorEnumerator : InlinedAggregationOperatorEnumerator { private QueryOperatorEnumerator m_source; // The source data. private int m_sign; // The sign for comparisons (-1 means min, 1 means max). //---------------------------------------------------------------------------------------- // Instantiates a new aggregation operator. // internal LongMinMaxAggregationOperatorEnumerator(QueryOperatorEnumerator source, int partitionIndex, int sign, CancellationToken cancellationToken) : base(partitionIndex, cancellationToken) { Contract.Assert(source != null); m_source = source; m_sign = sign; } //--------------------------------------------------------------------------------------- // Tallies up the min/max of the underlying data source, walking the entire thing the first // time MoveNext is called on this object. // protected override bool MoveNextCore(ref long currentElement) { // Based on the sign, do either a min or max reduction. QueryOperatorEnumerator source = m_source; TKey keyUnused = default(TKey); if (source.MoveNext(ref currentElement, ref keyUnused)) { int i = 0; // We just scroll through the enumerator and find the min or max. if (m_sign == -1) { long elem = default(long); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem < currentElement) { currentElement = elem; } } } else { long elem = default(long); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem > currentElement) { currentElement = elem; } } } // The sum has been calculated. Now just return. return true; } return false; } //---------------------------------------------------------------------------------------- // Dispose of resources associated with the underlying enumerator. // protected override void Dispose(bool disposing) { Contract.Assert(m_source != null); m_source.Dispose(); } } } } // 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
- DataServiceExpressionVisitor.cs
- TextTreeFixupNode.cs
- FontFamilyConverter.cs
- DbModificationClause.cs
- TypeElement.cs
- ItemsPresenter.cs
- GlyphRunDrawing.cs
- XpsFontSerializationService.cs
- IsolatedStoragePermission.cs
- WebPartConnectionsEventArgs.cs
- WorkflowQueue.cs
- ObjectDisposedException.cs
- OdbcParameter.cs
- VBCodeProvider.cs
- RuleInfoComparer.cs
- GridViewDeleteEventArgs.cs
- EventLogQuery.cs
- HttpInputStream.cs
- Empty.cs
- Line.cs
- SignedPkcs7.cs
- WebSysDisplayNameAttribute.cs
- XsdSchemaFileEditor.cs
- __Filters.cs
- Set.cs
- DynamicPhysicalDiscoSearcher.cs
- ObjectDataSourceMethodEventArgs.cs
- ConstantExpression.cs
- XmlArrayAttribute.cs
- ExtendedPropertiesHandler.cs
- ipaddressinformationcollection.cs
- NamespaceInfo.cs
- DLinqAssociationProvider.cs
- MethodBuilderInstantiation.cs
- MatrixAnimationUsingPath.cs
- FixedTextPointer.cs
- HttpCookiesSection.cs
- PartialCachingControl.cs
- dataobject.cs
- ComPlusTypeLoader.cs
- SqlDataSourceEnumerator.cs
- ToolboxService.cs
- RadioButtonFlatAdapter.cs
- LinkButton.cs
- TraceSection.cs
- WebPartsSection.cs
- KeyFrames.cs
- ApplicationBuildProvider.cs
- Byte.cs
- FunctionUpdateCommand.cs
- InvokeGenerator.cs
- ObjectKeyFrameCollection.cs
- BigInt.cs
- RoleManagerModule.cs
- SponsorHelper.cs
- TypeBuilderInstantiation.cs
- Compiler.cs
- _NegoStream.cs
- EntityDataSourceWrapperCollection.cs
- TargetControlTypeAttribute.cs
- ZeroOpNode.cs
- WebPartConnectionsCancelVerb.cs
- SqlFlattener.cs
- ImpersonationContext.cs
- BCLDebug.cs
- Globals.cs
- PipelineModuleStepContainer.cs
- TemplatedMailWebEventProvider.cs
- AnonymousIdentificationModule.cs
- XmlObjectSerializerWriteContextComplexJson.cs
- ObjectStateManager.cs
- SqlBulkCopyColumnMapping.cs
- cookieexception.cs
- StdValidatorsAndConverters.cs
- Missing.cs
- TimelineClockCollection.cs
- DateTimeValueSerializer.cs
- WebRequestModulesSection.cs
- ExtractorMetadata.cs
- FastEncoder.cs
- MissingManifestResourceException.cs
- NegotiationTokenAuthenticator.cs
- CriticalHandle.cs
- TokenBasedSet.cs
- DataGridTablesFactory.cs
- EventArgs.cs
- DashStyle.cs
- TabControl.cs
- PeerContact.cs
- SafeNativeMethods.cs
- LoginStatusDesigner.cs
- ProfileGroupSettingsCollection.cs
- LayoutManager.cs
- ResourceAttributes.cs
- ListViewItemMouseHoverEvent.cs
- VisemeEventArgs.cs
- DataObjectFieldAttribute.cs
- RectAnimationClockResource.cs
- SEHException.cs
- SpellerError.cs