本文整理汇总了Java中java.util.Deque.getFirst方法的典型用法代码示例。如果您正苦于以下问题:Java Deque.getFirst方法的具体用法?Java Deque.getFirst怎么用?Java Deque.getFirst使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类java.util.Deque
的用法示例。
在下文中一共展示了Deque.getFirst方法的9个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: readAttribute
import java.util.Deque; //导入方法依赖的package包/类
@Override
public String readAttribute(final HttpServerExchange exchange) {
Deque<String> res = exchange.getPathParameters().get(parameter);
if(res == null) {
return null;
}else if(res.isEmpty()) {
return "";
} else if(res.size() ==1) {
return res.getFirst();
} else {
StringBuilder sb = new StringBuilder("[");
int i = 0;
for(String s : res) {
sb.append(s);
if(++i != res.size()) {
sb.append(", ");
}
}
sb.append("]");
return sb.toString();
}
}
示例2: unavailableTransformer
import java.util.Deque; //导入方法依赖的package包/类
/**
* Called to identify a transformer that cannot be used during working out
* available transformers.
*/
public void unavailableTransformer(ContentTransformer transformer, String sourceMimetype, String targetMimetype, long maxSourceSizeKBytes)
{
if (isEnabled())
{
Deque<Frame> ourStack = ThreadInfo.getStack();
Frame frame = ourStack.peek();
if (frame != null)
{
Deque<String> isTransformableStack = ThreadInfo.getIsTransformableStack();
String name = (!isTransformableStack.isEmpty())
? isTransformableStack.getFirst()
: getName(transformer);
boolean debug = (maxSourceSizeKBytes != 0);
if (frame.unavailableTransformers == null)
{
frame.unavailableTransformers = new TreeSet<UnavailableTransformer>();
}
String priority = gePriority(transformer, sourceMimetype, targetMimetype);
frame.unavailableTransformers.add(new UnavailableTransformer(name, priority, maxSourceSizeKBytes, debug));
}
}
}
示例3: doAuthorize
import java.util.Deque; //导入方法依赖的package包/类
@SuppressWarnings("deprecation")
public void doAuthorize(HttpServerExchange exchange) throws ServerError{
Map<String, Deque<String>> queryParams = exchange.getQueryParameters();
Deque<String> parameter = queryParams.get("apiKey");
String apiKey = parameter.getFirst();
String path = exchange.getRequestPath();
String threescaleMethod = getThreescaleMethodName(path);
AuthorizeResponse auth = pluginService.authRep(apiKey, threescaleMethod);
if (auth!=null && (!auth.success())){
//TODO find non-deprecated way of doing this.
exchange.setResponseCode(403);
}
}
示例4: readAttribute
import java.util.Deque; //导入方法依赖的package包/类
@Override
public String readAttribute(final HttpServerExchange exchange) {
Deque<String> res = exchange.getQueryParameters().get(parameter);
if(res == null) {
return null;
}else if(res.isEmpty()) {
return "";
} else if(res.size() ==1) {
return res.getFirst();
} else {
StringBuilder sb = new StringBuilder("[");
int i = 0;
for(String s : res) {
sb.append(s);
if(++i != res.size()) {
sb.append(", ");
}
}
sb.append("]");
return sb.toString();
}
}
示例5: getParameter
import java.util.Deque; //导入方法依赖的package包/类
@Override
public String getParameter(final String name) {
if(queryParameters == null) {
queryParameters = exchange.getQueryParameters();
}
Deque<String> params = queryParameters.get(name);
if (params == null) {
if (exchange.getRequestMethod().equals(Methods.POST)) {
final FormData parsedFormData = parseFormData();
if (parsedFormData != null) {
FormData.FormValue res = parsedFormData.getFirst(name);
if (res == null || res.isFile()) {
return null;
} else {
return res.getValue();
}
}
}
return null;
}
return params.getFirst();
}
示例6: PathDrawer
import java.util.Deque; //导入方法依赖的package包/类
private PathDrawer(GoogleMap map,
Deque<PathCreator.DistanceFrom> path,
BitmapDescriptor firstNodeIcon,
BitmapDescriptor middleNodeIcon,
BitmapDescriptor lastNodeIcon) {
this.map = map;
this.path = new ArrayDeque<>();
this.path.addAll(path);
last = path.getFirst();
this.firstNodeIcon = firstNodeIcon;
this.middleNodeIcon = middleNodeIcon;
this.lastNodeIcon = lastNodeIcon;
this.isFirstPop = true;
}
示例7: findSessionId
import java.util.Deque; //导入方法依赖的package包/类
@Override
public String findSessionId(final HttpServerExchange exchange) {
Deque<String> stringDeque = exchange.getPathParameters().get(name);
if (stringDeque == null) {
return null;
}
return stringDeque.getFirst();
}
示例8: testCleanupMemoryAvailabilityWaiterOnInterruption
import java.util.Deque; //导入方法依赖的package包/类
/**
* Test if the waiter that is waiting on availability of more memory is cleaned up when an interruption occurs
*/
@Test
public void testCleanupMemoryAvailabilityWaiterOnInterruption() throws Exception {
BufferPool pool = new BufferPool(2, 1, metrics, time, metricGroup);
long blockTime = 5000;
pool.allocate(1, maxBlockTimeMs);
Thread t1 = new Thread(new BufferPoolAllocator(pool, blockTime));
Thread t2 = new Thread(new BufferPoolAllocator(pool, blockTime));
// start thread t1 which will try to allocate more memory on to the Buffer pool
t1.start();
// sleep for 500ms. Condition variable c1 associated with pool.allocate() by thread t1 will be inserted in the waiters queue.
Thread.sleep(500);
Deque<Condition> waiters = pool.waiters();
// get the condition object associated with pool.allocate() by thread t1
Condition c1 = waiters.getFirst();
// start thread t2 which will try to allocate more memory on to the Buffer pool
t2.start();
// sleep for 500ms. Condition variable c2 associated with pool.allocate() by thread t2 will be inserted in the waiters queue. The waiters queue will have 2 entries c1 and c2.
Thread.sleep(500);
t1.interrupt();
// sleep for 500ms.
Thread.sleep(500);
// get the condition object associated with allocate() by thread t2
Condition c2 = waiters.getLast();
t2.interrupt();
assertNotEquals(c1, c2);
t1.join();
t2.join();
// both the allocate() called by threads t1 and t2 should have been interrupted and the waiters queue should be empty
assertEquals(pool.queued(), 0);
}
示例9: print
import java.util.Deque; //导入方法依赖的package包/类
public void print(TreeNode root) {
if (root == null)
return;
Deque<TreeNode> queue = new ArrayDeque<>();
queue.addLast(root);
int nextLevel = 0;
int toBePrinted = 1;
while (!queue.isEmpty()) {
TreeNode node = queue.getFirst();
System.out.print(node.val + " ");
if (node.left != null) {
queue.addLast(node.left);
++nextLevel;
}
if (node.right != null) {
queue.addLast(node.right);
++nextLevel;
}
queue.pop();
--toBePrinted;
if (toBePrinted == 0) {
System.out.println();
toBePrinted = nextLevel;
nextLevel = 0;
}
}
}