java.util.Stack.subList()方法的使用及代码示例

x33g5p2x  于2022-01-29 转载在 其他  
字(6.2k)|赞(0)|评价(0)|浏览(178)

本文整理了Java中java.util.Stack.subList()方法的一些代码示例，展示了Stack.subList()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Stack.subList()方法的具体详情如下：
包路径：java.util.Stack
类名称：Stack
方法名：subList

Stack.subList介绍

暂无

代码示例

代码示例来源：origin: google/j2objc

  1. private List<Matcher> popLastArgumentMatchers(int count) {
  2.   List<Matcher> result = new LinkedList<Matcher>();
  3.   result.addAll(matcherStack.subList(matcherStack.size() - count, matcherStack.size()));
  4.   for (int i = 0; i < count; i++) {
  5.     matcherStack.pop();
  6.   }
  7.   return result;
  8. }

代码示例来源：origin: jenkinsci/jenkins

  1. private void detectedCycle(N q) throws CycleDetectedException {
  2.   int i = path.indexOf(q);
  3.   path.push(q);
  4.   reactOnCycle(q, path.subList(i, path.size()));
  5. }

代码示例来源：origin: apache/pdfbox

  1. @Override
  2. public void execute(ExecutionContext context)
  3. {
  4.   Stack<Object> stack = context.getStack();
  5.   int n = ((Number)stack.pop()).intValue();
  6.   if (n > 0)
  7.   {
  8.     int size = stack.size();
  9.     //Need to copy to a new list to avoid ConcurrentModificationException
  10.     List<Object> copy = new java.util.ArrayList<>(
  11.         stack.subList(size - n, size));
  12.     stack.addAll(copy);
  13.   }
  14. }

代码示例来源：origin: org.openl.rules/org.openl.rules.mapping.dev.dozer

  1. public List<Object> getDestParents() {
  2.   return dstObjects.subList(0, dstObjects.size());
  3. }

代码示例来源：origin: org.openl.rules/org.openl.rules.mapping.dev.modified

  1. public List<Object> getSourceParents() {
  2.   return srcObjects.subList(0, srcObjects.size());
  3. }

代码示例来源：origin: org.openl.rules/org.openl.rules.mapping.dev.dozer

  1. public List<Object> getSourceParents() {
  2.   return srcObjects.subList(0, srcObjects.size());
  3. }

代码示例来源：origin: org.openl.rules/org.openl.rules.mapping.dev.modified

  1. public List<Object> getDestParents() {
  2.   return dstObjects.subList(0, dstObjects.size());
  3. }

代码示例来源：origin: org.apache.pdfbox/pdfbox

  1. public void execute(ExecutionContext context)
  2. {
  3.   Stack<Object> stack = context.getStack();
  4.   int n = ((Number)stack.pop()).intValue();
  5.   if (n > 0)
  6.   {
  7.     int size = stack.size();
  8.     //Need to copy to a new list to avoid ConcurrentModificationException
  9.     List<Object> copy = new java.util.ArrayList<Object>(
  10.         stack.subList(size - n, size));
  11.     stack.addAll(copy);
  12.   }
  13. }

代码示例来源：origin: com.github.lafa.pdfbox/pdfbox

  1. public void execute(ExecutionContext context)
  2. {
  3.   Stack<Object> stack = context.getStack();
  4.   int n = ((Number)stack.pop()).intValue();
  5.   if (n > 0)
  6.   {
  7.     int size = stack.size();
  8.     //Need to copy to a new list to avoid ConcurrentModificationException
  9.     List<Object> copy = new java.util.ArrayList<>(
  10.         stack.subList(size - n, size));
  11.     stack.addAll(copy);
  12.   }
  13. }

代码示例来源：origin: TomRoush/PdfBox-Android

  1. public void execute(ExecutionContext context)
  2. {
  3.   Stack<Object> stack = context.getStack();
  4.   int n = ((Number)stack.pop()).intValue();
  5.   if (n > 0)
  6.   {
  7.     int size = stack.size();
  8.     //Need to copy to a new list to avoid ConcurrentModificationException
  9.     List<Object> copy = new java.util.ArrayList<Object>(
  10.         stack.subList(size - n, size));
  11.     stack.addAll(copy);
  12.   }
  13. }

