1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/* ****************************************************************************
*
* 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; using Microsoft;
using System.Collections.Generic;
#if CODEPLEX_40
using System.Linq.Expressions;
#else
using Microsoft.Linq.Expressions;
#endif
#if SILVERLIGHT
using System.Core;
#endif
#if CODEPLEX_40
namespace System.Linq.Expressions.Compiler {
#else
namespace Microsoft.Linq.Expressions.Compiler {
#endif
/// <summary>
/// A simple dictionary of queues, keyed off a particular type
/// This is useful for storing free lists of variables
/// </summary>
internal sealed class KeyedQueue<K, V> {
private readonly Dictionary<K, Queue<V>> _data;
internal KeyedQueue() {
_data = new Dictionary<K, Queue<V>>();
}
internal void Enqueue(K key, V value) {
Queue<V> queue;
if (!_data.TryGetValue(key, out queue)) {
_data.Add(key, queue = new Queue<V>());
}
queue.Enqueue(value);
}
internal V Dequeue(K key) {
Queue<V> 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<V> 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<V> queue;
if (!_data.TryGetValue(key, out queue)) {
throw Error.QueueEmpty();
}
return queue.Peek();
}
internal int GetCount(K key) {
Queue<V> queue;
if (!_data.TryGetValue(key, out queue)) {
return 0;
}
return queue.Count;
}
internal void Clear() {
_data.Clear();
}
}
}
|
