-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathdataTypes.h
116 lines (99 loc) · 2.4 KB
/
dataTypes.h
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
#ifndef Included_DataTypes_H
#define Included_DataTypes_H
#include <iostream>
#include "stdio.h"
#include "string.h"
#include <bitset>
//orismos twn tupwn dedomenwn pou 8a apo8hkeuoume kai 8a diaxeirizomaste
class Vector //class Vector gia dedomena cosine
{
private:
std::string id;
const int dimensions;
double* coordinance;
public:
Vector(std::string ID, int dim, double* coord): dimensions(dim)
{
id = ID;
coordinance = new double[dimensions];
memcpy(coordinance, coord, dimensions*sizeof(double)); //antigrafei ta dedomena apo ton ena pinaka ston allo
}
~Vector()
{
delete[] coordinance;
}
std::string get_string()
{
return id;
}
int get_dimensions()
{
return dimensions;
}
double get_coordinance(int pos)
{
if(pos >= dimensions) return -9999;
return coordinance[pos];
}
};
class Hamming //class Hamming gia dedomena tupou hamming
{
private:
std::string id;
std::bitset<64> bitString;
const int noBits;
public:
Hamming(std::string ID, std::bitset<64> bitSet, int nBits): noBits(nBits)
{
id = ID;
bitString = bitSet;
}
std::string get_string()
{
return id;
}
void get_bitString(std::bitset<64>& data)
{
data = bitString;
}
int get_noBits()
{
return noBits;
}
};
class MatrixPoint //class MatrixPoint gia dedomena pou anhkoun se distance matrix
{
private:
std::string id;
const int N, position;
int* distances;
public:
MatrixPoint(std::string ID, int* dist, int n, int pos): N(n), position(pos)
{
id = ID;
distances = new int[N];
memcpy(distances, dist, N*sizeof(int));
}
~MatrixPoint()
{
delete [] distances;
}
std::string get_string()
{
return id;
}
int get_noItems()
{
return N;
}
int get_distance(int pos)
{
if(pos >= N) return -9999;
return distances[pos];
}
int get_pos()
{
return position;
}
};
#endif