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)

  }


  LinkedList items = spacket.getSourceDescriptionItems();
  SourceDescriptionItem item;
  int itemType;
  for (ListIterator iter=items.listIterator(); iter.hasNext();) {
      item=(SourceDescriptionItem) iter.next();
      try {
    if (info.checkForItemValueChange(item)) {
        info.setStandardItem(item);
        infoModified=true;

View Full Code Here

  
  long subID=0;
  int active=0;
  byte[] name=null;


  for(ListIterator iter=subcomponents.listIterator();iter.hasNext();) {
      info = (SubcomponentReportInfo) iter.next();
      
      subID = info.getSubcomponentID();
      active = info.getActive();
      name = info.getApplicationLevelName();

View Full Code Here

      info = (RtpiSourceInfo) remoteParticipants.get(pid);
      if (info.timedOut(currentDeterministicTransmissionInterval*timeoutIntervalsSource)) {
          removeList.add(pid);
      }
  }
  for (ListIterator iter=removeList.listIterator();iter.hasNext();) {
      info= (RtpiSourceInfo) remoteParticipants.remove((Integer) iter.next());
      recipient.removeSource(this, info);
      members--;
  }
  removeList.clear();

View Full Code Here

      info = (RtpiSourceInfo) deletedParticipants.get(pid);
      if (info.timedOut(currentDeterministicTransmissionInterval*timeoutByeIntervals)) {
          removeList.add(pid);
      }
  }
  for (ListIterator iter=removeList.listIterator();iter.hasNext();) {
      deletedParticipants.remove((Integer) iter.next());
  }
  removeList.clear();


  // Timing out subcomponents

View Full Code Here

      if (sinfo.timedOut(currentDeterministicTransmissionInterval*timeoutIntervalsSubcomponent)) {
          removeList.add(subID);
      }
  }


  for (ListIterator iter=removeList.listIterator();iter.hasNext();) {
      subID = (Long) iter.next();
      sinfo = (SubcomponentInfo) remotePassiveSubcomponents.remove(subID);
      if (!remoteActiveSubcomponents.containsKey(subID) &&
    !localPassiveSubcomponents.containsKey(subID) &&
    !localActiveSubcomponents.containsKey(subID)) {

View Full Code Here

    //System.out.println("timeoutIntervalsSubcomponent: " + timeoutIntervalsSubcomponent);
          removeList.add(subID);
      }
  }


  for (ListIterator iter=removeList.listIterator();iter.hasNext();) {
      subID = (Long) iter.next();
      sinfo = (SubcomponentInfo) remoteActiveSubcomponents.remove(subID);
      if (!remotePassiveSubcomponents.containsKey(subID) &&
    !localPassiveSubcomponents.containsKey(subID) &&
    !localActiveSubcomponents.containsKey(subID)) {

View Full Code Here

        LinkedList returnedList = body.getChangedKnuthElements(oldList, alignment);
        // "wrap" the Position inside each element
        LinkedList tempList = returnedList;
        KnuthElement tempElement;
        returnedList = new LinkedList();
        ListIterator listIter = tempList.listIterator();
        while (listIter.hasNext()) {
            tempElement = (KnuthElement)listIter.next();
            tempElement.setPosition(new NonLeafPosition(this, tempElement.getPosition()));
            returnedList.add(tempElement);
        }

View Full Code Here

        return new FacesContextWrapper(facesContext, false)
        {
            // Constructor...
            {
                log.debug("getFacesContext: running inner constructor");
                ListIterator i = handlers.listIterator();
                try
                {
                    while(i.hasNext())
                    {
                        RequestHandler h = (RequestHandler) i.next();

View Full Code Here


            public void release()
            {
                log.debug("Running release");
                super.release();
                ListIterator i = handlers.listIterator();
                // ecch, wind forward to end of list.
                while (i.hasNext())
                {
                    i.next();
                }

View Full Code Here

    myList.add(null);
    myList.add("Blah");
    myList.add(null);
    myList.add("Booga");
    myList.add(null);
    ListIterator li = myList.listIterator();
    assertTrue("li.hasPrevious() should be false", !li.hasPrevious());
    assertNull("li.next() should be null", li.next());
    assertTrue("li.hasPrevious() should be true", li.hasPrevious());
    assertNull("li.prev() should be null", li.previous());
    assertNull("li.next() should be null", li.next());

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.