Java ArrayBlockingQueue.offer方法代码示例

import java.util.concurrent.ArrayBlockingQueue; //导入方法依赖的package包/类
public void test() throws Exception{
	
	Vector<Object> vector = new Vector<Object>();
	ArrayBlockingQueue<Object> queue = new ArrayBlockingQueue<Object>(50000);

	Random myRandom = new Random();
	for (int j = 0; j<50000; j++){
		if (myRandom.nextInt(2) == 0){
			vector.add(i);
			queue.offer(i);
		}
		else{
			vector.add(k);
			queue.offer(k);
		}
	}
	
	assertTrue(Arrays.equals(vector.toArray(), queue.toArray()));
	
}
 

import java.util.concurrent.ArrayBlockingQueue; //导入方法依赖的package包/类
public boolean passMessageDownstream(Object object, MPIMessage currentMessage) {
  int src = router.mainTaskOfExecutor(instancePlan.getThisExecutor(), MPIContext.DEFAULT_PATH);
  RoutingParameters routingParameters = sendRoutingParameters(src, MPIContext.DEFAULT_PATH);
  ArrayBlockingQueue<Pair<Object, MPISendMessage>> pendingSendMessages =
      pendingSendMessagesPerSource.get(src);

  MPIMessage mpiMessage = new MPIMessage(src, type, MPIMessageDirection.OUT, delegete);

  // create a send message to keep track of the serialization
  // at the intial stage the sub-edge is 0
  int di = -1;
  if (routingParameters.getExternalRoutes().size() > 0) {
    di = routingParameters.getDestinationId();
  }
  MPISendMessage sendMessage = new MPISendMessage(src, mpiMessage, edge,
      di, MPIContext.DEFAULT_PATH, currentMessage.getHeader().getFlags(),
      routingParameters.getInternalRoutes(),
      routingParameters.getExternalRoutes());

  // now try to put this into pending
  return pendingSendMessages.offer(
      new ImmutablePair<Object, MPISendMessage>(object, sendMessage));
}
 

import java.util.concurrent.ArrayBlockingQueue; //导入方法依赖的package包/类
/**
 * Channel使用完毕之后,回收到阻塞队列arrayBlockingQueue
 *
 * @param arrayBlockingQueue
 * @param channel
 * @param inetSocketAddress
 */
public void release(ArrayBlockingQueue<Channel> arrayBlockingQueue, Channel channel, InetSocketAddress inetSocketAddress) {
    if (arrayBlockingQueue == null) {
        return;
    }

    //回收之前先检查channel是否可用,不可用的话,重新注册一个,放入阻塞队列
    if (channel == null || !channel.isActive() || !channel.isOpen() || !channel.isWritable()) {
        if (channel != null) {
            channel.deregister().syncUninterruptibly().awaitUninterruptibly();
            channel.closeFuture().syncUninterruptibly().awaitUninterruptibly();
        }
        Channel newChannel = null;
        while (newChannel == null) {
            logger.debug("---------register new Channel-------------");
            newChannel = registerChannel(inetSocketAddress);
        }
        arrayBlockingQueue.offer(newChannel);
        return;
    }
    arrayBlockingQueue.offer(channel);
}
 

import java.util.concurrent.ArrayBlockingQueue; //导入方法依赖的package包/类
public void levelOrderTraversal(Node node) {
	if (node == null) {
		return;
	}
	ArrayBlockingQueue<Node> queue = new ArrayBlockingQueue<>(10);
	
	queue.offer(node);
	
	while(!queue.isEmpty()) {
		Node temp = queue.poll();
		System.out.println(temp.getKey());
		if (temp.leftNode != null) {
			queue.offer(temp.leftNode);
		}
		if(temp.rightNode != null) {
			queue.offer(temp.rightNode);
		}
	}
}
 

import java.util.concurrent.ArrayBlockingQueue; //导入方法依赖的package包/类
public boolean sendMessagePartial(int source, Object object, int path,
                                    int flags, RoutingParameters routingParameters) {
    lock.lock();
    try {
//      LOG.info(String.format("%d send message partial %d", executor, source));
      // for partial sends we use minus value to find the correct queue
      ArrayBlockingQueue<Pair<Object, MPISendMessage>> pendingSendMessages =
          pendingSendMessagesPerSource.get(source * -1 - 1);

      MPIMessage mpiMessage = new MPIMessage(source, type, MPIMessageDirection.OUT, this);
      int di = -1;
      if (routingParameters.getExternalRoutes().size() > 0) {
        di = routingParameters.getDestinationId();
      }
      // create a send message to keep track of the serialization
      // at the intial stage the sub-edge is 0
      MPISendMessage sendMessage = new MPISendMessage(source, mpiMessage, edge,
          di, path, flags, routingParameters.getInternalRoutes(),
          routingParameters.getExternalRoutes());

      // now try to put this into pending
      boolean ret = pendingSendMessages.offer(
          new ImmutablePair<Object, MPISendMessage>(object, sendMessage));
      return ret;
    } finally {
      lock.unlock();
    }
  }
 

import java.util.concurrent.ArrayBlockingQueue; //导入方法依赖的package包/类
private K findMaxKeyBinaryTree(Node node) {
	
	if (node == null)
		return null;
	
	K max = (K)node.key;
	
	ArrayBlockingQueue<Node> queue = new ArrayBlockingQueue<>(20);
	queue.offer(node);
	
	while (!queue.isEmpty()) {
		Node temp = queue.poll();
		
		if(max.compareTo((K)temp.key) > 0) {
			max = max;
		} else {
			max = (K) temp.key;
		}
		
		if (temp.leftNode != null) {
			queue.offer(temp.leftNode);
		}
		if (temp.rightNode != null) {
			queue.offer(temp.rightNode);
		}
	}
	
	return max;
}