Package co.paralleluniverse.strands.queues

Examples of co.paralleluniverse.strands.queues.CircularIntBuffer

90
91
92
93
94
95
96
97
98
99
100
        final BasicSingleConsumerIntQueue queue;
        if (mailboxSize < 0) {
            queue = new SingleConsumerLinkedArrayIntQueue();
        } else if (policy == OverflowPolicy.DISPLACE) {
            queue = new CircularIntBuffer(mailboxSize, singleProducer);
        } else
            queue = new SingleConsumerArrayIntQueue(mailboxSize);

        return new QueueIntChannel(queue, policy);
    }
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
        final BasicSingleConsumerIntQueue queue;
        if (bufferSize < 0) {
            queue = new SingleConsumerLinkedArrayIntQueue();
        } else if (policy == OverflowPolicy.DISPLACE) {
            queue = new CircularIntBuffer(bufferSize, singleProducer);
        } else
            queue = new SingleConsumerArrayIntQueue(bufferSize);

        return new QueueIntChannel(queue, policy);
    }
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
        final BasicSingleConsumerIntQueue queue;
        if (bufferSize < 0) {
            queue = new SingleConsumerLinkedArrayIntQueue();
        } else if (policy == OverflowPolicy.DISPLACE) {
            queue = new CircularIntBuffer(bufferSize, singleProducer);
        } else
            queue = new SingleConsumerArrayIntQueue(bufferSize);

        return new QueueIntChannel(queue, policy);
    }
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
        final BasicSingleConsumerIntQueue queue;
        if (bufferSize < 0) {
            queue = new SingleConsumerLinkedArrayIntQueue();
        } else if (policy == OverflowPolicy.DISPLACE) {
            queue = new CircularIntBuffer(bufferSize, singleProducer);
        } else
            queue = new SingleConsumerArrayIntQueue(bufferSize);

        return new QueueIntChannel(queue, policy);
    }
View Full Code Here
194
195
196
197
198
199
200
201
202
203
204
        final BasicSingleConsumerIntQueue queue;
        if (bufferSize < 0) {
            queue = new SingleConsumerLinkedArrayIntQueue();
        } else if (policy == OverflowPolicy.DISPLACE) {
            queue = new CircularIntBuffer(bufferSize, singleProducer);
        } else
            queue = new SingleConsumerArrayIntQueue(bufferSize);

        return new QueueIntChannel(queue, policy);
    }
View Full Code Here
TOP

Related Classes of co.paralleluniverse.strands.queues.CircularIntBuffer

  • co.paralleluniverse.strands.channels.Channels
    • Copyright © 2018 www.massapicom. 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.