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
|
/*
Copyright 2013 Sébastien Boisvert
Copyright 2013 Université Laval
Copyright 2013 Centre Hospitalier Universitaire de Québec
This file is part of Ray Surveyor.
Ray Surveyor 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.
Ray Surveyor 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 should have received a copy of the GNU General Public License
along with Ray Surveyor. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef StoreKeeperHeader
#define StoreKeeperHeader
#define PLAN_STORE_KEEPER_ACTORS_PER_RANK 1
#include "ExperimentVertex.h"
#include <code/Searcher/ColorSet.h>
#include <code/VerticesExtractor/Vertex.h>
#include <code/KmerAcademyBuilder/Kmer.h>
#include <code/Mock/constants.h>
#include <RayPlatform/actors/Actor.h>
#include <RayPlatform/structures/MyHashTable.h>
/**
* Provides genomic storage.
*
* \author Sébastien Boisvert
*/
class StoreKeeper: public Actor {
private:
int m_storeDataCalls;
int m_receivedPushes;
map<SampleIdentifier, map<SampleIdentifier, LargeCount> > m_localGramMatrix;
map<SampleIdentifier, map<SampleIdentifier, LargeCount> >::iterator m_iterator1;
map<SampleIdentifier, LargeCount>::iterator m_iterator2;
ColorSet m_colorSet;
int m_mother;
int m_matrixOwner;
bool m_configured;
/**
* MyHashTable is a space-efficient data structure provided
* by RayPlatform.
*/
MyHashTable<Kmer,ExperimentVertex> m_hashTable;
int m_kmerLength;
bool m_colorSpaceMode;
uint64_t m_receivedObjects;
uint64_t m_lastSize;
void pushSampleVertex(Message & message);
void printStatus();
void storeData(Vertex & vertex, int & sample);
void configureHashTable();
void computeLocalGramMatrix();
void printLocalGramMatrix();
void printColorReport();
void sendMatrixCell();
public:
StoreKeeper();
~StoreKeeper();
void receive(Message & message);
enum {
FIRST_TAG = 10250,
PUSH_SAMPLE_VERTEX,
PUSH_SAMPLE_VERTEX_OK,
MERGE,
MERGE_OK,
LAST_TAG
};
};
#endif
|
