Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members  

model/topos/SMeshNPosition.h

Go to the documentation of this file.
00001 /* #start# ***********************************************************
00002 
00003            Scheduling Simulator
00004         Lehrstuhl f"ur Effiziente Algorithmen
00005            Technische Universit"at M"unchen
00006 
00007  File    : $Id: SMeshNPosition.h,v 1.3 2003/01/08 18:57:14 meierb Exp $
00008 
00009  Purpose : 
00010 
00011  RCS-Log:
00012  $Log: SMeshNPosition.h,v $
00013  Revision 1.3  2003/01/08 18:57:14  meierb
00014  added randomized release times
00015 
00016  Revision 1.1.1.1  2002/12/02 22:26:19  meierb
00017  my_schedule
00018 
00019  Revision 1.1  2002/08/29 12:59:59  taeubig
00020  Added the sources
00021 
00022  Revision 1.1  2000/06/21 12:30:08  taeubig
00023  Added n-dimensional mesh topology
00024 
00025 
00026  * #end# ************************************************************* */
00027 
00028 #ifndef SMESHNPOSITION_H
00029 #define SMESHNPOSITION_H
00030 
00031 // system header files
00032 
00033 // project header files
00034 #include "SComplexPosition.h"
00035 #include "SDimArray.h"
00036 
00037 // ------------------------------------------------------------
00038 
00039 class SMeshNPosition: public SComplexPosition, public SDimArray {
00040  public:
00041   SDimArray _sizes;  // size in every dimension (accord. to mach. dims)
00042   SDimArray _jobDimToMachDim;  // maps job dimensions to machine dimensions
00043   SMeshNPosition(int dim) :
00044     SDimArray(dim),
00045     _sizes(dim),
00046     _jobDimToMachDim(dim) {};
00047 
00048   // -1 means all
00049   virtual int getMinPos() const {
00050     int linearPos = 0;
00051     for (int i=size()-1; i>=0; i--) {
00052       linearPos *= 2;
00053       if ((*this)[i] == 1)
00054   linearPos += 1;
00055     }
00056     return linearPos;
00057   };
00058 
00059   int getMaxPos() const {
00060     int linearPos = 0;
00061     for (int i=size()-1; i>=0; i--) {
00062       linearPos *= 2;
00063       if ((*this)[i] != 0)
00064   linearPos += 1;
00065     }
00066     return linearPos;
00067   };
00068 
00069   bool isNormal() const {
00070     int i=0;
00071     while ( (i<size()) && ((*this)[i] == -1) ) i++;
00072     while ( i<size() )
00073       if ( (*this)[i] == -1 )
00074   return false;
00075       else
00076   i++;
00077     return true;
00078   }
00079 
00080 };
00081 
00082 #endif //SMESHNPOSITION_H

Generated on Thu May 22 16:48:09 2003 for Sketch-it! by doxygen1.2.18