2 ///////////////////////////////////////////////////////////////////////////
3 // This program is free software: you can redistribute it and/or modify //
4 // it under the terms of the version 3 of the GNU General Public License //
5 // as published by the Free Software Foundation. //
7 // This program is distributed in the hope that it will be useful, but //
8 // WITHOUT ANY WARRANTY; without even the implied warranty of //
9 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU //
10 // General Public License for more details. //
12 // You should have received a copy of the GNU General Public License //
13 // along with this program. If not, see <http://www.gnu.org/licenses/>. //
15 // Written by Francois Fleuret //
16 // (C) Idiap Research Institute //
18 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
19 ///////////////////////////////////////////////////////////////////////////
23 void Interval::set(scalar_t x) {
28 void Interval::set(scalar_t a, scalar_t b) {
33 void Interval::set(Interval *i) {
38 void Interval::set_subinterval(Interval *i, int k, int nb) {
39 min = i->min + ((i->max - i->min) * scalar_t(k))/scalar_t(nb);
40 max = i->min + ((i->max - i->min) * scalar_t(k + 1))/scalar_t(nb);
43 void Interval::swallow(Interval *i) {
44 min = ::min(min, i->min);
45 max = ::max(max, i->max);
48 ostream &operator << (ostream &out, const Interval &i) {
49 return out << "[" << i.min << ", " << i.max << "]";