-
Notifications
You must be signed in to change notification settings - Fork 0
/
myBijection.h
99 lines (97 loc) · 1.62 KB
/
myBijection.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
#ifndef _MY_BIJECTION_H
#define _MY_BIJECTION_H
#include <cstring>
class Bijection
{
protected:
int *array;
int *index_in_array;
int array_size;
int array_capacity;
public:
Bijection()
{
array = NULL;
index_in_array = NULL;
array_size = 0;
array_capacity = 0;
}
Bijection(int sz)
{
array_capacity = sz + 2;
array = new int[array_capacity];
index_in_array = new int[array_capacity];
memset(array, 0, sizeof(int) * (array_capacity));
memset(index_in_array, 0, sizeof(int) * (array_capacity));
array_size = 0;
}
~Bijection()
{
delete[] array;
array = NULL;
delete[] index_in_array;
index_in_array = NULL;
array_size = 0;
array_capacity = 0;
}
void clear()
{
//memset(array, 0, sizeof(int) * array_capacity);
//memset(index_in_array, 0, sizeof(int) * array_capacity);
for(int i = 1; i <= array_size; i++)
{
index_in_array[array[i]] = 0;
}
array_size = 0;
}
void insert_element(int e)
{
array[++array_size] = e;
index_in_array[e] = array_size;
}
void delete_element(int e)
{
int last_e = array[array_size--];
int e_pos = index_in_array[e];
array[e_pos] = last_e;
index_in_array[last_e] = e_pos;
index_in_array[e] = 0;
}
int index_of(int e)
{
return index_in_array[e];
}
int element_in(int e)
{
return index_in_array[e];
}
int size()
{
return array_size;
}
int at(int i)
{
return array[i];
}
int begin()
{
return 1;
}
int end()
{
return array_size + 1;
}
int rand_element()
{
return array[rand() % array_size + 1];
}
void show_elements()
{
for(int i = begin(); i != end(); i++)
{
cout << at(i) << '\t';
}
cout << endl;
}
};
#endif