vector.c


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

#include <stdlib.h>
#include "vector.h"
vector_t init_vector(int mx, int my) {
	vector_t vector;
	vector.mx = mx;
	vector.my = my;
	return vector;
}
vectorp_t init_vectorp(vector_t* vectors, int length) {
	vectorp_t vectorP;
	vectorP.vectors = vectors;
	vectorP.length = length;
	return vectorP;
}
bool vector_equals(vector_t v1, vector_t v2) {
	return v1.mx == v2.mx && v1.my == v2.my;
}
vector_t vector_add(vector_t v1, vector_t v2) {
	return init_vector(v1.mx + v2.mx, v1.my + v2.my);
}
vector_t vector_sub(vector_t v1, vector_t v2) {
	return init_vector(v1.mx - v2.mx, v1.my - v2.my);
}
vectorp_t remove_vector(vectorp_t vectorp, int index) {
	vector_t* vectors = malloc((vectorp.length - 1) * sizeof(vector_t));
	for(int i = 0; i < vectorp.length - 1; i++) {
		int correctedIndex = i > index ? i - 1 : i;
		if(i != index) {
			vectors[correctedIndex] = vectorp.vectors[i];
		}
	}
	return init_vectorp(vectors, vectorp.length - 1);
}
vectorp_t remove_vectors(vectorp_t vectorp, int* indexes, int indexCount) {
	vector_t* vectors = malloc((vectorp.length - indexCount) * sizeof(vector_t));
	int correctedIndex = 0;
	for(int i = 0; i < vectorp.length - indexCount; i++) {
		int toRemove = 0;
		for(int j = 0; j < indexCount; j++) {
			if(i == indexes[j]) {
				toRemove = 1;
				break;
			}
		}
		if(!toRemove) {
			vectors[correctedIndex] = vectorp.vectors[i];
			correctedIndex++;
		}
	}
	return init_vectorp(vectors, vectorp.length - indexCount);
}
vectorpp_t init_vectorpp(vectorp_t* vectorps, int length) {
	vectorpp_t vectorPP;
	vectorPP.vectorps = vectorps;
	vectorPP.length = length;
	return vectorPP;
}