Examples of java.util.ArrayDeque$DescendingIterator

java.util.ArrayDeque
Resizable-array implementation of the {@link Deque} interface. Arraydeques have no capacity restrictions; they grow as necessary to support usage. They are not thread-safe; in the absence of external synchronization, they do not support concurrent access by multiple threads. Null elements are prohibited. This class is likely to be faster than {@link Stack} when used as a stack, and faster than {@link LinkedList}when used as a queue.
Most ArrayDeque operations run in amortized constant time. Exceptions include {@link #remove(Object) remove}, {@link #removeFirstOccurrence removeFirstOccurrence}, {@link #removeLastOccurrence removeLastOccurrence}, {@link #contains contains}, {@link #iterator iterator.remove()}, and the bulk operations, all of which run in linear time.
The iterators returned by this class's iterator method are fail-fast: If the deque is modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will generally throw a {@link 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.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @author Josh Bloch and Doug Lea @since 1.6 @param < E> the type of elements held in this collection

    });
      }
            bc.classLoaderSwitched = true;
        }


        ArrayDeque beanContextStack =
            (ArrayDeque) threadLocalContext.get();
                
        if ( beanContextStack == null ) {
            beanContextStack = new ArrayDeque();
            threadLocalContext.set(beanContextStack);
        } 
        beanContextStack.push(bc);
    }

View Full Code Here

        beanContextStack.push(bc);
    }


    public void externalPostInvoke() {
        try {
          ArrayDeque beanContextStack =
                (ArrayDeque) threadLocalContext.get();
            
            final BeanContext bc = (BeanContext) beanContextStack.pop();
            if ( bc.classLoaderSwitched == true ) {
              if (System.getSecurityManager() == null) {
                Thread.currentThread().setContextClassLoader(bc.previousClassLoader);
            } else {
                java.security.AccessController.doPrivileged(

View Full Code Here

         fields = new HashMap<Integer, Deque>();
      } else {
         field = fields.get(tag);
      }
      if (field == null) {
         field = new ArrayDeque();
         fields.put(tag, field);
      }
      return field;
   }

View Full Code Here

        if (target.isEmpty()) {
            return target;
        }


        Collection<EventBean> beans = (Collection<EventBean>) target;
        Deque queue = new ArrayDeque();
        for (EventBean next : beans) {
            eventsLambda[streamNumLambda] = next;


            Object item = innerExpression.evaluate(eventsLambda, isNewData, context);
            if (item != null) {
                queue.add(item);
            }
        }


        return queue;
    }

View Full Code Here

            return target;
        }


        ObjectArrayEventBean resultEvent = new ObjectArrayEventBean(new Object[1], resultEventType);
        Collection<Object> values = (Collection<Object>) target;
        Deque queue = new ArrayDeque();
        for (Object next : values) {


            resultEvent.getProperties()[0] = next;
            eventsLambda[streamNumLambda] = resultEvent;


            Object item = innerExpression.evaluate(eventsLambda, isNewData, context);
            if (item != null) {
                queue.add(item);
            }
        }


        return queue;
    }

View Full Code Here

    });
      }
            bc.classLoaderSwitched = true;
        }


        ArrayDeque beanContextStack =
            (ArrayDeque) threadLocalContext.get();
                
        if ( beanContextStack == null ) {
            beanContextStack = new ArrayDeque();
            threadLocalContext.set(beanContextStack);
        } 
        beanContextStack.push(bc);
    }

View Full Code Here

        beanContextStack.push(bc);
    }


    public void externalPostInvoke() {
        try {
          ArrayDeque beanContextStack =
                (ArrayDeque) threadLocalContext.get();
            
            final BeanContext bc = (BeanContext) beanContextStack.pop();
            if ( bc.classLoaderSwitched == true ) {
              if (System.getSecurityManager() == null) {
                Thread.currentThread().setContextClassLoader(bc.previousClassLoader);
            } else {
                java.security.AccessController.doPrivileged(

View Full Code Here

    return new ArrayBlockingQueue(paramInt);
  }


  public static ArrayDeque newArrayDeque()
  {
    return new ArrayDeque();
  }

View Full Code Here

  }


  public static ArrayDeque newArrayDeque(Iterable paramIterable)
  {
    if ((paramIterable instanceof Collection))
      return new ArrayDeque(Collections2.cast(paramIterable));
    ArrayDeque localArrayDeque = new ArrayDeque();
    Iterables.addAll(localArrayDeque, paramIterable);
    return localArrayDeque;
  }

View Full Code Here

        MinMaxPriorityQueue.MoveDesc localMoveDesc = MinMaxPriorityQueue.this.removeAt(this.cursor);
        if (localMoveDesc != null)
        {
          if (this.forgetMeNot == null)
          {
            this.forgetMeNot = new ArrayDeque();
            this.skipMe = new ArrayList(3);
          }
          this.forgetMeNot.add(localMoveDesc.toTrickle);
          this.skipMe.add(localMoveDesc.replaced);
        }

View Full Code Here

0 1 2 3 4 5

TOP

Related Classes of java.util.ArrayDeque$DescendingIterator

booton.translator.JavaMethodCompiler

booton.translator.Node

booton.translator.Node$BackedgeGroup

booton.translator.Node$TryCatchFinally

booton.translator.Node$TryCatchFinallyBlocks

co.edu.eafit.day1.collections.Collections

com.carrotsearch.hppc.cursors.ByteCursor

com.carrotsearch.hppc.cursors.CharCursor

com.carrotsearch.hppc.cursors.DoubleCursor

com.carrotsearch.hppc.cursors.FloatCursor

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.