File: Searcher.h

package info (click to toggle)
ray 2.3.1-9
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 6,008 kB
  • sloc: cpp: 49,973; sh: 339; makefile: 281; python: 168
file content (512 lines) | stat: -rw-r--r-- 16,074 bytes parent folder | download | duplicates (5)
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
/*
 	Ray
    Copyright (C) 2010, 2011, 2012 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 _Searcher_h
#define _Searcher_h

#include <code/VerticesExtractor/GridTable.h>
#include <code/SeedingData/GraphPath.h>

#include <stdint.h>
#include <fstream>
#include <stdint.h> /* for uint64_t */
#include <stdio.h> /*for FILE */
#include <vector>
#include <string>
#include <map>
#include <sstream>
using namespace std;

#include <code/Mock/Parameters.h>
#include <RayPlatform/scheduling/SwitchMan.h>
#include <RayPlatform/communication/VirtualCommunicator.h>
#include <RayPlatform/communication/BufferedData.h>
#include <RayPlatform/memory/RingAllocator.h>
#include <code/Searcher/SearchDirectory.h>
#include <code/Searcher/ContigSearchEntry.h>
#include <RayPlatform/structures/StaticVector.h>
#include <RayPlatform/profiling/TimePrinter.h>
#include <RayPlatform/profiling/Derivative.h>
#include <RayPlatform/handlers/SlaveModeHandler.h>
#include <RayPlatform/handlers/MasterModeHandler.h>
#include <RayPlatform/handlers/MessageTagHandler.h>
#include <code/Searcher/ContigHit.h>
#include <code/Searcher/ColorSet.h>
#include <RayPlatform/plugins/CorePlugin.h>
#include <code/Searcher/QualityCaller.h>
#include <code/Searcher/DistributionWriter.h>
#include <RayPlatform/core/ComputeCore.h>

#define CONFIG_NICELY_ASSEMBLED_KMER_POSITION 0

__DeclarePlugin(Searcher);

__DeclareMasterModeAdapter(Searcher,RAY_MASTER_MODE_COUNT_SEARCH_ELEMENTS);
__DeclareMasterModeAdapter(Searcher,RAY_MASTER_MODE_CONTIG_BIOLOGICAL_ABUNDANCES);
__DeclareMasterModeAdapter(Searcher,RAY_MASTER_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES);
__DeclareMasterModeAdapter(Searcher,RAY_MASTER_MODE_ADD_COLORS);
__DeclareMasterModeAdapter(Searcher,RAY_MASTER_MODE_SEARCHER_CLOSE);

__DeclareSlaveModeAdapter(Searcher,RAY_SLAVE_MODE_COUNT_SEARCH_ELEMENTS);
__DeclareSlaveModeAdapter(Searcher,RAY_SLAVE_MODE_CONTIG_BIOLOGICAL_ABUNDANCES);
__DeclareSlaveModeAdapter(Searcher,RAY_SLAVE_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES);
__DeclareSlaveModeAdapter(Searcher,RAY_SLAVE_MODE_ADD_COLORS);
__DeclareSlaveModeAdapter(Searcher,RAY_SLAVE_MODE_SEARCHER_CLOSE);

__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_ADD_KMER_COLOR);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_CONTIG_IDENTIFICATION);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE_AND_COLORS);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_GET_COVERAGE_AND_PATHS);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCE_ENTRY);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_GRAPH_COUNTS);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_VIRTUAL_COLOR_DATA);
__DeclareMessageTagAdapter(Searcher,RAY_MPI_TAG_VIRTUAL_COLOR_DATA_REPLY);

/**
 * This class searches for sequences in the de Bruijn graph
 * It outputs biological abundance readouts
 *
 * This class is part of the "Ray Communities" workflow.
 *
 * Methods in this class are also used for the "Ray Ontology"
 * workflow.
 *
 * \author Sébastien Boisvert
 **/
class Searcher :  public CorePlugin {

