1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
/*
* Ray -- Parallel genome assemblies for parallel DNA sequencing
* Copyright (C) 2013 Sébastien Boisvert
*
* http://DeNovoAssembler.SourceForge.Net/
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3 of the License.
*
* This program 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 General Public License for more details.
*
* You have received a copy of the GNU General Public License
* along with this program (gpl-3.0.txt).
* see <http://www.gnu.org/licenses/>
*/
#ifndef GossipAssetManagerHeader
#define GossipAssetManagerHeader
#include "GraphSearchResult.h"
#include <vector>
#include <map>
#include <set>
using namespace std;
/**
* This class manages the assets (which are gossips).
*
* It also knows which gossip needs to be sent somewhere.
*
* This class dynamically computes the preference list for a gossip
* (the preference list of a gossip contains its primary actors).
*
*
* \author Sébastien Boisvert
*/
class GossipAssetManager {
vector<GraphSearchResult> m_gossips;
map<string, int> m_gossipIndex;
map<int, set<Rank> > m_remoteGossipOwners;
map<int, set<Rank> > m_futureRemoteGossipOwners;
vector<set<int> > m_gossipClusters;
map<PathHandle, int> m_pathToClusterTable;
void classifyGossip(GraphSearchResult & gossip);
bool scheduleTransportation(int gossipIndex, Rank destination);
public:
void addGossip(GraphSearchResult & gossip);
bool hasGossipToShare() const;
void getGossipToShare(GraphSearchResult & gossip, Rank & destination);
vector<GraphSearchResult> & getGossips();
bool hasGossip(const GraphSearchResult & gossip) const;
void registerRemoteGossip(GraphSearchResult & gossip, Rank & destination);
bool scheduleGossipTransportation(GraphSearchResult & gossip, Rank & destination);
};
#endif
|