代码示例来源：origin: easymock/easymock

  1. private static List<IArgumentMatcher> popLastArgumentMatchers(int count) {
  2.   Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(Thread
  3.       .currentThread());
  4.   assertState(stack != null, "no matchers found.");
  5.   assertState(stack.size() >= count, "" + count + " matchers expected, "
  6.       + stack.size() + " recorded.");
  7.   List<IArgumentMatcher> result = new LinkedList<IArgumentMatcher>();
  8.   result.addAll(stack.subList(stack.size() - count, stack.size()));
  9.   for (int i = 0; i < count; i++) {
  10.     stack.pop();
  11.   }
  12.   return result;
  13. }

代码示例来源：origin: org.easymock/com.springsource.org.easymock

  1. private static List<IArgumentMatcher> popLastArgumentMatchers(int count) {
  2.   Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
  3.   assertState(stack != null, "no matchers found.");
  4.   assertState(stack.size() >= count, "" + count + " matchers expected, "
  5.       + stack.size() + " recorded.");
  6.   List<IArgumentMatcher> result = new LinkedList<IArgumentMatcher>();
  7.   result.addAll(stack.subList(stack.size() - count, stack.size()));
  8.   for (int i = 0; i < count; i++) {
  9.     stack.pop();
  10.   }
  11.   return result;
  12. }

代码示例来源：origin: com.google.code.maven-play-plugin.com.google.code.eamelink-mockito/mockito-all

  1. private List<Matcher> popLastArgumentMatchers(int count) {
  2.   assertState(!matcherStack.isEmpty(), "No matchers found.");
  3.   assertState(matcherStack.size() >= count,
  4.       "" + count + " matchers expected, " + matcherStack.size() + " recorded.");
  5.   List<Matcher> result = new LinkedList<Matcher>();
  6.   result.addAll(matcherStack.subList(matcherStack.size() - count, matcherStack.size()));
  7.   for (int i = 0; i < count; i++) {
  8.     matcherStack.pop();
  9.   }
  10.   return result;
  11. }

代码示例来源：origin: org.jenkins-ci.main/jenkins-core

  1. private void detectedCycle(N q) throws CycleDetectedException {
  2.   int i = path.indexOf(q);
  3.   path.push(q);
  4.   reactOnCycle(q, path.subList(i, path.size()));
  5. }

代码示例来源：origin: org.jvnet.hudson.main/hudson-core

  1. private void detectedCycle(N q) throws CycleDetectedException {
  2.   int i = path.indexOf(q);
  3.   path.push(q);
  4.   throw new CycleDetectedException(path.subList(i, path.size()));
  5. }

代码示例来源：origin: hudson/hudson-2.x

  1. private void detectedCycle(N q) throws CycleDetectedException {
  2.   int i = path.indexOf(q);
  3.   path.push(q);
  4.   throw new CycleDetectedException(path.subList(i, path.size()));
  5. }

代码示例来源：origin: org.eclipse.hudson/hudson-core

  1. private void detectedCycle(N q) throws CycleDetectedException {
  2.   int i = path.indexOf(q);
  3.   path.push(q);
  4.   throw new CycleDetectedException(path.subList(i, path.size()));
  5. }

代码示例来源：origin: org.eclipse.hudson.main/hudson-core

  1. private void detectedCycle(N q) throws CycleDetectedException {
  2.   int i = path.indexOf(q);
  3.   path.push(q);
  4.   throw new CycleDetectedException(path.subList(i, path.size()));
  5. }

代码示例来源：origin: com.github.sommeri/less4j

  1. public List<Variable> getCycleFor(Variable input) {
  2.  if (!wouldCycle(input))
  3.   return Collections.emptyList();
  4.  
  5.  int position = names.indexOf(input.getName());
  6.  List<Variable> result = new ArrayList<Variable>(variables.subList(position, variables.size()));
  7.  result.add(input);
  8.  return result;
  9. }

代码示例来源：origin: org.icefaces/icefaces-mobi

  1. public void setSelected(String selected){
  2.   super.setSelected(selected);
  3.   Stack<String> history = getHistory();
  4.   if( history.size() == 1 && history.get(0).equals(selected)){
  5.     return;
  6.   }
  7.   if( history.size() > 1 && getHistory().contains(selected)){
  8.     Stack<String> newHistory = new Stack<String>();
  9.     newHistory.addAll(getHistory().subList(0, getHistory().indexOf(selected)+1));
  10.     setHistory(newHistory);
  11.   }
  12.   else {
  13.     getHistory().push(selected);
  14.   }
  15. }

内容来源于网络，如有侵权，请联系作者删除！

stack

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com