	__AddAdapter(Searcher,RAY_MASTER_MODE_COUNT_SEARCH_ELEMENTS);
	__AddAdapter(Searcher,RAY_MASTER_MODE_CONTIG_BIOLOGICAL_ABUNDANCES);
	__AddAdapter(Searcher,RAY_MASTER_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES);
	__AddAdapter(Searcher,RAY_MASTER_MODE_ADD_COLORS);
	__AddAdapter(Searcher,RAY_MASTER_MODE_SEARCHER_CLOSE);

	__AddAdapter(Searcher,RAY_SLAVE_MODE_COUNT_SEARCH_ELEMENTS);
	__AddAdapter(Searcher,RAY_SLAVE_MODE_CONTIG_BIOLOGICAL_ABUNDANCES);
	__AddAdapter(Searcher,RAY_SLAVE_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES);
	__AddAdapter(Searcher,RAY_SLAVE_MODE_ADD_COLORS);
	__AddAdapter(Searcher,RAY_SLAVE_MODE_SEARCHER_CLOSE);

	__AddAdapter(Searcher,RAY_MPI_TAG_ADD_KMER_COLOR);
	__AddAdapter(Searcher,RAY_MPI_TAG_CONTIG_IDENTIFICATION);
	__AddAdapter(Searcher,RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE_AND_COLORS);
	__AddAdapter(Searcher,RAY_MPI_TAG_GET_COVERAGE_AND_PATHS);
	__AddAdapter(Searcher,RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCE_ENTRY);
	__AddAdapter(Searcher,RAY_MPI_TAG_GRAPH_COUNTS);
	__AddAdapter(Searcher,RAY_MPI_TAG_VIRTUAL_COLOR_DATA);
	__AddAdapter(Searcher,RAY_MPI_TAG_VIRTUAL_COLOR_DATA_REPLY);

/* the number of colored k-mers for a contig */
	int m_coloredKmers;

/* states for browsing the graph */
	bool m_browseTheGraph;
	bool m_browsedTheGraphStarted;
	bool m_browsedTheGraphEnded;
	VirtualKmerColorHandle m_currentVirtualColor;
	Rank m_rank;
	bool m_messageSent;
	bool m_messageReceived;
	
	bool m_useOneColorPerFile;

	QualityCaller m_caller;

	MessageTag RAY_MPI_TAG_ADD_COLORS;
	MessageTag RAY_MPI_TAG_ADD_KMER_COLOR_REPLY;
	MessageTag RAY_MPI_TAG_CONTIG_BIOLOGICAL_ABUNDANCES;
	MessageTag RAY_MPI_TAG_SEQUENCE_BIOLOGICAL_ABUNDANCES;
	MessageTag RAY_MPI_TAG_COUNT_SEARCH_ELEMENTS;

	MessageTag RAY_MPI_TAG_ADD_KMER_COLOR;
	MessageTag RAY_MPI_TAG_CONTIG_ABUNDANCE;
	MessageTag RAY_MPI_TAG_CONTIG_ABUNDANCE_REPLY;
	MessageTag RAY_MPI_TAG_CONTIG_IDENTIFICATION;
	MessageTag RAY_MPI_TAG_CONTIG_IDENTIFICATION_REPLY;
	MessageTag RAY_MPI_TAG_GET_COVERAGE_AND_PATHS;
	MessageTag RAY_MPI_TAG_GET_COVERAGE_AND_PATHS_REPLY;
	MessageTag RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE;
	MessageTag RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE_REPLY;
	MessageTag RAY_MPI_TAG_SEARCH_COUNTING_DONE;
	MessageTag RAY_MPI_TAG_SEARCH_ELEMENTS;
	MessageTag RAY_MPI_TAG_SEARCH_ELEMENTS_REPLY;
	MessageTag RAY_MPI_TAG_SEARCH_MASTER_COUNT;
	MessageTag RAY_MPI_TAG_SEARCH_MASTER_COUNT_REPLY;
	MessageTag RAY_MPI_TAG_SEARCH_MASTER_SHARING_DONE;
	MessageTag RAY_MPI_TAG_SEARCH_SHARE_COUNTS;
	MessageTag RAY_MPI_TAG_SEARCH_SHARING_COMPLETED;
	MessageTag RAY_MPI_TAG_SEQUENCE_ABUNDANCE_FINISHED;
	MessageTag RAY_MPI_TAG_SEQUENCE_ABUNDANCE_YOU_CAN_GO_HOME;
	MessageTag RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCE_REPLY;
	MessageTag RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCES;
	MessageTag RAY_MPI_TAG_SEARCHER_CLOSE;
	MessageTag RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCE_ENTRY;
	MessageTag RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCE_ENTRY_REPLY;
	MessageTag RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE_AND_COLORS;
	MessageTag RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE_AND_COLORS_REPLY;
	MessageTag RAY_MPI_TAG_FINISHED_COLORING;
	MessageTag RAY_MPI_TAG_GET_GRAPH_COUNTS;
	MessageTag RAY_MPI_TAG_GET_GRAPH_COUNTS_REPLY;
	MessageTag RAY_MPI_TAG_GRAPH_COUNTS;
	MessageTag RAY_MPI_TAG_VIRTUAL_COLOR_DATA;
	MessageTag RAY_MPI_TAG_VIRTUAL_COLOR_DATA_REPLY;

