Subversion Repositories Kolibri OS

Rev

Rev 7771 | Rev 7885 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
5959 leency 1
#ifndef INCLUDE_COLLECTION_H
2
#define INCLUDE_COLLECTION_H
3
#print "[include ]\n"
4
 
6285 leency 5
/*========================================================
6
=                                                        =
7
=                       String                           =
8
=                                                        =
9
========================================================*/
10
 
5959 leency 11
struct collection
12
{
5965 leency 13
	int realloc_size, count;
14
	dword data_start;
5959 leency 15
	dword data_size;
7049 leency 16
	dword element_offset[4000];
5965 leency 17
	int add();
7049 leency 18
	int addn();
7738 leency 19
	dword get(); //get_name_by_pos
20
	dword get_pos_by_name();
5959 leency 21
	void drop();
5965 leency 22
	void increase_data_size();
7878 leency 23
	dword get_last();
24
	bool delete_last();
5959 leency 25
};
26
 
7286 leency 27
:void collection::increase_data_size() {
5965 leency 28
	int filled_size;
29
	if (realloc_size<4096) realloc_size = 4096;
30
	if (!data_size) {
31
		data_size = realloc_size;
32
		data_start = malloc(realloc_size);
33
	}
34
	else {
35
		data_size = data_size + realloc_size;
36
		data_start = realloc(data_start, data_size);
37
	}
5959 leency 38
}
39
 
7286 leency 40
:int collection::add(dword in) {
7049 leency 41
	return addn(in, strlen(in));
42
}
43
 
7286 leency 44
:int collection::addn(dword in, len) {
7878 leency 45
	if (count >= 4000) {
46
		debugln("collection: more than 4000 elements!");
47
		return 0;
48
	}
7049 leency 49
	if (element_offset[count]+len+2 > data_size) {
5965 leency 50
		increase_data_size();
7049 leency 51
		addn(in, len);
52
		return 1;
5965 leency 53
	}
7049 leency 54
	strncpy(data_start+element_offset[count], in, len);
5959 leency 55
	count++;
7049 leency 56
	element_offset[count] = element_offset[count-1] + len + 1;
5965 leency 57
	return 1;
5959 leency 58
}
59
 
7286 leency 60
:dword collection::get(dword pos) {
5974 leency 61
	if (pos<0) || (pos>=count) return 0;
5965 leency 62
	return data_start + element_offset[pos];
5959 leency 63
}
64
 
7878 leency 65
:dword collection::get_last() {
66
	return get(count-1);
67
}
68
 
7738 leency 69
:dword collection::get_pos_by_name(dword name) {
70
	dword i;
71
	for (i=0; i
72
		if (strcmp(data_start + element_offset[i], name)==0) return i;
73
	}
74
	return -1;
75
}
76
 
7286 leency 77
:void collection::drop() {
5965 leency 78
	if (data_start) free(data_start);
7771 leency 79
	data_size = 0;
80
	data_start = 0;
81
	element_offset[count] = 0;
82
	count = 0;
5959 leency 83
}
84
 
7878 leency 85
:bool collection::delete_last() {
86
	count--;
87
}
6285 leency 88
 
89
/*========================================================
90
=                                                        =
91
=                       Integer                          =
92
=                                                        =
93
========================================================*/
94
 
7043 leency 95
struct collection_int
6285 leency 96
{
97
	int count;
98
	dword element[4096*3];
99
	int add();
100
	dword get();
7286 leency 101
	dword get_last();
102
	void pop();
6285 leency 103
	void drop();
104
};
105
 
7286 leency 106
:int collection_int::add(dword in) {
6285 leency 107
	if (count >= 4096*3) return 0;
108
	element[count] = in;
109
	count++;
110
	return 1;
111
}
112
 
7286 leency 113
:dword collection_int::get(dword pos) {
6285 leency 114
	if (pos<0) || (pos>=count) return 0;
115
	return element[pos];
116
}
117
 
7286 leency 118
:dword collection_int::get_last() {
119
	return element[count];
120
}
121
 
122
:void collection_int::pop() {
123
	if (count>0) count--;
124
}
125
 
126
:void collection_int::drop() {
6285 leency 127
	element[0] =
128
	count = 0;
129
}
130
 
5959 leency 131
#endif