Changeset 2059 for stable/2.8/Cbc/test


Ignore:
Timestamp:
Aug 23, 2014 12:31:35 PM (5 years ago)
Author:
tkr
Message:

Merging r20009 r2010 r2016 r2019 r2020 r2021 r2026 r2032 r2033 r2036 r2037 r2038 r2039 r2047 r2052 r2053 r2054 to move C interface into stable

Location:
stable/2.8/Cbc
Files:
3 edited
1 copied

Legend:

Unmodified
Added
Removed
  • stable/2.8/Cbc

  • stable/2.8/Cbc/test/CInterfaceTest.c

    r2009 r2059  
    1 // $Id$
    2 // Copyright (C) 2014, International Business Machines
    3 // Corporation and others.  All Rights Reserved.
    4 // This code is licensed under the terms of the Eclipse Public License (EPL).
    5 
    6 #include <coin/Cbc_C_Interface.h>
     1/* $Id$ */
     2/* Copyright (C) 2014, International Business Machines
     3   Corporation and others.  All Rights Reserved.
     4   This code is licensed under the terms of the Eclipse Public License (EPL). */
     5
     6#undef NDEBUG /* force asserts to work */
     7#include "Cbc_C_Interface.h"
    78#include <assert.h>
    89#include <math.h>
    910#include <stdio.h>
     11#include <string.h>
     12
     13
     14static int callback_called = 0;
     15
     16void (COINLINKAGE_CB test_callback)(Cbc_Model * model,int  msgno, int ndouble,
     17                            const double * dvec, int nint, const int * ivec,
     18                            int nchar, char ** cvec) {
     19
     20    callback_called = 1;
     21    printf("In callback: message %d\n", msgno);
     22
     23}
     24
    1025
    1126void testKnapsack() {
     
    1328    Cbc_Model *model = Cbc_newModel();
    1429
    15     // Simple knapsack problem
    16     // Minimize -5x[1] - 3x[2] - 2x[3] - 7x[4] - 4x[5]
    17     // s.t.      2x[1] + 8x[2] + 4x[3] + 2x[4] + 5x[5] <= 10
    18     // All x binary
     30    /* Simple knapsack problem
     31       Maximize  5x[1] + 3x[2] + 2x[3] + 7x[4] + 4x[5]
     32       s.t.      2x[1] + 8x[2] + 4x[3] + 2x[4] + 5x[5] <= 10
     33       All x binary
     34       */
    1935   
    2036    CoinBigIndex start[] = {0, 1, 2, 3, 4, 5, 6};
     
    2339    double collb[] = {0,0,0,0,0};
    2440    double colub[] = {1,1,1,1,1};
    25     double obj[] = {-5, -3, -2, -7, -4};
     41    double obj[] = {5, 3, 2, 7, 4};
     42    double feasible[] = {1,1,0,0,0};
    2643    double rowlb[] = {-INFINITY};
    2744    double rowub[] = {10};
    28     char integer[] = {1,1,1,1,1};
    29     char *information;
     45    const double *sol;
     46    const char* setname = "test model";
     47    char *getname = malloc(20);
     48    int i;
     49
     50    printf("Interface reports Cbc version %s\n", Cbc_getVersion());
     51
     52    Cbc_loadProblem(model, 5, 1, start, rowindex, value, collb, colub, obj, rowlb, rowub);
     53
     54    Cbc_setColName(model, 2, "var2");
     55    Cbc_setRowName(model, 0, "constr0");
     56
     57
     58    assert(Cbc_getNumCols(model) == 5);
     59    assert(Cbc_getNumRows(model) == 1);
     60
     61    for (i = 0; i < 5; i++) {
     62        Cbc_setInteger(model, i);
     63        assert(Cbc_isInteger(model,i));
     64    }
     65
     66    Cbc_setObjSense(model, -1);
     67    assert(Cbc_getObjSense(model) == -1);
     68
     69    Cbc_setProblemName(model, setname);
     70
     71    Cbc_registerCallBack(model, test_callback);
     72
     73    Cbc_setInitialSolution(model, feasible);
     74
     75    Cbc_solve(model);
     76
     77    assert(Cbc_isProvenOptimal(model));
     78    assert(!Cbc_isAbandoned(model));
     79    assert(!Cbc_isProvenInfeasible(model));
     80    assert(!Cbc_isContinuousUnbounded(model));
     81    assert(!Cbc_isNodeLimitReached(model));
     82    assert(!Cbc_isSecondsLimitReached(model));
     83    assert(!Cbc_isSolutionLimitReached(model));
     84    assert(fabs( Cbc_getObjValue(model)- (16.0) < 1e-6));
     85    assert(fabs( Cbc_getBestPossibleObjValue(model)- (16.0) < 1e-6));
     86
     87    assert(callback_called == 1);
     88   
     89    sol = Cbc_getColSolution(model);
     90   
     91    assert(fabs(sol[0] - 1.0) < 1e-6);
     92    assert(fabs(sol[1] - 0.0) < 1e-6);
     93    assert(fabs(sol[2] - 0.0) < 1e-6);
     94    assert(fabs(sol[3] - 1.0) < 1e-6);
     95    assert(fabs(sol[4] - 1.0) < 1e-6);
     96
     97    Cbc_problemName(model, 20, getname);
     98    i = strcmp(getname,setname);
     99    assert( (i == 0) );
     100
     101    Cbc_getColName(model, 2, getname, 20);
     102    i = strcmp(getname, "var2");
     103    assert( (i == 0) );
     104    Cbc_getRowName(model, 0, getname, 20);
     105    i = strcmp(getname, "constr0");
     106    assert( (i == 0) );
     107    assert( Cbc_maxNameLength(model) >= 7 );
     108   
     109    Cbc_deleteModel(model);
     110
     111}
     112
     113/*
     114void testProblemModification() {
     115
     116    Cbc_Model *model = Cbc_newModel();
     117
     118    / * Simple knapsack problem
     119       Maximize  5x[1] + 3x[2] + 2x[3] + 7x[4] + 4x[5]
     120       s.t.      2x[1] + 8x[2] + 4x[3] + 2x[4] + 5x[5] <= 10
     121       All x binary
     122       * /
     123   
     124    CoinBigIndex start[] = {0, 1, 2, 3, 4, 5, 6};
     125    int rowindex[] = {0, 0, 0, 0, 0};
     126    double value[] = {2, 8, 4, 2, 5};
     127    double collb[] = {0,0,0,0,0};
     128    double colub[] = {1,1,1,1,1};
     129    double obj[] = {5, 3, 2, 7, 4};
     130    double rowlb[] = {-INFINITY};
     131    double rowub[] = {10};
    30132    const double *sol;
    31133    int i;
    32134
     135    printf("Interface reports Cbc version %s\n", Cbc_getVersion());
     136
    33137    Cbc_loadProblem(model, 5, 1, start, rowindex, value, collb, colub, obj, rowlb, rowub);
    34138
    35     Cbc_copyInIntegerInformation(model, integer);
    36 
    37     assert(Cbc_getNumCols(model) == 5);
    38     assert(Cbc_getNumRows(model) == 1);
    39 
    40     information = Cbc_integerInformation(model);
    41139    for (i = 0; i < 5; i++) {
    42         assert(information[i] == 1);
     140        Cbc_setInteger(model, i);
     141        assert(Cbc_isInteger(model,i));
    43142    }
    44143
    45     assert(Cbc_optimizationDirection(model) == 1);
    46 
    47     Cbc_branchAndBound(model);
    48 
    49     assert(Cbc_isProvenOptimal(model));
    50     assert(abs( Cbc_objectiveValue(model)- (-16.0) < 1e-6));
    51    
     144    Cbc_setObjSense(model, -1);
     145    assert(Cbc_getObjSense(model) == -1);
     146
     147    Cbc_solve(model);
     148
     149    assert(Cbc_isProvenOptimal(model));
     150    assert(fabs( Cbc_getObjValue(model)- (16.0) < 1e-6));
     151
    52152    sol = Cbc_getColSolution(model);
    53153   
     
    58158    assert(fabs(sol[4] - 1.0) < 1e-6);
    59159
    60 }
     160    Cbc_setColUpper(model, 0, 0.0);
     161    Cbc_solve(model);
     162
     163    assert(Cbc_isProvenOptimal(model));
     164    assert(fabs( Cbc_getObjValue(model)- (11.0) < 1e-6));
     165
     166    sol = Cbc_getColSolution(model);
     167   
     168    assert(fabs(sol[0] - 0.0) < 1e-6);
     169    assert(fabs(sol[1] - 0.0) < 1e-6);
     170    assert(fabs(sol[2] - 0.0) < 1e-6);
     171    assert(fabs(sol[3] - 1.0) < 1e-6);
     172    assert(fabs(sol[4] - 1.0) < 1e-6);
     173
     174
     175    Cbc_setColLower(model, 1, 1.0);
     176
     177    assert(Cbc_isProvenOptimal(model));
     178    assert(fabs( Cbc_getObjValue(model)- (10.0) < 1e-6));
     179
     180    sol = Cbc_getColSolution(model);
     181   
     182    assert(fabs(sol[0] - 0.0) < 1e-6);
     183    assert(fabs(sol[1] - 1.0) < 1e-6);
     184    assert(fabs(sol[2] - 0.0) < 1e-6);
     185    assert(fabs(sol[3] - 1.0) < 1e-6);
     186    assert(fabs(sol[4] - 0.0) < 1e-6);
     187
     188   
     189    Cbc_deleteModel(model);
     190
     191}
     192*/
     193
     194
     195void testSOS() {
     196
     197    Cbc_Model *model = Cbc_newModel();
     198
     199    /*
     200       Maximize  5x[1] + 3x[2] + 2x[3] + 7x[4] + 4x[5]
     201       s.t.       x[1] +  x[2] +  x[3] +  x[4] +  x[5] == 1
     202       All x binary
     203       */
     204   
     205    CoinBigIndex start[] = {0, 0, 0, 0, 0, 0, 0};
     206    double collb[] = {0,0,0,0,0};
     207    double colub[] = {1,1,1,1,1};
     208    double obj[] = {5, 3, 2, 7, 4};
     209    int sosrowstart[] = {0,5};
     210    int soscolindex[] = {0,1,2,3,4};
     211    const double *sol;
     212    int i;
     213
     214    Cbc_loadProblem(model, 5, 0, start, NULL, NULL, collb, colub, obj, NULL, NULL);
     215
     216    assert(Cbc_getNumCols(model) == 5);
     217    assert(Cbc_getNumRows(model) == 0);
     218
     219    for (i = 0; i < 5; i++) {
     220        Cbc_setInteger(model, i);
     221        assert(Cbc_isInteger(model,i));
     222    }
     223
     224    Cbc_setObjSense(model, -1);
     225    assert(Cbc_getObjSense(model) == -1);
     226   
     227    Cbc_addSOS(model,1,sosrowstart,soscolindex,obj,1);
     228
     229    Cbc_solve(model);
     230
     231    assert(Cbc_isProvenOptimal(model));
     232    assert(!Cbc_isAbandoned(model));
     233    assert(!Cbc_isProvenInfeasible(model));
     234    assert(!Cbc_isContinuousUnbounded(model));
     235    assert(!Cbc_isNodeLimitReached(model));
     236    assert(!Cbc_isSecondsLimitReached(model));
     237    assert(!Cbc_isSolutionLimitReached(model));
     238    assert(fabs( Cbc_getObjValue(model)- (7.0) < 1e-6));
     239    assert(fabs( Cbc_getBestPossibleObjValue(model)- (7.0) < 1e-6));
     240
     241    sol = Cbc_getColSolution(model);
     242   
     243    assert(fabs(sol[0] - 0.0) < 1e-6);
     244    assert(fabs(sol[1] - 0.0) < 1e-6);
     245    assert(fabs(sol[2] - 0.0) < 1e-6);
     246    assert(fabs(sol[3] - 1.0) < 1e-6);
     247    assert(fabs(sol[4] - 0.0) < 1e-6);
     248
     249    Cbc_deleteModel(model);
     250
     251}
     252
     253
     254void testIntegerInfeasible() {
     255
     256    Cbc_Model *model = Cbc_newModel();
     257
     258    /* Minimize x
     259     * s.t.     x <= -10
     260     * x binary */
     261
     262    CoinBigIndex start[] = {0, 1};
     263    int rowindex[] = {0};
     264    double value[] = {1.0};
     265    double rowlb[] = {-INFINITY};
     266    double rowub[] = {-10};
     267
     268    double collb[] = {0.0};
     269    double colub[] = {1.0};
     270    double obj[] = {1.0};
     271
     272    Cbc_loadProblem(model, 1, 1, start, rowindex, value, collb, colub, obj, rowlb, rowub);
     273
     274    Cbc_setInteger(model, 0);
     275
     276    assert(Cbc_getNumCols(model) == 1);
     277    assert(Cbc_getNumRows(model) == 1);
     278
     279    Cbc_solve(model);
     280   
     281    assert(!Cbc_isProvenOptimal(model));
     282    assert(Cbc_isProvenInfeasible(model));
     283   
     284    Cbc_deleteModel(model);
     285
     286}
     287
     288void testIntegerUnbounded() {
     289
     290    Cbc_Model *model = Cbc_newModel();
     291
     292    /* http://list.coin-or.org/pipermail/cbc/2014-March/001276.html
     293     * Minimize x
     294     * s.t. x + y <= 3
     295     *      x - y == 0
     296     *      x,y Free
     297     *      x integer */
     298
     299    CoinBigIndex start[] = {0,2,4};
     300    int rowindex[] = {0, 1, 0, 1};
     301    double value[] = {1, 1, 1, -1};
     302    double rowlb[] = {-INFINITY, 0.0};
     303    double rowub[] = {3.0,0.0};
     304    double collb[] = {-INFINITY, -INFINITY};
     305    double colub[] = {INFINITY, INFINITY};
     306    double obj[] = {1.0,0.0};
     307
     308    Cbc_loadProblem(model, 2, 2, start, rowindex, value, collb, colub, obj, rowlb, rowub);
     309
     310    Cbc_setInteger(model, 0);
     311
     312    Cbc_setParameter(model, "log", "0");
     313   
     314    printf("About to solve problem silently. You should see no output except \"Done\".\n");
     315    Cbc_solve(model);
     316    printf("Done\n");
     317   
     318    assert(!Cbc_isProvenOptimal(model));
     319    assert(!Cbc_isProvenInfeasible(model));
     320    assert(Cbc_isContinuousUnbounded(model));
     321
     322    Cbc_deleteModel(model);
     323
     324
     325}
     326
     327void testIntegerBounds() {
     328    /* max 1.1x + 100.0z
     329       st     x +      z <= 3
     330         0 <= x <= 3
     331         0 <= z <= 1.5, Integer
     332     x* = 2, z* = 1 */
     333   
     334    Cbc_Model *model = Cbc_newModel();
     335
     336    CoinBigIndex start[] = {0,1,2};
     337    int rowindex[] = {0, 0};
     338    double value[] = {1, 1};
     339    double rowlb[] = {-INFINITY};
     340    double rowub[] = {3.0};
     341    double collb[] = {0.0, 0.0};
     342    double colub[] = {3.0, 1.5};
     343    double obj[] = {1.1,100.0};
     344    const double *sol;
     345
     346    Cbc_loadProblem(model, 2, 1, start, rowindex, value, collb, colub, obj, rowlb, rowub);
     347
     348    Cbc_setInteger(model, 1);
     349    Cbc_setObjSense(model, -1);
     350
     351    Cbc_solve(model);
     352   
     353    assert(Cbc_isProvenOptimal(model));
     354
     355    sol = Cbc_getColSolution(model);
     356   
     357    assert(fabs(sol[0] - 2.0) < 1e-6);
     358    assert(fabs(sol[1] - 1.0) < 1e-6);
     359
     360    Cbc_deleteModel(model);
     361
     362}
     363
    61364
    62365int main() {
    63366
     367    printf("Knapsack test\n");
    64368    testKnapsack();
     369    printf("SOS test\n");
     370    testSOS();
     371    printf("Infeasible test\n");
     372    testIntegerInfeasible();
     373    printf("Unbounded test\n");
     374    testIntegerUnbounded();
     375    /*printf("Problem modification test\n");
     376    testProblemModification();*/
     377    printf("Integer bounds test\n");
     378    testIntegerBounds();
    65379
    66380    return 0;
  • stable/2.8/Cbc/test/Makefile.am

    r1714 r2059  
    1616
    1717if COIN_HAS_CLP
    18   CBC_TEST_TGTS += test_cbc
     18  CBC_TEST_TGTS += test_cbc ctests
    1919endif
    2020if CBC_BUILD_CBC_GENERIC
     
    5757.PHONY: test
    5858
    59 bin_PROGRAMS = gamsTest osiUnitTest
     59bin_PROGRAMS = gamsTest osiUnitTest CInterfaceTest
    6060
    6161gamsTest_SOURCES = gamsTest.cpp
     
    8787
    8888########################################################################
     89#                         unitTest for CbcCInterface                   #
     90########################################################################
     91
     92CInterfaceTest_SOURCES = CInterfaceTest.c
     93nodist_EXTRA_CInterfaceTest_SOURCES = dummy.cpp # force using C++ linker
     94
     95CInterfaceTest_LDADD = ../src/libCbcSolver.la ../src/libCbc.la $(CBCLIB_LIBS)
     96
     97CInterfaceTest_DEPENDENCIES = ../src/libCbcSolver.la ../src/libCbc.la $(CBCLIB_DEPENDENCIES)
     98
     99ctests: CInterfaceTest$(EXEEXT)
     100        ./CInterfaceTest$(EXEEXT)
     101
     102########################################################################
    89103#                          Cleaning stuff                              #
    90104########################################################################
  • stable/2.8/Cbc/test/Makefile.in

    r1975 r2059  
    4343build_triplet = @build@
    4444host_triplet = @host@
    45 @COIN_HAS_CLP_TRUE@am__append_1 = test_cbc
     45@COIN_HAS_CLP_TRUE@am__append_1 = test_cbc ctests
    4646@CBC_BUILD_CBC_GENERIC_TRUE@@COIN_HAS_SAMPLE_TRUE@am__append_2 = test_cbc_generic
    4747@COIN_HAS_SAMPLE_TRUE@am__append_3 = -dirSample `$(CYGPATH_W) $(SAMPLE_DATA)`
     
    4949@COIN_HAS_MIPLIB3_TRUE@am__append_5 = -dirMiplib `$(CYGPATH_W) $(MIPLIB3_DATA)` -miplib
    5050@COIN_HAS_NETLIB_TRUE@am__append_6 = -netlibDir=`$(CYGPATH_W) $(NETLIB_DATA)` -testOsiSolverInterface
    51 bin_PROGRAMS = gamsTest$(EXEEXT) osiUnitTest$(EXEEXT)
     51bin_PROGRAMS = gamsTest$(EXEEXT) osiUnitTest$(EXEEXT) \
     52        CInterfaceTest$(EXEEXT)
    5253subdir = test
    5354DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
     
    6465binPROGRAMS_INSTALL = $(INSTALL_PROGRAM)
    6566PROGRAMS = $(bin_PROGRAMS)
     67am_CInterfaceTest_OBJECTS = CInterfaceTest.$(OBJEXT)
     68CInterfaceTest_OBJECTS = $(am_CInterfaceTest_OBJECTS)
     69am__DEPENDENCIES_1 =
    6670am_gamsTest_OBJECTS = gamsTest.$(OBJEXT)
    6771gamsTest_OBJECTS = $(am_gamsTest_OBJECTS)
    68 am__DEPENDENCIES_1 =
    6972am_osiUnitTest_OBJECTS = osiUnitTest.$(OBJEXT) \
    7073        OsiCbcSolverInterfaceTest.$(OBJEXT)
     
    7275depcomp = $(SHELL) $(top_srcdir)/depcomp
    7376am__depfiles_maybe = depfiles
     77COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
     78        $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
     79LTCOMPILE = $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) \
     80        $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \
     81        $(AM_CFLAGS) $(CFLAGS)
     82CCLD = $(CC)
     83LINK = $(LIBTOOL) --tag=CC --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
     84        $(AM_LDFLAGS) $(LDFLAGS) -o $@
    7485CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
    7586        $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
     
    8091CXXLINK = $(LIBTOOL) --tag=CXX --mode=link $(CXXLD) $(AM_CXXFLAGS) \
    8192        $(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
    82 SOURCES = $(gamsTest_SOURCES) $(osiUnitTest_SOURCES)
    83 DIST_SOURCES = $(gamsTest_SOURCES) $(osiUnitTest_SOURCES)
     93SOURCES = $(CInterfaceTest_SOURCES) \
     94        $(nodist_EXTRA_CInterfaceTest_SOURCES) $(gamsTest_SOURCES) \
     95        $(osiUnitTest_SOURCES)
     96DIST_SOURCES = $(CInterfaceTest_SOURCES) $(gamsTest_SOURCES) \
     97        $(osiUnitTest_SOURCES)
    8498ETAGS = etags
    8599CTAGS = ctags
     
    438452
    439453########################################################################
     454#                         unitTest for CbcCInterface                   #
     455########################################################################
     456CInterfaceTest_SOURCES = CInterfaceTest.c
     457nodist_EXTRA_CInterfaceTest_SOURCES = dummy.cpp # force using C++ linker
     458CInterfaceTest_LDADD = ../src/libCbcSolver.la ../src/libCbc.la $(CBCLIB_LIBS)
     459CInterfaceTest_DEPENDENCIES = ../src/libCbcSolver.la ../src/libCbc.la $(CBCLIB_DEPENDENCIES)
     460
     461########################################################################
    440462#                          Cleaning stuff                              #
    441463########################################################################
     
    447469
    448470.SUFFIXES:
    449 .SUFFIXES: .cpp .lo .o .obj
     471.SUFFIXES: .c .cpp .lo .o .obj
    450472$(srcdir)/Makefile.in: @MAINTAINER_MODE_TRUE@ $(srcdir)/Makefile.am  $(am__configure_deps)
    451473        @for dep in $?; do \
     
    505527          rm -f $$p $$f ; \
    506528        done
     529CInterfaceTest$(EXEEXT): $(CInterfaceTest_OBJECTS) $(CInterfaceTest_DEPENDENCIES)
     530        @rm -f CInterfaceTest$(EXEEXT)
     531        $(CXXLINK) $(CInterfaceTest_LDFLAGS) $(CInterfaceTest_OBJECTS) $(CInterfaceTest_LDADD) $(LIBS)
    507532gamsTest$(EXEEXT): $(gamsTest_OBJECTS) $(gamsTest_DEPENDENCIES)
    508533        @rm -f gamsTest$(EXEEXT)
     
    518543        -rm -f *.tab.c
    519544
     545@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/CInterfaceTest.Po@am__quote@
    520546@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/OsiCbcSolverInterfaceTest.Po@am__quote@
     547@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/dummy.Po@am__quote@
    521548@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/gamsTest.Po@am__quote@
    522549@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/osiUnitTest.Po@am__quote@
     550
     551.c.o:
     552@am__fastdepCC_TRUE@    if $(COMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \
     553@am__fastdepCC_TRUE@    then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
     554@AMDEP_TRUE@@am__fastdepCC_FALSE@       source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
     555@AMDEP_TRUE@@am__fastdepCC_FALSE@       DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
     556@am__fastdepCC_FALSE@   $(COMPILE) -c $<
     557
     558.c.obj:
     559@am__fastdepCC_TRUE@    if $(COMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ `$(CYGPATH_W) '$<'`; \
     560@am__fastdepCC_TRUE@    then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
     561@AMDEP_TRUE@@am__fastdepCC_FALSE@       source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
     562@AMDEP_TRUE@@am__fastdepCC_FALSE@       DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
     563@am__fastdepCC_FALSE@   $(COMPILE) -c `$(CYGPATH_W) '$<'`
     564
     565.c.lo:
     566@am__fastdepCC_TRUE@    if $(LTCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \
     567@am__fastdepCC_TRUE@    then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Plo"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
     568@AMDEP_TRUE@@am__fastdepCC_FALSE@       source='$<' object='$@' libtool=yes @AMDEPBACKSLASH@
     569@AMDEP_TRUE@@am__fastdepCC_FALSE@       DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
     570@am__fastdepCC_FALSE@   $(LTCOMPILE) -c -o $@ $<
    523571
    524572.cpp.o:
     
    742790ositests: osiUnitTest$(EXEEXT)
    743791        ./osiUnitTest$(EXEEXT) $(ositestsflags)
     792
     793ctests: CInterfaceTest$(EXEEXT)
     794        ./CInterfaceTest$(EXEEXT)
    744795# Tell versions [3.59,3.63) of GNU make to not export all variables.
    745796# Otherwise a system limit (for SysV at least) may be exceeded.
Note: See TracChangeset for help on using the changeset viewer.