1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/deps/glpk/src/glpbfd.h	Sun Nov 06 20:59:10 2011 +0100
     1.3 @@ -0,0 +1,75 @@
     1.4 +/* glpbfd.h (LP basis factorization driver) */
     1.5 +
     1.6 +/***********************************************************************
     1.7 +*  This code is part of GLPK (GNU Linear Programming Kit).
     1.8 +*
     1.9 +*  Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008,
    1.10 +*  2009, 2010, 2011 Andrew Makhorin, Department for Applied Informatics,
    1.11 +*  Moscow Aviation Institute, Moscow, Russia. All rights reserved.
    1.12 +*  E-mail: <mao@gnu.org>.
    1.13 +*
    1.14 +*  GLPK is free software: you can redistribute it and/or modify it
    1.15 +*  under the terms of the GNU General Public License as published by
    1.16 +*  the Free Software Foundation, either version 3 of the License, or
    1.17 +*  (at your option) any later version.
    1.18 +*
    1.19 +*  GLPK is distributed in the hope that it will be useful, but WITHOUT
    1.20 +*  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
    1.21 +*  or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
    1.22 +*  License for more details.
    1.23 +*
    1.24 +*  You should have received a copy of the GNU General Public License
    1.25 +*  along with GLPK. If not, see <http://www.gnu.org/licenses/>.
    1.26 +***********************************************************************/
    1.27 +
    1.28 +#ifndef GLPBFD_H
    1.29 +#define GLPBFD_H
    1.30 +
    1.31 +#ifndef GLPBFD_PRIVATE
    1.32 +typedef struct { double _opaque_bfd[100]; } BFD;
    1.33 +#endif
    1.34 +
    1.35 +/* return codes: */
    1.36 +#define BFD_ESING    1  /* singular matrix */
    1.37 +#define BFD_ECOND    2  /* ill-conditioned matrix */
    1.38 +#define BFD_ECHECK   3  /* insufficient accuracy */
    1.39 +#define BFD_ELIMIT   4  /* update limit reached */
    1.40 +#define BFD_EROOM    5  /* SVA overflow */
    1.41 +
    1.42 +#define bfd_create_it _glp_bfd_create_it
    1.43 +BFD *bfd_create_it(void);
    1.44 +/* create LP basis factorization */
    1.45 +
    1.46 +#define bfd_set_parm _glp_bfd_set_parm
    1.47 +void bfd_set_parm(BFD *bfd, const void *parm);
    1.48 +/* change LP basis factorization control parameters */
    1.49 +
    1.50 +#define bfd_factorize _glp_bfd_factorize
    1.51 +int bfd_factorize(BFD *bfd, int m, const int bh[], int (*col)
    1.52 +      (void *info, int j, int ind[], double val[]), void *info);
    1.53 +/* compute LP basis factorization */
    1.54 +
    1.55 +#define bfd_ftran _glp_bfd_ftran
    1.56 +void bfd_ftran(BFD *bfd, double x[]);
    1.57 +/* perform forward transformation (solve system B*x = b) */
    1.58 +
    1.59 +#define bfd_btran _glp_bfd_btran
    1.60 +void bfd_btran(BFD *bfd, double x[]);
    1.61 +/* perform backward transformation (solve system B'*x = b) */
    1.62 +
    1.63 +#define bfd_update_it _glp_bfd_update_it
    1.64 +int bfd_update_it(BFD *bfd, int j, int bh, int len, const int ind[],
    1.65 +      const double val[]);
    1.66 +/* update LP basis factorization */
    1.67 +
    1.68 +#define bfd_get_count _glp_bfd_get_count
    1.69 +int bfd_get_count(BFD *bfd);
    1.70 +/* determine factorization update count */
    1.71 +
    1.72 +#define bfd_delete_it _glp_bfd_delete_it
    1.73 +void bfd_delete_it(BFD *bfd);
    1.74 +/* delete LP basis factorization */
    1.75 +
    1.76 +#endif
    1.77 +
    1.78 +/* eof */