blob: 2fb9d34b4153960a0c2f9b77ed85764f739f692b (
plain)
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
package org.apache.velocity.util;
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/**
* Simple object pool. Based on ThreadPool and few other classes
*
* The pool will ignore overflow and return null if empty.
*
* @author Gal Shachor
* @author Costin
* @author <a href="mailto:geirm@optonline.net">Geir Magnusson Jr.</a>
* @version $Id$
*/
public final class SimplePool
{
/*
* Where the objects are held.
*/
private Object pool[];
/**
* max amount of objects to be managed
* set via CTOR
*/
private int max;
/**
* index of previous to next
* free slot
*/
private int current=-1;
/**
* @param max
*/
public SimplePool(int max)
{
this.max = max;
pool = new Object[max];
}
/**
* Add the object to the pool, silent nothing if the pool is full
* @param o
*/
public void put(Object o)
{
int idx=-1;
synchronized(this)
{
/*
* if we aren't full
*/
if (current < max - 1)
{
/*
* then increment the
* current index.
*/
idx = ++current;
}
if (idx >= 0)
{
pool[idx] = o;
}
}
}
/**
* Get an object from the pool, null if the pool is empty.
* @return The object from the pool.
*/
public Object get()
{
synchronized(this)
{
/*
* if we have any in the pool
*/
if( current >= 0 )
{
/*
* remove the current one
*/
Object o = pool[current];
pool[current] = null;
current--;
return o;
}
}
return null;
}
/**
* Return the size of the pool
* @return The pool size.
*/
public int getMax()
{
return max;
}
/**
* for testing purposes, so we can examine the pool
*
* @return Array of Objects in the pool.
*/
Object[] getPool()
{
return pool;
}
}
|
