|
// ==++==
//
// Copyright (c) Microsoft Corporation. All rights reserved.
//
// ==--==
// =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
//
// LongAverageAggregationOperator.cs
//
// <OWNER>Microsoft</OWNER>
//
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
using System.Collections.Generic;
using System.Diagnostics.Contracts;
using System.Threading;
#if SILVERLIGHT
using System.Core; // for System.Core.SR
#endif
namespace System.Linq.Parallel
{
/// <summary>
/// An inlined average aggregation operator and its enumerator, for longs.
/// </summary>
internal sealed class LongAverageAggregationOperator : InlinedAggregationOperator<long, Pair<long, long>, double>
{
//---------------------------------------------------------------------------------------
// Constructs a new instance of an average associative operator.
//
internal LongAverageAggregationOperator(IEnumerable<long> child) : base(child)
{
}
//---------------------------------------------------------------------------------------
// 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 double 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<Pair<long, long>> enumerator = GetEnumerator(ParallelMergeOptions.FullyBuffered, true))
{
// Throw an error for empty results.
if (!enumerator.MoveNext())
{
singularExceptionToThrow = new InvalidOperationException(SR.GetString(SR.NoElements));
return default(double);
}
Pair<long, long> result = enumerator.Current;
// Simply add together the sums and totals.
while (enumerator.MoveNext())
{
checked
{
result.First += enumerator.Current.First;
result.Second += enumerator.Current.Second;
}
}
// And divide the sum by the total to obtain the final result.
return (double)result.First / result.Second;
}
}
//---------------------------------------------------------------------------------------
// Creates an enumerator that is used internally for the final aggregation step.
//
protected override QueryOperatorEnumerator<Pair<long, long>, int> CreateEnumerator<TKey>(
int index, int count, QueryOperatorEnumerator<long, TKey> source, object sharedData, CancellationToken cancellationToken)
{
return new LongAverageAggregationOperatorEnumerator<TKey>(source, index, cancellationToken);
}
//---------------------------------------------------------------------------------------
// This enumerator type encapsulates the intermediary aggregation over the underlying
// (possibly partitioned) data source.
//
private class LongAverageAggregationOperatorEnumerator<TKey> : InlinedAggregationOperatorEnumerator<Pair<long, long>>
{
private QueryOperatorEnumerator<long, TKey> m_source; // The source data.
//---------------------------------------------------------------------------------------
// Instantiates a new aggregation operator.
//
internal LongAverageAggregationOperatorEnumerator(QueryOperatorEnumerator<long, TKey> source, int partitionIndex,
CancellationToken cancellationToken) :
base(partitionIndex, cancellationToken)
{
Contract.Assert(source != null);
m_source = source;
}
//---------------------------------------------------------------------------------------
// Tallies up the average of the underlying data source, walking the entire thing the first
// time MoveNext is called on this object.
//
protected override bool MoveNextCore(ref Pair<long, long> currentElement)
{
// The temporary result contains the running sum and count, respectively.
long sum = 0;
long count = 0;
QueryOperatorEnumerator<long, TKey> source = m_source;
long current = default(long);
TKey keyUnused = default(TKey);
if (source.MoveNext(ref current, ref keyUnused))
{
int i = 0;
do
{
if ((i++ & CancellationState.POLL_INTERVAL) == 0)
CancellationState.ThrowIfCanceled(m_cancellationToken);
checked
{
sum += current;
count++;
}
}
while (source.MoveNext(ref current, ref keyUnused));
currentElement = new Pair<long, long>(sum, count);
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();
}
}
}
}
|