/usr/include/CLAM/Search.hxx is in libclam-dev 1.4.0-5build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 | /*
* Copyright (c) 2001-2004 MUSIC TECHNOLOGY GROUP (MTG)
* UNIVERSITAT POMPEU FABRA
*
*
* This program 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 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef _Search_
#define _Search_
#include "OSDefines.hxx"
#include "DataTypes.hxx"
namespace CLAM {
template <class U, class T> class Search
{
/* Based on locate() and hunt(), Numerical Recipes,second Edition, 117 */
private:
const U* mpData;
public:
Search()
{
mpData = NULL;
}
Search(const U& array)
{
Set(array);
}
~Search()
{
}
void Set(const U& array)
{
mpData = &array;
}
TIndex Find(const T& value,TIndex prevIndex=0) const
{
return Hunt(value,prevIndex);
}
TIndex Hunt(const T& value,TIndex prevIndex=0) const;
TIndex Bisection(const T& value) const
{
return Bisection(value,0,mpData->Size());
}
TIndex Bisection(const T& value,TIndex lowerLimit) const
{
return Bisection(value,lowerLimit,mpData->Size());
}
TIndex Bisection(const T& value,TIndex lowerLimit,TIndex upperLimit) const;
};
template <class U, class T>
inline TIndex Search<U,T>::Hunt(
const T& value,TIndex guessIndex) const
{
TIndex result;
TIndex n = mpData->Size();
if (guessIndex<0 || guessIndex>=n)
{
return Bisection(value);
}
bool ascending = (*mpData)[n-1] >= (*mpData)[0];
TIndex inc = 1;
TIndex upperLimit;
if ( (value >= (*mpData)[guessIndex]) == ascending)
{
if (guessIndex == n-1)
return -1;//X.A. changed to -1 for consistency
upperLimit = guessIndex+1;
while ( (value >= (*mpData)[upperLimit]) == ascending)
{
guessIndex = upperLimit;
inc += inc;
upperLimit += inc;
if (upperLimit >= n) {
result=Bisection(value,guessIndex);
if(result==n-1) return -1;
else return result;
}
}
} else {
if (guessIndex==0) return -1;
upperLimit = guessIndex--;
while ( (value < (*mpData)[guessIndex]) == ascending)
{
upperLimit = guessIndex;
inc += inc;
if (inc >= upperLimit) {
result = Bisection(value,0,upperLimit);
if(result==0) return -1;
else return result;
}
guessIndex = upperLimit-inc;
}
}
return Bisection(value,guessIndex,upperLimit);
}
template <class U, class T>
inline TIndex Search<U,T>::Bisection(
const T& value,TIndex lowerLimit,TIndex upperLimit) const
{
lowerLimit--;
bool ascending = (*mpData)[mpData->Size()-1] >= (*mpData)[0];
while (upperLimit-lowerLimit > 1)
{
TIndex midPoint = (upperLimit+lowerLimit)>>1;
if ( (value >= (*mpData)[midPoint]) == ascending)
lowerLimit = midPoint;
else
upperLimit = midPoint;
}
return lowerLimit;
}
}
#endif
|