-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathihspairjob.hpp
46 lines (42 loc) · 1.48 KB
/
ihspairjob.hpp
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
/*
* Hapbin: A fast binary implementation EHH, iHS, and XPEHH
* Copyright (C) 2015-2017 Colin MacLean <[email protected]>
*
* 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, either version 3 of the License, or
* (at your option) any later version.
*
* 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 should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifndef IHSPAIRJOB_H
#define IHSPAIRJOB_H
#include "ehh.hpp"
#include "hapmap.hpp"
class IhsPairJob
{
public:
IhsPairJob();
IhsPairJob(std::size_t start, std::size_t end);
void add(const EHHPair &result);
int load(const std::string& file);
void save(const std::string& file);
std::vector<EHHPair> results() const;
void saveAscii(const std::string& out, const HapMap& hm);
std::size_t size() const { return m_results.size(); }
std::size_t start() const { return m_range[0]; }
std::size_t end() const { return m_range[1]; }
protected:
std::size_t m_range[2];
double m_sumIhs[4];
std::vector<EHHPair> m_results;
static const uint64_t magicNumber;
};
#endif // IHSPAIRJOB_H