_misc.h

Go to the documentation of this file.

/* === S T A R T =========================================================== */

#ifndef __ETL__MISC_H_
#define __ETL__MISC_H_

/* === H E A D E R S ======================================================= */
#include <cmath>

#include <math.h>

/* === M A C R O S ========================================================= */

/* === T Y P E D E F S ===================================================== */

/* === C L A S S E S & S T R U C T S ======================================= */

_ETL_BEGIN_NAMESPACE

template<typename I, typename T> inline I
binary_find(I begin, I end, const T& value)
{
#if 1
    I iter(begin+(end-begin)/2);

    while(end-begin>1 && !(*iter==value))
    {
        ((*iter<value)?begin:end) = iter;

        iter = begin+(end-begin)/2;
    }
    return iter;
#else
    size_t len_(end-begin);
    size_t half_(len_/2);

    I iter(begin);
    iter+=half_;

    while(len_>1 && !(*iter==value))
    {
        ((*iter<value)?begin:end) = iter;

        len_=half_;
        half_/=2;

        iter=begin;
        iter+=half_;
    }
    return iter;
#endif
}

inline int round_to_int(const float x) {
    // return static_cast<int>(x+0.5f);         // <-- (a) fast, but rounds -1.333 to 0!
    // return static_cast<int>(rintf(x));       // <-- (b) slow, but correct
    if (x>=0) return static_cast<int>(x + 0.5); // <-- slower than (a), but correct, and faster than (b)
    else      return static_cast<int>(x - 0.5);
}
inline int round_to_int(const double x) {
    // return static_cast<int>(x+0.5);
    // return static_cast<int>(rint(x));
    if (x>=0) return static_cast<int>(x + 0.5);
    else      return static_cast<int>(x - 0.5);
}

inline int ceil_to_int(const float x) { return static_cast<int>(ceil(x)); }
inline int ceil_to_int(const double x) { return static_cast<int>(ceil(x)); }

inline int floor_to_int(const float x) { return static_cast<int>(x); }
inline int floor_to_int(const double x) { return static_cast<int>(x); }

_ETL_END_NAMESPACE

/* === E X T E R N S ======================================================= */

/* === E N D =============================================================== */

#endif