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
|
//------------------------------------------------------------------------------
// <copyright file="SimpleRecyclingCache.cs" company="Microsoft">
// Copyright (c) Microsoft Corporation. All rights reserved.
// </copyright>
//------------------------------------------------------------------------------
/*
* SimpleRecyclingCache class
*
* Copyright (c) 1999 Microsoft Corporation
*/
namespace System.Web.Util {
using System.Collections;
/*
* The purpose of this class is to provide a simple and efficient cache.
* Instead of using fancy logic to expire items, it uses a simple heuristic:
* when the number of entry reaches a fixed limit, the cache is reset.
*/
internal class SimpleRecyclingCache {
private const int MAX_SIZE = 100;
private static Hashtable _hashtable;
internal SimpleRecyclingCache() {
CreateHashtable();
}
// Create or recreate the hastable
private void CreateHashtable() {
_hashtable = new Hashtable(MAX_SIZE, StringComparer.OrdinalIgnoreCase);
}
internal object this[object key] {
get {
return _hashtable[key];
}
set {
lock (this) {
// The limit was reached, so reset everything
if (_hashtable.Count >= MAX_SIZE)
_hashtable.Clear();
_hashtable[key] = value;
}
}
}
}
}
|