	MasterMode RAY_MASTER_MODE_KILL_RANKS;
	MasterMode RAY_MASTER_MODE_ADD_COLORS;
	MasterMode RAY_MASTER_MODE_COUNT_SEARCH_ELEMENTS;
	MasterMode RAY_MASTER_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES;
	MasterMode RAY_MASTER_MODE_CONTIG_BIOLOGICAL_ABUNDANCES;
	MasterMode RAY_MASTER_MODE_SEARCHER_CLOSE;
	MasterMode RAY_MASTER_MODE_PHYLOGENY_MAIN;

	SlaveMode RAY_SLAVE_MODE_ADD_COLORS;
	SlaveMode RAY_SLAVE_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES;
	SlaveMode RAY_SLAVE_MODE_CONTIG_BIOLOGICAL_ABUNDANCES;
	SlaveMode RAY_SLAVE_MODE_COUNT_SEARCH_ELEMENTS;
	SlaveMode RAY_SLAVE_MODE_SEARCHER_CLOSE;




/** translator for virtual colors **/
	ColorSet m_colorSet;

/*
 * The master color object
 */
	ColorSet m_masterColorSet;

	int m_finishedColoring;
	bool m_locallyFinishedColoring;

/** an object that writes files */
	DistributionWriter m_writer;

	bool m_pumpedCounts;
	void shareTotalGraphCounts();

	LargeCount m_processedFiles;
	LargeCount m_processedSequences;

	LargeCount m_sequencesToProcessInFile;
	LargeCount m_sequencesToProcess;
	LargeCount m_filesToProcess;

	LargeCount m_totalNumberOfColoredKmerObservations;
	LargeCount m_totalNumberOfColoredKmers;
	LargeCount m_totalNumberOfAssembledKmerObservations;
	LargeCount m_totalNumberOfAssembledColoredKmerObservations;
	LargeCount m_totalNumberOfAssembledKmers;
	LargeCount m_totalNumberOfAssembledColoredKmers;
	LargeCount m_totalKmerObservations;
	LargeCount m_totalKmers;
	
	PhysicalKmerColor m_color;
	PhysicalKmerColor m_identifier;

	bool m_closedFiles;

	/** indicates if colors must be added for this sequence. **/
	bool m_mustAddColors;

	bool m_colorSequenceKmersSlaveStarted;

	/** the part of the de Bruijn graph that the current ranks owns **/
	GridTable*m_subgraph;

	bool m_startedColors;

	/** number of pending messages */
	int m_pendingMessages;
	
	int m_numberOfRanksThatFinishedSequenceAbundances;

	/** total number of kmers processed */
	LargeCount m_kmersProcessed;

	/** manually buffered data */
	BufferedData m_bufferedData;

	/** point-wise derivative for speed readouts */
	Derivative m_derivative;

	/** the Ray parameters */
	Parameters*m_parameters;

	/** the switchman */
	SwitchMan*m_switchMan;
	VirtualCommunicator*m_virtualCommunicator;
	StaticVector*m_outbox;
	StaticVector*m_inbox;
	RingAllocator*m_outboxAllocator;
	TimePrinter*m_timePrinter;

