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

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

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

Stack.listIterator介绍

暂无

代码示例

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

  1. String styleString = ""; // $NON-NLS-1$
  2. ListIterator layerIter = layers.listIterator(layers.size());
  3. ListIterator styleIter = styles.listIterator(styles.size());
  4. while (layerIter.hasPrevious()) {

代码示例来源：origin: org.astrogrid/astrogrid-adqlparser-base

  1. public ListIterator listIterator() {
  2.   return stack.listIterator();
  3. }

代码示例来源：origin: org.astrogrid/astrogrid-adqlstox

  1. public ListIterator listIterator() {
  2.   return stack.listIterator();
  3. }

代码示例来源：origin: javanettasks/httpunit

  1. private Iterator getTopDownIterator( final Stack stack ) {
  2.   return new Iterator() {
  3.     private ListIterator _forwardIterator = stack.listIterator( stack.size() );
  4.     public boolean hasNext() {
  5.       return _forwardIterator.hasPrevious();
  6.     }
  7.     public Object next() {
  8.       return _forwardIterator.previous();
  9.     }
  10.     public void remove() {
  11.       _forwardIterator.remove();
  12.     }
  13.   };
  14. }

代码示例来源：origin: ogarcia/opensudoku

  1. public AbstractSingleCellCommand findLatestSingleCellCommand() {
  2.   ListIterator<AbstractCommand> iter = mCommandStack.listIterator(mCommandStack.size());
  3.   while (iter.hasPrevious()) {
  4.     AbstractCommand o = iter.previous();
  5.     if (o instanceof AbstractSingleCellCommand)
  6.       return (AbstractSingleCellCommand) o;
  7.   }
  8.   return null;
  9. }

代码示例来源：origin: openmrs/openmrs-module-htmlformentry

  1. /**
  2.  * Utility method that returns the object of a specified class that was most recently added to
  3.  * the stack
  4.  */
  5. @SuppressWarnings("unchecked")
  6. private <T> T highestOnStack(Class<T> clazz) {
  7.   for (ListIterator<Object> iter = stack.listIterator(stack.size()); iter.hasPrevious();) {
  8.     Object o = iter.previous();
  9.     if (clazz.isAssignableFrom(o.getClass()))
  10.       return (T) o;
  11.   }
  12.   return null;
  13. }

代码示例来源：origin: org.ow2.bonita/bonita-client

  1. /** search a contextual object in the stack by type. */
  2. @SuppressWarnings("unchecked")
  3. public <T> T findObject(final Class<T> clazz) {
  4.  if (objectStack != null && !objectStack.isEmpty()) {
  5.   final ListIterator<Object> listIter = objectStack.listIterator(objectStack.size());
  6.   while (listIter.hasPrevious()) {
  7.    final Object object = listIter.previous();
  8.    if (object != null && clazz.isAssignableFrom(object.getClass())) {
  9.     return (T) object;
  10.    }
  11.   }
  12.   return null;
  13.  }
  14.  return null;
  15. }

代码示例来源：origin: net.sf.okapi.filters/okapi-filter-abstractmarkup

  1. public boolean isInlineExcludedState() {
  2.   if (inlineRuleStack.isEmpty()) {
  3.     return false;
  4.   }
  5.   // reverse the stack as we want to see the most recently added first
  6.   //ReversedIterator<RuleType> ri = new ReversedIterator<RuleType>(inlineRuleStack);
  7.   // JEH 9/16/13 ReversedIterator was very slow - try a listIterator and move backwards 
  8.   ListIterator<RuleType> ri = inlineRuleStack.listIterator(inlineRuleStack.size());
  9.   while (ri.hasPrevious()) {
  10.     RuleType rt = ri.previous();
  11.     if (rt.ruleType == RULE_TYPE.INLINE_EXCLUDED_ELEMENT) {
  12.       return true;
  13.     }
  14.   }
  15.   return false;
  16. }

代码示例来源：origin: org.ow2.bonita/bonita-server

  1. /** search a contextual object in the stack by type. */
  2. @SuppressWarnings("unchecked")
  3. public <T> T findObject(final Class<T> clazz) {
  4.  if (objectStack != null && !objectStack.isEmpty()) {
  5.   final ListIterator<Object> listIter = objectStack.listIterator(objectStack.size());
  6.   while (listIter.hasPrevious()) {
  7.    final Object object = listIter.previous();
  8.    if (object != null && clazz.isAssignableFrom(object.getClass())) {
  9.     return (T) object;
  10.    }
  11.   }
  12.   return null;
  13.  }
  14.  return null;
  15. }

代码示例来源：origin: org.jbpm/pvm

  1. /** search a contextual object in the stack by type. */
  2. public <T> T findObject(Class<T> clazz) {
  3.  if ( (objectStack!=null)
  4.     && (! objectStack.isEmpty())
  5.    ) {
  6.   ListIterator<Object> listIter = objectStack.listIterator(objectStack.size());
  7.   while (listIter.hasPrevious()) {
  8.    Object object = listIter.previous();
  9.    if (object!=null) {
  10.     if (clazz.isAssignableFrom(object.getClass())) {
  11.      return (T) object;
  12.     }
  13.    }
  14.   }
  15.   return null;
  16.  }
  17.  return null;
  18. }

代码示例来源：origin: net.sf.okapi.filters/okapi-filter-abstractmarkup

  1. public boolean isExludedState() {
  2.   if (excludedIncludedRuleStack.isEmpty()) {
  3.     return excludeByDefault;
  4.   }
  5.   
  6.   // reverse the stack as we want to see the most recently added first
  7.   //ReversedIterator<RuleType> ri = new ReversedIterator<RuleType>(excludedIncludedRuleStack);
  8.   // JEH 9/16/13 ReversedIterator was very slow - try a listIterator and move backwards 
  9.   ListIterator<RuleType> ri = excludedIncludedRuleStack.listIterator(excludedIncludedRuleStack.size());
  10.   while (ri.hasPrevious()) {
  11.     RuleType rt = ri.previous();        
  12.     if (rt.ruleType == RULE_TYPE.EXCLUDED_ELEMENT) {
  13.       return true;
  14.     }
  15.     
  16.     if (rt.ruleType == RULE_TYPE.INCLUDED_ELEMENT) {
  17.       return false;
  18.     }
  19.   }
  20.   
  21.   return excludeByDefault;
  22. }

代码示例来源：origin: org.ow2.bonita/bonita-pvm

  1. /** search a contextual object in the stack by type. */
  2. public <T> T findObject(Class<T> clazz) {
  3.  if ((objectStack != null) && (!objectStack.isEmpty())) {
  4.   ListIterator<Object> listIter = objectStack.listIterator(objectStack
  5.     .size());
  6.   while (listIter.hasPrevious()) {
  7.    Object object = listIter.previous();
  8.    if (object != null) {
  9.     if (clazz.isAssignableFrom(object.getClass())) {
  10.      return (T) object;
  11.     }
  12.    }
  13.   }
  14.   return null;
  15.  }
  16.  return null;
  17. }

代码示例来源：origin: EngineHub/CommandHelper

  1. /**
  2.  * Returns the ivariable from the lowest stack element. If the IVariable is not defined, null is returned.
  3.  *
  4.  * @param name
  5.  * @return
  6.  */
  7. public IVariable getIVariableFromStack(String name) {
  8.   ListIterator<Set<IVariable>> stackIterator = variableStack.listIterator(variableStack.size());
  9.   while(stackIterator.hasPrevious()) {
  10.     Set<IVariable> set = stackIterator.previous();
  11.     for(IVariable v : set) {
  12.       if(v.getVariableName().equals(name)) {
  13.         return v;
  14.       }
  15.     }
  16.   }
  17.   return null;
  18. }

代码示例来源：origin: com.js-lib/js-json

  1. /**
  2.    * Dump circular dependencies stack to error log but leave stack unchanged.
  3.    * 
  4.    * @param value current value object on which circular dependency was discovered.
  5.    */
  6.   private void dumpCircularDependenciesStack(Object value) {
  7.     ListIterator<Object> it = circularDependenciesStack.listIterator(circularDependenciesStack.size());
  8.     StringBuilder dump = new StringBuilder();
  9.     while (it.hasPrevious()) {
  10.       dump.append(Strings.concat("\t- ", it.previous().getClass().getName(), "\r\n"));
  11.     }
  12.     log.error("Circular dependecies on value object |%s|. Set it to null. Stack dump:\r\n%s", value.getClass().getName(), dump.toString());
  13.   }
  14. }

