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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
/*
Ray
Copyright (C) 2011, 2012, 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 _JoinerWorker_H
#define _JoinerWorker_H
#include <code/SeedingData/PathHandle.h>
#include <code/KmerAcademyBuilder/Kmer.h>
#include <code/Mock/Parameters.h>
#include <RayPlatform/communication/VirtualCommunicator.h>
#include <RayPlatform/scheduling/Worker.h>
#include <stdint.h>
#include <map>
#include <vector>
using namespace std;
/**
* JoinerWorker merge a path with another path
*/
class JoinerWorker: public Worker{
MessageTag RAY_MPI_TAG_ASK_VERTEX_PATH;
MessageTag RAY_MPI_TAG_ASK_VERTEX_PATHS_SIZE;
MessageTag RAY_MPI_TAG_GET_PATH_LENGTH;
MessageTag RAY_MPI_TAG_GET_PATH_VERTEX;
bool m_requestedNumberOfPaths;
WorkerHandle m_workerIdentifier;
bool m_isDone;
GraphPath*m_path;
PathHandle m_identifier;
bool m_reverseStrand;
bool m_eliminated;
int m_position;
int m_numberOfPaths;
VirtualCommunicator*m_virtualCommunicator;
Parameters*m_parameters;
bool m_receivedNumberOfPaths;
RingAllocator*m_outboxAllocator;
bool m_gatheredHits;
bool m_initializedGathering;
bool m_requestedHitLength;
vector<PathHandle> m_hitNames;
map<PathHandle,int> m_hitLengths;
int m_hitIterator;
vector<GraphPath>*m_newPaths;
bool m_selectedHit;
int m_selectedHitIndex;
map<PathHandle,int> m_hits;
map<PathHandle,int> m_minPosition;
map<PathHandle,int> m_maxPosition;
map<PathHandle,int> m_minPositionOnSelf;
map<PathHandle,int> m_maxPositionOnSelf;
map<PathHandle,vector<int> > m_selfPositions;
map<PathHandle,vector<int> > m_hitPositions;
GraphPath m_hitVertices;
int m_hitPosition;
bool m_requestedHitVertex;
int m_pathIndex;
bool m_receivedPath;
bool m_requestedPath;
public:
void constructor(WorkerHandle i,GraphPath*path,PathHandle identifier,bool reverseStrand,
VirtualCommunicator*virtualCommunicator,Parameters*parameters,RingAllocator*outboxAllocator,
vector<GraphPath>*newPaths,
MessageTag RAY_MPI_TAG_ASK_VERTEX_PATH,
MessageTag RAY_MPI_TAG_ASK_VERTEX_PATHS_SIZE,
MessageTag RAY_MPI_TAG_GET_PATH_LENGTH,
MessageTag RAY_MPI_TAG_GET_PATH_VERTEX
);
/* a method for Worker interface */
void work();
/* a method for Worker interface */
bool isDone();
/* a method for Worker interface */
WorkerHandle getWorkerIdentifier();
bool isPathEliminated();
PathHandle getPathIdentifier();
};
#endif
|
