UnorderedHashRepartitionStream.cs source code in C# .NET

Source code for the .NET framework in C#

                        
Code:

                         / 4.0 / 4.0 / DEVDIV_TFS / Dev10 / Releases / RTMRel / ndp / fx / src / Core / System / Linq / Parallel / Partitioning / UnorderedHashRepartitionStream.cs / 1305376 / UnorderedHashRepartitionStream.cs
                        

                        
                            // ==++== 
//
//   Copyright (c) Microsoft Corporation.  All rights reserved.
//
// ==--== 
// =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
// 
// UnorderedHashRepartitionStream.cs 
//
// [....] 
//
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-

using System.Collections.Generic; 
using System.Threading;
 
namespace System.Linq.Parallel 
{
    internal class UnorderedHashRepartitionStream : HashRepartitionStream 
    {

        //----------------------------------------------------------------------------------------
        // Creates a new partition exchange operator. 
        //
 
        internal UnorderedHashRepartitionStream( 
            PartitionedStream inputStream,
            Func keySelector, IEqualityComparer keyComparer, IEqualityComparer elementComparer, 
            CancellationToken cancellationToken)
            : base(inputStream.PartitionCount, Util.GetDefaultComparer(), keyComparer, elementComparer)
        {
            // Create our array of partitions. 
            m_partitions = new HashRepartitionEnumerator[inputStream.PartitionCount];
 
            // Initialize state shared among the partitions. A latch and a matrix of buffers. Note that 
            // the actual elements in the buffer array are lazily allocated if needed.
            CountdownEvent barrier = new CountdownEvent(inputStream.PartitionCount); 
            ListChunk>[,] valueExchangeMatrix =
                new ListChunk>[inputStream.PartitionCount, inputStream.PartitionCount];

            // Now construct each partition object. 
            for (int i = 0; i < inputStream.PartitionCount; i++)
            { 
                m_partitions[i] = new HashRepartitionEnumerator( 
                    inputStream[i], inputStream.PartitionCount, i, keySelector, this,
                    barrier, valueExchangeMatrix, cancellationToken); 
            }
        }
    }
} 

// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
// ==++== 
//
//   Copyright (c) Microsoft Corporation.  All rights reserved.
//
// ==--== 
// =+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+=+
// 
// UnorderedHashRepartitionStream.cs 
//
// [....] 
//
// =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-

using System.Collections.Generic; 
using System.Threading;
 
namespace System.Linq.Parallel 
{
    internal class UnorderedHashRepartitionStream : HashRepartitionStream 
    {

        //----------------------------------------------------------------------------------------
        // Creates a new partition exchange operator. 
        //
 
        internal UnorderedHashRepartitionStream( 
            PartitionedStream inputStream,
            Func keySelector, IEqualityComparer keyComparer, IEqualityComparer elementComparer, 
            CancellationToken cancellationToken)
            : base(inputStream.PartitionCount, Util.GetDefaultComparer(), keyComparer, elementComparer)
        {
            // Create our array of partitions. 
            m_partitions = new HashRepartitionEnumerator[inputStream.PartitionCount];
 
            // Initialize state shared among the partitions. A latch and a matrix of buffers. Note that 
            // the actual elements in the buffer array are lazily allocated if needed.
            CountdownEvent barrier = new CountdownEvent(inputStream.PartitionCount); 
            ListChunk>[,] valueExchangeMatrix =
                new ListChunk>[inputStream.PartitionCount, inputStream.PartitionCount];

            // Now construct each partition object. 
            for (int i = 0; i < inputStream.PartitionCount; i++)
            { 
                m_partitions[i] = new HashRepartitionEnumerator( 
                    inputStream[i], inputStream.PartitionCount, i, keySelector, this,
                    barrier, valueExchangeMatrix, cancellationToken); 
            }
        }
    }
} 

// File provided for Reference Use Only by Microsoft Corporation (c) 2007.

Link Menu

Network programming in C#, Network Programming in VB.NET, Network Programming in .NET
This book is available now!
Buy at Amazon US or
Buy at Amazon UK