Examples of ArrayBlockingQueue

edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue
A bounded {@linkplain BlockingQueue blocking queue} backed by anarray. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue.
This is a classic "bounded buffer", in which a fixed-sized array holds elements inserted by producers and extracted by consumers. Once created, the capacity cannot be increased. Attempts to put an element into a full queue will result in the operation blocking; attempts to take an element from an empty queue will similarly block.
This class supports an optional fairness policy for ordering waiting producer and consumer threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness set to true grants threads access in FIFO order. Fairness generally decreases throughput but reduces variability and avoids starvation.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea
java.util.concurrent.ArrayBlockingQueue
A bounded {@linkplain BlockingQueue blocking queue} backed by anarray. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue.
This is a classic "bounded buffer", in which a fixed-sized array holds elements inserted by producers and extracted by consumers. Once created, the capacity cannot be changed. Attempts to {@code put} an element into a full queuewill result in the operation blocking; attempts to {@code take} anelement from an empty queue will similarly block.
This class supports an optional fairness policy for ordering waiting producer and consumer threads. By default, this ordering is not guaranteed. However, a queue constructed with fairness set to {@code true} grants threads access in FIFO order. Fairnessgenerally decreases throughput but reduces variability and avoids starvation.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea @param < E> the type of elements held in this collection

Examples of edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue

            pluginConfig);
      if (this.asyncSendQueueSizeMax > 0) {
         this.asyncSendQueueBlockOnOverflow = glob.get("asyncSendQueueBlockOnOverflow",
               this.asyncSendQueueBlockOnOverflow, null,
               pluginConfig);
         this.asyncSendQueue = new ArrayBlockingQueue(this.asyncSendQueueSizeMax);
         this.asyncSender = new AsyncSender(this, this.asyncSendQueue, msgIdFileName);
         Thread t = new Thread(this.asyncSender, getType() + "-AsyncSender");
         t.start();
      }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue

        public Worker() {
            super(THREAD_GROUP, "Dispatcher-" + COUNTER.incrementAndGet());
        }


        private void setQueue(BlockingQueue queue) {
            this.queue = (queue == null ? new ArrayBlockingQueue(capacity)
                    : queue);
        }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue

            return answer;
        }
    }


    protected BlockingQueueTransport createTransportChannel() {
        return new BlockingQueueTransport(new ArrayBlockingQueue(10));
    }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue

     * Constructor
     */
    public DeliveryChannelImpl(ComponentMBeanImpl component) {
        this.component = component;
        this.container = component.getContainer();
        this.queue = new ArrayBlockingQueue(component.getInboundQueueCapacity());
        this.transactionManager = (TransactionManager) this.container.getTransactionManager();
    }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.ArrayBlockingQueue

        if (config.getQueueSize() == 0) {
            queue = new SynchronousQueue();
        } else if (config.getQueueSize() < 0 || config.getQueueSize() == Integer.MAX_VALUE) {
            queue = new LinkedBlockingQueue();
        } else {
            queue = new ArrayBlockingQueue(config.getQueueSize());
        }
        ThreadFactory factory = new DefaultThreadFactory(id,
                                                         config.isThreadDaemon(), 
                                                         config.getThreadPriority());
        RejectedExecutionHandler handler = new ThreadPoolExecutor.CallerRunsPolicy();

View Full Code Here

Examples of java.util.concurrent.ArrayBlockingQueue

      frame.setResizable(true);
   }


   public InfinispanDemo(String cfgFileName) {
      asyncExecutor = Executors.newFixedThreadPool(1);
      tableUpdateExecutor = new ThreadPoolExecutor(1, 1, 0, TimeUnit.SECONDS, new ArrayBlockingQueue(1),
            new ThreadPoolExecutor.DiscardPolicy());


      cacheConfigFile = cfgFileName;
      cacheStatusProgressBar.setVisible(false);
      cacheStatusProgressBar.setEnabled(false);

View Full Code Here

Examples of java.util.concurrent.ArrayBlockingQueue

    * Important: this *MUST* be called with WL on {@link #address2key}.
    */
   private void addQueuesForAddresses(Collection<Address> addresses) {
      for (Address address : addresses) {
         if (interestedInAddress(address)) {
            address2key.put(address, new ArrayBlockingQueue(bufferSize));
         } else {
            if (log.isTraceEnabled())
               log.trace("Skipping address: " + address);
         }
      }

View Full Code Here

Examples of java.util.concurrent.ArrayBlockingQueue

    * Important: this *MUST* be called with WL on {@link #address2key}.
    */
   private void addQueuesForAddresses(Collection<Address> addresses) {
      for (Address address : addresses) {
         if (interestedInAddress(address)) {
            address2key.put(address, new ArrayBlockingQueue(bufferSize));
         } else {
            if (log.isTraceEnabled())
               log.tracef("Skipping address: %s", address);
         }
      }

View Full Code Here

Examples of java.util.concurrent.ArrayBlockingQueue

    * Important: this *MUST* be called with WL on {@link #address2key}.
    */
   private void addQueuesForAddresses(Collection<Address> addresses) {
      for (Address address : addresses) {
         if (interestedInAddress(address)) {
            address2key.put(address, new ArrayBlockingQueue(bufferSize));
         } else {
            if (log.isTraceEnabled())
               log.trace("Skipping address: " + address);
         }
      }

View Full Code Here

Examples of java.util.concurrent.ArrayBlockingQueue

      frame.setResizable(true);
   }


   public InfinispanDemo(String cfgFileName) {
      asyncExecutor = Executors.newFixedThreadPool(1);
      tableUpdateExecutor = new ThreadPoolExecutor(1, 1, 0, TimeUnit.SECONDS, new ArrayBlockingQueue(1),
            new ThreadPoolExecutor.DiscardPolicy());


      cacheConfigFile = cfgFileName;
      cacheStatusProgressBar.setVisible(false);
      cacheStatusProgressBar.setEnabled(false);

View Full Code Here

0 1 2 3 4 5

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.