Context Navigation

CT_hash.cxx

Timestamp:

14/08/09 16:29:27 (3 years ago)

Author:

westram

Message:

Files:

r5390	r6141
15	15	HNODE *Sortedlist = NULL;
16	16
17		/** initalize Hashtable and free old data */
	17	/** initialize Hashtable and free old data */
18	18	void hash_init(void)
19	19	{
…	…
59	59
60	60	/** return the first element (with the highest hitnumber) from the linear sorted
61		list and calculate percent~~ile appearence of this par~~ition in all trees and
	61	list and calculate percentaged appearance of this partition in all trees and
62	62	calculate the average pathlength.
63	63	The element is removed from the list afterwards */
…	…
82	82
83	83	/** insert part in hashtable with weight
84		@PARAMTER part the one to insert, is destructed afterwards
	84	@PARAMETER part the one to insert, is destructed afterwards
85	85	weight the weight of the part */
86	86	void hash_insert(PART *part, int weight)
…	…
89	89	HNODE *hp;
90	90
91		part_standart(part);
	91	part_standard(part);
92	92
93	93	key = part_key(part);
…	…
129	129	is empty afterwards. I use a simple trick speed up the function:
130	130	build for every hitnumber one list and put all elements with that hitnumber
131		in it. After that i conect the list together, what results in a sorted list
	131	in it. After that i connect the list together, what results in a sorted list
132	132	*/
133	133	void build_sorted_list(void)
…	…
163	163	head = NULL;
164	164	tail = NULL;
165		/* concatinate lists */
	165	/* concatenate lists */
166	166	for(i=Hash_max_count-1; i>=0; i--) {
167	167	if(heads[i]) {