kernel/util/MinMaxHeap.h

22 			int			fIndex;
114 	fIndex(-1)
261 	ASSERT(link->fIndex != -1);
262 	link->fIndex = -1;
282 	ASSERT(link->fIndex != -1);
283 	link->fIndex = -1;
305 	ASSERT(link->fIndex == -1);
313 	link->fIndex = lastElement++;
353 		if (link->fIndex <= 0)
356 		int parent = (link->fIndex - 1) / 2;
359 			ASSERT(sGetLink(tree[parent])->fIndex == parent);
360 			sGetLink(tree[parent])->fIndex = link->fIndex;
362 			Element* element = tree[link->fIndex];
363 			tree[link->fIndex] = tree[parent];
366 			link->fIndex = parent;
382 		current = link->fIndex;
384 		int child = 2 * link->fIndex + 1;
391 		child = 2 * link->fIndex + 2;
399 		if (link->fIndex == current)
402 		ASSERT(sGetLink(tree[current])->fIndex == current);
403 		sGetLink(tree[current])->fIndex = link->fIndex;
405 		Element* element = tree[link->fIndex];
406 		tree[link->fIndex] = tree[current];
409 		link->fIndex = current;
412 	if (2 * link->fIndex + 1 >= lastElement)
431 	ASSERT((link->fIndex - 1) / 2 < otherLastElement);
434 	if (2 * link->fIndex + 1 < otherLastElement) {
435 		predecessor = otherTree[2 * link->fIndex + 1];
436 		ASSERT(sGetLink(predecessor)->fIndex == 2 * link->fIndex + 1);
437 	} else if (link->fIndex < otherLastElement) {
438 		predecessor = otherTree[link->fIndex];
439 		ASSERT(sGetLink(predecessor)->fIndex == link->fIndex);
441 		predecessor = otherTree[(link->fIndex - 1) / 2];
442 		ASSERT(sGetLink(predecessor)->fIndex == (link->fIndex - 1) / 2);
448 		Element* element = currentTree[link->fIndex];
449 		currentTree[link->fIndex] = otherTree[predecessorLink->fIndex];
450 		otherTree[predecessorLink->fIndex] = element;
452 		int index = link->fIndex;
453 		link->fIndex = predecessorLink->fIndex;
454 		predecessorLink->fIndex = index;
489 	link->fIndex = 0;