org/objectweb/proactive/scheduler/Queue.java

/* 
 * ################################################################
 * 
 * ProActive: The Java(TM) library for Parallel, Distributed, 
 *            Concurrent computing with Security and Mobility
 * 
 * Copyright (C) 1997-2007 INRIA/University of Nice-Sophia Antipolis
 * Contact: proactive@objectweb.org
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or any later version.
 *  
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307
 * USA
 *  
 *  Initial developer(s):               The ProActive Team
 *                        http://www.inria.fr/oasis/ProActive/contacts.html
 *  Contributor(s): 
 * 
 * ################################################################
 */ 
package org.objectweb.proactive.scheduler;

import java.util.Collection;
import java.util.HashMap;
import java.util.Set;


public class Queue implements java.io.Serializable {
    private HashMap queue;
    private int queueSize;

    public Queue() {
        queue = new HashMap();
        queueSize = 100;
    }

    public int size() {
        return this.queue.size();
    }

    public boolean containsId(String jobId) {
        return this.queue.containsKey(jobId);
    }

    public void put(GenericJob job) throws QueueFullException {
        //      System.out.println(".......................................");
        if (this.size() == queueSize) {
            throw new QueueFullException();
        }

        this.queue.put(job.getJobID(), job);
    }

    public Set keySet() {
        return queue.keySet();
    }

    public GenericJob get(String jobId) {
        return (GenericJob) this.queue.get(jobId);
    }

    public GenericJob remove(String jobId) {
        return (GenericJob) this.queue.remove(jobId);
    }

    public boolean isEmpty() {
        return this.queue.isEmpty();
    }

    public Collection values() {
        return this.queue.values();
    }
}

---