Examples of java.util.ListIterator

java.util.ListIterator
An iterator for lists that allows the programmer to traverse the list in either direction, modify the list during iteration, and obtain the iterator's current position in the list. A ListIterator has no current element; its cursor position always lies between the element that would be returned by a call to previous() and the element that would be returned by a call to next(). An iterator for a list of length n has n+1 possible cursor positions, as illustrated by the carets (^) below:
```
 Element(0)   Element(1)   Element(2)   ... Element(n-1) cursor positions:  ^            ^            ^            ^                  ^ 
```
Note that the {@link #remove} and {@link #set(Object)} methods arenot defined in terms of the cursor position; they are defined to operate on the last element returned by a call to {@link #next} or {@link #previous()}.
This interface is a member of the Java Collections Framework. @author Josh Bloch @version 1.28, 04/21/06 @see Collection @see List @see Iterator @see Enumeration @see List#listIterator() @since 1.2

                  
      List dels = new ArrayList();
      
      synchronized (refLock)
      {
         ListIterator liter = messageRefs.iterator();
                           
         while (iter.hasNext())
         {
            Long id = (Long)iter.next();
            
            //Scan the queue
            while (true)
            {               
               if (!liter.hasNext())
               {
                  // TODO we need to look in paging state too - currently not supported
                  //http://jira.jboss.com/jira/browse/JBMESSAGING-839
                  log.warn(this + " cannot find reference " + id + " (Might be paged!)");
                  break;
               }
               
               MessageReference ref = (MessageReference)liter.next();
               
               if (ref.getMessage().getMessageID() == id.longValue())
               {
                  liter.remove();
                  
                  Delivery del = new SimpleDelivery(this, ref);
                  
                  dels.add(del);

View Full Code Here


      try
      {
         // The iterator is used to iterate through the refs in the channel in the case that they
         // don't match the selectors of any receivers.
         ListIterator iter = null;
         
         MessageReference ref = null;
         
         if (!receiversReady)
         {

View Full Code Here


        if(v.getClass() == ArrayValueImpl.class) {
            return equals((ArrayValueImpl) v);
        }


        ListIterator oi = v.asArrayValue().listIterator();
        int i = 0;
        while(i < array.length) {
            if(!oi.hasNext() || !array[i].equals(oi.next())) {
                return false;
            }
        }
        return !oi.hasNext();
    }

View Full Code Here

    }


    if (system)
    {
      // add the variable before the first non-system variable
      ListIterator it = variablesList.listIterator();
      while (it.hasNext())
      {
        JRVariable var = (JRVariable) it.next();
        if (!var.isSystemDefined())
        {
          it.previous();
          break;
        }
      }
      it.add(variable);
      index = it.previousIndex();
    }
    else
    {
      variablesList.add(index, variable);
    }

View Full Code Here

    }


    
    void collectVals(BucketMap map, boolean sum) throws JRException
    {
      ListIterator totalIt = entries.listIterator();
      MapEntry totalItEntry = totalIt.hasNext() ? (MapEntry) totalIt.next() : null;
      
      Iterator it = map.entryIterator();
      Map.Entry entry = it.hasNext() ? (Map.Entry) it.next() : null;
      while(entry != null)
      {
        Bucket key = (Bucket) entry.getKey();
        
        int compare = totalItEntry == null ? -1 : key.compareTo(totalItEntry.key);
        if (compare <= 0)
        {
          Object addVal = null;
          
          if (last)
          {
            if (sum)
            {
              MeasureValue[] totalVals = compare == 0 ? (MeasureValue[]) totalItEntry.value : null;


              if (totalVals == null)
              {
                totalVals = initMeasureValues();
                addVal = totalVals;
              }


              sumVals(totalVals, (MeasureValue[]) entry.getValue());
            }
          }
          else
          {
            BucketListMap nextTotals = compare == 0 ? (BucketListMap) totalItEntry.value : null;
            
            if (nextTotals == null)
            {
              nextTotals = createCollectBucketMap(level + 1);
              addVal = nextTotals;
            }
            
            nextTotals.collectVals((BucketMap) entry.getValue(), sum);
          }
          
          if (compare < 0)
          {
            if (totalItEntry != null)
            {
              totalIt.previous();
            }
            
            totalIt.add(new MapEntry(key, addVal));
            entryMap.put(key, addVal);
            
            if (totalItEntry != null)
            {
              totalIt.next();
            }
          }
          
          entry = it.hasNext() ? (Map.Entry) it.next() : null;
        }
        
        if (compare >= 0)
        {
          totalItEntry = totalIt.hasNext() ? (MapEntry) totalIt.next() : null;
        }
      }
    }

View Full Code Here

public class LIFOInvocationDispatcher implements InvocationDispatcher {


    private ArrayList invokables = new ArrayList();


    public Object dispatch(Invocation invocation) throws Throwable {
        ListIterator i = invokables.listIterator(invokables.size());
        while (i.hasPrevious()) {
            Invokable invokable = (Invokable) i.previous();
            if (invokable.matches(invocation)) {
                return invokable.invoke(invocation);
            }
        }
        throw new DynamicMockError(invocation, "No match found");

View Full Code Here

   */
  public void scanClasses( List cls ) {
    if( null == cls )
      return;


    ListIterator iter = cls.listIterator();
    while( iter.hasNext() ) {
      Class klass = (Class) ((WeakReference)iter.next()).get();
      if( null == klass )
        iter.remove();
      else if( !scannedClasses.containsKey(klass) )
        try{ scan( klass ); }
      catch(ClassNotFoundException e) 
      { System.err.println("HotSwapClassRegister.scanClasses: " + e.getMessage() ); }
    }

View Full Code Here

     * 
     * @param newEntry new entry to insert into <CODE>redefineAdvices</CODE>
     */
    private void addRedefineAdvice(RedefineAdviceListEntry newEntry) {
      // find the right position for insertion
      ListIterator iter = redefineAdvices.listIterator();
      while(iter.hasNext()) {
        if(newEntry.priority <= ((RedefineAdviceListEntry)iter.next()).priority) {
          // a. found the position where newEntry will be inserted
          redefineAdvices.add(iter.previousIndex(), newEntry);
          return;
        }
      }
      // b. the list is empty or all entries have a lower priority number:
      //        append the new entry to the list.

View Full Code Here

      List<ServiceContext> servicesCopy = new ArrayList<ServiceContext>(installedServices);


      int serviceCounter = 0;
      ObjectName name = null;


      ListIterator i = servicesCopy.listIterator(servicesCopy.size());
      while (i.hasPrevious())
      {
         ServiceContext ctx = (ServiceContext) i.previous();
         name = ctx.objectName;


         // Go through the full stop/destroy cycle
         try
         {

View Full Code Here

     * 
     * @param newEntry new entry to insert into <CODE>redefineAdvices</CODE>
     */
    private void addRedefineAdvice(RedefineAdviceListEntry newEntry) {
      // find the right position for insertion
      ListIterator iter = redefineAdvices.listIterator();
      while(iter.hasNext()) {
        if(newEntry.priority <= ((RedefineAdviceListEntry)iter.next()).priority) {
          // a. found the position where newEntry will be inserted
          redefineAdvices.add(iter.previousIndex(), newEntry);
          return;
        }
      }
      // b. the list is empty or all entries have a lower priority number:
      //        append the new entry to the list.

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.ListIterator

ae.com.sun.imageio.plugins.jpeg.JPEGMetadata

ae.java.awt.DefaultKeyboardFocusManager

avrora.sim.radio.freespace.LocalAirImpl

ColorMapList

com.cloud.bridge.service.core.s3.S3Engine

com.google.gwt.emultest.java.util.ListTestBase

com.lightcrafts.media.jai.opimage.ExtremaOpImage

com.lightcrafts.media.jai.util.RWLock$WaitingList

com.meapsoft.FeatExtractor

com.puppycrawl.tools.checkstyle.checks.javadoc.JavadocMethodCheck

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.