/*****************************************************************************
The Dark Mod GPL Source Code

This file is part of the The Dark Mod Source Code, originally based
on the Doom 3 GPL Source Code as published in 2011.

The Dark Mod Source Code is free software: you can redistribute it
and/or modify it under the terms of the GNU General Public License as
published by the Free Software Foundation, either version 3 of the License,
or (at your option) any later version. For details, see LICENSE.TXT.

Project: The Dark Mod (http://www.thedarkmod.com/)

******************************************************************************/

#ifndef __BINSEARCH_H__
#define __BINSEARCH_H__

struct idLess {
	template<class A, class B> ID_FORCE_INLINE bool operator() (const A &a, const B &b) const {
		return a < b;
	}
};

/*
===============================================================================

	Binary Search templates

	The array elements have to be ordered in increasing order.

===============================================================================
*/

/*
====================
idBinSearch_GreaterEqual

	Finds the last array element which is smaller than the given value.
====================
*/
template< class type, class key, class less = idLess >
ID_INLINE int idBinSearch_Less( const type *array, const int arraySize, const key &value, const less &cmp = less() ) {
	int len = arraySize;
	int mid = len;
	int offset = 0;
	while( mid > 0 ) {
		mid = len >> 1;
		if ( cmp( array[offset+mid], value ) ) {
			offset += mid;
		}
		len -= mid;
	}
	return offset;
}

/*
====================
idBinSearch_GreaterEqual

	Finds the last array element which is smaller than or equal to the given value.
====================
*/
template< class type, class key, class less = idLess >
ID_INLINE int idBinSearch_LessEqual( const type *array, const int arraySize, const key &value, const less &cmp = less() ) {
	int len = arraySize;
	int mid = len;
	int offset = 0;
	while( mid > 0 ) {
		mid = len >> 1;
		if ( !cmp( value, array[offset+mid] ) ) {
			offset += mid;
		}
		len -= mid;
	}
	return offset;
}

/*
====================
idBinSearch_Greater

	Finds the first array element which is greater than the given value.
====================
*/
template< class type, class key, class less = idLess >
ID_INLINE int idBinSearch_Greater( const type *array, const int arraySize, const key &value, const less &cmp = less() ) {
	int len = arraySize;
	int mid = len;
	int offset = 0;
	int res = 0;
	while( mid > 0 ) {
		mid = len >> 1;
		if ( cmp( value, array[offset+mid] ) ) {
			res = 0;
		} else {
			offset += mid;
			res = 1;
		}
		len -= mid;
	}
	return offset+res;
}

/*
====================
idBinSearch_GreaterEqual

	Finds the first array element which is greater than or equal to the given value.
====================
*/
template< class type, class key, class less = idLess >
ID_INLINE int idBinSearch_GreaterEqual( const type *array, const int arraySize, const key &value, const less &cmp = less() ) {
	int len = arraySize;
	int mid = len;
	int offset = 0;
	int res = 0;
	while( mid > 0 ) {
		mid = len >> 1;
		if ( !cmp( array[offset+mid], value ) ) {
			res = 0;
		} else {
			offset += mid;
			res = 1;
		}
		len -= mid;
	}
	return offset+res;
}

typedef struct exponentialSearchParams_s {
	float initValue;
	float minValue, maxValue;
	float relativePrecision, absolutePrecision;
} exponentialSearchParams_t;

// stgatilov: finds maximum positive value where condition is still true
// it is assumed that condition is monotonic: first true, then false
// returns maxValue if condition is true everywhere, minValue - eps if condition is false everywhere
float idExponentialSearch_MaxTrue( bool (*condition)(void*, float), void *context, const exponentialSearchParams_t &params );

#endif /* !__BINSEARCH_H__ */