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 as published
13 * by the Free Software Foundation, either version 3 of the License,
14 * or (at your option) any later version.
16 * folded-ctf is distributed in the hope that it will be useful, but
17 * WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * General Public License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with folded-ctf. If not, see <http://www.gnu.org/licenses/>.
42 void set(scalar_t a, scalar_t b);
43 void set(Interval *i);
45 // Set this interval to the k-th of the nb regular subintervals of i
46 void set_subinterval(Interval *i, int k, int nb);
49 void swallow(Interval *i);
51 inline bool contains(scalar_t x) {
52 return x >= min && x < max;
55 inline scalar_t middle() {
56 return (min + max) / 2;
60 ostream &operator << (ostream &out, const Interval &i);