Examples of java.util.PriorityQueue

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 enqueing and dequeing 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 @version 1.16, 04/21/06 @author Josh Bloch, Doug Lea @param < E> the type of elements held in this collection

    return localPriorityBlockingQueue;
  }


  public static PriorityQueue newPriorityQueue()
  {
    return new PriorityQueue();
  }

View Full Code Here

  }


  public static PriorityQueue newPriorityQueue(Iterable paramIterable)
  {
    if ((paramIterable instanceof Collection))
      return new PriorityQueue(Collections2.cast(paramIterable));
    PriorityQueue localPriorityQueue = new PriorityQueue();
    Iterables.addAll(localPriorityQueue, paramIterable);
    return localPriorityQueue;
  }

View Full Code Here

    
    //System.out.println("Number of children="+traversalTree.getChildCount());
    
    String date = null;
    
    PriorityQueue queue = new PriorityQueue();
  
    while (enu.hasMoreElements())
    {
      DefaultMutableTreeNode node = (DefaultMutableTreeNode)enu.nextElement(); 
      if (node.isLeaf())
      {
        //System.out.println("Is leaf");
        //System.out.println("Name="+node.getUserObject());
        NameQueryNode nqn = (NameQueryNode)node.getUserObject();
        
        String buffername = nqn.getName();
        date = nqn.getDate();
        if (date == null)
        {
          date = "0000-00-00";
        }
        
        //System.out.println("Name="+buffername+" Date="+date);
        //System.out.println("date="+date);
        if (buffername!=null)
        {
          queue.add(new SortNameUnit(date,buffername));
        }
        
      }
    }
    
    //ExceptionGroup exceptionThreadGroup = new ExceptionGroup();
    Iterator iter = queue.iterator();
    
    System.out.println("The number of buffers to be optimized in repository '"+repos+"' = "+queue.size()+".");
    
    this.optimizing_threads = 0;
    while (iter.hasNext())
    {
      SortNameUnit unit = (SortNameUnit)iter.next();

View Full Code Here

    
    //System.out.println("Number of children="+traversalTree.getChildCount());
    
    String date = null;
    
    PriorityQueue queue = new PriorityQueue();
  
    while (enu.hasMoreElements())
    {
      DefaultMutableTreeNode node = (DefaultMutableTreeNode)enu.nextElement(); 
      if (node.isLeaf())
      {
        //System.out.println("Is leaf");
        //System.out.println("Name="+node.getUserObject());
        NameQueryNode nqn = (NameQueryNode)node.getUserObject();
        
        String buffername = nqn.getName();
        date = nqn.getDate();
        if (date == null)
        {
          date = "0000-00-00";
        }
        
        //System.out.println("Name="+buffername+" Date="+date);
        //System.out.println("date="+date);
        if (buffername!=null)
        {
          queue.add(new SortNameUnit(date,buffername));
        }
        
      }
    }
    
    //ExceptionGroup exceptionThreadGroup = new ExceptionGroup();
    Iterator iter = queue.iterator();
    
    System.out.println("The number of buffers to be optimized in repository '"+repos+"' = "+queue.size()+".");
    
    this.optimizing_threads = 0;
    while (iter.hasNext())
    {
      SortNameUnit unit = (SortNameUnit)iter.next();

View Full Code Here

    while (nextClass != null) {
      Collections.addAll(allMethods, nextClass.getDeclaredMethods());
      nextClass = nextClass.getSuperclass();
      if (nextClass == Object.class) break;
    }
    PriorityQueue<Method> methods = new PriorityQueue(Math.max(1, allMethods.size()), new Comparator<Method>() {
      public int compare (Method o1, Method o2) {
        // Methods are sorted so they can be represented as an index.
        int diff = o1.getName().compareTo(o2.getName());
        if (diff != 0) return diff;
        Class[] argTypes1 = o1.getParameterTypes();
        Class[] argTypes2 = o2.getParameterTypes();
        if (argTypes1.length > argTypes2.length) return 1;
        if (argTypes1.length < argTypes2.length) return -1;
        for (int i = 0; i < argTypes1.length; i++) {
          diff = argTypes1[i].getName().compareTo(argTypes2[i].getName());
          if (diff != 0) return diff;
        }
        throw new RuntimeException("Two methods with same signature!"); // Impossible.
      }
    });
    for (int i = 0, n = allMethods.size(); i < n; i++) {
      Method method = allMethods.get(i);
      int modifiers = method.getModifiers();
      if (Modifier.isStatic(modifiers)) continue;
      if (Modifier.isPrivate(modifiers)) continue;
      if (method.isSynthetic()) continue;
      methods.add(method);
    }


    int n = methods.size();
    cachedMethods = new CachedMethod[n];
    for (int i = 0; i < n; i++) {
      CachedMethod cachedMethod = new CachedMethod();
      cachedMethod.method = methods.poll();


      // Store the serializer for each final parameter.
      Class[] parameterTypes = cachedMethod.method.getParameterTypes();
      cachedMethod.serializers = new Serializer[parameterTypes.length];
      for (int ii = 0, nn = parameterTypes.length; ii < nn; ii++)

View Full Code Here


    final Array<Page> pages = new Array<Page>();
    final Array<Region> regions = new Array<Region>();


    public TextureAtlasData (FileHandle packFile, FileHandle imagesDir, boolean flip) {
      PriorityQueue<Region> sortedRegions = new PriorityQueue(16, indexComparator);


      BufferedReader reader = new BufferedReader(new InputStreamReader(packFile.read()), 64);
      try {
        Page pageImage = null;
        while (true) {
          String line = reader.readLine();
          if (line == null) break;
          if (line.trim().length() == 0)
            pageImage = null;
          else if (pageImage == null) {
            FileHandle file = imagesDir.child(line);


            Format format = Format.valueOf(readValue(reader));


            readTuple(reader);
            TextureFilter min = TextureFilter.valueOf(tuple[0]);
            TextureFilter max = TextureFilter.valueOf(tuple[1]);


            String direction = readValue(reader);
            TextureWrap repeatX = ClampToEdge;
            TextureWrap repeatY = ClampToEdge;
            if (direction.equals("x"))
              repeatX = Repeat;
            else if (direction.equals("y"))
              repeatY = Repeat;
            else if (direction.equals("xy")) {
              repeatX = Repeat;
              repeatY = Repeat;
            }


            pageImage = new Page(file, min.isMipMap(), format, min, max, repeatX, repeatY);
            pages.add(pageImage);
          } else {
            boolean rotate = Boolean.valueOf(readValue(reader));


            readTuple(reader);
            int left = Integer.parseInt(tuple[0]);
            int top = Integer.parseInt(tuple[1]);


            readTuple(reader);
            int width = Integer.parseInt(tuple[0]);
            int height = Integer.parseInt(tuple[1]);


            Region region = new Region();
            region.page = pageImage;
            region.left = left;
            region.top = top;
            region.width = width;
            region.height = height;
            region.name = line;
            region.rotate = rotate;


            readTuple(reader);
            region.originalWidth = Integer.parseInt(tuple[0]);
            region.originalHeight = Integer.parseInt(tuple[1]);


            readTuple(reader);
            region.offsetX = Integer.parseInt(tuple[0]);
            region.offsetY = Integer.parseInt(tuple[1]);


            region.index = Integer.parseInt(readValue(reader));


            if (flip) region.flip = true;


            sortedRegions.add(region);
          }
        }
      } catch (IOException ex) {
        throw new GdxRuntimeException("Error reading pack file: " + packFile);
      } finally {
        try {
          reader.close();
        } catch (IOException ignored) {
        }
      }


      int n = sortedRegions.size();
      for (int i = 0; i < n; i++)
        regions.add(sortedRegions.poll());
    }

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

0 1 2

TOP

Related Classes of java.util.PriorityQueue

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.