sensix v0.3.0

00001 
00010 /*
00011  * Copyright 2008. Los Alamos National Security, LLC. This material
00012  * was produced under U.S. Government contract DE-AC52-06NA25396 for
00013  * Los Alamos National Laboratory (LANL), which is operated by Los
00014  * Alamos National Security, LLC, for the Department of Energy. The
00015  * U.S. Government has rights to use, reproduce, and distribute this
00016  * software. NEITHER THE GOVERNMENT NOR LOS ALAMOS NATIONAL SECURITY,
00017  * LLC, MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY LEGAL
00018  * LIABILITY FOR THE USE OF THIS SOFTWARE. If software is modified to
00019  * produce derivative works, such modified software should be clearly
00020  * marked, so as not to confuse it with the version available from LANL.
00021  *
00022  * Additionally, this program is free software; you can redistribute
00023  * it and/or modify it under the terms of the GNU General Public
00024  * License as published by the Free Software Foundation; version 2 of
00025  * the License. Accordingly, this program is distributed in the hope
00026  * it will be useful, but WITHOUT ANY WARRANTY; without even the
00027  * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
00028  * PURPOSE. See the GNU General Public License for more details.
00029  *
00030  * You should have received a copy of the GNU General Public License
00031  * along with this program; if not, write to the Free Software
00032  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA. 
00033  */
00034 
00035 package gov.lanl.isr.sensix;
00036 
00037 import java.util.*;
00038 
00039 
00040 public class TaskTracking
00041 {
00042     public SortedMap<Integer,TaskImpl> tree;
00043     
00044     public TaskTracking() {
00045         tree =
00046             Collections.synchronizedSortedMap(new TreeMap<Integer,TaskImpl>());
00047     }
00048 
00049 
00050     public void add(TaskImpl t) {
00051         tree.put(t.f().sequencer(), t);
00052     }
00053 
00054     public TaskImpl get(Functor f) {
00055         return tree.get(f.sequencer());
00056     }
00057 
00058     public void remove(Functor f) {
00059         tree.remove(f.sequencer());
00060     }
00061 
00062     public int num_peers(Functor f) {
00063         TaskImpl t = tree.get(f.sequencer());
00064         if (t == null)
00065             return 0;
00066         return t.numPeers();
00067     }
00068 
00069     public void num_peers(Functor f, int p) {
00070         TaskImpl t = tree.get(f.sequencer());
00071         if (t != null)
00072             t.numPeers(p);
00073     }
00074 
00075     public boolean cancelled(Functor f) {
00076         TaskImpl t = tree.get(f.sequencer());
00077         if (t == null)
00078             return true;
00079         return t.cancelled();
00080     }
00081 
00082     public void cancelled(Functor f, boolean c) {
00083         TaskImpl t = tree.get(f.sequencer());
00084         if (t != null)
00085             t.cancelled(c);
00086     }
00087 
00088     public void print() {
00089         Iterator itr = tree.entrySet().iterator();
00090         while (itr.hasNext()) {
00091             Map.Entry e = (Map.Entry)itr.next();
00092             System.err.println(e.getKey() + " : " + e.getValue());
00093         }
00094     }
00095 }
/home/brennan/Software/sensix/source/C^4/corba/gov/lanl/isr/sensix/TaskTracking.java
