Examples of LocalConcurrentBlockingObjectQueue

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

38
39
40
41
42
43
44
45
46
47
48
49
50
51
    /**
     * Returns a new queue of given size containing consecutive
     * Integers 0 ... n.
     */
    private BlockingQueue populatedQueue(int n) {
        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

54
55
56
57
58
59
60
     * A new queue has the indicated capacity
     */

    @Test
    public void testConstructor1() {
        assertEquals(SIZE, new LocalConcurrentBlockingObjectQueue(SIZE).remainingCapacity());
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

63
64
65
66
67
68
69
70
71
72
     * Constructor throws IAE if capacity argument nonpositive
     */
    @Test
    public void testConstructor2() {
        try {
            new LocalConcurrentBlockingObjectQueue(0);
            shouldThrow();
        } catch (IllegalArgumentException success) {
        }
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

76
77
78
79
80
81
82
83
84
85
     */
    @Ignore
    @Test
    public void testConstructor3() {
        try {
            new LocalConcurrentBlockingObjectQueue(1, true, null);
            shouldThrow();
        } catch (NullPointerException success) {
        }
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

90
91
92
93
94
95
96
97
98
99
    @Ignore
    @Test
    public void testConstructor4() {
        Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
        try {
            new LocalConcurrentBlockingObjectQueue(SIZE, false, elements);
            shouldThrow();
        } catch (NullPointerException success) {
        }
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

107
108
109
110
111
112
113
114
115
116
        Integer[] ints = new Integer[SIZE];
        for (int i = 0; i < SIZE - 1; ++i)
            ints[i] = i;
        Collection<Integer> elements = Arrays.asList(ints);
        try {
            new LocalConcurrentBlockingObjectQueue(SIZE, false, Arrays.asList(ints));
            shouldThrow();
        } catch (NullPointerException success) {
        }
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

124
125
126
127
128
129
130
131
132
133
        Integer[] ints = new Integer[SIZE];
        for (int i = 0; i < SIZE; ++i)
            ints[i] = i;
        Collection<Integer> elements = Arrays.asList(ints);
        try {
            new LocalConcurrentBlockingObjectQueue(SIZE - 1, false, elements);
            shouldThrow();
        } catch (IllegalArgumentException success) {
        }
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

140
141
142
143
144
145
146
147
148
    public void testConstructor7() {
        Integer[] ints = new Integer[SIZE];
        for (int i = 0; i < SIZE; ++i)
            ints[i] = i;
        Collection<Integer> elements = Arrays.asList(ints);
        BlockingQueue q = new LocalConcurrentBlockingObjectQueue(SIZE, true, elements);
        for (int i = 0; i < SIZE; ++i)
            assertEquals(ints[i], q.poll());
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
    /**
     * Queue transitions from empty to full when elements added
     */
    @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());
        assertFalse(q.offer(three));
    }
View Full Code Here

Examples of net.openhft.chronicle.sandbox.queue.LocalConcurrentBlockingObjectQueue

184
185
186
187
188
189
190
191
192
    /**
     * Offer succeeds if not full; fails if full
     */
    @Test
    public void testOffer() {
        BlockingQueue q = new LocalConcurrentBlockingObjectQueue(1);
        assertTrue(q.offer(zero));
        assertFalse(q.offer(one));
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.