	/** counts for each contig for the current sequence
 * being processed
 *
 * map<char, map<contig, set<position > > > */
	map<char, map<PathHandle,set<int> > > m_contigCounts;

/** the set of observed paths for the current position */
	map<int,set<PathHandle> > m_observedPaths;

	// state of the machine
	bool m_checkedHits;

/**
 * this is only populated on master
 */
	map<PathHandle,int> m_contigLengths;

	// iterators for hits
	vector<ContigHit> m_sortedHits;

	vector<ContigHit>::iterator m_sortedHitsIterator;

	vector<ContigSearchEntry> m_listOfContigEntries;

	/** the identifier to give to the virtual communicator */
	WorkerHandle m_workerId;

	// for counting entries in category files
	bool m_countElementsMasterStarted;
	bool m_countElementsSlaveStarted;

	// for counting stuff in contigs
	bool m_countContigKmersSlaveStarted;
	bool m_countContigKmersMasterStarted;

	// for counting sequences
	bool m_listedDirectories;
	bool m_countedDirectories;
	bool m_shareCounts;
	bool m_sharedCounts;
	int m_directoryIterator;
	int m_fileIterator;
	bool m_waiting;

	/** option that indicates if detailed reports are needed */
	bool m_writeDetailedFiles;

	/** contig paths */
	vector<GraphPath>*m_contigs;
	vector<PathHandle>*m_contigNames;

	// synchronization
	int m_ranksDoneCounting;
	int m_ranksDoneSharing;
	int m_ranksSynced;
	bool m_synchronizationIsDone;

	int m_masterDirectoryIterator;
	int m_masterFileIterator;
	bool m_sendCounts;

	/** contig iterator */
	int m_contig;

	/** contig position iterator */
	int m_contigPosition;

	/** only used by master, tells which rank to call next */
	int m_rankToCall;

	/** indicates if the rank has sent a control message already */
	bool m_finished;

	// for the virtual communicator
	vector<WorkerHandle> m_activeWorkers;

	/** file to write coverage distribution */
	ofstream m_currentCoverageFile;
	ostringstream m_currentCoverageFile_Buffer;

	/** a vector to store coverage values */
	vector<int> m_coverageValues;
	vector<int> m_colorValues;

	bool m_waitingForAbundanceReply;

	map<CoverageDepth,LargeCount> m_coverageDistribution;
	map<CoverageDepth,LargeCount> m_coloredCoverageDistribution;
	map<CoverageDepth,LargeCount> m_assembledCoverageDistribution;
	map<CoverageDepth,LargeCount> m_coloredAssembledCoverageDistribution;

	/** search directory objects */
	SearchDirectory*m_searchDirectories;
	int m_searchDirectories_size;

	/** for the master rank */
	map<int,FILE*> m_identificationFiles;
	map<int,ostringstream*> m_identificationFiles_Buffer;
	int m_contigIdentificationflushOperations;
	void flushContigIdentificationBuffer(int directory,bool force);

	// base names of directories
	vector<string> m_directoryNames;

/** for a sequence, indicates if its abundance was processed. */
	bool m_processedAbundance;

	// base names of files
	vector<vector<string> > m_fileNames;

	/** number of matches for a sequence */
	int m_matches;
	int m_coloredMatches;
	int m_assembledMatches;
	int m_coloredAssembledMatches;

	/** k-mer length */
	int m_kmerLength;

	/** flag */
	bool m_requestedCoverage;

	int m_numberOfKmers;

	/** files to write */
	map<int,FILE* > m_arrayOfFiles;
	map<int,ostringstream*> m_arrayOfFiles_Buffer;

	// tsv profiles
	map<int,FILE* > m_arrayOfFiles_tsv;
	map<int,ostringstream*> m_arrayOfFiles_tsv_Buffer;

	/** track the descriptors */
	int m_activeFiles;

	/** partition */
	int m_firstSequence;
	int m_lastSequence;

	/** states for sequence abundances */
	bool m_countSequenceKmersSlaveStarted;
	bool m_countSequenceKmersMasterStarted;

	/** state */
	bool m_createdSequenceReader;

	/** iteraetor */
	int m_sequenceIterator;
	uint64_t m_globalSequenceIterator;
	int m_globalFileIterator;

