Examples of org.apache.commons.collections.buffer.PriorityBuffer

Package org.apache.commons.collections.buffer

Examples of org.apache.commons.collections.buffer.PriorityBuffer

org.apache.commons.collections.buffer.PriorityBuffer
Binary heap implementation of Buffer that provides for removal based on Comparator ordering.
The removal order of a binary heap is based on either the natural sort order of its elements or a specified {@link Comparator}. The {@link #remove()} method always returns the first element as determinedby the sort order. (The ascendingOrder flag in the constructors can be used to reverse the sort order, in which case {@link #remove()}will always remove the last element.) The removal order is not the same as the order of iteration; elements are returned by the iterator in no particular order.
The {@link #add(Object)} and {@link #remove()} operations performin logarithmic time. The {@link #get()} operation performs in constanttime. All other operations perform in linear time or worse.
Note that this implementation is not synchronized. Use {@link org.apache.commons.collections.BufferUtils#synchronizedBuffer(Buffer)} or{@link org.apache.commons.collections.buffer.SynchronizedBuffer#decorate(Buffer)}to provide synchronized access to a PriorityBuffer:
```
 Buffer heap = SynchronizedBuffer.decorate(new PriorityBuffer()); 
```
This class is Serializable from Commons Collections 3.2. @since Commons Collections 3.0 (previously BinaryHeap v1.0) @version $Revision: 646777 $ $Date: 2008-04-10 13:33:15 +0100 (Thu, 10 Apr 2008) $ @author Peter Donald @author Ram Chidambaram @author Michael A. Smith @author Paul Jack @author Stephen Colebourne @author Steve Phelps

    }
    return true;
  }
  
  public synchronized boolean seek(WritableComparable key) throws IOException {
    PriorityBuffer reheap = new PriorityBuffer(heap.size());
    boolean result = false;
    for (Object obj : heap) {
      Index index = (Index) obj;
      try {
        WritableComparable found = index.reader.getClosest(key, index.value, true);
        if (found != null && found.equals(key)) {
          result = true;
        }
      } catch (EOFException ex) {
        // thrown if key is beyond all data in the map
      }
      index.cached = false;
      reheap.add(index);
    }
    heap = reheap;
    return result;
  }

View Full Code Here

    }
    return true;
  }
  
  public synchronized boolean seek(WritableComparable key) throws IOException {
    PriorityBuffer reheap = new PriorityBuffer(heap.size());
    boolean result = false;
    for (Object obj : heap) {
      Index index = (Index) obj;
      try {
        WritableComparable found = index.reader.getClosest(key, index.value, true);
        if (found != null && found.compareTo(key) == 0) {
          result = true;
        }
      } catch (EOFException ex) {
        // thrown if key is beyond all data in the map
      }
      index.cached = false;
      reheap.add(index);
    }
    heap = reheap;
    return result;
  }

View Full Code Here

  
  protected void createHeap(int maxSize) {
    if (heap != null)
      throw new IllegalStateException("heap already exist");
    
    heap = new PriorityBuffer(maxSize == 0 ? 1 : maxSize);
  }

View Full Code Here

    }
    return true;
  }
  
  public synchronized boolean seek(WritableComparable key) throws IOException {
    PriorityBuffer reheap = new PriorityBuffer(heap.size());
    boolean result = false;
    for (Object obj : heap) {
      Index index = (Index) obj;
      try {
        WritableComparable found = index.reader.getClosest(key, index.value, true);
        if (found != null && found.equals(key)) {
          result = true;
        }
      } catch (EOFException ex) {
        // thrown if key is beyond all data in the map
      }
      index.cached = false;
      reheap.add(index);
    }
    heap = reheap;
    return result;
  }

View Full Code Here

  
  protected void createHeap(int maxSize) {
    if (heap != null)
      throw new IllegalStateException("heap already exist");
    
    heap = new PriorityBuffer(maxSize == 0 ? 1 : maxSize);
  }

View Full Code Here

TOP

Related Classes of org.apache.commons.collections.buffer.PriorityBuffer

org.apache.accumulo.core.iterators.HeapIterator

org.apache.accumulo.core.iterators.system.HeapIterator

org.apache.accumulo.server.tabletserver.log.MultiReader

org.apache.accumulo.tserver.log.MultiReader

java.util.NoSuchElementException

org.apache.commons.collections.BufferUnderflowException

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.