Code:
/ 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / Core / System / Linq / Parallel / QueryOperators / Inlined / FloatMinMaxAggregationOperator.cs / 1305376 / FloatMinMaxAggregationOperator.cs
// ==++== // // Copyright (c) Microsoft Corporation. All rights reserved. // // ==--== // =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ // // FloatMinMaxAggregationOperator.cs // //[....] // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- using System.Collections.Generic; using System.Diagnostics.Contracts; using System.Threading; namespace System.Linq.Parallel { // Notes: // Note that normally float.NaN < anything is false, as is anything < NaN. This would // lead to some strangeness in Min and Max, e.g. Min({ NaN, 5.0 } == NaN, yet // Min({ 5.0, NaN }) == 5.0! We impose a total ordering so that NaN is smaller than // everything, including -infinity, which is consistent with Comparer. /// /// An inlined min/max aggregation and its enumerator, for floats. /// internal sealed class FloatMinMaxAggregationOperator : 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 FloatMinMaxAggregationOperator(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 float 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(float); } float best = enumerator.Current; // Based on the sign, do either a min or max reduction. if (m_sign == -1) { while (enumerator.MoveNext()) { float current = enumerator.Current; if (current < best || float.IsNaN(current)) { best = current; } } } else { while (enumerator.MoveNext()) { float current = enumerator.Current; if (current > best || float.IsNaN(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 FloatMinMaxAggregationOperatorEnumerator (source, index, m_sign, cancellationToken); } //--------------------------------------------------------------------------------------- // This enumerator type encapsulates the intermediary aggregation over the underlying // (possibly partitioned) data source. // private class FloatMinMaxAggregationOperatorEnumerator : 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 FloatMinMaxAggregationOperatorEnumerator(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 float 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) { float elem = default(float); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem < currentElement || float.IsNaN(elem)) { currentElement = elem; } } } else { float elem = default(float); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem > currentElement || float.IsNaN(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. // // ==--== // =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+ // // FloatMinMaxAggregationOperator.cs // // [....] // // =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- using System.Collections.Generic; using System.Diagnostics.Contracts; using System.Threading; namespace System.Linq.Parallel { // Notes: // Note that normally float.NaN < anything is false, as is anything < NaN. This would // lead to some strangeness in Min and Max, e.g. Min({ NaN, 5.0 } == NaN, yet // Min({ 5.0, NaN }) == 5.0! We impose a total ordering so that NaN is smaller than // everything, including -infinity, which is consistent with Comparer. /// /// An inlined min/max aggregation and its enumerator, for floats. /// internal sealed class FloatMinMaxAggregationOperator : 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 FloatMinMaxAggregationOperator(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 float 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(float); } float best = enumerator.Current; // Based on the sign, do either a min or max reduction. if (m_sign == -1) { while (enumerator.MoveNext()) { float current = enumerator.Current; if (current < best || float.IsNaN(current)) { best = current; } } } else { while (enumerator.MoveNext()) { float current = enumerator.Current; if (current > best || float.IsNaN(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 FloatMinMaxAggregationOperatorEnumerator (source, index, m_sign, cancellationToken); } //--------------------------------------------------------------------------------------- // This enumerator type encapsulates the intermediary aggregation over the underlying // (possibly partitioned) data source. // private class FloatMinMaxAggregationOperatorEnumerator : 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 FloatMinMaxAggregationOperatorEnumerator(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 float 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) { float elem = default(float); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem < currentElement || float.IsNaN(elem)) { currentElement = elem; } } } else { float elem = default(float); while (source.MoveNext(ref elem, ref keyUnused)) { if ((i++ & CancellationState.POLL_INTERVAL) == 0) CancellationState.ThrowIfCanceled(m_cancellationToken); if (elem > currentElement || float.IsNaN(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
- GenericEnumerator.cs
- Point4DConverter.cs
- SpeechRecognitionEngine.cs
- CounterSetInstanceCounterDataSet.cs
- RC2.cs
- EditorServiceContext.cs
- FixedPageStructure.cs
- followingquery.cs
- StaticFileHandler.cs
- HostedNamedPipeTransportManager.cs
- Matrix3DStack.cs
- Soap12ServerProtocol.cs
- AttributeQuery.cs
- Switch.cs
- PointHitTestResult.cs
- ToolbarAUtomationPeer.cs
- QueueException.cs
- ReadOnlyDataSource.cs
- KeyInstance.cs
- SessionEndingCancelEventArgs.cs
- DocumentViewerAutomationPeer.cs
- DescendentsWalker.cs
- TreeNodeBindingCollection.cs
- VariableReference.cs
- ProfileSettingsCollection.cs
- ApplicationInfo.cs
- storepermissionattribute.cs
- RawMouseInputReport.cs
- RemotingAttributes.cs
- ProcessingInstructionAction.cs
- ActivationArguments.cs
- InteropBitmapSource.cs
- XPathDescendantIterator.cs
- StrongNameMembershipCondition.cs
- OleDbInfoMessageEvent.cs
- SslStream.cs
- RelatedPropertyManager.cs
- RangeBaseAutomationPeer.cs
- Site.cs
- ColumnMapVisitor.cs
- OrderPreservingMergeHelper.cs
- PathSegmentCollection.cs
- SqlRowUpdatedEvent.cs
- HandlerElementCollection.cs
- DataGridViewColumn.cs
- PerformanceCounterLib.cs
- HttpHandlersSection.cs
- DropSource.cs
- SafeNativeMethods.cs
- SEHException.cs
- Queue.cs
- ISO2022Encoding.cs
- PointCollection.cs
- PackageDigitalSignature.cs
- GridViewColumnHeader.cs
- DocumentReference.cs
- HttpResponseInternalWrapper.cs
- RichTextBoxDesigner.cs
- HelpEvent.cs
- HTTPRemotingHandler.cs
- DataGridViewCellErrorTextNeededEventArgs.cs
- EmbeddedMailObjectsCollection.cs
- DocumentPageTextView.cs
- ListBoxItemAutomationPeer.cs
- GenericUI.cs
- FunctionUpdateCommand.cs
- SoapFault.cs
- TextPointerBase.cs
- SiteMapDataSource.cs
- DataListItem.cs
- SapiRecognizer.cs
- RemotingSurrogateSelector.cs
- StreamGeometry.cs
- _UriTypeConverter.cs
- UserControlFileEditor.cs
- ResourceReferenceExpressionConverter.cs
- Rights.cs
- DataGridViewDataConnection.cs
- OleDbParameterCollection.cs
- _RequestCacheProtocol.cs
- BamlTreeMap.cs
- SiteMapNodeCollection.cs
- Optimizer.cs
- TcpClientChannel.cs
- InvalidFilterCriteriaException.cs
- FormsAuthenticationEventArgs.cs
- PromptStyle.cs
- ValueType.cs
- IsolatedStorageException.cs
- ModelItemCollection.cs
- StringDictionary.cs
- NamedPipeTransportBindingElement.cs
- List.cs
- MimeMapping.cs
- ArrayTypeMismatchException.cs
- BookmarkEventArgs.cs
- ComplexType.cs
- HtmlToClrEventProxy.cs
- DocobjHost.cs
- TypeExtensionConverter.cs