public class AppaloosaPriorityQueue implements Queue
{
    List<List<Message>> messageQueue;
    int size;

    public AppaloosaPriorityQueue()
    {
        messageQueue = new ArrayList<List<Message>>();
        for(int i = 0; i < 10; i++)
        {
            messageQueue.push_back(new ArrayList<Message>());
        }
        size = 0;
    }

    boolean isEmpty()
    {
        if(size() == 0)
        {
            return true;
        }
        else
        {
            return false;
        }
    }

    int size()
    {
        return size;
    }

    void add(Message msg)
    {
        messageQueue.at(msg.getPriority()).push_back(msg);
        size++;
    }

    Message remove()
    {
        for(int i = 9; i >= 0; i--)
        {
            if(messageQueue.at(i).size() > 0)
            {
                //get first
                Message m = messageQueue.at(i).at(0);
                messageQueue.at(i).remove(0);
                return m;
            }
        }
        size--;
    }
}