Home

nevrax.com

Nevrax.org News Mailing-list Documentation CVS Bugs License

Documentation                       Search   algo.h Go to the documentation of this file. /* Copyright, 2000-2002 Nevrax Ltd. * * This file is part of NEVRAX NEL. * NEVRAX NEL 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 2, or (at your option) * any later version. * NEVRAX NEL is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License for more details. * You should have received a copy of the GNU General Public License * along with NEVRAX NEL; see the file COPYING. If not, write to the * Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, * MA 02111-1307, USA. */ #ifndef NL_ALGO_H #define NL_ALGO_H #include "nel/misc/types_nl.h" #include <vector> #include <string> namespace NLMISC { // *************************************************************************** template <class T, class U> T computeBilinear(const T &v0, const T &v1, const T &v2, const T &v3, const U &s, const U &t) { T h0 = t * v3 + ((U) 1 - t) * v0; T h1 = t * v2 + ((U) 1 - t) * v1; return s * h1 + ((U) 1 - s) * h0; } // *************************************************************************** template<class T> uint searchLowerBound(const T *array, uint arraySize, const T &key) { uint start=0; uint end= arraySize; // find lower_bound by dichotomy while(end-1>start) { uint pivot= (end+start)/2; // return the lower_bound, ie return first start with array[pivot]<=key if(array[pivot] <= key) start= pivot; else end= pivot; } return start; } // *************************************************************************** template<class T> uint searchLowerBound(const std::vector<T> &array, const T &key) { uint size= array.size(); if(size==0) return 0; else return searchLowerBound(&array[0], size, key); } // *************************************************************************** static inline void fastClamp8(sint &v) { #ifdef NL_OS_WINDOWS // clamp v in 0..255 (no cond jmp) __asm { mov esi, v mov eax, [esi] mov ebx, eax // clamp to 0. add eax, 0x80000000 sbb ecx, ecx not ecx and ebx, ecx // clamp to 255. add eax, 0x7FFFFF00 sbb ecx, ecx and ebx, 255 and ecx, 255 or ebx, ecx // store mov [esi], ebx } #else clamp(v, 0, 255); #endif } // *************************************************************************** bool testWildCard(const char *strIn, const char *wildCard); // *************************************************************************** void splitString(const std::string &str, const std::string &separator, std::vector<std::string> &retList); } // NLMISC #endif // NL_ALGO_H /* End of algo.h */