blob: c10ebcc28843ad06101542da15bb23a9193ddf0b (
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
|
/*
* Licensed to Elasticsearch under one or more contributor
* license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright
* ownership. Elasticsearch 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.
*/
package org.elasticsearch.common.recycler;
import org.elasticsearch.ElasticsearchIllegalStateException;
import java.util.Deque;
/**
* A {@link Recycler} implementation based on a {@link Deque}. This implementation is NOT thread-safe.
*/
public class DequeRecycler<T> extends AbstractRecycler<T> {
final Deque<T> deque;
final int maxSize;
public DequeRecycler(C<T> c, Deque<T> queue, int maxSize) {
super(c);
this.deque = queue;
this.maxSize = maxSize;
}
@Override
public void close() {
deque.clear();
}
@Override
public V<T> obtain(int sizing) {
final T v = deque.pollFirst();
if (v == null) {
return new DV(c.newInstance(sizing), false);
}
return new DV(v, true);
}
/** Called before releasing an object, returns true if the object should be recycled and false otherwise. */
protected boolean beforeRelease() {
return deque.size() < maxSize;
}
/** Called after a release. */
protected void afterRelease(boolean recycled) {}
private class DV implements Recycler.V<T> {
T value;
final boolean recycled;
DV(T value, boolean recycled) {
this.value = value;
this.recycled = recycled;
}
@Override
public T v() {
return value;
}
@Override
public boolean isRecycled() {
return recycled;
}
@Override
public boolean release() {
if (value == null) {
throw new ElasticsearchIllegalStateException("recycler entry already released...");
}
final boolean recycle = beforeRelease();
if (recycle) {
c.clear(value);
deque.addFirst(value);
}
value = null;
afterRelease(recycle);
return true;
}
}
}
|
