Examples of org.apache.commons.collections.UnboundedFifoBuffer

org.apache.commons.collections.UnboundedFifoBuffer
UnboundedFifoBuffer is a very efficient buffer implementation. According to performance testing, it exhibits a constant access time, but it also outperforms ArrayList when used for the same purpose.
The removal order of an UnboundedFifoBuffer is based on the insertion order; elements are removed in the same order in which they were added. The iteration order is the same as the removal order.
The {@link #remove()} and {@link #get()} operations perform in constant time.The {@link #add(Object)} operation performs in amortized constant time. Allother operations perform in linear time or worse.
Note that this implementation is not synchronized. The following can be used to provide synchronized access to your UnboundedFifoBuffer:
```
 Buffer fifo = BufferUtils.synchronizedBuffer(new UnboundedFifoBuffer()); 
```
This buffer prevents null objects from being added. @deprecated Moved to buffer subpackage. Due to be removed in v4.0. @since Commons Collections 2.1 @version $Revision: 646777 $ $Date: 2008-04-10 13:33:15 +0100 (Thu, 10 Apr 2008) $ @author Avalon @author Federico Barbieri @author Berin Loritsch @author Paul Jack @author Stephen Colebourne @author Andreas Schlosser

     *
     * @return queue.
     */
    protected Buffer createQueueBuffer()
    {
        return new UnboundedFifoBuffer(100);
    }

View Full Code Here


    public void clearEvents(FacesContext context) {
  int len;
  events = new Buffer[len = PhaseId.VALUES.size()];
  for (int i = 0; i < len; i++) {
      events[i] = new UnboundedFifoBuffer();
  }
    }

View Full Code Here

     * Constructor for a managed pool
     */
    public VariableSizePool( ObjectFactory factory, int size, long key )
        throws Exception
    {
        m_buffer = new UnboundedFifoBuffer( size );
        m_factory = factory;
        m_key = key;


        synchronized( m_factory )
        {

View Full Code Here

    public DefaultQueue( EnqueuePredicate predicate )
    {
        setEnqueuePredicate( predicate );


        m_mutex = new ReentrantLock();
        m_elements = new UnboundedFifoBuffer();
        m_reserve = 0;
        m_maxSize = -1;
    }

View Full Code Here

    public DefaultQueue( EnqueuePredicate predicate )
    {
        setEnqueuePredicate( predicate );


        m_mutex = new ReentrantLock();
        m_elements = new UnboundedFifoBuffer();
        m_reserve = 0;
        m_maxSize = -1;
    }

View Full Code Here

     * Constructor for a managed pool
     */
    public VariableSizePool( ObjectFactory factory, int size, long key )
        throws Exception
    {
        m_buffer = new UnboundedFifoBuffer( size );
        m_factory = factory;
        m_key = key;


        synchronized( m_factory )
        {

View Full Code Here

     * Constructor for a managed pool
     */
    public VariableSizePool( ObjectFactory factory, int size, long key )
        throws Exception
    {
        m_buffer = new UnboundedFifoBuffer( size );
        m_factory = factory;
        m_key = key;


        synchronized( m_factory )
        {

View Full Code Here

    public DefaultQueue( EnqueuePredicate predicate )
    {
        setEnqueuePredicate( predicate );


        m_mutex = new ReentrantLock();
        m_elements = new UnboundedFifoBuffer();
        m_reserve = 0;
        m_maxSize = -1;
    }

View Full Code Here

TOP

Related Classes of org.apache.commons.collections.UnboundedFifoBuffer

com.salas.bb.utils.concurrency.CachingCalculator

org.ajax4jsf.component.AjaxViewRoot

org.apache.excalibur.event.impl.DefaultQueue

org.apache.excalibur.mpool.VariableSizePool

java.util.NoSuchElementException

java.util.Iterator

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.