List of remainingCapacity() Examples

Examples of remainingCapacity()

com.hazelcast.core.IQueue.remainingCapacity()
{@inheritDoc}
edu.emory.mathcs.backport.java.util.concurrent.BlockingQueue.remainingCapacity()
Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking, or Integer.MAX_VALUE if there is no intrinsic limit.
Note that you cannot always tell if an attempt to insert an element will succeed by inspecting remainingCapacity because it may be the case that another thread is about to insert or remove an element. @return the remaining capacity
java.util.concurrent.BlockingQueue.remainingCapacity()
Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking, or {@code Integer.MAX_VALUE} if there is no intrinsiclimit.
Note that you cannot always tell if an attempt to insert an element will succeed by inspecting {@code remainingCapacity}because it may be the case that another thread is about to insert or remove an element. @return the remaining capacity
java.util.concurrent.LinkedBlockingQueue.remainingCapacity()
Returns the number of additional elements that this queue can ideally (in the absence of memory or resource constraints) accept without blocking. This is always equal to the initial capacity of this queue less the current {@code size} of this queue.
Note that you cannot always tell if an attempt to insert an element will succeed by inspecting {@code remainingCapacity}because it may be the case that another thread is about to insert or remove an element.
net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue.remainingCapacity()
net.rubyeye.xmemcached.transcoders.CachedData.remainingCapacity()

Examples of java.util.concurrent.BlockingQueue.remainingCapacity()

                assertFalse(Thread.interrupted());
            }
        });


        await(pleaseTake);
        assertEquals(0, q.remainingCapacity());
        assertEquals(0, q.take());


        await(pleaseInterrupt);
        assertThreadStaysAlive(t);
        t.interrupt();

View Full Code Here

Examples of java.util.concurrent.BlockingQueue.remainingCapacity()


        await(pleaseInterrupt);
        assertThreadStaysAlive(t);
        t.interrupt();
        awaitTermination(t);
        assertEquals(0, q.remainingCapacity());
    }


    /**
     * timed offer times out if full and elements not taken
     */

View Full Code Here

Examples of java.util.concurrent.BlockingQueue.remainingCapacity()

        BlockingQueue q = new LocalConcurrentBlockingObjectQueue(n);
        assertTrue(q.isEmpty());
        for (int i = 0; i < n; i++)
            assertTrue(q.offer(new Integer(i)));
        assertFalse(q.isEmpty());
        assertEquals(0, q.remainingCapacity());
        assertEquals(n, q.size());
        return q;
    }


    /**

View Full Code Here

Examples of java.util.concurrent.LinkedBlockingQueue.remainingCapacity()


    public void testBlockingQueueConfigured() throws Exception {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?size=2000", SedaEndpoint.class);
        BlockingQueue<Exchange> queue = endpoint.getQueue();
        LinkedBlockingQueue blockingQueue = assertIsInstanceOf(LinkedBlockingQueue.class, queue);
        assertEquals("remainingCapacity", 2000, blockingQueue.remainingCapacity());
    }
}

View Full Code Here

Examples of java.util.concurrent.LinkedBlockingQueue.remainingCapacity()


    public void testBlockingQueueConfigured() throws Exception {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?size=2000", SedaEndpoint.class);
        BlockingQueue<Exchange> queue = endpoint.getQueue();
        LinkedBlockingQueue blockingQueue = assertIsInstanceOf(LinkedBlockingQueue.class, queue);
        assertEquals("remainingCapacity", 2000, blockingQueue.remainingCapacity());
    }
    
    public void testConcurrentConsumersConfigured() {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?concurrentConsumers=5", SedaEndpoint.class);
        assertEquals("concurrentConsumers", 5, endpoint.getConcurrentConsumers());

View Full Code Here

Examples of java.util.concurrent.LinkedBlockingQueue.remainingCapacity()


    public void testBlockingQueueConfigured() throws Exception {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?size=2000", SedaEndpoint.class);
        BlockingQueue<Exchange> queue = endpoint.getQueue();
        LinkedBlockingQueue blockingQueue = assertIsInstanceOf(LinkedBlockingQueue.class, queue);
        assertEquals("remainingCapacity", 2000, blockingQueue.remainingCapacity());
    }
    
    public void testConcurrentConsumersConfigured() {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?concurrentConsumers=5", SedaEndpoint.class);
        assertEquals("concurrentConsumers", 5, endpoint.getConcurrentConsumers());

View Full Code Here

Examples of java.util.concurrent.LinkedBlockingQueue.remainingCapacity()


    public void testBlockingQueueConfigured() throws Exception {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?size=2000", SedaEndpoint.class);
        BlockingQueue<Exchange> queue = endpoint.getQueue();
        LinkedBlockingQueue blockingQueue = assertIsInstanceOf(LinkedBlockingQueue.class, queue);
        assertEquals("remainingCapacity", 2000, blockingQueue.remainingCapacity());
    }
    
    public void testConcurrentConsumersConfigured() {
        SedaEndpoint endpoint = resolveMandatoryEndpoint("seda:foo?concurrentConsumers=5", SedaEndpoint.class);
        assertEquals("concurrentConsumers", 5, endpoint.getConcurrentConsumers());

View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue.remainingCapacity()

        BlockingQueue q = new LocalConcurrentBlockingObjectQueue(n);
        assertTrue(q.isEmpty());
        for (int i = 0; i < n; i++)
            assertTrue(q.offer(new Integer(i)));
        assertFalse(q.isEmpty());
        assertEquals(0, q.remainingCapacity());
        assertEquals(n, q.size());
        return q;
    }


    /**

View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue.remainingCapacity()

     */
    @Test
    public void testEmptyFull() {
        BlockingQueue q = new LocalConcurrentBlockingObjectQueue(2);
        assertTrue(q.isEmpty());
        assertEquals(2, q.remainingCapacity());
        q.add(one);
        assertFalse(q.isEmpty());
        q.add(two);
        assertFalse(q.isEmpty());
        assertEquals(0, q.remainingCapacity());

View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue.remainingCapacity()

        assertEquals(2, q.remainingCapacity());
        q.add(one);
        assertFalse(q.isEmpty());
        q.add(two);
        assertFalse(q.isEmpty());
        assertEquals(0, q.remainingCapacity());
        assertFalse(q.offer(three));
    }


    /**
     * remainingCapacity decreases on add, increases on remove

View Full Code Here

0 1 2 3 4

TOP

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.