libsent/src/util/qsort.c File Reference

quick sort (re-entrant) More...

Go to the source code of this file.

Functions
static void	internal_quick_sort (char *left, char *right, int size, int(*compare)(const void *, const void *, void *), void *pointer)
	Internal quick sort function.
void	qsort_reentrant (void *base, int count, int size, int(*compare)(const void *, const void *, void *), void *pointer)
	Quick sort that will pass data poitner to comparison function for re-entrant usage.

---

Detailed Description

quick sort (re-entrant)

Author:

Akinobu Lee

Date:

Wed Feb 13 14:34:45 2008

Revision

1.1

Definition in file qsort.c.

---

Function Documentation

static void internal_quick_sort	(	char *	left,
		char *	right,
		int	size,
		int(*)(const void *, const void *, void *)	compare,
		void *	pointer
	)			[static]

Internal quick sort function.

Parameters:

	left	[in] left bound element
	right	[in] right bound element
	size	[in] size of an element
	compare	[in] comparison function
	pointer	[in] data pointer which will be passed to comparison function

Definition at line 30 of file qsort.c.

Referenced by qsort_reentrant().

void qsort_reentrant	(	void *	base,
		int	count,
		int	size,
		int(*)(const void *, const void *, void *)	compare,
		void *	pointer
	)

Quick sort that will pass data poitner to comparison function for re-entrant usage.

Parameters:

	base	[i/o] pointer to the data array
	count	[in] number of elements in the array
	size	[in] size of an element in bytes
	compare	[in] comparison function
	pointer	[in] data which will be passed to comparison function

Definition at line 77 of file qsort.c.

Referenced by wchmm_sort_idx_by_category(), and wchmm_sort_idx_by_wseq().

---