All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.jppf.utils.pooling.AbstractObjectPoolQueue Maven / Gradle / Ivy

There is a newer version: 6.3-alpha
Show newest version
/*
 * JPPF.
 * Copyright (C) 2005-2015 JPPF Team.
 * http://www.jppf.org
 *
 * Licensed 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.jppf.utils.pooling;

import java.util.Queue;
import java.util.concurrent.ConcurrentLinkedQueue;

/**
 * A thread-safe, dynamic object pool backed by a {@link ConcurrentLinkedQueue}.
 * This pool is designed for maximum throughput, thus its size will grow dynamically,
 * up to maximum concurrent usage.
 * 

Subclasses that wish to avoid a size too large for the pool may for instance * introduce a core pool size, and override the put(T) method such that it * doesn't put released object back into the queue if its size > core size. *

In this case the {@link #size()} method might need to be overriden as well, as its * performance in O(n) may be the main bottleneck of the implementation. * @param the type of objects in the pool. * @author Laurent Cohen */ public abstract class AbstractObjectPoolQueue implements ObjectPool { /** * The pool of objects. */ protected final Queue queue = new ConcurrentLinkedQueue<>(); @Override public T get() { T t = queue.poll(); return (t == null) ? create() : t; } /** * Create a new object for the pool. * @return an object that can be returned to the pool. */ protected abstract T create(); @Override public void put(final T t) { queue.offer(t); } @Override public boolean isEmpty() { return queue.isEmpty(); } /** * Use this method with precaution, as its performance is in O(n).
* {@inheritDoc} */ @Override public int size() { return queue.size(); } }





© 2015 - 2025 Weber Informatics LLC | Privacy Policy