Package java.util.concurrent

Examples of java.util.concurrent.LinkedBlockingQueue$Itr

279
280
281
282
283
284
285
286
287
288
289
   public void setMaximumQueueSize(int size)
   {
      // Reset the executor work queue
      ArrayList tmp = new ArrayList();
      queue.drainTo(tmp);
      queue = new LinkedBlockingQueue(size);
      queue.addAll(tmp);

      ThreadFactory tf = executor.getThreadFactory();
      RejectedExecutionHandler handler = executor.getRejectedExecutionHandler();
      long keepAlive = executor.getKeepAliveTime(TimeUnit.SECONDS);
View Full Code Here
67
68
69
70
71
72
73
    *
    * @param poolSize the maximum pool size
    */
   public MinPooledExecutor(int poolSize)
   {
      super(poolSize, 2*poolSize, 60, TimeUnit.SECONDS, new LinkedBlockingQueue(1024));
   }
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
        _protocolHandler = protocolHandler;
        _prefetchHigh = prefetchHigh;
        _prefetchLow = prefetchLow;
        _exclusive = exclusive;
       
        _synchronousQueue = new LinkedBlockingQueue();
        _autoClose = autoClose;
        _browseOnly = browseOnly;

        try
        {
View Full Code Here
61
62
63
64
65
66
67
  /**
   * Creates a new instace with the default thread pool implementation (<tt>new ThreadPoolExecutor(16, 16, 60, TimeUnit.SECONDS, new LinkedBlockingQueue() )</tt>).
   */
  public ExecutorFilter() {
    this(new ThreadPoolExecutor(16, 16, 60, TimeUnit.SECONDS,
        new LinkedBlockingQueue()));
  }
View Full Code Here
92
93
94
95
96
97
98
   *            Keep alive time (in seconds)
   */
  public ExecutorFilter(int corePoolSize, int maximumPoolSize,
      long keepAliveTime) {
    this(new ThreadPoolExecutor(corePoolSize, maximumPoolSize,
        keepAliveTime, TimeUnit.SECONDS, new LinkedBlockingQueue()));
  }
View Full Code Here
406
407
408
409
410
411
412
413
414
415
416
            ThunkCreator thunkCreator)
    {

        final ThreadPoolExecutor executorService = new ThreadPoolExecutor(coreSize, maxSize,
                                                                          keepAliveMillis, TimeUnit.MILLISECONDS,
                                                                          new LinkedBlockingQueue(maxSize));

        shutdownHub.addRegistryShutdownListener(new RegistryShutdownListener()
        {
            public void registryDidShutdown()
            {
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
    private final Executor executor;

    public ServicePool(ServerService next, final String name, final int threads, final long keepAliveTime) {
        this.next = next;

        ThreadPoolExecutor p = new ThreadPoolExecutor(threads, threads, keepAliveTime, TimeUnit.MILLISECONDS, new LinkedBlockingQueue());
        p.setThreadFactory(new ThreadFactory() {
            private volatile int id = 0;

            public Thread newThread(Runnable arg0) {
                Thread thread = new Thread(arg0, name + " " + getNextID());
View Full Code Here
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
     */
    ThreadPoolExecutor getExecutorService() {
        if (executorService == null) {
            synchronized (this) {
                executorService = new ThreadPoolExecutor(EXECUTOR_CORE_POOL_SIZE, EXECUTOR_MAXIMUM_POOL_SIZE,
                        EXECUTOR_KEEP_ALIVE_TIME, TimeUnit.MILLISECONDS, new LinkedBlockingQueue());
            }
        }
        return executorService;
    }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
    }

    public JournalImpl(LogFileManager logFile) {
        this.file = logFile;
        this.packetPool = createBufferPool();
        this.executor = new ThreadPoolExecutor(1, 1, 30, TimeUnit.SECONDS, new LinkedBlockingQueue(), new ThreadFactory() {
            public Thread newThread(Runnable runnable) {
                Thread answer = new Thread(runnable, "Journal Writer");
                answer.setPriority(Thread.MAX_PRIORITY);
                answer.setDaemon(true);
                return answer;
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
   */
  public static <T> BlockingQueue<T> getQueue(String queueName) {
    BlockingQueue queue = queueMap.get(queueName);

    if (queue == null) {
      BlockingQueue newQueue = new LinkedBlockingQueue(queueSize);

      //如果之前消息队列还不存在,放入新队列并返回Null.否则返回之前的值.
      queue = queueMap.putIfAbsent(queueName, newQueue);
      if (queue == null) {
        queue = newQueue;
View Full Code Here
TOP

Related Classes of java.util.concurrent.LinkedBlockingQueue$Itr

  • azkaban.jobs.JobExecutorManager
  • backtype.storm.task.ShellBolt
  • com.alibaba.asyncload.AsyncLoadExecutor
  • com.basho.riak.client.core.query.Location
  • com.basho.riak.client.core.query.Namespace
  • com.basho.riak.client.core.util.BinaryValue
  • com.google.common.collect.Queues
  • com.hazelcast.spi.impl.BasicOperationScheduler$PartitionOperationThreadFactory
  • com.intellij.util.ui.UIUtil
  • com.netflix.eventbus.impl.ConsumerQueueFullTest$MyConsumerQueueSupplier$MyConsumerQueue
    • 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.