Examples of java.util.LinkedList.listIterator()

java.util.LinkedList.listIterator()
Returns a list-iterator of the elements in this list (in proper sequence), starting at the specified position in the list. Obeys the general contract of List.listIterator(int).
The list-iterator is fail-fast: if the list is structurally modified at any time after the Iterator is created, in any way except through the list-iterator's own remove or add methods, the list-iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future. @param index index of the first element to be returned from thelist-iterator (by a call to next) @return a ListIterator of the elements in this list (in propersequence), starting at the specified position in the list @throws IndexOutOfBoundsException {@inheritDoc} @see List#listIterator(int)

                }
            }
        }


        // create iterator for the updateList
        ListIterator updateListIterator = updateList.listIterator();
        Update currUpdate = null;
        //int iPreservedElements = 0;
        int iAddedElements = 0;
        //int iRemovedElements = 0;

View Full Code Here

            //between footnotes!)
            SpaceResolver.resolveElementList(noteList);
            
            int noteLength = 0;
            footnotesList.add(noteList);
            ListIterator noteListIterator = noteList.listIterator();
            while (noteListIterator.hasNext()) {
                KnuthElement element = (KnuthElement) noteListIterator.next();
                if (element.isBox() || element.isGlue()) {
                    noteLength += element.getW();
                }

View Full Code Here

                    true, 
                    bslm.isFirst(firstPos), 
                    bslm.isLast(lastPos));
        }


        StackingIter childPosIter = new StackingIter(positionList.listIterator());


        while ((childLM = childPosIter.getNextChildLM()) != null) {
            // TODO vh: the test above might be problematic in some cases. See comment in
            // the TableCellLM.getNextKnuthElements method
            // Add the block areas to Area

View Full Code Here

        addMarkersToPage(true, isFirst(firstPos), isLast(lastPos));


        if (bpUnit == 0) {
            // the Positions in positionList were inside the elements
            // created by the LineLM
            childPosIter = new StackingIter(positionList.listIterator());
            } else {
            // the Positions in positionList were inside the elements
            // created by the BlockLM in the createUnitElements() method
            //if (((Position) positionList.getLast()) instanceof
                  // LeafPosition) {

View Full Code Here

        
        if (bcpos == null) {
            if (bpUnit == 0) {
                // the Positions in positionList were inside the elements
                // created by the LineLM
                childPosIter = new StackingIter(positionList.listIterator());
            } else {
                // the Positions in positionList were inside the elements
                // created by the BCLM in the createUnitElements() method
                //if (((Position) positionList.getLast()) instanceof
                      // LeafPosition) {

View Full Code Here

          null,
          null);
    }


    List<String> tmpListOut = new LinkedList<String>();
    Iterator tmpIterator = tmpListIn.listIterator();
    while(tmpIterator.hasNext()){
      tmpListOut.add(((Generique)tmpIterator.next()).getLibelle());
    }


    Object[] possibilities = tmpListOut.toArray();

View Full Code Here

            }
        }


        addMarkersToPage(true, isFirst(firstPos), isLast(lastPos));
        
        StackingIter childPosIter = new StackingIter(positionList.listIterator());
        while ((childLM = childPosIter.getNextChildLM()) != null) {
            // Add the block areas to Area
            lc.setFlags(LayoutContext.FIRST_AREA, childLM == firstLM);
            lc.setFlags(LayoutContext.LAST_AREA, childLM == lastLM);
            // set the space adjustment ratio

View Full Code Here


        stackSize = 0;


        LinkedList contentList =
            getNextKnuthElements(childLC, Constants.EN_START);
        ListIterator contentIter = contentList.listIterator();
        while (contentIter.hasNext()) {
            KnuthElement element = (KnuthElement) contentIter.next();
            if (element instanceof KnuthInlineBox) {
                KnuthInlineBox box = (KnuthInlineBox) element;
                // TODO handle alignment here?

View Full Code Here

            }
            else if (! expected.equals(actual)) {
                if (TestUtil.getFieldSpecs(LinkedListCollections.fieldSpecs[i]
                            ).equals("BigDecimal")) {
                    ListIterator expectedIT = expected.listIterator();
                    ListIterator actualIt = actual.listIterator();
                    int index = 0;
                    while (expectedIT.hasNext()) {
                        BigDecimal bigDecExpected =
                                (BigDecimal)(expectedIT.next());
                        BigDecimal bigDecActual = (BigDecimal)(actualIt.next());

View Full Code Here

            else
                current = null;
        }


        Map nsDeclarations = null;
        ListIterator i = ancestorsAndSelf.listIterator(ancestorsAndSelf.size());
        while (i.hasPrevious()) {
            Element element = (Element) i.previous();
            nsDeclarations = addLocalNSDeclarations(element, nsDeclarations);
        }

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.