List that allows items to be added with a priority that will affect the order in which they are later iterated over. : List « Collections Data Structure « Java






List that allows items to be added with a priority that will affect the order in which they are later iterated over.

        
//package com.thoughtworks.xstream.core.util;

import java.util.Iterator;
import java.util.Set;
import java.util.TreeSet;


/**
 * List that allows items to be added with a priority that will affect the order in which they are later iterated over.
 * Objects with a high priority will appear before objects with a low priority in the list. If two objects of the same
 * priority are added to the list, the most recently added one will be iterated over first. Implementation uses a
 * TreeSet, which has a garanteed add time of O(log(n)).
 * 
 * @author Joe Walnes
 * @author Guilherme Silveira
 */
public class PrioritizedList {

    private final Set set = new TreeSet();

    private int lowestPriority = Integer.MAX_VALUE;

    private int lastId = 0;

    public void add(Object item, int priority) {
        if (this.lowestPriority > priority) {
            this.lowestPriority = priority;
        }
        this.set.add(new PrioritizedItem(item, priority, ++lastId));
    }

    public Iterator iterator() {
        return new PrioritizedItemIterator(this.set.iterator());
    }

    private static class PrioritizedItem implements Comparable {

        final Object value;
        final int priority;
        final int id;

        public PrioritizedItem(Object value, int Prioritized, int id) {
            this.value = value;
            this.priority = Prioritized;
            this.id = id;
        }

        public int compareTo(Object o) {
            PrioritizedItem other = (PrioritizedItem)o;
            if (this.priority != other.priority) {
                return (other.priority - this.priority);
            }
            return (other.id - this.id);
        }

        public boolean equals(Object obj) {
            return this.id == ((PrioritizedItem)obj).id;
        }

    }

    private static class PrioritizedItemIterator implements Iterator {

        private Iterator iterator;

        public PrioritizedItemIterator(Iterator iterator) {
            this.iterator = iterator;
        }

        public void remove() {
            // call iterator.remove()?
            throw new UnsupportedOperationException();
        }

        public boolean hasNext() {
            return iterator.hasNext();
        }

        public Object next() {
            return ((PrioritizedItem)iterator.next()).value;
        }

    }

}

   
    
    
    
    
    
    
    
  








Related examples in the same category

1.Using the Double Brace Initialization.
2.Add to end Performance compare: LinkList and ArrayListAdd to end Performance compare: LinkList and ArrayList
3.Add to start Performance compare: LinkList and ArrayList
4.Convert array to list and sortConvert array to list and sort
5.Shuffle a listShuffle a list
6.Sort a listSort a list
7.Bidirectional Traversal with ListIteratorBidirectional Traversal with ListIterator
8.Int listInt list
9.Linked List example
10.List to array
11.List Reverse Test
12.Build your own Linked List class
13.List Search Test List Search Test
14.Convert a List to a Set
15.Set Operating on Lists: addAll, removeAll, retainAll, subList
16.Convert collection into array
17.Convert LinkedList to array
18.Convert Set into List
19.If a List contains an item
20.ListSet extends List and Set
21.List containing other lists
22.Helper method for creating list
23.Generic to list
24.List implementation with lazy array construction and modification tracking.
25.Utility methods for operating on memory-efficient lists. All lists of size 0 or 1 are assumed to be immutable.
26.A class that wraps an array with a List interface.
27.Splits the list.
28.Slice a list
29.A List that, like a Set, contains no duplicate Elements.
30.Determines if the given lists contain the same elements. We suppose that all the elements of the given lists are different.