程序包 org.dromara.dynamictp.common.queue

类 MemorySafeLinkedBlockingQueue<E>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractQueue<E>

org.dromara.dynamictp.common.queue.VariableLinkedBlockingQueue<E>

org.dromara.dynamictp.common.queue.MemorySafeLinkedBlockingQueue<E>

所有已实现的接口:

Serializable, Iterable<E>, Collection<E>, BlockingQueue<E>, Queue<E>

public class MemorySafeLinkedBlockingQueue<E>
extends VariableLinkedBlockingQueue<E>

Can completely solve the OOM problem caused by LinkedBlockingQueue.

另请参阅:

• MemorySafeLinkedBlockingQueue
• 序列化表格

字段概要

字段

修饰符和类型	字段	说明
static final int	THE_16_MB

构造器概要

构造器

构造器	说明
MemorySafeLinkedBlockingQueue()
MemorySafeLinkedBlockingQueue(int maxFreeMemory)
MemorySafeLinkedBlockingQueue(int capacity, int maxFreeMemory)
MemorySafeLinkedBlockingQueue(Collection<? extends E> c, int maxFreeMemory)

方法概要

修饰符和类型	方法	说明
int	getMaxFreeMemory()	get the max free memory.
boolean	hasRemainedMemory()	determine if there is any remaining free memory.
boolean	offer(E e)	Inserts the specified element at the tail of this queue if it is possible to do so immediately without exceeding the queue's capacity, returning true upon success and false if this queue is full.
boolean	offer(E e, long timeout, TimeUnit unit)	Inserts the specified element at the tail of this queue, waiting if necessary up to the specified wait time for space to become available.
void	put(E e)	Inserts the specified element at the tail of this queue, waiting if necessary for space to become available.
void	setMaxFreeMemory(int maxFreeMemory)	set the max free memory.

从类继承的方法 org.dromara.dynamictp.common.queue.VariableLinkedBlockingQueue

clear, contains, drainTo, drainTo, iterator, peek, poll, poll, remainingCapacity, remove, setCapacity, size, spliterator, take, toArray, toArray, toString

从类继承的方法 java.util.AbstractQueue

add, addAll, element, remove

从类继承的方法 java.util.AbstractCollection

containsAll, isEmpty, removeAll, retainAll

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

从接口继承的方法 java.util.concurrent.BlockingQueue

add

从接口继承的方法 java.util.Collection

addAll, containsAll, equals, hashCode, isEmpty, parallelStream, removeAll, removeIf, retainAll, stream, toArray

从接口继承的方法 java.lang.Iterable

forEach

从接口继承的方法 java.util.Queue

element, remove

字段详细资料

THE_16_MB

public static final int THE_16_MB

另请参阅:

• 常量字段值

构造器详细资料

MemorySafeLinkedBlockingQueue

public MemorySafeLinkedBlockingQueue()

MemorySafeLinkedBlockingQueue

public MemorySafeLinkedBlockingQueue(int maxFreeMemory)

MemorySafeLinkedBlockingQueue

public MemorySafeLinkedBlockingQueue(int capacity,
 int maxFreeMemory)

MemorySafeLinkedBlockingQueue

public MemorySafeLinkedBlockingQueue(Collection<? extends E> c,
 int maxFreeMemory)

方法详细资料

setMaxFreeMemory

public void setMaxFreeMemory(int maxFreeMemory)

set the max free memory.

参数:

maxFreeMemory - the max free memory

getMaxFreeMemory

public int getMaxFreeMemory()

get the max free memory.

返回:

the max free memory limit

hasRemainedMemory

public boolean hasRemainedMemory()

determine if there is any remaining free memory.

返回:

true if has free memory

put

public void put(E e)
         throws InterruptedException

从类复制的说明: VariableLinkedBlockingQueue

Inserts the specified element at the tail of this queue, waiting if necessary for space to become available.

指定者:

put 在接口中 BlockingQueue<E>

覆盖:

put 在类中 VariableLinkedBlockingQueue<E>

抛出:

InterruptedException

offer

public boolean offer(E e,
 long timeout,
 TimeUnit unit)
              throws InterruptedException

从类复制的说明: VariableLinkedBlockingQueue

Inserts the specified element at the tail of this queue, waiting if necessary up to the specified wait time for space to become available.

指定者:

offer 在接口中 BlockingQueue<E>

覆盖:

offer 在类中 VariableLinkedBlockingQueue<E>

返回:

true if successful, or false if the specified waiting time elapses before space is available

抛出:

InterruptedException

offer

public boolean offer(E e)

从类复制的说明: VariableLinkedBlockingQueue

Inserts the specified element at the tail of this queue if it is possible to do so immediately without exceeding the queue's capacity, returning true upon success and false if this queue is full. When using a capacity-restricted queue, this method is generally preferable to method add, which can fail to insert an element only by throwing an exception.

指定者:

offer 在接口中 BlockingQueue<E>

指定者:

offer 在接口中 Queue<E>

覆盖:

offer 在类中 VariableLinkedBlockingQueue<E>