Examples of java.util.ArrayList.listIterator()

java.util.ArrayList.listIterator()
Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. The specified index indicates the first element that would be returned by an initial call to {@link ListIterator#next next}. An initial call to {@link ListIterator#previous previous} wouldreturn the element with the specified index minus one.
The returned list iterator is fail-fast. @throws IndexOutOfBoundsException {@inheritDoc}

        list.add(c.getConceptClass());
      }
    }catch(TerminologyException ex){
      ex.printStackTrace();
    }
    return new DefaultResourceIterator(list.listIterator());
  }


  public IProperty getProperty(String name) {
    // convert a name to valid property
    String oname = name;

View Full Code Here

                } else {
                    operands.add(lhs);
                    break;
                }
            }
            return new ReverseListIterator(operands.listIterator(operands.size()));
        }


        public void accept(Visitor.AtomVisitor visitor) { visitor.visitBinaryOperation(this); }
        public void accept(Visitor.RvalueVisitor visitor) { visitor.visitBinaryOperation(this); }
    }

View Full Code Here

        list.add(c.getConceptClass());
      }
    }catch(TerminologyException ex){
      ex.printStackTrace();
    }
    return new DefaultResourceIterator(list.listIterator());
  }


  public IProperty getProperty(String name) {
    // convert a name to valid property
    String oname = name;

View Full Code Here

                throw new XWSSecurityException(ex.getMessage());
            }
            
            boolean exclTransformToBeAdded = false;
            ArrayList transforms = signatureTarget.getTransforms();
            ListIterator transformIterator = transforms.listIterator();
            ArrayList transformList = new ArrayList(2);
            boolean disableInclusivePrefix = false;
            while(transformIterator.hasNext()) {
                SignatureTarget.Transform transformInfo = (SignatureTarget.Transform)transformIterator.next();
                String transformAlgo = transformInfo.getTransform();

View Full Code Here

                break;
            }
            parent=(Element)n;
        }
        //Visit them in reverse order.
        ListIterator it=parents.listIterator(parents.size());
        while (it.hasPrevious()) {
            Element ele=(Element)it.previous();
            if (!ele.hasAttributes()) {
                continue;
            }

View Full Code Here

             * have started, we need to propagate new LSNs upward, so we log
             * the node and update its parent.
             *
             * Start this iterator at the end of the list.
             */
            iter = nodeLadder.listIterator(nodeLadder.size());
            long lastParentForSplit = -1;
            while (iter.hasPrevious()) {
                SplitInfo info = (SplitInfo) iter.previous();
                child = info.child;
                parent = info.parent;

View Full Code Here

            /*
             * Unlatch any remaining children. There should only be remainders
             * in the event of an exception.
             */
            if (nodeLadder.size() > 0) {
                iter = nodeLadder.listIterator(nodeLadder.size());
                while (iter.hasPrevious()) {
                    SplitInfo info = (SplitInfo) iter.previous();
                    info.child.releaseLatchIfOwner();
                }
            }

View Full Code Here

                                break;
                        }
                        e=(Element)n;
                } while (e!=null);
                //Visit them in reverse order.
                ListIterator it2=parents.listIterator(parents.size()-1);
                Element ele=null;
                while (it2.hasPrevious()) {
                        ele=(Element)it2.previous();
                        if (set.contains(ele)) {
                                return ele;

View Full Code Here

    private LinkedHashSet resolveParentIds(ConfigurationData configurationData) throws MissingDependencyException, InvalidConfigException {
        Environment environment = configurationData.getEnvironment();


        LinkedHashSet parentIds = new LinkedHashSet();
        List dependencies = new ArrayList(environment.getDependencies());
        for (ListIterator iterator = dependencies.listIterator(); iterator.hasNext();) {
            Dependency dependency = (Dependency) iterator.next();
            Artifact resolvedArtifact = artifactResolver.resolveInClassLoader(dependency.getArtifact());
            if (isConfiguration(resolvedArtifact)) {
                parentIds.add(resolvedArtifact);

View Full Code Here

    {
        checkBaseName( baseName );
        
        List entries = new ArrayList( this.entries );
        
        for( ListIterator i = entries.listIterator(); i.hasNext(); )
        {
            Entry base = ( Entry ) i.next();
            if( base.getName().equals( baseName ) )
            {
                register( i.nextIndex(), new EntryImpl( name, filter ) );

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.