cs107thirdAssignment/main.c at master · ArtemMartus/cs107thirdAssignment · GitHub

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
#include "vector.h"
#include "hashtable.h"
#include <stdio.h> // printf
#include <assert.h> // assert
#include <stdlib.h> // malloc, free


int compareInts(const void* a, const void* b){
	int i1 = *(int*)a;
	int i2 = *(int*)b;
	return i2 - i1;
}

void mapInts(void* pElement,void* pbyNum){ // add function
	int* element = (int*)pElement;
	int byNum = *(int*)pbyNum;
	*element += byNum;
}

void printPosition(vector* v,int q,int w,int e,int r,bool isSorted){

	int a = VectorSearch(v,&q,compareInts,0,isSorted),
		b = VectorSearch(v,&w,compareInts,0,isSorted),
		c = VectorSearch(v,&e,compareInts,0,isSorted),
		d = VectorSearch(v,&r,compareInts,0,isSorted);

	printf("Positions of values { %d %d %d %d } in vector { %d %d %d %d }\n",q,w,e,r,a,b,c,d);
}

void printVector(vector* v){
	void* pos0 = VectorNth(v,0); assert(pos0 != 0);
	void* pos1 = VectorNth(v,1); assert(pos1 != 0);
	void* pos2 = VectorNth(v,2); assert(pos2 != 0);
	void* pos3 = VectorNth(v,3); assert(pos3 != 0);

	int a = *(int*)pos0,
		b = *(int*)pos1,
		c = *(int*)pos2,
		d = *(int*)pos3;
	printf("Values from vector %d %d %d %d\n",a,b,c,d);
}

void testVector(){
	vector* v = malloc(sizeof(vector)); //vector of integers
	VectorNew(v,sizeof(int),0,3);
// lets fill this vector with {2,0,1,9}
	int number;
	number = 2;VectorAppend(v,(void*)&number);
	number = 0;VectorAppend(v,(void*)&number);
	number = 1;VectorAppend(v,(void*)&number);
	number = 9;VectorAppend(v,(void*)&number);

	printVector(v);

//Replace to 1998
	number = 1;VectorReplace(v,&number,0);
	number = 9;VectorReplace(v,&number,1);
	number = 9;VectorReplace(v,&number,2);
	number = 8;VectorReplace(v,&number,3);

	printVector(v);

//Remove and insert element to form 1787
	VectorDelete(v,1);
	VectorDelete(v,1);
	number = 7;VectorInsert(v,&number,1);
	VectorInsert(v,&number,3);

	printVector(v);

//Search for an element
	printPosition(v,1,7,8,7,false);

//Sort the vector
	VectorSort(v,compareInts);

	printVector(v);
//Binary search the element
	printPosition(v,1,7,8,7,true);

//Use vector mapping
	number = 3;VectorMap(v,mapInts,(void*)&number);

	printVector(v);

//Free memory
	VectorDispose(v);
	free(v);
}

static int number;

int hashFun(const void* element, int numBuckets){
	return (number + *(int*)element) % numBuckets;
}


void innerHashsetMap(void* element, void* aux){ //divide function
	assert(element!=0);
	assert(aux!=0);
	int* el = (int*)element;
	int b = *(int*)aux;
	int result = *el / b;
	*el = result;
}
void hashsetMapf(void* element, void* aux){
	assert(element!=0);
	assert(aux!=0);
	vector* v = (vector*) element;
	VectorMap(v,innerHashsetMap,aux);
}

void testHashset(){
	sranddev();
	number = rand();
	hashset* h = malloc(sizeof(hashset));// hashset of integers
	HashSetNew(h,sizeof(int),0xff,hashFun,compareInts,0);

	int year = 1931;
	int someNumber = 1235124;

	HashSetEnter(h,(void*)&year);
	HashSetEnter(h,(void*)&someNumber);

	vector* searchOne = (vector*)HashSetLookup(h,(void*)&year);
	vector* searchTwo = (vector*)HashSetLookup(h,(void*)&someNumber);

	assert(searchOne != 0);
	assert(searchTwo != 0);
	assert(VectorLength(searchOne)>0);
	assert(VectorLength(searchTwo)>0);

	int a = *(int*)VectorNth(searchOne,0);
	int b = *(int*)VectorNth(searchTwo,0);

	assert(a == year);
	assert(b == someNumber);

	int divider = 1000;
	HashSetMap(h,hashsetMapf,(void*)&divider);

	printf("Hashes count %d\n", HashSetCount(h));

	HashSetDispose(h);
	free(h);
}

int main(){
	printf("Hello, World!\n");
	testHashset();
	return 0;
}