Examples of java.util.PriorityQueue$PriorityQueueSpliterator

java.util.PriorityQueue
An unbounded priority {@linkplain Queue queue} based on a priority heap.The elements of the priority queue are ordered according to their {@linkplain Comparable natural ordering}, or by a {@link Comparator}provided at queue construction time, depending on which constructor is used. A priority queue does not permit {@code null} elements.A priority queue relying on natural ordering also does not permit insertion of non-comparable objects (doing so may result in {@code ClassCastException}).
The head of this queue is the least element with respect to the specified ordering. If multiple elements are tied for least value, the head is one of those elements -- ties are broken arbitrarily. The queue retrieval operations {@code poll}, {@code remove}, {@code peek}, and {@code element} access theelement at the head of the queue.
A priority queue is unbounded, but has an internal capacity governing the size of an array used to store the elements on the queue. It is always at least as large as the queue size. As elements are added to a priority queue, its capacity grows automatically. The details of the growth policy are not specified.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces. The Iterator provided in method {@link #iterator()} is not guaranteed to traverse the elements ofthe priority queue in any particular order. If you need ordered traversal, consider using {@code Arrays.sort(pq.toArray())}.
Note that this implementation is not synchronized. Multiple threads should not access a {@code PriorityQueue}instance concurrently if any of the threads modifies the queue. Instead, use the thread-safe {@link java.util.concurrent.PriorityBlockingQueue} class.
Implementation note: this implementation provides O(log(n)) time for the enqueuing and dequeuing methods ( {@code offer}, {@code poll}, {@code remove()} and {@code add}); linear time for the {@code remove(Object)} and {@code contains(Object)}methods; and constant time for the retrieval methods ( {@code peek}, {@code element}, and {@code size}).
This class is a member of the Java Collections Framework. @since 1.5 @author Josh Bloch, Doug Lea @param < E> the type of elements held in this collection

        Set<JTag> set = new LinkedHashSet<JTag>();
        set.add(new JTag("Test"));
        set.add(new JTag("Test2"));
        assertEquals(2, set.size());


        PriorityQueue q = new PriorityQueue<JTag>();
        q.add(new JTag("test"));
        q.add(new JTag("pest"));
        assertEquals(2, q.size());
        assertNotNull(q.poll());
        assertNotNull(q.poll());
        assertNull(q.poll());


        // THIS IS UGLY
        set = new TreeSet<JTag>();
        set.add(new JTag("Test"));
        set.add(new JTag("Test2"));

View Full Code Here


        if ( capacity == 0 ) {
            return;
        }


        this.queue = new PriorityQueue( capacity,
                                        new Comparator<SimulationStep>() {
                                            public int compare(SimulationStep s1,
                                                               SimulationStep s2) {
                                                return (int) (s1.getDistanceMillis() - s2.getDistanceMillis());
                                            }

View Full Code Here


        if ( capacity == 0 ) {
            return;
        }


        this.queue = new PriorityQueue( capacity,
                                        new Comparator<Step>() {
                                            public int compare(Step s1,
                                                               Step s2) {
                                                return (int) (s1.getTemporalDistance() - s2.getTemporalDistance());
                                            }

View Full Code Here

      return l_sorted_rules;
    }
    
    private void add_rule(Rule rl){      
      if(heap_rules==null)
        heap_rules = new PriorityQueue(1, Rule.FrequencyComparator);//TODO: initial capacity?
      String sig = rl.get_eng_signature();
      Rule old_rule = (Rule) tbl_eng_rules.get(sig);
      if(old_rule!=null){
        for(int i=0; i< rl.feat_scores.length; i++)
          old_rule.feat_scores[i] += rl.feat_scores[i];

View Full Code Here


        if ( capacity == 0 ) {
            return;
        }


        this.queue = new PriorityQueue( capacity,
                                        new Comparator<Step>() {
                                            public int compare(Step s1,
                                                               Step s2) {
                                                return (int) (s1.getTemporalDistance() - s2.getTemporalDistance());
                                            }

View Full Code Here

      Collections.addAll(allFields, nextClass.getDeclaredFields());
      nextClass = nextClass.getSuperclass();
    }


    ArrayList<CachedField> publicFields = new ArrayList();
    PriorityQueue<CachedField> cachedFields = new PriorityQueue(Math.max(1, allFields.size()), new Comparator<CachedField>() {
      public int compare (CachedField o1, CachedField o2) {
        // Fields are sorted by alpha so the order of the data is known.
        return o1.field.getName().compareTo(o2.field.getName());
      }
    });
    for (int i = 0, n = allFields.size(); i < n; i++) {
      Field field = allFields.get(i);


      int modifiers = field.getModifiers();
      if (Modifier.isTransient(modifiers)) continue;
      if (Modifier.isStatic(modifiers)) continue;
      if (field.isSynthetic() && ignoreSyntheticFields) continue;


      if (!field.isAccessible()) {
        if (!setFieldsAsAccessible) continue;
        try {
          field.setAccessible(true);
        } catch (AccessControlException ex) {
          continue;
        }
      }


      CachedField cachedField = new CachedField();
      cachedField.field = field;
      if (fieldsCanBeNull)
        cachedField.canBeNull = !field.isAnnotationPresent(NotNull.class);
      else
        cachedField.canBeNull = false;


      // Always use the same serializer for this field if the field's class is final.
      Class fieldClass = field.getType();
      if (isFinal(fieldClass)) cachedField.fieldClass = fieldClass;


      cachedFields.add(cachedField);
      if (Modifier.isPublic(modifiers) && Modifier.isPublic(fieldClass.getModifiers())) publicFields.add(cachedField);
    }


    if (!Util.isAndroid && Modifier.isPublic(type.getModifiers()) && !publicFields.isEmpty()) {
      // Use ReflectASM for any public fields.
      try {
        access = FieldAccess.get(type);
        for (int i = 0, n = publicFields.size(); i < n; i++) {
          CachedField cachedField = publicFields.get(i);
          cachedField.accessIndex = ((FieldAccess)access).getIndex(cachedField.field.getName());
        }
      } catch (AccessControlException ignored) {
      }
    }


    int fieldCount = cachedFields.size();
    fields = new CachedField[fieldCount];
    for (int i = 0; i < fieldCount; i++)
      fields[i] = cachedFields.poll();
  }

View Full Code Here

      Collections.addAll(allFields, nextClass.getDeclaredFields());
      nextClass = nextClass.getSuperclass();
    }


    ArrayList<CachedField> publicFields = new ArrayList();
    PriorityQueue<CachedField> cachedFields = new PriorityQueue(Math.max(1, allFields.size()), new Comparator<CachedField>() {
      public int compare (CachedField o1, CachedField o2) {
        // Fields are sorted by alpha so the order of the data is known.
        return o1.field.getName().compareTo(o2.field.getName());
      }
    });
    for (int i = 0, n = allFields.size(); i < n; i++) {
      Field field = allFields.get(i);


      int modifiers = field.getModifiers();
      if (Modifier.isTransient(modifiers)) continue;
      if (Modifier.isStatic(modifiers)) continue;
      if (field.isSynthetic()) continue;


      if (!field.isAccessible()) {
        if (!setFieldsAsAccessible) continue;
        try {
          field.setAccessible(true);
        } catch (AccessControlException ex) {
          continue;
        }
      }


      CachedField cachedField = new CachedField();
      cachedField.field = field;
      if (fieldsCanBeNull)
        cachedField.canBeNull = !field.isAnnotationPresent(NotNull.class);
      else
        cachedField.canBeNull = false;


      // Always use the same serializer for this field if the field's class is final.
      Class fieldClass = field.getType();
      if (isFinal(fieldClass)) cachedField.fieldClass = fieldClass;


      cachedFields.add(cachedField);
      if (Modifier.isPublic(modifiers) && Modifier.isPublic(fieldClass.getModifiers())) publicFields.add(cachedField);
    }


    if (!Util.isAndroid && Modifier.isPublic(type.getModifiers()) && !publicFields.isEmpty()) {
      // Use ReflectASM for any public fields.
      try {
        access = FieldAccess.get(type);
        for (int i = 0, n = publicFields.size(); i < n; i++) {
          CachedField cachedField = publicFields.get(i);
          cachedField.accessIndex = ((FieldAccess)access).getIndex(cachedField.field.getName());
        }
      } catch (AccessControlException ignored) {
      }
    }


    int fieldCount = cachedFields.size();
    fields = new CachedField[fieldCount];
    for (int i = 0; i < fieldCount; i++)
      fields[i] = cachedFields.poll();
  }

View Full Code Here


    protected AbstractBoundedEventHeap(int capacity, EventQueueOverflowStrategy overflowStrategy, Object lock, Comparator comparator)
    {
        super(capacity, overflowStrategy, lock);


        heap_ = new PriorityQueue(capacity, comparator);
    }

View Full Code Here

            _reverse = reverse;
        }


        @Override
        public PriorityQueue init(Object batchId, TridentCollector collector) {
            return new PriorityQueue(_n, new Comparator<TridentTuple>() {
                @Override
                public int compare(TridentTuple t1, TridentTuple t2) {
                    Comparable c1 = (Comparable) t1.getValueByField(_sortField);
                    Comparable c2 = (Comparable) t2.getValueByField(_sortField);
                    int ret = c1.compareTo(c2);

View Full Code Here

        public int compare(PeekingIterator paramAnonymousPeekingIterator1, PeekingIterator paramAnonymousPeekingIterator2)
        {
          return Iterators.MergingIterator.this.comparator.compare(paramAnonymousPeekingIterator1.peek(), paramAnonymousPeekingIterator2.peek());
        }
      };
      this.queue = new PriorityQueue(2, local1);
      Iterator localIterator1 = paramIterable.iterator();
      while (localIterator1.hasNext())
      {
        Iterator localIterator2 = (Iterator)localIterator1.next();
        if (localIterator2.hasNext())

View Full Code Here

0 1 2

TOP

Related Classes of java.util.PriorityQueue$PriorityQueueSpliterator

com.badlogic.gdx.graphics.g2d.TextureAtlas$TextureAtlasData

com.esotericsoftware.kryo.serialize.CompatibleFieldSerializer

com.esotericsoftware.kryo.serialize.FieldSerializer

com.esotericsoftware.kryonet.rmi.ObjectSpace

com.google.common.collect.Iterators$MergingIterator

com.google.common.collect.Queues

com.mockturtlesolutions.jpHtools.maintenance.jpHtoolsOptimizer

com.mockturtlesolutions.jpHtools.manager.jpHtoolsOptimizer

com.netflix.lipstick.pigstatus.RestfulPigStatusClient

de.jetwick.data.JTagTest

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.