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/>.
41 void set(scalar_t a, scalar_t b);
42 void set(Interval *i);
44 // Set this interval to the k-th of the nb regular subintervals of i
45 void set_subinterval(Interval *i, int k, int nb);
48 void swallow(Interval *i);
50 inline bool contains(scalar_t x) {
51 return x >= min && x < max;
54 inline scalar_t middle() {
55 return (min + max) / 2;
59 ostream &operator << (ostream &out, const Interval &i);