//     This is a part of the SvmFu library, a library for training//     Support Vector Machines.  Copyright (C) 2000 rif and MIT////     Contact: rif@mit.edu//     This program is free software; you can redistribute it and/or//     modify it under the terms of the GNU General Public License as//     published by the Free Software Foundation; either version 2 of//     the License, or (at your option) any later version.//     This program 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 General Public License for more details.//     You should have received a copy of the GNU General Public//     License along with this program; if not, write to the Free//     Software Foundation, Inc., 59 Temple Place, Suite 330, Boston,//     MA 02111-1307 USA#include "SvmFuSvmConstants.h"const char * SVM_VERSION = "3.0";const int SVM_LARGEOPT_MIN_TOTAL_SIZE = 2;const int SVM_LARGEOPT_MIN_TO_ADD = 100;const int SVM_LARGEOPT_DEFAULT_CHUNK_SIZE = 3000;const int SVM_LARGEOPT_DEFAULT_CHECKS_BEFORE_SHRINKING = 10000000;const double SVM_LARGEOPT_DEFAULT_NON_SHRINK_PROPORTION = .1;// We will attempt to keep this many non-USVs in the working set, in// order to avoid "churning" --- the goal is to keep points which are// not currently violating the KKT conditions, but are very close to// doing so.  MIN_TO_ADD takes precedence over this.const int SVM_LARGEOPT_NON_USVS_TO_KEEP = 200;// Number of points to keep checking after we've already found at least// one, before giving up.const int SVM_LARGEOPT_MAX_NONFIND_CHECKS = 200;// This will cause up front allocation of a vector of this many pointers// to doubles.  For every chunk we actually use, we'll need chunkSize// space, which will be a problem WAY before this vector is.const int SVM_LARGEOPT_MAX_CHUNKS = 10000;// How often we "zero and reset" the update helper vector.const int SVM_RESET_UPDATES_HOW_OFTEN = 429000000;