代码示例来源：origin: org.terracotta/terracotta-ee

  1. private synchronized void addPendingAcquires(final LockWaiter waiter) {
  2.  if (!waiter.isRejoinInProgress()) {
  3.   Stack<PendingLockHold> reacquires = waiter.getReacquires();
  4.   java.util.ListIterator<PendingLockHold> it = reacquires.listIterator(reacquires.size());
  5.   while (it.hasPrevious()) {
  6.    addLast(it.previous());
  7.   }
  8.  }
  9. }

代码示例来源：origin: org.terracotta/terracotta-l1

  1. private synchronized void addPendingAcquires(final LockWaiter waiter) {
  2.  if (!waiter.isRejoinInProgress()) {
  3.   Stack<PendingLockHold> reacquires = waiter.getReacquires();
  4.   java.util.ListIterator<PendingLockHold> it = reacquires.listIterator(reacquires.size());
  5.   while (it.hasPrevious()) {
  6.    addLast(it.previous());
  7.   }
  8.  }
  9. }

代码示例来源：origin: org.terracotta/terracotta-l1-ee

  1. private synchronized void addPendingAcquires(final LockWaiter waiter) {
  2.  if (!waiter.isRejoinInProgress()) {
  3.   Stack<PendingLockHold> reacquires = waiter.getReacquires();
  4.   java.util.ListIterator<PendingLockHold> it = reacquires.listIterator(reacquires.size());
  5.   while (it.hasPrevious()) {
  6.    addLast(it.previous());
  7.   }
  8.  }
  9. }

