|
- << Symphony Toolbox
+ << lsqlin
|
diff --git a/help/en_US/scilab_en_US_help/section_19f4f1e5726c01d683e8b82be0a7e910.html b/help/en_US/scilab_en_US_help/section_19f4f1e5726c01d683e8b82be0a7e910.html
index 52d6d9e..14e8136 100644
--- a/help/en_US/scilab_en_US_help/section_19f4f1e5726c01d683e8b82be0a7e910.html
+++ b/help/en_US/scilab_en_US_help/section_19f4f1e5726c01d683e8b82be0a7e910.html
@@ -31,7 +31,13 @@
Symphony Toolbox
-- qpipopt — Solves a linear quadratic problem.
+- lsqlin — Solves a linear quadratic problem.
+
+
+
+
+
+- qpipopt — Solves a linear quadratic problem.
diff --git a/jar/scilab_en_US_help.jar b/jar/scilab_en_US_help.jar
index 79b480b..1487f17 100644
Binary files a/jar/scilab_en_US_help.jar and b/jar/scilab_en_US_help.jar differ
diff --git a/macros/lib b/macros/lib
index 33343bd..b846940 100644
Binary files a/macros/lib and b/macros/lib differ
diff --git a/macros/lsqlin.bin b/macros/lsqlin.bin
new file mode 100644
index 0000000..ec9e6ef
Binary files /dev/null and b/macros/lsqlin.bin differ
diff --git a/macros/lsqlin.sci b/macros/lsqlin.sci
new file mode 100644
index 0000000..003edc5
--- /dev/null
+++ b/macros/lsqlin.sci
@@ -0,0 +1,372 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+
+function [xopt,resnorm,residual,exitflag,output,lambda] = lsqlin (varargin)
+ // Solves a linear quadratic problem.
+ //
+ // Calling Sequence
+ // x = lsqlin(C,d,A,b)
+ // x = lsqlin(C,d,A,b,Aeq,beq)
+ // x = lsqlin(C,d,A,b,Aeq,beq,lb,ub)
+ // x = lsqlin(C,d,A,b,Aeq,beq,lb,ub,x0)
+ // x = lsqlin(C,d,A,b,Aeq,beq,lb,ub,x0,param)
+ // [xopt,resnorm,residual,exitflag,output,lambda] = lsqlin( ... )
+ //
+ // Parameters
+ // C : a matrix of doubles, represents the multiplier of the solution x in the expression C*x - d. C is M-by-N, where M is the number of equations, and N is the number of elements of x.
+ // d : a vector of doubles, represents the additive constant term in the expression C*x - d. d is M-by-1, where M is the number of equations.
+ // A : a vector of doubles, represents the linear coefficients in the inequality constraints
+ // b : a vector of doubles, represents the linear coefficients in the inequality constraints
+ // Aeq : a matrix of doubles, represents the linear coefficients in the equality constraints
+ // beq : a vector of doubles, represents the linear coefficients in the equality constraints
+ // LB : a vector of doubles, where n is number of variables, contains lower bounds of the variables.
+ // UB : a vector of doubles, where n is number of variables, contains upper bounds of the variables.
+ // x0 : a vector of doubles, contains initial guess of variables.
+ // param : a list containing the the parameters to be set.
+ // xopt : a vector of doubles, the computed solution of the optimization problem.
+ // fopt : a double, the function value at x.
+ // exitflag : Integer identifying the reason the algorithm terminated.
+ // output : Structure containing information about the optimization.
+ // lambda : Structure containing the Lagrange multipliers at the solution x (separated by constraint type).
+ //
+ // Description
+ // Search the minimum of a constrained linear least square problem specified by :
+ // find the minimum of f(x) such that
+ //
+ //
+ // \begin{eqnarray}
+ // &\mbox{min}_{x}
+ // & 1/2||C*x - d||_2^2 \\
+ // & \text{subject to} & A.x \leq b \\
+ // & & Aeq.x \leq beq \\
+ // & & lb \leq x \leq ub \\
+ // \end{eqnarray}
+ //
+ //
+ // We are calling IPOpt for solving the linear least square problem, IPOpt is a library written in C++. The code has been written by Andreas Wächter and Carl Laird.
+ //
+ // Examples
+ // //A simple linear least square example
+ // C = [0.9501 0.7620 0.6153 0.4057
+ // 0.2311 0.4564 0.7919 0.9354
+ // 0.6068 0.0185 0.9218 0.9169
+ // 0.4859 0.8214 0.7382 0.4102
+ // 0.8912 0.4447 0.1762 0.8936];
+ // d = [0.0578
+ // 0.3528
+ // 0.8131
+ // 0.0098
+ // 0.1388];
+ // A = [0.2027 0.2721 0.7467 0.4659
+ // 0.1987 0.1988 0.4450 0.4186
+ // 0.6037 0.0152 0.9318 0.8462];
+ // b = [0.5251
+ // 0.2026
+ // 0.6721];
+ // [xopt,resnorm,residual,exitflag,output,lambda] = lsqlin(C,d,A,b)
+ //
+ // Examples
+ // C = [0.9501 0.7620 0.6153 0.4057
+ // 0.2311 0.4564 0.7919 0.9354
+ // 0.6068 0.0185 0.9218 0.9169
+ // 0.4859 0.8214 0.7382 0.4102
+ // 0.8912 0.4447 0.1762 0.8936];
+ // d = [0.0578
+ // 0.3528
+ // 0.8131
+ // 0.0098
+ // 0.1388];
+ // A =[0.2027 0.2721 0.7467 0.4659
+ // 0.1987 0.1988 0.4450 0.4186
+ // 0.6037 0.0152 0.9318 0.8462];
+ // b =[0.5251
+ // 0.2026
+ // 0.6721];
+ // Aeq = [3 5 7 9];
+ // beq = 4;
+ // lb = -0.1*ones(4,1);
+ // ub = 2*ones(4,1);
+ // [xopt,resnorm,residual,exitflag,output,lambda] = lsqlin(C,d,A,b,Aeq,beq,lb,ub)
+ //
+ // Authors
+ // Harpreet Singh
+
+
+ //To check the number of input and output argument
+ [lhs , rhs] = argn();
+
+ //To check the number of argument given by user
+ if ( rhs < 4 | rhs == 5 | rhs == 7 | rhs > 10 ) then
+ errmsg = msprintf(gettext("%s: Unexpected number of input arguments : %d provided while should be in the set of [4 6 8 9 10]"), "lsqlin", rhs);
+ error(errmsg)
+ end
+
+ C = varargin(1);
+ d = varargin(2);
+ A = varargin(3);
+ b = varargin(4);
+ nbVar = size(C,2);
+
+ if ( rhs<5 ) then
+ Aeq = []
+ beq = []
+ else
+ Aeq = varargin(5);
+ beq = varargin(6);
+ end
+
+ if ( rhs<7 ) then
+ LB = repmat(-%inf,nbVar,1);
+ UB = repmat(%inf,nbVar,1);
+ else
+ LB = varargin(7);
+ UB = varargin(8);
+ end
+
+
+ if ( rhs<9 | size(varargin(9)) ==0 ) then
+ x0 = repmat(0,nbVar,1)
+ else
+ x0 = varargin(9);
+ end
+
+ if ( rhs<10 | size(varargin(10)) ==0 ) then
+ param = list();
+ else
+ param =varargin(10);
+ end
+
+ if (size(LB,2)==0) then
+ LB = repmat(-%inf,nbVar,1);
+ end
+
+ if (size(UB,2)==0) then
+ UB = repmat(%inf,nbVar,1);
+ end
+
+ if (type(param) ~= 15) then
+ errmsg = msprintf(gettext("%s: param should be a list "), "lsqlin");
+ error(errmsg);
+ end
+
+
+ if (modulo(size(param),2)) then
+ errmsg = msprintf(gettext("%s: Size of parameters should be even"), "lsqlin");
+ error(errmsg);
+ end
+
+ options = list( "MaxIter" , [3000], ...
+ "CpuTime" , [600] ...
+ );
+
+ for i = 1:(size(param))/2
+
+ select param(2*i-1)
+ case "MaxIter" then
+ options(2*i) = param(2*i);
+ case "CpuTime" then
+ options(2*i) = param(2*i);
+ else
+ errmsg = msprintf(gettext("%s: Unrecognized parameter name ''%s''."), "lsqlin", param(2*i-1));
+ error(errmsg)
+ end
+ end
+
+ nbConInEq = size(A,1);
+ nbConEq = size(Aeq,1);
+
+ // Check if the user gives row vector
+ // and Changing it to a column matrix
+
+
+ if (size(d,2)== [nbVar]) then
+ d=d';
+ end
+
+ if (size(LB,2)== [nbVar]) then
+ LB = LB';
+ end
+
+ if (size(UB,2)== [nbVar]) then
+ UB = UB';
+ end
+
+ if (size(b,2)==nbConInEq) then
+ b = b';
+ end
+
+ if (size(beq,2)== nbConEq) then
+ beq = beq';
+ end
+
+ if (size(x0,2)== [nbVar]) then
+ x0=x0';
+ end
+
+ //Check the size of f which should equal to the number of variable
+ if ( size(d,1) ~= size(C,1)) then
+ errmsg = msprintf(gettext("%s: The number of rows in C must be equal the number of elements of d"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of inequality constraint which should be equal to the number of variables
+ if ( size(A,2) ~= nbVar & size(A,2) ~= 0) then
+ errmsg = msprintf(gettext("%s: The number of columns in A must be the same as the number of elements of d"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of equality constraint which should be equal to the number of variables
+ if ( size(Aeq,2) ~= nbVar & size(Aeq,2) ~= 0 ) then
+ errmsg = msprintf(gettext("%s: The number of columns in Aeq must be the same as the number of elements of d"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of Lower Bound which should be equal to the number of variables
+ if ( size(LB,1) ~= nbVar) then
+ errmsg = msprintf(gettext("%s: The Lower Bound is not equal to the number of variables"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of Upper Bound which should equal to the number of variables
+ if ( size(UB,1) ~= nbVar) then
+ errmsg = msprintf(gettext("%s: The Upper Bound is not equal to the number of variables"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of constraints of Lower Bound which should equal to the number of constraints
+ if ( size(b,1) ~= nbConInEq & size(b,1) ~= 0) then
+ errmsg = msprintf(gettext("%s: The number of rows in A must be the same as the number of elementsof b"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of constraints of Upper Bound which should equal to the number of constraints
+ if ( size(beq,1) ~= nbConEq & size(beq,1) ~= 0) then
+ errmsg = msprintf(gettext("%s: The number of rows in Aeq must be the same as the number of elements of beq"), "lsqlin");
+ error(errmsg);
+ end
+
+ //Check the size of initial of variables which should equal to the number of variables
+ if ( size(x0,1) ~= nbVar) then
+ warnmsg = msprintf(gettext("%s: Ignoring initial guess of variables as it is not equal to the number of variables"), "lsqlin");
+ warning(warnmsg);
+ end
+
+ //Check if the user gives a matrix instead of a vector
+
+ if ((size(d,1)~=1)& (size(d,2)~=1)) then
+ errmsg = msprintf(gettext("%s: d should be a vector"), "lsqlin");
+ error(errmsg);
+ end
+
+ if (size(LB,1)~=1)& (size(LB,2)~=1) then
+ errmsg = msprintf(gettext("%s: Lower Bound should be a vector"), "lsqlin");
+ error(errmsg);
+ end
+
+ if (size(UB,1)~=1)& (size(UB,2)~=1) then
+ errmsg = msprintf(gettext("%s: Upper Bound should be a vector"), "lsqlin");
+ error(errmsg);
+ end
+
+ if (nbConInEq) then
+ if ((size(b,1)~=1)& (size(b,2)~=1)) then
+ errmsg = msprintf(gettext("%s: Constraint Lower Bound should be a vector"), "lsqlin");
+ error(errmsg);
+ end
+ end
+
+ if (nbConEq) then
+ if (size(beq,1)~=1)& (size(beq,2)~=1) then
+ errmsg = msprintf(gettext("%s: Constraint should be a vector"), "lsqlin");
+ error(errmsg);
+ end
+ end
+
+ for i = 1:nbConInEq
+ if (b(i) == -%inf)
+ errmsg = msprintf(gettext("%s: Value of b can not be negative infinity"), "qpipoptmat");
+ error(errmsg);
+ end
+ end
+
+ for i = 1:nbConEq
+ if (beq(i) == -%inf)
+ errmsg = msprintf(gettext("%s: Value of beq can not be negative infinity"), "qpipoptmat");
+ error(errmsg);
+ end
+ end
+
+ //Converting it into Quadratic Programming Problem
+
+ Q = C'*C;
+ p = [-C'*d]';
+ op_add = d'*d;
+ LB = LB';
+ UB = UB';
+ x0 = x0';
+ conMatrix = [Aeq;A];
+ nbCon = size(conMatrix,1);
+ conLB = [beq; repmat(-%inf,nbConInEq,1)]';
+ conUB = [beq;b]' ;
+ [xopt,fopt,status,iter,Zl,Zu,lmbda] = solveqp(nbVar,nbCon,Q,p,conMatrix,conLB,conUB,LB,UB,x0,options);
+
+ xopt = xopt';
+ residual = C*xopt-d;
+ resnorm = residual'*residual;
+ exitflag = status;
+ output = struct("Iterations" , []);
+ output.Iterations = iter;
+ lambda = struct("lower" , [], ..
+ "upper" , [], ..
+ "constraint" , []);
+
+ lambda.lower = Zl;
+ lambda.upper = Zu;
+ lambda.constraint = lmbda;
+
+ select status
+ case 0 then
+ printf("\nOptimal Solution Found.\n");
+ case 1 then
+ printf("\nMaximum Number of Iterations Exceeded. Output may not be optimal.\n");
+ case 2 then
+ printf("\nMaximum CPU Time exceeded. Output may not be optimal.\n");
+ case 3 then
+ printf("\nStop at Tiny Step\n");
+ case 4 then
+ printf("\nSolved To Acceptable Level\n");
+ case 5 then
+ printf("\nConverged to a point of local infeasibility.\n");
+ case 6 then
+ printf("\nStopping optimization at current point as requested by user.\n");
+ case 7 then
+ printf("\nFeasible point for square problem found.\n");
+ case 8 then
+ printf("\nIterates diverging; problem might be unbounded.\n");
+ case 9 then
+ printf("\nRestoration Failed!\n");
+ case 10 then
+ printf("\nError in step computation (regularization becomes too large?)!\n");
+ case 12 then
+ printf("\nProblem has too few degrees of freedom.\n");
+ case 13 then
+ printf("\nInvalid option thrown back by IPOpt\n");
+ case 14 then
+ printf("\nNot enough memory.\n");
+ case 15 then
+ printf("\nINTERNAL ERROR: Unknown SolverReturn value - Notify IPOPT Authors.\n");
+ else
+ printf("\nInvalid status returned. Notify the Toolbox authors\n");
+ break;
+ end
+
+endfunction
diff --git a/macros/names b/macros/names
index 4f0ba56..18923c4 100644
--- a/macros/names
+++ b/macros/names
@@ -1,3 +1,4 @@
+lsqlin
qpipopt
qpipoptmat
setOptions
diff --git a/macros/qpipopt.bin b/macros/qpipopt.bin
index 0c65c0b..e13d5a9 100644
Binary files a/macros/qpipopt.bin and b/macros/qpipopt.bin differ
diff --git a/macros/qpipopt.sci b/macros/qpipopt.sci
index e25aad9..ccf10e4 100644
--- a/macros/qpipopt.sci
+++ b/macros/qpipopt.sci
@@ -298,13 +298,13 @@ function [xopt,fopt,exitflag,output,lambda] = qpipopt (varargin)
for i = 1:nbCon
if (conLB(i) == %inf)
errmsg = msprintf(gettext("%s: Value of Lower Bound can not be infinity"), "qpipopt");
- error(errmsg);
- end
+ error(errmsg);
+ end
if (conUB(i) == -%inf)
errmsg = msprintf(gettext("%s: Value of Upper Bound can not be negative infinity"), "qpipopt");
- error(errmsg);
- end
+ error(errmsg);
+ end
end
[xopt,fopt,status,iter,Zl,Zu,lmbda] = solveqp(nbVar,nbCon,Q,p,conMatrix,conLB,conUB,LB,UB,x0,options);
diff --git a/macros/qpipoptmat.bin b/macros/qpipoptmat.bin
index 6ca5589..07c9386 100644
Binary files a/macros/qpipoptmat.bin and b/macros/qpipoptmat.bin differ
diff --git a/macros/qpipoptmat.sci b/macros/qpipoptmat.sci
index 0adc0bd..9f20870 100644
--- a/macros/qpipoptmat.sci
+++ b/macros/qpipoptmat.sci
@@ -23,8 +23,8 @@ function [xopt,fopt,exitflag,output,lambda] = qpipoptmat (varargin)
// [xopt,fopt,exitflag,output,lamda] = qpipoptmat( ... )
//
// Parameters
- // H : a vector of doubles, where n is number of variables, represents coefficients of quadratic in the quadratic problem.
- // f : a vector of doubles, where n is number of variables, represents coefficients of linear in the quadratic problem
+ // H : a symmetric matrix of doubles, represents coefficients of quadratic in the quadratic problem.
+ // f : a vector of doubles, represents coefficients of linear in the quadratic problem
// A : a vector of doubles, represents the linear coefficients in the inequality constraints
// b : a vector of doubles, represents the linear coefficients in the inequality constraints
// Aeq : a matrix of doubles, represents the linear coefficients in the equality constraints
diff --git a/sci_gateway/cpp/libFAMOS.so b/sci_gateway/cpp/libFAMOS.so
index ec45532..f973a5b 100755
Binary files a/sci_gateway/cpp/libFAMOS.so and b/sci_gateway/cpp/libFAMOS.so differ
diff --git a/tests/unit_tests/lsqlin.dia.ref b/tests/unit_tests/lsqlin.dia.ref
new file mode 100644
index 0000000..a2b9630
--- /dev/null
+++ b/tests/unit_tests/lsqlin.dia.ref
@@ -0,0 +1,82 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+//
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+// <-- JVM NOT MANDATORY -->
+// <-- ENGLISH IMPOSED -->
+
+
+//
+// assert_close --
+// Returns 1 if the two real matrices computed and expected are close,
+// i.e. if the relative distance between computed and expected is lesser than epsilon.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+function flag = assert_close ( computed, expected, epsilon )
+ if expected==0.0 then
+ shift = norm(computed-expected);
+ else
+ shift = norm(computed-expected)/norm(expected);
+ end
+// if shift < epsilon then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+ flag = assert_checktrue ( shift < epsilon );
+endfunction
+//
+// assert_equal --
+// Returns 1 if the two real matrices computed and expected are equal.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+//function flag = assert_equal ( computed , expected )
+// if computed==expected then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+//endfunction
+
+ //A simple linear least square example
+C = [0.9501 0.7620 0.6153 0.4057
+ 0.2311 0.4564 0.7919 0.9354
+ 0.6068 0.0185 0.9218 0.9169
+ 0.4859 0.8214 0.7382 0.4102
+ 0.8912 0.4447 0.1762 0.8936];
+ d = [0.0578
+ 0.3528
+ 0.8131
+ 0.0098
+ 0.1388];
+ A =[0.2027 0.2721 0.7467 0.4659
+ 0.1987 0.1988 0.4450 0.4186
+ 0.6037 0.0152 0.9318 0.8462];
+ b =[0.5251
+ 0.2026
+ 0.6721];
+ Aeq = [3 5 7 9];
+ beq = 4;
+ lb = -0.1*ones(4,1);
+ ub = 2*ones(4,1);
+ [xopt,resnorm,residual,exitflag,output,lambda] = lsqlin(C,d,A,b,Aeq,beq,lb,ub)
+
+assert_close ( xopt , [ -0.1, -0.1, 0.1599089, 0.4089598 ]' , 0.0005 );
+assert_close ( residual , [ 0.0352969 0.0876228 -0.3532508 0.1452700 0.1212324 ]' , 0.0005 );
+assert_close ( resnorm , [ 0.1695104] , 0.0005 );
+
+assert_checkequal( exitflag , int32(0) );
diff --git a/tests/unit_tests/lsqlin.tst b/tests/unit_tests/lsqlin.tst
new file mode 100644
index 0000000..a2b9630
--- /dev/null
+++ b/tests/unit_tests/lsqlin.tst
@@ -0,0 +1,82 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+//
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+// <-- JVM NOT MANDATORY -->
+// <-- ENGLISH IMPOSED -->
+
+
+//
+// assert_close --
+// Returns 1 if the two real matrices computed and expected are close,
+// i.e. if the relative distance between computed and expected is lesser than epsilon.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+function flag = assert_close ( computed, expected, epsilon )
+ if expected==0.0 then
+ shift = norm(computed-expected);
+ else
+ shift = norm(computed-expected)/norm(expected);
+ end
+// if shift < epsilon then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+ flag = assert_checktrue ( shift < epsilon );
+endfunction
+//
+// assert_equal --
+// Returns 1 if the two real matrices computed and expected are equal.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+//function flag = assert_equal ( computed , expected )
+// if computed==expected then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+//endfunction
+
+ //A simple linear least square example
+C = [0.9501 0.7620 0.6153 0.4057
+ 0.2311 0.4564 0.7919 0.9354
+ 0.6068 0.0185 0.9218 0.9169
+ 0.4859 0.8214 0.7382 0.4102
+ 0.8912 0.4447 0.1762 0.8936];
+ d = [0.0578
+ 0.3528
+ 0.8131
+ 0.0098
+ 0.1388];
+ A =[0.2027 0.2721 0.7467 0.4659
+ 0.1987 0.1988 0.4450 0.4186
+ 0.6037 0.0152 0.9318 0.8462];
+ b =[0.5251
+ 0.2026
+ 0.6721];
+ Aeq = [3 5 7 9];
+ beq = 4;
+ lb = -0.1*ones(4,1);
+ ub = 2*ones(4,1);
+ [xopt,resnorm,residual,exitflag,output,lambda] = lsqlin(C,d,A,b,Aeq,beq,lb,ub)
+
+assert_close ( xopt , [ -0.1, -0.1, 0.1599089, 0.4089598 ]' , 0.0005 );
+assert_close ( residual , [ 0.0352969 0.0876228 -0.3532508 0.1452700 0.1212324 ]' , 0.0005 );
+assert_close ( resnorm , [ 0.1695104] , 0.0005 );
+
+assert_checkequal( exitflag , int32(0) );
diff --git a/tests/unit_tests/qpipopt_base.dia.ref b/tests/unit_tests/qpipopt_base.dia.ref
index ffe546a..5587ddc 100644
--- a/tests/unit_tests/qpipopt_base.dia.ref
+++ b/tests/unit_tests/qpipopt_base.dia.ref
@@ -70,7 +70,7 @@ nbVar = 2;
nbCon = 3;
[xopt,fopt,exitflag,output,lambda] = qpipopt(nbVar,nbCon,Q,p,lb,ub,conMatrix,conLB,conUB)
-assert_close ( x , [0.6666667 1.3333333]' , 1.e-7 );
-assert_close ( f , [ - 8.2222223] , 1.e-7 );
+assert_close ( xopt , [0.6666667 1.3333333]' , 1.e-7 );
+assert_close ( fopt , [ - 8.2222223] , 1.e-7 );
-assert_checkequal( exitflag , 0 );
+assert_checkequal( exitflag , int32(0) );
diff --git a/tests/unit_tests/qpipopt_base.tst b/tests/unit_tests/qpipopt_base.tst
index ffe546a..5587ddc 100644
--- a/tests/unit_tests/qpipopt_base.tst
+++ b/tests/unit_tests/qpipopt_base.tst
@@ -70,7 +70,7 @@ nbVar = 2;
nbCon = 3;
[xopt,fopt,exitflag,output,lambda] = qpipopt(nbVar,nbCon,Q,p,lb,ub,conMatrix,conLB,conUB)
-assert_close ( x , [0.6666667 1.3333333]' , 1.e-7 );
-assert_close ( f , [ - 8.2222223] , 1.e-7 );
+assert_close ( xopt , [0.6666667 1.3333333]' , 1.e-7 );
+assert_close ( fopt , [ - 8.2222223] , 1.e-7 );
-assert_checkequal( exitflag , 0 );
+assert_checkequal( exitflag , int32(0) );
diff --git a/tests/unit_tests/qpipoptmat_base .dia.ref b/tests/unit_tests/qpipoptmat_base .dia.ref
deleted file mode 100644
index aacbc4e..0000000
--- a/tests/unit_tests/qpipoptmat_base .dia.ref
+++ /dev/null
@@ -1,73 +0,0 @@
-// Copyright (C) 2015 - IIT Bombay - FOSSEE
-//
-// Author: Harpreet Singh
-// Organization: FOSSEE, IIT Bombay
-// Email: harpreet.mertia@gmail.com
-//
-// This file must be used under the terms of the CeCILL.
-// This source file is licensed as described in the file COPYING, which
-// you should have received as part of this distribution. The terms
-// are also available at
-// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
-
-// <-- JVM NOT MANDATORY -->
-// <-- ENGLISH IMPOSED -->
-
-
-//
-// assert_close --
-// Returns 1 if the two real matrices computed and expected are close,
-// i.e. if the relative distance between computed and expected is lesser than epsilon.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-function flag = assert_close ( computed, expected, epsilon )
- if expected==0.0 then
- shift = norm(computed-expected);
- else
- shift = norm(computed-expected)/norm(expected);
- end
-// if shift < epsilon then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
- flag = assert_checktrue ( shift < epsilon );
-endfunction
-//
-// assert_equal --
-// Returns 1 if the two real matrices computed and expected are equal.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-//function flag = assert_equal ( computed , expected )
-// if computed==expected then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
-//endfunction
-
-//Find the value of x that minimize following function
-// f(x) = 0.5*x1^2 + x2^2 - x1*x2 - 2*x1 - 6*x2
-// Subject to:
-// x1 + x2 ≤ 2
-// –x1 + 2x2 ≤ 2
-// 2x1 + x2 ≤ 3
-// 0 ≤ x1, 0 ≤ x2.
-H = [1 -1; -1 2];
-f = [-2; -6];
-A = [1 1; -1 2; 2 1];
-b = [2; 2; 3];
-lb = [0; 0];
-ub = [%inf; %inf];
-[xopt,fopt,exitflag,output,lambda] = qpipoptmat(H,f,A,b,[],[],lb,ub)
-
-assert_close ( x , [0.6666667 1.3333333]' , 1.e-7 );
-assert_close ( f , [ - 8.2222223] , 1.e-7 );
-
-assert_checkequal( exitflag , 0 );
diff --git a/tests/unit_tests/qpipoptmat_base .tst b/tests/unit_tests/qpipoptmat_base .tst
deleted file mode 100644
index aacbc4e..0000000
--- a/tests/unit_tests/qpipoptmat_base .tst
+++ /dev/null
@@ -1,73 +0,0 @@
-// Copyright (C) 2015 - IIT Bombay - FOSSEE
-//
-// Author: Harpreet Singh
-// Organization: FOSSEE, IIT Bombay
-// Email: harpreet.mertia@gmail.com
-//
-// This file must be used under the terms of the CeCILL.
-// This source file is licensed as described in the file COPYING, which
-// you should have received as part of this distribution. The terms
-// are also available at
-// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
-
-// <-- JVM NOT MANDATORY -->
-// <-- ENGLISH IMPOSED -->
-
-
-//
-// assert_close --
-// Returns 1 if the two real matrices computed and expected are close,
-// i.e. if the relative distance between computed and expected is lesser than epsilon.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-function flag = assert_close ( computed, expected, epsilon )
- if expected==0.0 then
- shift = norm(computed-expected);
- else
- shift = norm(computed-expected)/norm(expected);
- end
-// if shift < epsilon then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
- flag = assert_checktrue ( shift < epsilon );
-endfunction
-//
-// assert_equal --
-// Returns 1 if the two real matrices computed and expected are equal.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-//function flag = assert_equal ( computed , expected )
-// if computed==expected then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
-//endfunction
-
-//Find the value of x that minimize following function
-// f(x) = 0.5*x1^2 + x2^2 - x1*x2 - 2*x1 - 6*x2
-// Subject to:
-// x1 + x2 ≤ 2
-// –x1 + 2x2 ≤ 2
-// 2x1 + x2 ≤ 3
-// 0 ≤ x1, 0 ≤ x2.
-H = [1 -1; -1 2];
-f = [-2; -6];
-A = [1 1; -1 2; 2 1];
-b = [2; 2; 3];
-lb = [0; 0];
-ub = [%inf; %inf];
-[xopt,fopt,exitflag,output,lambda] = qpipoptmat(H,f,A,b,[],[],lb,ub)
-
-assert_close ( x , [0.6666667 1.3333333]' , 1.e-7 );
-assert_close ( f , [ - 8.2222223] , 1.e-7 );
-
-assert_checkequal( exitflag , 0 );
diff --git a/tests/unit_tests/qpipoptmat_base.dia.ref b/tests/unit_tests/qpipoptmat_base.dia.ref
new file mode 100644
index 0000000..a03fc4e
--- /dev/null
+++ b/tests/unit_tests/qpipoptmat_base.dia.ref
@@ -0,0 +1,73 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+//
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+// <-- JVM NOT MANDATORY -->
+// <-- ENGLISH IMPOSED -->
+
+
+//
+// assert_close --
+// Returns 1 if the two real matrices computed and expected are close,
+// i.e. if the relative distance between computed and expected is lesser than epsilon.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+function flag = assert_close ( computed, expected, epsilon )
+ if expected==0.0 then
+ shift = norm(computed-expected);
+ else
+ shift = norm(computed-expected)/norm(expected);
+ end
+// if shift < epsilon then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+ flag = assert_checktrue ( shift < epsilon );
+endfunction
+//
+// assert_equal --
+// Returns 1 if the two real matrices computed and expected are equal.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+//function flag = assert_equal ( computed , expected )
+// if computed==expected then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+//endfunction
+
+//Find the value of x that minimize following function
+// f(x) = 0.5*x1^2 + x2^2 - x1*x2 - 2*x1 - 6*x2
+// Subject to:
+// x1 + x2 ≤ 2
+// –x1 + 2x2 ≤ 2
+// 2x1 + x2 ≤ 3
+// 0 ≤ x1, 0 ≤ x2.
+H = [1 -1; -1 2];
+f = [-2; -6];
+A = [1 1; -1 2; 2 1];
+b = [2; 2; 3];
+lb = [0; 0];
+ub = [%inf; %inf];
+[xopt,fopt,exitflag,output,lambda] = qpipoptmat(H,f,A,b,[],[],lb,ub)
+
+assert_close ( xopt , [0.6666667 1.3333333]' , 1.e-7 );
+assert_close ( fopt , [ - 8.2222223] , 1.e-7 );
+
+assert_checkequal( exitflag , int32(0) );
diff --git a/tests/unit_tests/qpipoptmat_base.tst b/tests/unit_tests/qpipoptmat_base.tst
new file mode 100644
index 0000000..a03fc4e
--- /dev/null
+++ b/tests/unit_tests/qpipoptmat_base.tst
@@ -0,0 +1,73 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+//
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+// <-- JVM NOT MANDATORY -->
+// <-- ENGLISH IMPOSED -->
+
+
+//
+// assert_close --
+// Returns 1 if the two real matrices computed and expected are close,
+// i.e. if the relative distance between computed and expected is lesser than epsilon.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+function flag = assert_close ( computed, expected, epsilon )
+ if expected==0.0 then
+ shift = norm(computed-expected);
+ else
+ shift = norm(computed-expected)/norm(expected);
+ end
+// if shift < epsilon then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+ flag = assert_checktrue ( shift < epsilon );
+endfunction
+//
+// assert_equal --
+// Returns 1 if the two real matrices computed and expected are equal.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+//function flag = assert_equal ( computed , expected )
+// if computed==expected then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+//endfunction
+
+//Find the value of x that minimize following function
+// f(x) = 0.5*x1^2 + x2^2 - x1*x2 - 2*x1 - 6*x2
+// Subject to:
+// x1 + x2 ≤ 2
+// –x1 + 2x2 ≤ 2
+// 2x1 + x2 ≤ 3
+// 0 ≤ x1, 0 ≤ x2.
+H = [1 -1; -1 2];
+f = [-2; -6];
+A = [1 1; -1 2; 2 1];
+b = [2; 2; 3];
+lb = [0; 0];
+ub = [%inf; %inf];
+[xopt,fopt,exitflag,output,lambda] = qpipoptmat(H,f,A,b,[],[],lb,ub)
+
+assert_close ( xopt , [0.6666667 1.3333333]' , 1.e-7 );
+assert_close ( fopt , [ - 8.2222223] , 1.e-7 );
+
+assert_checkequal( exitflag , int32(0) );
diff --git a/tests/unit_tests/symphony_mat_base.dia.ref b/tests/unit_tests/symphony_mat_base.dia.ref
deleted file mode 100644
index 3bf286d..0000000
--- a/tests/unit_tests/symphony_mat_base.dia.ref
+++ /dev/null
@@ -1,83 +0,0 @@
-// Copyright (C) 2015 - IIT Bombay - FOSSEE
-//
-// Author: Keyur Joshi and Harpreet Singh
-// Organization: FOSSEE, IIT Bombay
-// Email: harpreet.mertia@gmail.com
-//
-// This file must be used under the terms of the CeCILL.
-// This source file is licensed as described in the file COPYING, which
-// you should have received as part of this distribution. The terms
-// are also available at
-// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
-
-// <-- JVM NOT MANDATORY -->
-// <-- ENGLISH IMPOSED -->
-
-
-//
-// assert_close --
-// Returns 1 if the two real matrices computed and expected are close,
-// i.e. if the relative distance between computed and expected is lesser than epsilon.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-function flag = assert_close ( computed, expected, epsilon )
- if expected==0.0 then
- shift = norm(computed-expected);
- else
- shift = norm(computed-expected)/norm(expected);
- end
-// if shift < epsilon then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
- flag = assert_checktrue ( shift < epsilon );
-endfunction
-//
-// assert_equal --
-// Returns 1 if the two real matrices computed and expected are equal.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-//function flag = assert_equal ( computed , expected )
-// if computed==expected then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
-//endfunction
-
-// Objective function
-c = [350*5,330*3,310*4,280*6,500,450,400,100]
-
-// Lower Bound of variable
-lb = repmat(0,1,8);
-
-// Upper Bound of variables
-ub = [repmat(1,1,4) repmat(%inf,1,4)];
-
-// Constraint Matrix
-Aeq = [5,3,4,6,1,1,1,1;
- 5*0.05,3*0.04,4*0.05,6*0.03,0.08,0.07,0.06,0.03;
- 5*0.03,3*0.03,4*0.04,6*0.04,0.06,0.07,0.08,0.09;]
-
-
-beq = [ 25, 1.25, 1.25]
-
-intcon = [1 2 3 4];
-
-// Calling Symphony
-[x,f,iter] = symphony_mat(c,intcon,[],[],Aeq,beq,lb,ub);
-
-//In Symphony Library for optimal solution status = 227
-status = sym_getStatus();
-
-assert_close ( x , [1 1 0 1 7.25 0 0.25 3.5] , 1.e-7 );
-assert_close ( f , [ 8495] , 1.e-7 );
-
-assert_checkequal( status , 227 );
diff --git a/tests/unit_tests/symphony_mat_base.tst b/tests/unit_tests/symphony_mat_base.tst
deleted file mode 100644
index 629039b..0000000
--- a/tests/unit_tests/symphony_mat_base.tst
+++ /dev/null
@@ -1,80 +0,0 @@
-// Copyright (C) 2015 - IIT Bombay - FOSSEE
-//
-// Author: Keyur Joshi and Harpreet Singh
-// Organization: FOSSEE, IIT Bombay
-// Email: harpreet.mertia@gmail.com
-//
-// This file must be used under the terms of the CeCILL.
-// This source file is licensed as described in the file COPYING, which
-// you should have received as part of this distribution. The terms
-// are also available at
-// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
-
-// <-- JVM NOT MANDATORY -->
-// <-- ENGLISH IMPOSED -->
-
-
-//
-// assert_close --
-// Returns 1 if the two real matrices computed and expected are close,
-// i.e. if the relative distance between computed and expected is lesser than epsilon.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-function flag = assert_close ( computed, expected, epsilon )
- if expected==0.0 then
- shift = norm(computed-expected);
- else
- shift = norm(computed-expected)/norm(expected);
- end
-// if shift < epsilon then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
- flag = assert_checktrue ( shift < epsilon );
-endfunction
-//
-// assert_equal --
-// Returns 1 if the two real matrices computed and expected are equal.
-// Arguments
-// computed, expected : the two matrices to compare
-// epsilon : a small number
-//
-//function flag = assert_equal ( computed , expected )
-// if computed==expected then
-// flag = 1;
-// else
-// flag = 0;
-// end
-// if flag <> 1 then pause,end
-//endfunction
-
-// Objective function
-c = [350*5,330*3,310*4,280*6,500,450,400,100]
-
-// Lower Bound of variable
-lb = repmat(0,1,8);
-
-// Upper Bound of variables
-ub = [repmat(1,1,4) repmat(%inf,1,4)];
-
-// Constraint Matrix
-Aeq = [5,3,4,6,1,1,1,1;
- 5*0.05,3*0.04,4*0.05,6*0.03,0.08,0.07,0.06,0.03;
- 5*0.03,3*0.03,4*0.04,6*0.04,0.06,0.07,0.08,0.09;]
-
-
-beq = [ 25, 1.25, 1.25]
-
-intcon = [1 2 3 4];
-
-// Calling Symphony
-[x,f,status,output] = symphony_mat(c,intcon,[],[],Aeq,beq,lb,ub);
-
-assert_close ( x , [1 1 0 1 7.25 0 0.25 3.5]' , 1.e-7 );
-assert_close ( f , [ 8495] , 1.e-7 );
-
-assert_checkequal( status , 227 );
diff --git a/tests/unit_tests/symphonymat_base.dia.ref b/tests/unit_tests/symphonymat_base.dia.ref
new file mode 100644
index 0000000..1e6f74a
--- /dev/null
+++ b/tests/unit_tests/symphonymat_base.dia.ref
@@ -0,0 +1,83 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Keyur Joshi and Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+//
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+// <-- JVM NOT MANDATORY -->
+// <-- ENGLISH IMPOSED -->
+
+
+//
+// assert_close --
+// Returns 1 if the two real matrices computed and expected are close,
+// i.e. if the relative distance between computed and expected is lesser than epsilon.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+function flag = assert_close ( computed, expected, epsilon )
+ if expected==0.0 then
+ shift = norm(computed-expected);
+ else
+ shift = norm(computed-expected)/norm(expected);
+ end
+// if shift < epsilon then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+ flag = assert_checktrue ( shift < epsilon );
+endfunction
+//
+// assert_equal --
+// Returns 1 if the two real matrices computed and expected are equal.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+//function flag = assert_equal ( computed , expected )
+// if computed==expected then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+//endfunction
+
+// Objective function
+c = [350*5,330*3,310*4,280*6,500,450,400,100]
+
+// Lower Bound of variable
+lb = repmat(0,1,8);
+
+// Upper Bound of variables
+ub = [repmat(1,1,4) repmat(%inf,1,4)];
+
+// Constraint Matrix
+Aeq = [5,3,4,6,1,1,1,1;
+ 5*0.05,3*0.04,4*0.05,6*0.03,0.08,0.07,0.06,0.03;
+ 5*0.03,3*0.03,4*0.04,6*0.04,0.06,0.07,0.08,0.09;]
+
+
+beq = [ 25, 1.25, 1.25]
+
+intcon = [1 2 3 4];
+
+// Calling Symphony
+[x,f,iter] = symphonymat(c,intcon,[],[],Aeq,beq,lb,ub);
+
+//In Symphony Library for optimal solution status = 227
+status = sym_getStatus();
+
+assert_close ( x , [1 1 0 1 7.25 0 0.25 3.5] , 1.e-7 );
+assert_close ( f , [ 8495] , 1.e-7 );
+
+assert_checkequal( status , 227 );
diff --git a/tests/unit_tests/symphonymat_base.tst b/tests/unit_tests/symphonymat_base.tst
new file mode 100644
index 0000000..2465738
--- /dev/null
+++ b/tests/unit_tests/symphonymat_base.tst
@@ -0,0 +1,80 @@
+// Copyright (C) 2015 - IIT Bombay - FOSSEE
+//
+// Author: Keyur Joshi and Harpreet Singh
+// Organization: FOSSEE, IIT Bombay
+// Email: harpreet.mertia@gmail.com
+//
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+
+// <-- JVM NOT MANDATORY -->
+// <-- ENGLISH IMPOSED -->
+
+
+//
+// assert_close --
+// Returns 1 if the two real matrices computed and expected are close,
+// i.e. if the relative distance between computed and expected is lesser than epsilon.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+function flag = assert_close ( computed, expected, epsilon )
+ if expected==0.0 then
+ shift = norm(computed-expected);
+ else
+ shift = norm(computed-expected)/norm(expected);
+ end
+// if shift < epsilon then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+ flag = assert_checktrue ( shift < epsilon );
+endfunction
+//
+// assert_equal --
+// Returns 1 if the two real matrices computed and expected are equal.
+// Arguments
+// computed, expected : the two matrices to compare
+// epsilon : a small number
+//
+//function flag = assert_equal ( computed , expected )
+// if computed==expected then
+// flag = 1;
+// else
+// flag = 0;
+// end
+// if flag <> 1 then pause,end
+//endfunction
+
+// Objective function
+c = [350*5,330*3,310*4,280*6,500,450,400,100]
+
+// Lower Bound of variable
+lb = repmat(0,1,8);
+
+// Upper Bound of variables
+ub = [repmat(1,1,4) repmat(%inf,1,4)];
+
+// Constraint Matrix
+Aeq = [5,3,4,6,1,1,1,1;
+ 5*0.05,3*0.04,4*0.05,6*0.03,0.08,0.07,0.06,0.03;
+ 5*0.03,3*0.03,4*0.04,6*0.04,0.06,0.07,0.08,0.09;]
+
+
+beq = [ 25, 1.25, 1.25]
+
+intcon = [1 2 3 4];
+
+// Calling Symphony
+[x,f,status,output] = symphonymat(c,intcon,[],[],Aeq,beq,lb,ub);
+
+assert_close ( x , [1 1 0 1 7.25 0 0.25 3.5]' , 1.e-7 );
+assert_close ( f , [ 8495] , 1.e-7 );
+
+assert_checkequal( status , 227 );
--
cgit
|