java socket poll_Java LinkedBlockingQueue.poll方法代码示例

import java.util.concurrent.LinkedBlockingQueue; //导入方法依赖的package包/类

/**

* This removes the "num" values currently at the head of the Queue for the

* provided key. Will immediately fire the Queue filler function if key

* does not exist

* How many values are actually returned is governed by the

* SyncGenerationPolicy specified by the user.

* @param keyName String key name

* @param num Minimum number of values to return.

* @return List values returned

* @throws IOException

* @throws ExecutionException

*/

public List getAtMost(String keyName, int num) throws IOException,

ExecutionException {

LinkedBlockingQueue keyQueue = keyQueues.get(keyName);

// Using poll to avoid race condition..

LinkedList ekvs = new LinkedList();

try {

for (int i = 0; i < num; i++) {

E val = keyQueue.poll();

// If queue is empty now, Based on the provided SyncGenerationPolicy,

// figure out how many new values need to be generated synchronously

if (val == null) {

// Synchronous call to get remaining values

int numToFill = 0;

switch (policy) {

case ATLEAST_ONE:

numToFill = (ekvs.size() < 1) ? 1 : 0;

break;

case LOW_WATERMARK:

numToFill =

Math.min(num, (int) (lowWatermark * numValues)) - ekvs.size();

break;

case ALL:

numToFill = num - ekvs.size();

break;

}

// Synchronous fill if not enough values found

if (numToFill > 0) {

refiller.fillQueueForKey(keyName, ekvs, numToFill);

}

// Asynch task to fill > lowWatermark

if (i <= (int) (lowWatermark * numValues)) {

submitRefillTask(keyName, keyQueue);

}

return ekvs;

}

ekvs.add(val);

}

} catch (Exception e) {

throw new IOException("Exeption while contacting value generator ", e);

}

return ekvs;

}