KeyedQueue.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 / Microsoft / Scripting / Compiler / KeyedQueue.cs / 1305376 / KeyedQueue.cs
                        

                        
                            /* **************************************************************************** 
 *
 * Copyright (c) Microsoft Corporation.
 *
 * This source code is subject to terms and conditions of the Microsoft Public License. A 
 * copy of the license can be found in the License.html file at the root of this distribution. If
 * you cannot locate the  Microsoft Public License, please send an email to 
 * dlr@microsoft.com. By using this source code in any fashion, you are agreeing to be bound 
 * by the terms of the Microsoft Public License.
 * 
 * You must not remove this notice, or any other, from this software.
 *
 *
 * ***************************************************************************/ 

using System.Collections.Generic; 
using System.Linq.Expressions; 

#if SILVERLIGHT 
using System.Core;
#endif

namespace System.Linq.Expressions.Compiler { 

    ///  
    /// A simple dictionary of queues, keyed off a particular type 
    /// This is useful for storing free lists of variables
    ///  
    internal sealed class KeyedQueue {
        private readonly Dictionary> _data;

        internal KeyedQueue() { 
            _data = new Dictionary>();
        } 
 
        internal void Enqueue(K key, V value) {
            Queue queue; 
            if (!_data.TryGetValue(key, out queue)) {
                _data.Add(key, queue = new Queue());
            }
            queue.Enqueue(value); 
        }
 
        internal V Dequeue(K key) { 
            Queue queue;
            if (!_data.TryGetValue(key, out queue)) { 
                throw Error.QueueEmpty();
            }
            V result = queue.Dequeue();
            if (queue.Count == 0) { 
                _data.Remove(key);
            } 
            return result; 
        }
 
        internal bool TryDequeue(K key, out V value) {
            Queue queue;
            if (_data.TryGetValue(key, out queue) && queue.Count > 0) {
                value = queue.Dequeue(); 
                if (queue.Count == 0) {
                    _data.Remove(key); 
                } 
                return true;
            } 
            value = default(V);
            return false;
        }
 
        internal V Peek(K key) {
            Queue queue; 
            if (!_data.TryGetValue(key, out queue)) { 
                throw Error.QueueEmpty();
            } 
            return queue.Peek();
        }

        internal int GetCount(K key) { 
            Queue queue;
            if (!_data.TryGetValue(key, out queue)) { 
                return 0; 
            }
            return queue.Count; 
        }

        internal void Clear() {
            _data.Clear(); 
        }
    } 
} 

// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
// Copyright (c) Microsoft Corporation. All rights reserved.
/* **************************************************************************** 
 *
 * Copyright (c) Microsoft Corporation.
 *
 * This source code is subject to terms and conditions of the Microsoft Public License. A 
 * copy of the license can be found in the License.html file at the root of this distribution. If
 * you cannot locate the  Microsoft Public License, please send an email to 
 * dlr@microsoft.com. By using this source code in any fashion, you are agreeing to be bound 
 * by the terms of the Microsoft Public License.
 * 
 * You must not remove this notice, or any other, from this software.
 *
 *
 * ***************************************************************************/ 

using System.Collections.Generic; 
using System.Linq.Expressions; 

#if SILVERLIGHT 
using System.Core;
#endif

namespace System.Linq.Expressions.Compiler { 

    ///  
    /// A simple dictionary of queues, keyed off a particular type 
    /// This is useful for storing free lists of variables
    ///  
    internal sealed class KeyedQueue {
        private readonly Dictionary> _data;

        internal KeyedQueue() { 
            _data = new Dictionary>();
        } 
 
        internal void Enqueue(K key, V value) {
            Queue queue; 
            if (!_data.TryGetValue(key, out queue)) {
                _data.Add(key, queue = new Queue());
            }
            queue.Enqueue(value); 
        }
 
        internal V Dequeue(K key) { 
            Queue queue;
            if (!_data.TryGetValue(key, out queue)) { 
                throw Error.QueueEmpty();
            }
            V result = queue.Dequeue();
            if (queue.Count == 0) { 
                _data.Remove(key);
            } 
            return result; 
        }
 
        internal bool TryDequeue(K key, out V value) {
            Queue queue;
            if (_data.TryGetValue(key, out queue) && queue.Count > 0) {
                value = queue.Dequeue(); 
                if (queue.Count == 0) {
                    _data.Remove(key); 
                } 
                return true;
            } 
            value = default(V);
            return false;
        }
 
        internal V Peek(K key) {
            Queue queue; 
            if (!_data.TryGetValue(key, out queue)) { 
                throw Error.QueueEmpty();
            } 
            return queue.Peek();
        }

        internal int GetCount(K key) { 
            Queue queue;
            if (!_data.TryGetValue(key, out queue)) { 
                return 0; 
            }
            return queue.Count; 
        }

        internal void Clear() {
            _data.Clear(); 
        }
    } 
} 

// File provided for Reference Use Only by Microsoft Corporation (c) 2007.
// Copyright (c) Microsoft Corporation. All rights reserved.

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