---

model/topos/SSetTopology.h

Go to the documentation of this file.

/* #start# ***********************************************************

           Scheduling Simulator
        Lehrstuhl f"ur Effiziente Algorithmen
           Technische Universit"at M"unchen

 File    : $Id: SSetTopology.h,v 1.7 2003/01/24 10:05:04 hall Exp $

 Purpose : 

 * #end# ************************************************************* */

#ifndef SSETTOPOLOGY_H
#define SSETTOPOLOGY_H

// system header files
#include <iostream>

#include <LEDA/array.h>
#include <LEDA/h_array.h>
#include <LEDA/list.h>

#ifndef leda_list_item
#define leda_list_item list_item
#endif

// project header files
#include "STopology.h"
#include "SSetTopologyMod.h"
#include "../SPassiveMachinesMod.h"


// ------------------------------------------------------------
class SSetTopEntry {
public:
  int ID, card, pos;
  SSetTopEntry() : ID(0), card(0), pos(-1) {};
  SSetTopEntry(int i, int c, int p) : ID(i), card(c), pos(p) {};

  friend std::istream &operator>>(std::istream &i, SSetTopEntry &e) { return i; };
  friend std::ostream &operator<<(std::ostream &o, const SSetTopEntry &e) { return o; };
};
// ------------------------------------------------------------
class SSetTopology : public virtual STopology {
  TYPEINFO0(SSetTopology,"set")
  friend class SSetTopologyMod;
public:
  SSetTopology(int cardinality);
  virtual ~SSetTopology() {}
  
  virtual STopologyMod &getModifier() 
    { return _mod; };
  
  virtual int getCount() const { return _cardinality; };

  virtual int getIDAt(int pos) const { return _positions[pos]; };

  virtual int getPos(int ID) const { return _IDtoEntry[ID]->pos; };

  virtual bool isPosFree(int pos) const { return _free.size() > 0; };

  virtual leda_list<int> getFreePos() const { return _free; };

  virtual bool canEmbedAt(const STopology &top, int pos) const;

  virtual leda_list<int> canEmbedAt(const STopology &top) const;

  virtual void embed(const STopology& top, int pos, int ID);

  virtual void remove(int ID);

  virtual bool fitsInto(const STopology *top) const
    { return (_cardinality <= top->getCount()); }

private:
  int _cardinality;
  leda_list<SSetTopEntry> _tops;  // currently allocated topologies
  leda_array<int> _positions; // -1 if the position is free
  leda_h_array<int, SSetTopEntry*> _IDtoEntry;
  leda_list<int> _free;   // the positions in a SSetTop are irelevant ->
        // the list contains as many zeros as there are
        // free positions
  static leda_list<int> _zeroList;  // this list contains one zero
  static leda_list<int> _emptyList; // this list is empty
  static SSetTopEntry _defaultEntry;

  SSetTopologyMod _mod;

  // all embeddings are lost after a call to this funtion
  void setSize(int cardinality);
};
// ------------------------------------------------------------

#endif //SSETTOPOLOGY_H

---