/usr/include/casacore/casa/Utilities/BinarySearch.tcc is in casacore-dev 2.2.0-2.
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 137 138 139 140 141 142 143 | //# BinarySearch.cc: Binary search through linear, sorted, data structures
//# Copyright (C) 1995,1996,2001
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library 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 Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//# $Id$
#ifndef CASA_BINARYSEARCH_TCC
#define CASA_BINARYSEARCH_TCC
#include <casacore/casa/Utilities/BinarySearch.h>
#include <casacore/casa/Exceptions/Error.h>
namespace casacore { //# NAMESPACE CASACORE - BEGIN
//#!!!!! If you change either of the following, make sure you change the other
//#!!!!! similarly.
template<class Container, class ElType>
Int binarySearch(Bool &found, const Container &container,
const ElType &value, uInt n, Int originalLower)
{
found = False;
if (n == 0) {
return 0;
}
Int lower = originalLower;
Int upper = lower + n - 1;
Int middle = 0;
Bool ascending = (! (container(upper) < container(lower)));
Bool toLeft, toRight;
ElType midval;
while (lower <= upper) {
middle = (upper + lower) / 2;
midval = container(middle);
if (ascending) {
toLeft = (value < midval);
} else {
toLeft = (value > midval);
}
if (toLeft) {
upper = middle - 1;
} else {
if (ascending) {
toRight = (value > midval);
} else {
toRight = (value < midval);
}
if (toRight) {
middle++;
lower = middle;
} else {
// exact match, but still we want to get to the beginning of
// sequence
upper = middle - 1;
found = True;
}
}
}
return middle;
}
template<class Container, class ElType>
Int binarySearchBrackets(Bool &found, const Container &container,
const ElType &value, uInt n, Int originalLower)
{
found = False;
if (n == 0) {
return 0;
}
Int lower = originalLower;
Int upper = lower + n - 1;
Int middle = 0;
Bool ascending = (! (container[upper] < container[lower]));
Bool toLeft, toRight;
ElType midval;
while (lower <= upper) {
middle = (upper + lower) / 2;
midval = container[middle];
if (ascending) {
toLeft = (value < midval);
} else {
toLeft = (value > midval);
}
if (toLeft) {
upper = middle - 1;
} else {
if (ascending) {
toRight = (value > midval);
} else {
toRight = (value < midval);
}
if (toRight) {
middle++;
lower = middle;
} else {
// exact match, but still we want to get to the beginning of
// sequence
upper = middle - 1;
found = True;
}
}
}
return middle;
}
} //# NAMESPACE CASACORE - END
#endif
|