nojhan/eodev
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Each island is connected from/to only one neighbour

Browse source
This commit is contained in:
cahon 2002-03-29 14:50:11 +00:00
commit 6667499e62
1 changed files with 122 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

122
eo/src/paradisEO/island/topologies/eoRingConnectivity.h Normal file
View file

@ -0,0 +1,122 @@
// -*- mode: c++; c-indent-level: 4; c++-member-init-indent: 8; comment-column: 35; -*-
// "eoRingConnectivity.h"
// (c) OPAC Team, LIFL, 2002
/* 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 of the License, or (at your option) 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
Cont act: cahon@lifl.fr
*/
#ifndef eoRingConnectivity_h
#define eoRingConnectivity_h
#include <paradisEO/island/eoConnectivity.h>
/**
Each algorithm has a single pair of entering and outgoing
neighbours, so that the unit constitutes a circular topology.
*/
template <class EOT> class eoRingConnectivity : public eoConnectivity <EOT> {
public :
/**
Constructor
*/
eoRingConnectivity (eoListener <EOT> & _listen,
vector <string> & _sel_neigh
) : eoConnectivity <EOT> (_listen, _sel_neigh) {
}
virtual vector <eoLocalListener <EOT> *> from () {
listen.update () ;
vector <eoLocalListener <EOT> *> v ;
int i, k = listen.size () ;
for (i = 0 ; i < k ; i ++) {
if (listen [i] == listen.here ())
break ;
}
for (int j = (i - 1 + k) % k ; j != i ; j = (j - 1 + k) % k)
if (selected (listen [j].label ())) {
v.push_back (& listen [j]) ;
break ;
}
return v ;
}
/**
*/
virtual vector <eoLocalListener <EOT> *> to () {
listen.update () ;
vector <eoLocalListener <EOT> *> v ;
int i, k = listen.size () ;
for (i = 0 ; i < k ; i ++)
if (listen [i] == listen.here ())
break ;
for (int j = (i + 1) % k ; j != i ; j = (j + 1) % k)
if (selected (listen [j].label ())) {
v.push_back (& listen [j]) ;
break ;
}
return v ;
}
} ;
#endif