2 * folded-ctf is an implementation of the folded hierarchy of
3 * classifiers for object detection, developed by Francois Fleuret
6 * Copyright (c) 2008 Idiap Research Institute, http://www.idiap.ch/
7 * Written by Francois Fleuret <francois.fleuret@idiap.ch>
9 * This file is part of folded-ctf.
11 * folded-ctf is free software: you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License version 3 as
13 * published by the Free Software Foundation.
15 * folded-ctf is distributed in the hope that it will be useful, but
16 * WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with folded-ctf. If not, see <http://www.gnu.org/licenses/>.
27 void Interval::set(scalar_t x) {
32 void Interval::set(scalar_t a, scalar_t b) {
37 void Interval::set(Interval *i) {
42 void Interval::set_subinterval(Interval *i, int k, int nb) {
43 min = i->min + ((i->max - i->min) * scalar_t(k))/scalar_t(nb);
44 max = i->min + ((i->max - i->min) * scalar_t(k + 1))/scalar_t(nb);
47 void Interval::swallow(Interval *i) {
48 min = ::min(min, i->min);
49 max = ::max(max, i->max);
52 ostream &operator << (ostream &out, const Interval &i) {
53 return out << "[" << i.min << ", " << i.max << "]";