Java Buffer.add方法代码示例

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
/**
 * Take an existing Reservation that we know is legit and randomly decide to 
 * either queue it for a later update or delete transaction 
 * @param r
 */
protected void requeueReservation(Reservation r) {
    int idx = rng.nextInt(100);
    if (idx > 20) return;
    
    // Queue this motha trucka up for a deletin' or an updatin'
    CacheType ctype = null;
    if (rng.nextBoolean()) {
        ctype = CacheType.PENDING_DELETES;
    } else {
        ctype = CacheType.PENDING_UPDATES;
    }
    assert(ctype != null);
    
    Buffer<Reservation> cache = CACHE_RESERVATIONS.get(ctype);
    assert(cache != null);
    cache.add(r);
    if (debug.val)
        LOG.debug(String.format("Queued %s for %s [cacheSize=%d]\nFlightId: %d\nCustomerId: %d",
                  r, ctype, cache.size(),
                  r.flight_id, r.customer_id));
}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
/**
 * Tests {@link BlockingBuffer#get()} in combination with {@link BlockingBuffer#add()} using multiple read threads.
 * <p/>
 * Two read threads should block on an empty buffer until one object
 * is added then both threads should complete.
 */
public void testBlockedGetWithAdd() {

    Buffer blockingBuffer = BlockingBuffer.decorate(new MyBuffer());
    Object obj = new Object();
    
    // run methods will get and compare -- must wait for add
    Thread thread1 = new ReadThread(blockingBuffer, obj);
    Thread thread2 = new ReadThread(blockingBuffer, obj);
    thread1.start();
    thread2.start();
    
    // give hungry read threads ample time to hang
    delay();
       
    // notifyAll should allow both read threads to complete
    blockingBuffer.add(obj);
    
    // allow notified threads to complete 
    delay();
    
    // There should not be any threads waiting.
    if (thread1.isAlive() || thread2.isAlive())
        fail("Live thread(s) when both should be dead.");
}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
/**
 * Tests that the removal operation actually removes the first element.
 */
public void testCircularFifoBufferCircular() {
    List list = new ArrayList();
    list.add("A");
    list.add("B");
    list.add("C");
    Buffer buf = new CircularFifoBuffer(list);

    assertEquals(true, buf.contains("A"));
    assertEquals(true, buf.contains("B"));
    assertEquals(true, buf.contains("C"));

    buf.add("D");

    assertEquals(false, buf.contains("A"));
    assertEquals(true, buf.contains("B"));
    assertEquals(true, buf.contains("C"));
    assertEquals(true, buf.contains("D"));

    assertEquals("B", buf.get());
    assertEquals("B", buf.remove());
    assertEquals("C", buf.remove());
    assertEquals("D", buf.remove());
}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
public void testTransformedBuffer() {
    Buffer buffer = TransformedBuffer.decorate(new ArrayStack(), TestTransformedCollection.STRING_TO_INTEGER_TRANSFORMER);
    assertEquals(0, buffer.size());
    Object[] els = new Object[]{"1", "3", "5", "7", "2", "4", "6"};
    for (int i = 0; i < els.length; i++) {
        buffer.add(els[i]);
        assertEquals(i + 1, buffer.size());
        assertEquals(true, buffer.contains(new Integer((String) els[i])));
        assertEquals(false, buffer.contains(els[i]));
    }

    assertEquals(false, buffer.remove(els[0]));
    assertEquals(true, buffer.remove(new Integer((String) els[0])));

}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
/**
 * Tests {@link BlockingBuffer#remove()} in combination with {@link BlockingBuffer#add()} using multiple read threads.
 * <p/>
 * Two read threads should block on an empty buffer until one
 * object is added then one thread should complete. The remaining
 * thread should complete after the addition of a second object.
 */
public void testBlockedRemoveWithAdd() {

    Buffer blockingBuffer = BlockingBuffer.decorate(new MyBuffer());
    Object obj = new Object();
    
    // run methods will remove and compare -- must wait for add
    Thread thread1 = new ReadThread(blockingBuffer, obj, null, "remove");
    Thread thread2 = new ReadThread(blockingBuffer, obj, null, "remove");
    thread1.start();
    thread2.start();
    
    // give hungry read threads ample time to hang
    delay();

    blockingBuffer.add(obj);
    
    // allow notified threads to complete 
    delay();
    
    // There should be one thread waiting.
    assertTrue("There is one thread waiting", thread1.isAlive() ^ thread2.isAlive());

    blockingBuffer.add(obj);
    
    // allow notified thread to complete 
    delay();

    // There should not be any threads waiting.
    if (thread1.isAlive() || thread2.isAlive())
        fail("Live thread(s) when both should be dead.");
}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
public void testGet() {
    Buffer buffer = makeTestBuffer();
    try {
        Object o = buffer.get();
        fail("Expecting BufferUnderflowException");
    } catch (BufferUnderflowException ex) {
        // expected
    }
    buffer.add("one");
    buffer.add("two");
    buffer.add("three");
    assertEquals("Buffer get", buffer.get(), "three");
}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
public void testRemove() {
    Buffer buffer = makeTestBuffer();
    buffer.add("one");
    assertEquals("Buffer get", buffer.remove(), "one");
    try {
        buffer.remove();
        fail("Expecting BufferUnderflowException");
    } catch (BufferUnderflowException ex) {
        // expected
    }
}
 

import org.apache.commons.collections15.Buffer; //导入方法依赖的package包/类
/**
 * Extracts the weak components from a graph.
 * @param graph the graph whose weak components are to be extracted
 * @return the list of weak components
 */
public Set<Set<V>> transform(Graph<V,E> graph) {

    Set<Set<V>> clusterSet = new HashSet<Set<V>>();

    HashSet<V> unvisitedVertices = new HashSet<V>(graph.getVertices());

    while (!unvisitedVertices.isEmpty()) {
    	Set<V> cluster = new HashSet<V>();
        V root = unvisitedVertices.iterator().next();
        unvisitedVertices.remove(root);
        cluster.add(root);

        Buffer<V> queue = new UnboundedFifoBuffer<V>();
        queue.add(root);

        while (!queue.isEmpty()) {
            V currentVertex = queue.remove();
            Collection<V> neighbors = graph.getNeighbors(currentVertex);

            for(V neighbor : neighbors) {
                if (unvisitedVertices.contains(neighbor)) {
                    queue.add(neighbor);
                    unvisitedVertices.remove(neighbor);
                    cluster.add(neighbor);
                }
            }
        }
        clusterSet.add(cluster);
    }
    return clusterSet;
}