File: SynchronizedDisposablePool.cs

package info (click to toggle)
mono 4.6.2.7%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 778,148 kB
  • ctags: 914,052
  • sloc: cs: 5,779,509; xml: 2,773,713; ansic: 432,645; sh: 14,749; makefile: 12,361; perl: 2,488; python: 1,434; cpp: 849; asm: 531; sql: 95; sed: 16; php: 1
file content (93 lines) | stat: -rw-r--r-- 2,497 bytes parent folder | download | duplicates (9)
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
//------------------------------------------------------------
// Copyright (c) Microsoft Corporation.  All rights reserved.
//------------------------------------------------------------
namespace System.ServiceModel
{
    using System.Collections.Generic;
    using System.Threading;

    class SynchronizedDisposablePool<T> where T : class, IDisposable
    {
        List<T> items;
        int maxCount;
        bool disposed;

        public SynchronizedDisposablePool(int maxCount)
        {
            this.items = new List<T>();
            this.maxCount = maxCount;
        }

        object ThisLock
        {
            get { return this; }
        }

        public void Dispose()
        {
            T[] items;
            lock (ThisLock)
            {
                if (!disposed)
                {
                    disposed = true;
                    if (this.items.Count > 0)
                    {
                        items = new T[this.items.Count];
                        this.items.CopyTo(items, 0);
                        this.items.Clear();
                    }
                    else
                    {
                        items = null;
                    }
                }
                else
                {
                    items = null;
                }
            }
            if (items != null)
            {
                for (int i = 0; i < items.Length; i++)
                {
                    items[i].Dispose();
                }
            }
        }

        public bool Return(T value)
        {
            if (!disposed && this.items.Count < this.maxCount)
            {
                lock (ThisLock)
                {
                    if (!disposed && this.items.Count < this.maxCount)
                    {
                        this.items.Add(value);
                        return true;
                    }
                }
            }
            return false;
        }

        public T Take()
        {
            if (!disposed && this.items.Count > 0)
            {
                lock (ThisLock)
                {
                    if (!disposed && this.items.Count > 0)
                    {
                        int index = this.items.Count - 1;
                        T item = this.items[index];
                        this.items.RemoveAt(index);
                        return item;
                    }
                }
            }
            return null;
        }
    }
}