	int m_currentLength;


//_-----------------_//


	void showContigAbundanceProgress();
	void createTrees();

	LargeIndex m_lastPrinted;

	bool isFileOwner(int globalFile);

	void printDirectoryStart();

	string getBaseName(string a);

	void showProcessedKmers();

	int getDistributionMode(map<CoverageDepth,LargeCount>*distribution);

	void dumpDistributions();
	string getDirectoryBaseName(int i);
	string getFileBaseName(int i,int j);
	int getWriter(int directory);

	int getAbundanceWriter(int directory);

	void addColorToKmer(Vertex*node,PhysicalKmerColor color);

	void createRootDirectories();

	/* count the k-mer observations */
	void countKmerObservations(LargeCount*localAssembledKmerObservations,
		LargeCount*localAssembledColoredKmerObservations,
		LargeCount*localAssembledKmers,LargeCount*localAssembledColoredKmers,
		LargeCount*localColoredKmerObservations,LargeCount*localColoredKmers,
		LargeCount*geneCdsKmerObservations,LargeCount*totalKmers,
		LargeCount*totalKmerObservations);

	/* I/O optimization */
	int m_sequenceXMLflushOperations;
	int m_coverageXMLflushOperations;
	void flushCoverageXMLBuffer(bool force);
	void flushSequenceAbundanceXMLBuffer(int directory,bool force);

	// EMBL_CDS namespace
	LargeCount m_totalNumberOfKmerObservations_EMBL_CDS;

	void browseColoredGraph();
	PhysicalKmerColor getColorInNamespace(PhysicalKmerColor handle);
	PhysicalKmerColor buildGlobalHandle(int theNamespace,PhysicalKmerColor handle);
	int getNamespace(PhysicalKmerColor handle);

	void generateSummaryOfColoredDeBruijnGraph();
public:

	void call_RAY_MASTER_MODE_COUNT_SEARCH_ELEMENTS();
	void call_RAY_SLAVE_MODE_COUNT_SEARCH_ELEMENTS();

	void call_RAY_MASTER_MODE_CONTIG_BIOLOGICAL_ABUNDANCES();
	void call_RAY_SLAVE_MODE_CONTIG_BIOLOGICAL_ABUNDANCES();

	void call_RAY_MASTER_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES();
	void call_RAY_SLAVE_MODE_SEQUENCE_BIOLOGICAL_ABUNDANCES();
	
	void call_RAY_MASTER_MODE_ADD_COLORS();
	void call_RAY_SLAVE_MODE_ADD_COLORS();

	void call_RAY_MASTER_MODE_SEARCHER_CLOSE();
	void call_RAY_SLAVE_MODE_SEARCHER_CLOSE();

	void call_RAY_MPI_TAG_ADD_KMER_COLOR(Message*message);
	void call_RAY_MPI_TAG_CONTIG_IDENTIFICATION(Message*message);
	void call_RAY_MPI_TAG_REQUEST_VERTEX_COVERAGE_AND_COLORS(Message*m);

	void constructor(Parameters*parameters,StaticVector*outbox,TimePrinter*timePrinter,SwitchMan*switchMan,
	VirtualCommunicator*m_vc,StaticVector*inbox,RingAllocator*outboxAllocator,
		GridTable*graph);

	void setContigs(vector<GraphPath>*paths,vector<PathHandle>*names);

	void call_RAY_MPI_TAG_GET_COVERAGE_AND_PATHS(Message*message);
	void call_RAY_MPI_TAG_WRITE_SEQUENCE_ABUNDANCE_ENTRY(Message*message);
	void call_RAY_MPI_TAG_GRAPH_COUNTS(Message*message);

	void registerPlugin(ComputeCore*core);
	void resolveSymbols(ComputeCore*core);

	LargeCount getTotalNumberOfKmerObservations();

	LargeCount getTotalNumberOfColoredKmerObservationsForANameSpace(int namespaceNumber);

	void call_RAY_MPI_TAG_VIRTUAL_COLOR_DATA(Message*message);
	void call_RAY_MPI_TAG_VIRTUAL_COLOR_DATA_REPLY(Message*message);

}; /* Searcher */


#endif /* _Searcher_h */