代码示例来源：origin: net.sf.okapi.filters/okapi-filter-yaml

  1. private String getKeyNames(Key key) {
  2.   StringBuilder keyPath = new StringBuilder();
  3.   
  4.   if (!params.getUseKeyAsName()) {
  5.     return null;
  6.   }
  7.   
  8.   if (!params.getUseFullKeyPath()) {
  9.     return key.getKeyName();
  10.   }
  11.   
  12.   if (!keyStack.isEmpty()) {
  13.     Iterator<Key> it = keyStack.listIterator();
  14.     while (it.hasNext()) {
  15.       Key k = it.next();
  16.       if (k != null && !k.isEmpty()) {
  17.         if (keyPath.length() > 0) {
  18.           keyPath.append("/");
  19.         }
  20.         keyPath.append(k.getKeyName());
  21.       }
  22.     }            
  23.   }
  24.   
  25.   return keyPath.toString();
  26. }

代码示例来源：origin: io.snappydata/gemfirexd-core

  1. Scope findOwningScope(int actualTableNumber) {
  2.  //special handling so as to avoid picking up the TableQueryInfo at 0th index
  3.  //  in case the dml being investigated is a subquery . without this check
  4.  // the column will get associated with wrong Scope.
  5.  if(actualTableNumber == 0) {
  6.   return this.getScopeAt(0);
  7.  }
  8.  //Do not check in the current scope
  9.  ListIterator<Scope> scopeItr = this.scopes.listIterator(this.scopeLevel);
  10.  Scope found = null;
  11.  while(scopeItr.hasPrevious()) {
  12.   Scope scope = scopeItr.previous();
  13.   DMLQueryInfo dqi = scope.getDMLQueryInfo();      
  14.   if(dqi.getTableQueryInfo(actualTableNumber) != null) {
  15.    found = scope;
  16.    break;
  17.   }
  18.  }
  19.  return found;    
  20. }

代码示例来源：origin: io.snappydata/snappydata-store-core

  1. Scope findOwningScope(int actualTableNumber) {
  2.  //special handling so as to avoid picking up the TableQueryInfo at 0th index
  3.  //  in case the dml being investigated is a subquery . without this check
  4.  // the column will get associated with wrong Scope.
  5.  if(actualTableNumber == 0) {
  6.   return this.getScopeAt(0);
  7.  }
  8.  //Do not check in the current scope
  9.  ListIterator<Scope> scopeItr = this.scopes.listIterator(this.scopeLevel);
  10.  Scope found = null;
  11.  while(scopeItr.hasPrevious()) {
  12.   Scope scope = scopeItr.previous();
  13.   DMLQueryInfo dqi = scope.getDMLQueryInfo();      
  14.   if(dqi.getTableQueryInfo(actualTableNumber) != null) {
  15.    found = scope;
  16.    break;
  17.   }
  18.  }
  19.  return found;    
  20. }

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

stack

相关文章

    查看更多

    热门标签

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

    最新文章

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