com.dynatrace.openkit.core

Class SynchronizedQueue<T>

java.lang.Object

com.dynatrace.openkit.core.SynchronizedQueue<T>

Type Parameters:

T - type of items in the queue instance

public class SynchronizedQueue<T>
extends java.lang.Object

SynchronizedQueue is an implementation of a data structure that fulfills the following requirements: - has to be thread-safe for access from multiple threads - should be non-blocking for performance reasons - random-delete has to be possible - first-in, first-out - shallow copies should be possible - should be easy to clear

As there was no real fit in the Java 6 JDK data structures, this is a simple self-made implementation. It's for sure not the best-performing implementation and it could make sense to introduce upper bounds, but it works well enough.

Constructor Summary

Constructors

Constructor and Description
SynchronizedQueue()

Method Summary

Modifier and Type	Method and Description
void	clear()
T	get()
boolean	isEmpty()
boolean	put(T entry)
boolean	remove(T entry)
java.util.ArrayList<T>	toArrayList()

Methods inherited from class java.lang.Object

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

Constructor Detail

SynchronizedQueue

public SynchronizedQueue()

Method Detail

put

public boolean put(T entry)

get

public T get()

remove

public boolean remove(T entry)

clear

public void clear()

isEmpty

public boolean isEmpty()

toArrayList

public java.util.ArrayList<T> toArrayList()