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

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

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

Stack.indexOf介绍

暂无

代码示例

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

  1. @SuppressWarnings("unchecked")
  2. private Operator<? extends OperatorDesc> getParentFromStack(Node currentMergeJoinOperator,
  3.   Stack<Node> stack) {
  4.  int pos = stack.indexOf(currentMergeJoinOperator);
  5.  return (Operator<? extends OperatorDesc>) stack.get(pos - 1);
  6. }

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

  1. @SuppressWarnings("unchecked")
  2. private Operator<? extends OperatorDesc> getParentFromStack(Node currentMergeJoinOperator,
  3.   Stack<Node> stack) {
  4.  int pos = stack.indexOf(currentMergeJoinOperator);
  5.  return (Operator<? extends OperatorDesc>) stack.get(pos - 1);
  6. }

代码示例来源：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: JingYeoh/FragmentRigger

  1. @Nullable
  2. private Activity getPreActivity() {
  3.   if (mPuppetHost instanceof Activity) {
  4.     Stack<Activity> stack = SwipeActivityManager.getInstance().getActivityStack();
  5.     int index = stack.indexOf(mPuppetHost);
  6.     if (index <= 0) {
  7.       return null;
  8.     }
  9.     return stack.get(index - 1);
  10.   }
  11.   return null;
  12. }

代码示例来源：origin: bingoogolapple/BGASwipeBackLayout-Android

  1. /**
  2.  * 获取倒数第二个 Activity
  3.  *
  4.  * @return
  5.  */
  6. @Nullable
  7. public Activity getPenultimateActivity(Activity currentActivity) {
  8.   Activity activity = null;
  9.   try {
  10.     if (mActivityStack.size() > 1) {
  11.       activity = mActivityStack.get(mActivityStack.size() - 2);
  12.       if (currentActivity.equals(activity)) {
  13.         int index = mActivityStack.indexOf(currentActivity);
  14.         if (index > 0) {
  15.           // 处理内存泄漏或最后一个 Activity 正在 finishing 的情况
  16.           activity = mActivityStack.get(index - 1);
  17.         } else if (mActivityStack.size() == 2) {
  18.           // 处理屏幕旋转后 mActivityStack 中顺序错乱
  19.           activity = mActivityStack.lastElement();
  20.         }
  21.       }
  22.     }
  23.   } catch (Exception e) {
  24.   }
  25.   return activity;
  26. }

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

  1. @Override
  2. public <R> Admin<R> split(final R r, final Step<T, R> step) {
  3.   final B_LP_NL_O_S_SE_SL_Traverser<R> clone = (B_LP_NL_O_S_SE_SL_Traverser<R>) super.split(r, step);
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public Admin<T> split() {
  3.   final B_LP_NL_O_P_S_SE_SL_Traverser<T> clone = (B_LP_NL_O_P_S_SE_SL_Traverser<T>) super.split();
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public Admin<T> split() {
  3.   final B_LP_NL_O_S_SE_SL_Traverser<T> clone = (B_LP_NL_O_S_SE_SL_Traverser<T>) super.split();
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public <R> Admin<R> split(final R r, final Step<T, R> step) {
  3.   final LP_NL_O_OB_P_S_SE_SL_Traverser<R> clone = (LP_NL_O_OB_P_S_SE_SL_Traverser<R>) super.split(r, step);
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public Admin<T> split() {
  3.   final NL_O_OB_S_SE_SL_Traverser<T> clone = (NL_O_OB_S_SE_SL_Traverser<T>) super.split();
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public <R> Admin<R> split(final R r, final Step<T, R> step) {
  3.   final LP_NL_O_OB_S_SE_SL_Traverser<R> clone = (LP_NL_O_OB_S_SE_SL_Traverser<R>) super.split(r, step);
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public Admin<T> split() {
  3.   final B_NL_O_S_SE_SL_Traverser<T> clone = (B_NL_O_S_SE_SL_Traverser<T>) super.split();
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public <R> Admin<R> split(final R r, final Step<T, R> step) {
  3.   final B_NL_O_S_SE_SL_Traverser<R> clone = (B_NL_O_S_SE_SL_Traverser<R>) super.split(r, step);
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public <R> Admin<R> split(final R r, final Step<T, R> step) {
  3.   final NL_O_OB_S_SE_SL_Traverser<R> clone = (NL_O_OB_S_SE_SL_Traverser<R>) super.split(r, step);
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public Admin<T> split() {
  3.   final LP_NL_O_OB_P_S_SE_SL_Traverser<T> clone = (LP_NL_O_OB_P_S_SE_SL_Traverser<T>) super.split();
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public <R> Admin<R> split(final R r, final Step<T, R> step) {
  3.   final B_LP_NL_O_P_S_SE_SL_Traverser<R> clone = (B_LP_NL_O_P_S_SE_SL_Traverser<R>) super.split(r, step);
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

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

  1. @Override
  2. public Admin<T> split() {
  3.   final LP_NL_O_OB_S_SE_SL_Traverser<T> clone = (LP_NL_O_OB_S_SE_SL_Traverser<T>) super.split();
  4.   clone.nestedLoops = new Stack<>();
  5.   for(LabelledCounter lc : this.nestedLoops)
  6.     clone.nestedLoops.push((LabelledCounter) lc.clone());
  7.   if (this.loopNames != null) {
  8.     clone.loopNames = new ReferenceMap(ReferenceMap.HARD, ReferenceMap.WEAK);
  9.     final Iterator loopNamesIterator = this.loopNames.entrySet().iterator();
  10.     while (loopNamesIterator.hasNext()) {
  11.       final ReferenceMap.Entry pair = (ReferenceMap.Entry) loopNamesIterator.next();
  12.       final int idx = this.nestedLoops.indexOf(pair.getValue());
  13.       if (idx != -1)
  14.         clone.loopNames.put(pair.getKey(), clone.nestedLoops.get(idx));
  15.     }
  16.   }
  17.   return clone;
  18. }

代码示例来源：origin: cincheo/jsweet

  1. return;
  2. int i = scanningStack.indexOf(from);
  3. if (i == -1 || i == 0) {
  4.   return;

代码示例来源：origin: smuyyh/SprintNBA

  1. static SwipeBackPage getPrePage(SwipeBackPage activity){
  2.   int index = mPageStack.indexOf(activity);
  3.   if (index>0)return mPageStack.get(index-1);
  4.   else return null;
  5. }

代码示例来源：origin: com.sun.faces/jsf-impl

  1. public UIComponent getParentCompositeComponent(FacesContext ctx, UIComponent forComponent) {
  2.   Stack<UIComponent> s = getStack(false);
  3.   if (s == null) {
  4.     return null;
  5.   } else {
  6.     int idx = s.indexOf(forComponent);
  7.     if (idx == 0) { // no parent
  8.       return null;
  9.     }
  10.     return (s.get(idx - 1));
  11.   }
  12. }

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

stack

相关文章

    查看更多

    热门标签

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

    最新文章

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