/*
 * Copyright (c) 2004 Teodor Sigaev <teodor@sigaev.ru>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *        notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *        notice, this list of conditions and the following disclaimer in the
 *        documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the author nor the names of any co-contributors
 *        may be used to endorse or promote products derived from this software
 *        without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY CONTRIBUTORS ``AS IS'' AND ANY EXPRESS
 * OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL CONTRIBUTORS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
 * GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
 * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
#ifndef __PSORT_H__
#define __PSORT_H__

typedef int (*compare_sort)(const void*, const void*);
typedef void (*ffree)(void*);

typedef struct SORTITEM {
        void*  value;
        struct SORTITEM *prev;
        struct SORTITEM *next;
} SORTITEM;

typedef struct {
	SORTITEM* buf;		/* buffer */
	int	buflen;		/* length of buffer in items */
	int	curlen;		/* current number of items */
	compare_sort	cmpr;   /* compare two items */
	ffree	free;		/* free mem unused item, may be NULL */

	/* pointer for sorting */
	SORTITEM* first;
	SORTITEM* last;

	SORTITEM* curitem;		/* current position for iterator */
} SORT;

/*
 * init object
 */
int PS_init( SORT* sobj, int buflen, compare_sort func, ffree ffunc );
/*
 * reset sort object to initial state
 */
void  PS_reset( SORT* sobj );
/*
 * clear sort object (after it it's need to call PS_init)
 */
void  PS_clear( SORT* sobj );

/*
 * functions for go trought sorted array 
 */ 
int PS_init_iterator( SORT* sobj, int start ); 
void*  PS_getnext( SORT* sobj );

/*
 * insert, return 1 if inserted
 */
int PS_insert( SORT* sobj, void* nobj );

/*
 * bulk insert
 */
void PS_bulkinsert( SORT* sobj, void** nobjs, int len );
/*
 * insert a-la qsort, require sobj->free = NULL
 */
int PS_bulkplain( SORT* sobj, void* nobjs, int size, int len );

/*
 * return number of result in buffer
 */
int PS_number( SORT* sobj );

#endif